On linear-time solvers for comrade linear systems
From MaRDI portal
Publication:2332725
DOI10.1016/j.cam.2019.112421zbMath1486.65031OpenAlexW2969940144WikidataQ127344742 ScholiaQ127344742MaRDI QIDQ2332725
Publication date: 5 November 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2019.112421
Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A novel elementary algorithm for solving comrade linear systems
- A fast and reliable numerical solver for general bordered \(k\)-tridiagonal matrix linear equations
- Numerical simulation in the partial differential equation controllability analysis with physically meaningful constraints
- Factorization of Hessenberg matrices
- Division of generalized polynomials using the comrade matrix
- Congenial matrices
- A parallel chopping algorithm for ODE boundary value problems
- A numerical solver for general bordered tridiagonal matrix equations
- Symbolic algorithm for solving comrade linear systems based on a modified stair-diagonal approach
- Two algorithms for solving comrade linear systems
- Numerical algorithms for solving comrade linear systems based on tridiagonal solvers
- On new algorithms for inverting Hessenberg matrices
- Numerical Methods in Scientific Computing, Volume I
- Comrade matrix and systems excited by colored noise
- Applications of the comrade matrix to linear multivariable systems theory
- Accuracy and Stability of Numerical Algorithms
This page was built for publication: On linear-time solvers for comrade linear systems
