Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix (Q3734977): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56999086, #quickstatements; #temporary_batch_1712201099914 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073943554 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56999086 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:39, 4 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix |
scientific article |
Statements
Efficient Algorithms for Computing the Condition Number of a Tridiagonal Matrix (English)
0 references
1986
0 references
matrix condition number
0 references
positive definite matrix
0 references
LINPACK
0 references
tridiagonal matrices
0 references
