Variational optimization of iterative decomposition methods (Q1360840): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5574354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Numerical Solution of Parabolic and Elliptic Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Application of Alternating Direction Implicit Iteration Model Problem Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5791786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332414 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02674625 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061831835 / rank
 
Normal rank

Latest revision as of 08:27, 30 July 2024

scientific article
Language Label Description Also known as
English
Variational optimization of iterative decomposition methods
scientific article

    Statements

    Variational optimization of iterative decomposition methods (English)
    0 references
    0 references
    22 July 1997
    0 references
    Iterative methods are studied for solving a system of linear algebraic equations \(Ax=b\) which arises in mathematical physics. The main problem is to determine a sequence of the parameters \(\omega\), \(\tau\) in the ``generating'' scheme \[ B_{m+1}(\omega^{\alpha}_{m+1}) \frac{x^{m+1}-x^{m}}{\tau_{m+1}}+Ax_{m}=b, \] \[ B_{m+1}=(I+\omega^1_{m+1}A_1)(I+\omega^2_{m+1}A_2), \] where the matrix \(A\) is such that \[ A=A_1+A_2, A_{\alpha}=A_{\alpha}^T>0, A_1A_2=A_2A_1, 0<\delta_{\alpha}I<A<\Delta_{\alpha}I. \] The Douglas-Rachford and Pieceman-Rachford methods follow from the above general scheme. A variational approach is proposed to determine an explicit form of optimal iterative parameters \(\omega^{\alpha}_{m+1}\), \(\tau_{m+1}\) via minimization of some functional. A proof of convergence and an estimate of the rate of convergence are given. The author mentions that some of the obtained results remain valid under more general conditions, i.e., when the matrices \(A_{\alpha}\) are noncommutative. He intends to publish them in the future.
    0 references
    iterative method
    0 references
    optimal parameters
    0 references

    Identifiers