Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Relaxed forms of BBK algorithm and FBP algorithm for symmetric indefinite linear systems

From MaRDI portal
Publication:2426900
Jump to:navigation, search

DOI10.1016/j.camwa.2007.04.030zbMath1149.65018OpenAlexW2018051146MaRDI QIDQ2426900

Ting-Zhu Huang, Liang Li

Publication date: 14 May 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.04.030


zbMATH Keywords

numerical examplessymmetric indefinite matricesdirect solversbounded Bunch-Kaufman algorithm (BBK)fast Bunch-Parlett algorithm (FBP)symmetric pivoting


Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)


Related Items (1)

Add-sub pivoting triangular factorization for symmetric matrix



Cites Work

  • Unnamed Item
  • Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
  • A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
  • Accurate Symmetric Indefinite Linear Equation Solvers
  • Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
  • On the reduction of a symmetric matrix to tridiagonal form


This page was built for publication: Relaxed forms of BBK algorithm and FBP algorithm for symmetric indefinite linear systems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2426900&oldid=15086326"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 22:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki