Pages that link to "Item:Q3769848"
From MaRDI portal
The following pages link to Fast Parallel Algorithms for QR and Triangular Factorization (Q3769848):
Displaying 32 items.
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems (Q677917) (← links)
- Estimating the extremal eigenvalues of a symmetric matrix (Q753418) (← links)
- Some complexity results in parallel matrix-based signal processing (Q915456) (← links)
- New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration (Q1005809) (← links)
- Least squares modifications with inverse factorizations: Parallel implications (Q1123540) (← links)
- A constructive proof of the Gohberg-Semencul formula (Q1123946) (← links)
- State-space approach to factorization of lossless transfer functions and structured matrices (Q1183191) (← links)
- Parallel solution of Toeplitzlike linear systems (Q1190529) (← links)
- An inverse factorization algorithm for linear prediction (Q1194518) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- Improved parallel computations with Toeplitz-like and Hankel-like matrices (Q1260780) (← links)
- Product rules for the displacement of near-Toeplitz matrices (Q1260809) (← links)
- A total least squares method for Toeplitz systems of equations (Q1272882) (← links)
- Fast triangular factorization of the sum of quasi-Toeplitz and quasi- Hankel matrices (Q1308435) (← links)
- Fast recursive identification of state space models via exploitation of displacement structure (Q1314744) (← links)
- On low-complexity approximation of matrices (Q1329962) (← links)
- Fast algorithms for generalized predictive control (Q1338063) (← links)
- Newton's iteration for inversion of Cauchy-like and other structured matrices (Q1361881) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- A new approach to fast polynomial interpolation and multipoint evaluation (Q1802447) (← links)
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros (Q1824354) (← links)
- A superfast method for solving Toeplitz linear least squares problems. (Q1874682) (← links)
- Fast algorithms for generalized displacement structures and lossless systems (Q1890750) (← links)
- Stability analysis of a general Toeplitz system solver (Q1904145) (← links)
- High performance algorithms for Toeplitz and block Toeplitz matrices (Q1923158) (← links)
- A modification to the LINPACK downdating algorithm (Q2639590) (← links)
- On Computations with Dense Structured Matrices (Q3482396) (← links)
- Fast parallel QR decomposition of block-Toeplitz matrices (Q4234391) (← links)
- Computing the<i>U</i><i>L</i>factorisation by newton's method (Q4323720) (← links)
- Computationally efficient cholesky factorization of a covariance matrix with block toeplitz structure (Q4851427) (← links)
- Homotopic residual correction processes (Q5713233) (← links)
- A fast algorithm for subspace state-space system identification via exploitation of the displacement structure (Q5946092) (← links)
