1978
DOI: 10.1007/bf01068849
|View full text |Cite
|
Sign up to set email alerts
|

Parallel computations in linear algebra

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
4
0

Year Published

1985
1985
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 28 publications
0
4
0
Order By: Relevance
“…The %eigenvalues of the smallest absolute value were found by the power method (Faddeev and Faddeeva 1963) modified for this case (see section 2.2). In order to find the approximate eigenvalue of H ( r e'") for a given value of 8, one should minimize Ihl with respect to E, and E,.…”
Section: Further Computational Detailsmentioning
confidence: 99%
“…The %eigenvalues of the smallest absolute value were found by the power method (Faddeev and Faddeeva 1963) modified for this case (see section 2.2). In order to find the approximate eigenvalue of H ( r e'") for a given value of 8, one should minimize Ihl with respect to E, and E,.…”
Section: Further Computational Detailsmentioning
confidence: 99%
“…Developer of shell methods for reconstructing images of piecewise homogeneous objects with a finite number of different homogeneous parts. Developer of new parallel algorithms using GPUs and using the MPI system for image reconstruction.ZOLOTAREV C.A 1 ,. TARUAT A.T 2 ,.…”
mentioning
confidence: 99%
“…In this context, three cases are analyzed: the so-called textbook case (where exact data are available), the regular case (where the data are inexact but their variation is far from critical), and the irregular case (where the variation of initial data is either critical or close to it), and, in each case, information on the solution is extracted.Papers [13,14] (written jointly with V. N. Kublanovskaya) consider the solution of general systems of linear algebraic equations, including the cases of rectangular and singular coefficient matrices. An algorithm for computing the so-called normalized decomposition of a matrix into the product of a left triangular matrix (with a special ordering of the diagonal entries) and an orthogonal matrix is suggested, an interrelation between the diagonal entries of the triangular (trapezoidal) factor and the singular values of the original matrix is established, and bounds for the largest and smallest singular values are obtained.Survey papers [15][16][17][18][19] give a comprehensive idea of the evolution of numerical linear algebra in the 50-70s of the 20th century.…”
mentioning
confidence: 99%
“…Survey papers [15][16][17][18][19] give a comprehensive idea of the evolution of numerical linear algebra in the 50-70s of the 20th century.…”
mentioning
confidence: 99%