✦ LIBER ✦

A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations

✍ Scribed by Åke Björck

Publisher: Springer Netherlands
Year: 1988
Tongue: English
Weight: 605 KB
Volume: 28
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01941141

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new algorithm for solving large inhomo

A new algorithm for solving large inhomogeneous linear system of algebraic equations

✍ S. Ramasesha 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB 👁 1 views

## Abstract An algorithm based on a small matrix approach to the solution of a system of inhomogeneous linear algebraic equations is developed and tested in this short communication. The solution is assumed to lie in an initial subspace and the dimension of the subspace is augmented iteratively by

A general projection algorithm for solvi

A general projection algorithm for solving systems of linear equations

✍ Khalide Jbilou 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 668 KB

A class of factorization update algorith

A class of factorization update algorithm for solving systems of sparse nonlinear equations

✍ Zhongzhi Bai; Deren Wang 📂 Article 📅 1996 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 721 KB

Estimation of the accuracy of solving il

Estimation of the accuracy of solving ill-posed problems and the solution of systems of linear algebraic equations

✍ V.A. Morozov 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 642 KB

A polynomial algorithm for solving syste

A polynomial algorithm for solving systems of two linear diophantine equations

✍ Jean-François Romeuf 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 987 KB

A Monte Carlo algorithm for solving syst

A Monte Carlo algorithm for solving systems of non-linear equations

✍ Aleksander Jablonski 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 349 KB