Stable and Efficient Algorithms for Structured Systems of Linear Equations
From MaRDI portal
Publication:4389075
DOI10.1137/S0895479895291273zbMATH Open0915.65024MaRDI QIDQ4389075FDOQ4389075
Authors: Ming Gu 
Publication date: 11 May 1998
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
- An efficient solution for Cauchy-like systems of linear equations
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
fast algorithmGaussian eliminationpivotingToeplitz matrixerror analysisnumerical experimentsHankel matrixCauchy-like matrixdisplacement equationstructured systems
Cited In (36)
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- Title not available (Why is that?)
- A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
- How bad are Vandermonde matrices?
- An efficient solution for Cauchy-like systems of linear equations
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Orthogonal Cauchy-like matrices
- Fast iterative adaptive multi-quadric radial basis function method for edges detection of piecewise functions. I: Uniform mesh
- A unified least squares approach to identify and to reduce continuous asymptotically stable systems
- Solving Toeplitz systems after extension and transformation
- Title not available (Why is that?)
- Algorithms for structured linear systems solving and their implementation
- Pivoting and backward stability of fast algorithms for solving Cauchy linear equations
- A least squares approach to reduce stable discrete linear systems preserving their stability.
- Algorithms that preserve the volume amplification factor for linear systems
- Look-ahead methods for block Hankel systems
- Toward the best algorithm for approximate GCD of univariate polynomials
- A superfast method for solving Toeplitz linear least squares problems.
- Title not available (Why is that?)
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- Transformations of matrix structures work again
- A fast and stable algorithm for downdating the singular value decomposition
- Title not available (Why is that?)
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- Efficient algorithms for solving systems of linear equations and path problems
- Factorizations of Cauchy matrices
- Fast recovery and approximation of hidden Cauchy structure
- A fast solver for linear systems with displacement structure
- Fast computation of the matrix exponential for a Toeplitz matrix
- Randomized preprocessing of homogeneous linear systems of equations
- Title not available (Why is that?)
- Accurate solution of structured linear systems via rank-revealing decompositions
- Fast approximate computations with Cauchy matrices, polynomials and rational functions
- Solving structured linear systems of large displacement rank
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
Uses Software
This page was built for publication: Stable and Efficient Algorithms for Structured Systems of Linear Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389075)
