1952
DOI: 10.6028/nbs.rpt.1644
|View full text |Cite
|
Sign up to set email alerts
|

Computational methods of linear algebra:

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
123
0
4

Year Published

1962
1962
2014
2014

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 90 publications
(128 citation statements)
references
References 0 publications
1
123
0
4
Order By: Relevance
“…Following the arguments of Faddeev and Faddeeva [7,8], this Relaxed Monte Carlo method will converge if…”
Section: Relaxed Monte Carlo Methodsmentioning
confidence: 99%
“…Following the arguments of Faddeev and Faddeeva [7,8], this Relaxed Monte Carlo method will converge if…”
Section: Relaxed Monte Carlo Methodsmentioning
confidence: 99%
“…Hence, we apply Leverrier-Faddeeva algorithm [16] for getting the characteristic equation of |sI − A| = 0 to the relation (5). We set in (5)…”
Section: Proofmentioning
confidence: 99%
“…These are the necessary and sufficient conditions for the triangular decomposition, see [2] or [3]. Thus and is a polynomial in A¿.…”
Section: Canonical Decomposition Of Hessenberg Matricestmentioning
confidence: 99%