Stable and Efficient Algorithms for Structured Systems of Linear Equations
From MaRDI portal
Publication:4389075
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
Cited in
(36)- Fast iterative adaptive multi-quadric radial basis function method for edges detection of piecewise functions. I: Uniform mesh
- Fast approximate computations with Cauchy matrices, polynomials and rational functions
- A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
- Transformations of matrix structures work again
- A fast solver for linear systems with displacement structure
- A unified least squares approach to identify and to reduce continuous asymptotically stable systems
- Algorithms for structured linear systems solving and their implementation
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- scientific article; zbMATH DE number 64181 (Why is no real title available?)
- An efficient solution for Cauchy-like systems of linear equations
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- Fast recovery and approximation of hidden Cauchy structure
- Algorithms that preserve the volume amplification factor for linear systems
- Randomized preprocessing of homogeneous linear systems of equations
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
- scientific article; zbMATH DE number 4028839 (Why is no real title available?)
- A fast and stable algorithm for downdating the singular value decomposition
- Orthogonal Cauchy-like matrices
- How bad are Vandermonde matrices?
- Solving Toeplitz systems after extension and transformation
- Solving structured linear systems of large displacement rank
- Accurate solution of structured linear systems via rank-revealing decompositions
- Fast computation of the matrix exponential for a Toeplitz matrix
- Look-ahead methods for block Hankel systems
- A superfast method for solving Toeplitz linear least squares problems.
- scientific article; zbMATH DE number 2098303 (Why is no real title available?)
- Factorizations of Cauchy matrices
- Efficient algorithms for solving systems of linear equations and path problems
- Pivoting and backward stability of fast algorithms for solving Cauchy linear equations
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- Toward the best algorithm for approximate GCD of univariate polynomials
- scientific article; zbMATH DE number 4124891 (Why is no real title available?)
- A least squares approach to reduce stable discrete linear systems preserving their stability.
- scientific article; zbMATH DE number 3863012 (Why is no real title available?)
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
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)
