scientific article; zbMATH DE number 4009180

From MaRDI portal
Publication:3759442





The author considers the equation (1) \(Px=0\), where \(P: B(\bar x,r_ 0)\subset R^ n\to R^ n\), \(\bar x\) is a solution of (1), under the following assumptions: 1) there is \(\bar A=(P'(\bar x))^{-1};\) 2) \(\| P(x)\| \leq L\) for \(x\in B(\bar x,r_ 0);\) 3) \(\| P'(\bar x)\| \leq C\), \(\| \bar A\| \leq B;\) 4) \(h=\max \{Kr_ 0,G\}<1\), where \(r_ 0=\max \{\| \bar x-x^ 0\|,\| \bar A-A^ 0\| \}\), \(K=C+1.5 BL+1.5 Lr_ 0\), \(G=Cr_ 0+L(B+r_ 0)^ 2\) \((A^ 0\) is an approximation of \(\bar A)\). Define \(x^{i,j}\) and \(A^ i\) by (a) \(x^{k+1,m+1}=x^{k+1,m}-A^ kP(x^{k+1,m})\), \(m=0,1,...,m_{k+1}-1,\) (b) \(A^{k+1}=A^ k(2I-P'(x^{k,m_ k-1})A^ k)\), \(k=0,1,2,...,\) \((m_ k's\) are not known a priori; for example, they may depend on times necessary to perform one step in (a) and (b), resp.), \(x^ k=x^{k+1,0}=x^{k,m_ k}\), \(x^ 0=x^{1,0}=x^{0,m_ 0-1}\). Then \(x^ k\to \bar x\), \(A^ k\to \bar A\) and \(\| \bar x-x^ k\| \leq h^{(N+1)(2^ k-1)}r_ 0\), \(\| \bar A-A^ k\| \leq h^{2^ k- 1}r_ 0\) for all \(k\geq 0\). A comparison of this (asynchronous) method to the corresponding synchronous one is given.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3759442)