Parametrization of Newton's iteration for computations with structured matrices and applications
From MaRDI portal
Publication:1205895
DOI10.7916/D8FJ2QWP 10.1016/0898-1221(92)90215-4; 10.7916/D8FJ2QWPzbMath0772.65013OpenAlexW2163787512MaRDI QIDQ1205895
Publication date: 1 April 1993
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(92)90215-4
performancecomplexityalgorithmsNewton iterationToeplitz matrixparallel processingleast squares solution
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Structured matrices and Newton's iteration: unified approach, Parallel computation of a Krylov matrix for a sparse and structured input, Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Algebraic and numerical techniques for the computation of matrix determinants, Optimal and nearly optimal algorithms for approximating polynomial zeros, Efficient inversion of matrix \(\varphi \)-functions of low order, Lifting/descending processes for polynomial zeros., Superfast algorithms for Cauchy-like matrix computations and extensions, Solving structured linear systems with large displacement rank, Improved algorithms for computing determinants and resultants, Improved parallel computations with Toeplitz-like and Hankel-like matrices
Cites Work
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
- On computing the determinant in small parallel time using a small number of processors
- How to multiply matrices faster
- Algebraic methods for Toeplitz-like matrices and operators
- Matrix multiplication via arithmetic progressions
- A note on a Toeplitz inversion formula
- Fast algorithms for the characteristic polynomial
- Complexity of parallel matrix computations
- Parallel evaluation of the determinant and of the inverse of a matrix
- Displacement ranks of matrices and linear equations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- On practical algorithms for accelerated matrix multiplication
- An improved parallel processor bound in fast matrix inversion
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
- Parallel Algorithms for Algebraic Problems
- On Computations with Dense Structured Matrices
- Stability of Methods for Solving Toeplitz Systems of Equations
- Solving sparse linear equations over finite fields
- Fast Parallel Algorithms for QR and Triangular Factorization
- Superfast Solution of Real Positive Definite Toeplitz Systems
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- A view of three decades of linear filtering theory
- Fast Parallel Matrix Inversion Algorithms
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- Improved Parallel Polynomial Division
- Fast parallel matrix and GCD computations
- The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
