Výsledky vyhledávání - fast QR factorization algorithms

Fast Parallel Algorithms for QR and Triangular Factorization Autor Chun, J., Kailath, T., Lev-Ari, H.

“…We present a family of new fast algorithms for QR factorization of certain structured matrices, including rectangular Toeplitz matrices and a variety of other Toeplitz-like matrices…”
Získat plný text

Ultra-Fast Saliency Detection Using Qr Factorization Autor Alshawi, Tariq

“…In this work, we propose an ultra-fast unsupervised saliency detection algorithm based on QR matrix factorization…”
Získat plný text

Incremental Linear Discriminant Analysis: A Fast Algorithm and Comparisons Autor Delin Chu, Li-Zhi Liao, Ng, Michael Kwok-Po, Xiaoyan Wang

“… We propose a new batch LDA algorithm called LDA/QR. LDA/QR is a simple and fast LDA algorithm, which is obtained by computing the economic QR factorization of the data matrix followed by solving a lower triangular linear system…”
Získat plný text

A fast algorithm for computing the pseudospectra of Toeplitz matrices Autor Wang, Zhengsheng, Liu, Chuntao, Li, Yuanjun

“… In this paper, we propose a fast algorithm for computing the pseudospectra of Toeplitz matrices by using fast Toeplitz QR factorization…”
Získat plný text

Scalable QR Factorisation of Ill-Conditioned Tall-and-Skinny Matrices on Distributed GPU Systems Autor Mijić, Nenad, Kaushik, Abhiram, Živković, Dario, Davidović, Davor

“… This paper introduces a novel algorithm for computing the QR factorisation of ill-conditioned TS matrices based on CholeskyQR methods…”
Získat plný text

Low-Rank Matrix Completion via QR-Based Retraction on Manifolds Autor Wang, Ke, Chen, Zhuo, Ying, Shihui, Xu, Xinjian

“… In this paper, we solve the problem via optimization of the matrix manifold. Specially, we apply QR factorization to retraction during optimization…”
Získat plný text

Numerical properties of a fast algorithm for QR factorization Autor Chun, J., Kailath, T.

“…We study the numerical stability of the Schur-Levinson type fast Toeplitz QR factorization algorithm…”
Získat plný text

VXQR: derivative-free unconstrained optimization based on QR factorizations Autor Neumaier, Arnold, Fendl, Hannes, Schilly, Harald, Leitner, Thomas

“…This paper presents basic features of a new family of algorithms for unconstrained derivative-free optimization, based on line searches along directions generated from QR factorizations of past direction matrices…”
Získat plný text

Fast factorization of rectangular Vandermonde matrices with Chebyshev nodes Autor Kuian, Mykhailo, Reichel, Lothar, Shiyanovskii, Sergij V.

“… This gives rise to a rectangular Vandermonde matrix. We describe fast algorithms for the factorization of these matrices…”
Získat plný text

Subspace learning for feature selection via rank revealing QR factorization: Fast feature selection Autor Moslemi, Amir, Ahmadian, Arash

“… This study introduces a novel unsupervised feature selection technique that leverages rank revealing QR (RRQR) factorization…”
Získat plný text

A Lanczos-type algorithm for the QR factorization of regular Cauchy matrices Autor Fasino, Dario, Gemignani, Luca

“…We present a fast algorithm for computing the QR factorization of Cauchy matrices with real nodes…”
Získat plný text

Fast Rank-Revealing QR Factorization for Two-Dimensional Frequency Estimation Autor Cao, Hui, Liu, Qi

“… (2-D) frequency estimation of a complex sinusoid in noisy environment. Based on the resulting data matrix, whereafter, two-stage QR factorization frequency estimation method with the weighted…”
Získat plný text

Analysis of Randomized Householder-Cholesky QR factorization with multisketching Autor Higgins, Andrew J., Szyld, Daniel B., Boman, Erik G., Yamazaki, Ichitaro

“…CholeskyQR2 and shifted CholeskyQR3 are two state-of-the-art algorithms for computing tall-and-skinny QR factorizations since they attain high performance on current computer architectures…”
Získat plný text

A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations Autor Chandrasekaran, S., Sayed, Ali H.

“…, Toeplitz, quasi-Toeplitz, and product of two Toeplitz matrices). The algorithm is based on a modified fast QR factorization of the coefficient matrix and relies…”
Získat plný text

Parallel QR factorization for hybrid message passing/shared memory operation Autor Dunn, Ian N., Meyer, Gerard G.L.

“… To probe the performance benefits of this feature on a 64-processor HP SPP-2000, a 32-processor IBM SP3, and a 128-processor SGI Origin 2000, we propose a new hybrid parallel fast Givens QR…”
Získat plný text

Analysis of Randomized Householder-Cholesky QR factorization with multisketching: Analysis of randomized householder-Cholesky Autor Higgins, Andrew J., Szyld, Daniel B., Boman, Erik G., Yamazaki, Ichitaro

“…CholeskyQR2 and shifted CholeskyQR3 are two state-of-the-art algorithms for computing tall-and-skinny QR factorizations since they attain high performance on current computer architectures…”
Získat plný text

Node Generation for RBF-FD Methods by QR Factorization Autor Liu, Tony, Platte, Rodrigo B.

“… In 2D, these methods are usually implemented with Cartesian nodes, hexagonal nodes, or most commonly, quasi-uniformly distributed nodes generated through fast algorithms…”
Získat plný text

Fast Parallel Randomized QR with Column Pivoting Algorithms for Reliable Low-Rank Matrix Approximations Autor Xiao, Jianwei, Gu, Ming, Langou, Julien

“… In contrast, randomized QRCP (RQRCP) algorithms have proven themselves empirically to be highly competitive with high-performance implementations of QR in processing time, on uniprocessor and shared memory machines, and as reliable…”
Získat plný text

Fast block QR update in digital signal processing Autor Alventosa, Fran J., Alonso, Pedro, Vidal, Antonio M., Piñero, Gema, Quintana-Ortí, Enrique S.

“… In addition, we propose a simple out-of-order task-parallel algorithm for the QR factorization using OpenMP that exploits the multicore capability of modern processors…”
Získat plný text

Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix Autor Aurentz, Jared L., Vandebril, Raf, Watkins, David S.

“…A new fast algorithm for computing the zeros of a polynomial in $O(n^{2})$ time using $O(n)$ memory is developed…”
Získat plný text