ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (55)
  • Other Sources
  • CR: G1.2  (31)
  • CR: G1.5  (24)
  • 1985-1989  (55)
  • 1930-1934
  • Mathematics  (55)
Collection
  • Articles  (55)
  • Other Sources
Publisher
Years
Year
Topic
  • Mathematics  (55)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 51 (1987), S. 545-557 
    ISSN: 0945-3245
    Keywords: AMS(MOS) ; 65G99 ; 65J15 ; CR: G1.5
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A convergence theorem for Newton-like methods in Banach spaces is given, which improves results of Rheinboldt [27], Dennis [4], Miel [15, 16] and Moret [18] and includes as a special case an updated (affine-invariant [6]) version of the Kantorovich theorem for the Newton method given in previous papers [35, 36]. Error bounds obtained in [34] are also improved. This paper unifies the study of finding sharp error bounds for Newton-like methods under Kantorovich type assumptions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 50 (1986), S. 633-653 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65H10 ; 65H15 ; 65K10 ; 65N20 ; 65N30 ; CR: G1.5
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We present an algorithm which efficiently solves large nonlinear systems of the form $$Au = F(u), u \in \mathbb{R}^n $$ whenever an (iterative) solver “A −1” for the symmetric positive definite matrixA is available andF'(u) is symmetric. Such problems arise from the discretization of nonlinear elliptic partial differential equations. By means of an adaptive decomposition process we split the original system into a low dimensional system — to be treated by any sophisticated solver — and a remaining high-dimensional system, which can easily be solved by fixed point iteration. Specifically we choose a Newton-type trust region algorithm for the treatment of the small system. We show global convergence under natural assumptions on the nonlinearity. The convergence results typical for trust-region algorithms carry over to the full iteration process. The only large systems to be solved are linear ones with the fixed matrixA. Thus existing software for positive definite sparse linear systems can be used.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 52 (1987), S. 511-521 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65H10 ; CR: G1.5
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In many cases when Newton's method, applied to a nonlinear sytemF(x)=0, produces a monotonically decreasing sequence of iterates, Brown's method converges monotonically, too. We compare the iterates of Brown's and Newton's method in these monotone cases with respect to the natural partial ordering. It turns out that in most of the cases arising in applications Brown's method then produces “better” iterates than Newton's method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 53 (1988), S. 143-163 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65H05 ; CR: G1.5
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The argument principle is a natural and simple method to determine the number of zeros of an analytic functionf(z) in a bounded domainD. N, the number of zeros (counting multiplicities) off(z), is 1/2π times the change in Argf(z) asz moves along the closed contour σD. Since the range of Argf(z) is (−π, π] a critical point in the computational procedure is to assure that the discretization of σD, {z i ,i=1, ...,M}, is such that $$|\Delta _{{\text{[z}}_i {\text{,}} {\text{z}}_{i + 1} {\text{]}}} Arg f(z)| \leqq \pi $$ . Discretization control which may violate this inequality can lead to an unreliable algorithm. Mathematical theorems derived for the discretization of σD lead to a completely reliable algorithm to computeN. This algorithm also treats in an elementary way the case when a zero is on or near the contour σD. Numerical examples are given for the reliable algorithm formulated here and it is pointed out in these examples how inadequate discretization control can lead to failure of other algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 54 (1989), S. 117-124 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: G1.2
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We give explicit solutions to the problem of minimizing the relative error for polynomial approximations to 1/t on arbitrary finite subintervals of (0, ∞). We give a simple algorithm, using synthetic division, for computing practical representations of the best approximating polynomials. The resulting polynomials also minimize the absolute error in a related functional equation. We show that, for any continuous function with no zeros on the interval of interest, the geometric convergence rates for best absolute error and best relative error approximants must be equal. The approximation polynomials for 1/t are useful for finding suitably precise initial approximations in iterative methods for computing reciprocals on computers.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 55 (1989), S. 281-307 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D20 ; 30B70 ; 30E10 ; 41A20 ; CR: G1.2
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary Much recent work has been done to investigate convergence of modified continued fractions (MCF's), following the proof by Thron and Waadeland [35] in 1980 that a limit-periodic MCFK(a n , 1;x 1), with $$\mathop {\lim }\limits_{n \to \infty } a_n = :a \in \mathbb{C} - ( - \infty , - \tfrac{1}{4}]$$ andnth approximant $$g_n = S_n (x_1 ) = \frac{{a_1 }}{1} + \frac{{a_2 }}{1} + \cdots + \frac{{a_{n - 1} }}{1} + \frac{{a_n }}{{1 + x_1 }},$$ converges more rapidly to its limitf than the ordinary reference continued fractionK(a n /1) withnth approximantf n =S n (0). Herex 1 denotes the smaller (in modulus) of the two fixed points ofT(w)=a/(1+w). The present paper gives truncation error bounds for bothf n andg n that exploit the limit-periodic property lima n =a. Certain a posteriori bounds given forg n are shown to be best possible, relative to the given (limited) information available. This is the first instance in which truncation error bounds for this problem have been shown to be best possible. Also included in this paper are results on speed of convergence, a practical method for constructing the bounds, and applications to a number of special functions. The given numerical examples indicate that the error bounds are indeed sharp. For the function arctanz, we give graphical contour maps of the number of significant digits in the approximationsf n (z),g n (z) andp n (z), thenth partial sum of the Maclaurin series, forz in a key region of the complex plane. These maps help us compare the various approximations with each other and add to our understanding of their convergence behavior.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 56 (1989), S. 67-71 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65D15 ; CR: G1.5
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary LetA: X→X (whereX=C q [a, b] orL p [a, b]) be a contraction having the fixed pointf. In this note, using ideas from [1–8], we obtain a modified successive approximation sequence which approximatesf and which has certain properties regarding monotonicity too.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 56 (1989), S. 345-357 
    ISSN: 0945-3245
    Keywords: AMS(MOS) ; 65D07 ; CR: G1.2
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The theory of Hermite-spline interpolation on the equidistant latticeZ is written in purly real terms and this for an arbitrary polynomial degree, Hermitian order and node-shift parameter. An explicit representation formula for the Hermitian fundamental splines (Lagrangians) is presented and the convergence of the corresponding Lagrange-series is discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 56 (1989), S. 501-512 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65B10 ; 65Q05 ; 40A15 ; CR: G1.2
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper we present a method of convergence acceleration for the calculation of non-dominant solutions of second-order linear recurrence relations for which the coefficients satisfy certain asymptotic conditions. It represents an improvement of the method recently proposed by Jacobsen and Waadeland [3, 4] for limit periodic continued fractions. For continued fractions the method corresponds to a repeated application of the Bauer-Muir transformation. Some examples and a generalization to non-homogeneous recurrence relations are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 52 (1988), S. 401-411 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65J15 ; CR: G1.5
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A solution of a nonlinear equation in Hilbert spaces is said to be a simple singular solution if the Fréchet derivative at the solution has one-dimensional kernel and cokernel. In this paper we present the enlargement procedure for resolution of singularities at simple singular solutions of nonlinear equations. Once singularities are resolved, we can compute accurately the singular solution by Newton's method. Conditions for which the procedure terminates in finite steps are given. In particular, if the equation defined in ℝn is analytic and the simple singular solution is geometrically isolated, the procedure stops in finite steps, and we obtain the enlarged problem with an isolated solution. Numerical examples are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...