Standard

Parallel Variable-Triangular Iterative Methods in Krylov Subspaces. / Il’in, V. P.

In: Journal of Mathematical Sciences (United States), Vol. 255, No. 3, 06.2021, p. 281-290.

Research output: Contribution to journalArticlepeer-review

Harvard

Il’in, VP 2021, 'Parallel Variable-Triangular Iterative Methods in Krylov Subspaces', Journal of Mathematical Sciences (United States), vol. 255, no. 3, pp. 281-290. https://doi.org/10.1007/s10958-021-05371-w

APA

Vancouver

Il’in VP. Parallel Variable-Triangular Iterative Methods in Krylov Subspaces. Journal of Mathematical Sciences (United States). 2021 Jun;255(3):281-290. doi: 10.1007/s10958-021-05371-w

Author

Il’in, V. P. / Parallel Variable-Triangular Iterative Methods in Krylov Subspaces. In: Journal of Mathematical Sciences (United States). 2021 ; Vol. 255, No. 3. pp. 281-290.

BibTeX

@article{f0aa11bc6aea4fc3b4711cd2e5fd73b4,
title = "Parallel Variable-Triangular Iterative Methods in Krylov Subspaces",
abstract = "The paper considers parallel preconditioned iterative methods in Krylov subspaces for solving systems of linear algebraic equations with large sparse symmetric positive-definite matrices resulting from grid approximations of multidimensional problems. For preconditioning, generalized block algorithms of symmetric successive over-relaxation or incomplete factorization type with matching row sums are used. Preconditioners are based on variable-triangular matrix factors with multiple alternations in triangular structure. For three-dimensional grid algebraic systems, methods are based on nested factorizations, as well as on two-level iterative processes. Successive approximations in Krylov subspaces are computed by applying a family of conjugate direction algorithms with various orthogonality and variational properties, including preconditioned conjugate gradient, conjugate residual, and minimal error methods.",
author = "Il{\textquoteright}in, {V. P.}",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Science+Business Media, LLC, part of Springer Nature. Copyright: Copyright 2021 Elsevier B.V., All rights reserved.",
year = "2021",
month = jun,
doi = "10.1007/s10958-021-05371-w",
language = "English",
volume = "255",
pages = "281--290",
journal = "Journal of Mathematical Sciences (United States)",
issn = "1072-3374",
publisher = "Springer Nature",
number = "3",

}

RIS

TY - JOUR

T1 - Parallel Variable-Triangular Iterative Methods in Krylov Subspaces

AU - Il’in, V. P.

N1 - Publisher Copyright: © 2021, Springer Science+Business Media, LLC, part of Springer Nature. Copyright: Copyright 2021 Elsevier B.V., All rights reserved.

PY - 2021/6

Y1 - 2021/6

N2 - The paper considers parallel preconditioned iterative methods in Krylov subspaces for solving systems of linear algebraic equations with large sparse symmetric positive-definite matrices resulting from grid approximations of multidimensional problems. For preconditioning, generalized block algorithms of symmetric successive over-relaxation or incomplete factorization type with matching row sums are used. Preconditioners are based on variable-triangular matrix factors with multiple alternations in triangular structure. For three-dimensional grid algebraic systems, methods are based on nested factorizations, as well as on two-level iterative processes. Successive approximations in Krylov subspaces are computed by applying a family of conjugate direction algorithms with various orthogonality and variational properties, including preconditioned conjugate gradient, conjugate residual, and minimal error methods.

AB - The paper considers parallel preconditioned iterative methods in Krylov subspaces for solving systems of linear algebraic equations with large sparse symmetric positive-definite matrices resulting from grid approximations of multidimensional problems. For preconditioning, generalized block algorithms of symmetric successive over-relaxation or incomplete factorization type with matching row sums are used. Preconditioners are based on variable-triangular matrix factors with multiple alternations in triangular structure. For three-dimensional grid algebraic systems, methods are based on nested factorizations, as well as on two-level iterative processes. Successive approximations in Krylov subspaces are computed by applying a family of conjugate direction algorithms with various orthogonality and variational properties, including preconditioned conjugate gradient, conjugate residual, and minimal error methods.

UR - http://www.scopus.com/inward/record.url?scp=85105359497&partnerID=8YFLogxK

U2 - 10.1007/s10958-021-05371-w

DO - 10.1007/s10958-021-05371-w

M3 - Article

AN - SCOPUS:85105359497

VL - 255

SP - 281

EP - 290

JO - Journal of Mathematical Sciences (United States)

JF - Journal of Mathematical Sciences (United States)

SN - 1072-3374

IS - 3

ER -

ID: 28552253