Search results for "Numerical analysis"

Absolute and monotonic norms

1961

Iterationsverfahren höherer Ordnung in Banach-Räumen

1969

The Newton process for operator equations in say a linear normed complete space converges under certain hypothesis about the Frechet-derivatives of the operator with at least the order two. There are different ways to improve this Newton process. For instance you obtain a process of order three if you add a correction element containing the second Frechet-derivative of the operator [1]. In the following note we will generalize this idea. In a recursive manner -- by adding higher derivatives -- we will construct iterative processes of any orderk (k > 1). A general theorem due toCollatz provides us error estimates for this processes. Last we will illustrate the processes by several examples.

Numerical evaluation of multiple polylogarithms

2004

Multiple polylogarithms appear in analytic calculations of higher order corrections in quantum field theory. In this article we study the numerical evaluation of multiple polylogarithms. We provide algorithms, which allow the evaluation for arbitrary complex arguments and without any restriction on the weight. We have implemented these algorithms with arbitrary precision arithmetic in C++ within the GiNaC framework.

New Families of Symplectic Runge-Kutta-Nyström Integration Methods

2001

We present new 6-th and 8-th order explicit symplectic Runge-Kutta-Nystrom methods for Hamiltonian systems which are more efficient than other previously known algorithms. The methods use the processing technique and non-trivial flows associated with different elements of the Lie algebra involved in the problem. Both the processor and the kernel are compositions of explicitly computable maps.

Periodic Polynomial Splines

2018

In this chapter, the spaces of periodic polynomial splines and the Spline Harmonic Analysis (SHA) in these spaces are briefly outlined. The stuff of this chapter is used for the design of periodic discrete-time splines and discrete-time-spline-based wavelets and wavelet packets. For a detailed description of the subject we refer to (Averbuch, Neittaanmaki and Zheludev, Spline and Spline Wavelet Methods with Applications to Signal and Image Processing, Springer, Berlin, 2014) [1]. Periodic polynomial splines provide an example of mixed discrete-continuous circular convolution.

An algebraic multigrid based shifted-Laplacian preconditioner for the Helmholtz equation

2007

A preconditioner defined by an algebraic multigrid cycle for a damped Helmholtz operator is proposed for the Helmholtz equation. This approach is well suited for acoustic scattering problems in complicated computational domains and with varying material properties. The spectral properties of the preconditioned systems and the convergence of the GMRES method are studied with linear, quadratic, and cubic finite element discretizations. Numerical experiments are performed with two-dimensional problems describing acoustic scattering in a cross-section of a car cabin and in a layered medium. Asymptotically the number of iterations grows linearly with respect to the frequency while for lower freq…

A damping preconditioner for time-harmonic wave equations in fluid and elastic material

2009

A physical damping is considered as a preconditioning technique for acoustic and elastic wave scattering. The earlier preconditioners for the Helmholtz equation are generalized for elastic materials and three-dimensional domains. An algebraic multigrid method is used in approximating the inverse of damped operators. Several numerical experiments demonstrate the behavior of the method in complicated two-dimensional and three-dimensional domains. peerReviewed

Skaitļu teorija: lekcijas, lasītas Latvijas Universitātes Matemātikas un dabas zinātņu fakultātē

1936

Lekcijas sakārtojis Fogels, Ernests ; rediģējis Lūsis, Arvīds.

The Bernstein Basis and its applications in solving geometric constraint systems

2012

International audience; This article reviews the properties of Tensorial Bernstein Basis (TBB) and its usage, with interval analysis, for solving systems of nonlinear, univariate or multivariate equations resulting from geometric constraints. TBB are routinely used in computerized geometry for geometric modelling in CAD-CAM, or in computer graphics. They provide sharp enclosures of polynomials and their derivatives. They are used to reduce domains while preserving roots of polynomial systems, to prove that domains do not contain roots, and to make existence and uniqueness tests. They are compatible with standard preconditioning methods and fit linear program- ming techniques. However, curre…

A marching-on in time meshless kernel based solver for full-wave electromagnetic simulation

2012

A meshless particle method based on an unconditionally stable time domain numerical scheme, oriented to electromagnetic transient simulations, is presented. The proposed scheme improves the smoothed particle electromagnetics method, already developed by the authors. The time stepping is approached by using the alternating directions implicit finite difference scheme, in a leapfrog way. The proposed formulation is used in order to efficiently overcome the stability relation constraint of explicit schemes. In fact, due to this constraint, large time steps cannot be used with small space steps and vice-versa. The same stability relation holds when the meshless formulation is applied together w…