We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 61-80 of 88 results
  1. Stability of the High Frequency Fast Multipole Method for Helmholtz’ Equation in Three Dimensions

    Stability limits for the high frequency plane wave expansion, which approximates the free space Green’s function in Helmholtz’ equation, are...

    Martin Nilsson in BIT Numerical Mathematics
    Article 01 December 2004
  2. Weak sufficient convergence conditions and applications for newton methods

    The famous Newton—Kantorovich hypothesis has been used for a long time as a sufficient condition for the convergence of Newton method to a solution...

    Article 01 March 2004
  3. A priori and a posteriori analysis of finite volume discretizations of Darcy’s equations

    This paper is devoted to the numerical analysis of some finite volume discretizations of Darcy’s equations. We propose two finite volume schemes on...

    Y. Achdou, C. Bernardi, F. Coquel in Numerische Mathematik
    Article 06 June 2003
  4. Local Sampling for Regular Wavelet and Gabor Expansions

    The local behavior of regular wavelet sampling expansions is quantified. The term “regular” refers to the decay properties of scaling functions φ of...

    N. Atreas, J. J. Benedetto, C. Karanikas in Sampling Theory in Signal and Image Processing
    Article 01 January 2003
  5. The Information Loss Error and the Jitter Error for Regular Sampling Expansions

    We give upper bounds for the Information Loss Error of regular sampling expansions. We estimate this error for a wide class of sampling formulas...

    N. Atreas, N. Bagis, C. Karanikas in Sampling Theory in Signal and Image Processing
    Article 01 September 2002
  6. A Gaussian smoothing algorithm to generate trend curves

    A Gaussian smoothing algorithm obtained from a cascade of convolutions with a seven-point kernel is described. We prove that the change of local sums...

    Article 01 September 2001
  7. Fast Verification of Solutions for Sparse Monotone Matrix Equations

    This paper concerns the problem of verifying the accuracy of a numerical solution for linear systems with a coefficient matrix being sparse and...
    Takeshi Ogita, Shin’ichi Oishi, Yasunori Ushiro in Topics in Numerical Analysis
    Conference paper 2001
  8. Structured Backward Error and Condition Number for Linear Systems of the Type A* Ax = b

    We present a formulation for the structured condition number and for the structured backward error for the linear system A* Ax = b , when the...

    V. Frayssé, S. Gratton, V. Toumazou in BIT Numerical Mathematics
    Article 01 March 2000
  9. Discretized Newman-Shapiro Operators and Jackson’s Inequality on the Sphere

    Applying a quadrature rule with positive weights to some integral operators introduced by Newman and Shapiro we obtain generalized hyperinterpolation...

    Manfred Reimer in Results in Mathematics
    Article 01 November 1999
  10. Eigenvalues of symmetrizable matrices

    New perturbation theorems for matrices similar to Hermitian matrices are proved for a class of unitarily invariant norms called Q -norms. These...

    Rajendra Bhatia, Fuad Kittaneh, Ren-Cang Li in BIT Numerical Mathematics
    Article 01 March 1998
  11. A note on conjugate gradient convergence

    Aaron E. Naiman, Ivo M. Babuška, Howard C. Elman in Numerische Mathematik
    Article 01 April 1997
  12. Perturbation analysis of the orthogonal procrustes problem

    Given two arbitrary real matrices A and B of the same size, the orthogonal Procrustes problem is to find an orthogonal matrix M such that the Frobenius...

    Inge Söderkvist in BIT Numerical Mathematics
    Article 01 December 1993
  13. A survey of truncation error analysis for Padé and continued fraction approximants

    To compute the value of a function f ( z ) in the complex domain by means of a converging sequence of rational approximants { f n ( z )} of a continued...

    Cathleen Craviotto, William B. Jones, W. J. Thron in Acta Applicandae Mathematica
    Article 01 December 1993
  14. A posteriori error estimates for linear equations

    This paper describes upper and lower p -norm error bounds for approximate solutions of the linear system of equations Ax=b . These bounds imply that the...

    Giles Auchmuty in Numerische Mathematik
    Article 01 December 1992
  15. Are the coefficients of a polynomial well-conditioned functions of its roots?

    We show that the coefficients of a polynomial can be rather illconditioned functions of its given roots. In certain cases, however, the coefficients...

    Frank Uhlig in Numerische Mathematik
    Article 01 December 1992
  16. On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization

    Two methods are presented which efficiently solve tridiagonal systems on vector supercomputers and parallel computers with a moderate degree of...

    Markus Hegland in Numerische Mathematik
    Article 01 December 1991
  17. Improved error bounds for near-minimax approximations

    David Elliott, George M. Phillips in BIT Numerical Mathematics
    Article 01 June 1991
  18. A lower bound for the number of function evaluations in an error estimate for numerical integration

    A popular practical way to estimate the error in numerical integration is to use two cubature formulae. In this paper we give a lower bound for the...

    Ronald Cools, Ann Haegemans in Constructive Approximation
    Article 01 December 1990
  19. A convergence theorem for Newton-like methods in Banach spaces

    A convergence theorem for Newton-like methods in Banach spaces is given, which improves results of Rheinboldt [27], Dennis [4], Miel [15, 16] and...

    Tetsuro Yamamoto in Numerische Mathematik
    Article 01 September 1987
Did you find what you were looking for? Share feedback.