Search results for "MathematicsofComputing_NUMERICALANALYSIS"
showing 10 items of 149 documents
Lacunary bifurcation for operator equations and nonlinear boundary value problems on ℝN
1991
SynopsisWe consider nonlinear eigenvalue problems of the form Lu + F(u) = λu in a real Hilbert space, where L is a positive self-adjoint linear operator and F is a nonlinearity vanishing to higher order at u = 0. We suppose that there are gaps in the essential spectrum of L and use critical point theory for strongly indefinite functionals to derive conditions for the existence of non-zero solutions for λ belonging to such a gap, and for the bifurcation of such solutions from the line of trivial solutions at the boundary points of a gap. The abstract results are applied to the L2-theory of semilinear elliptic partial differential equations on ℝN. We obtain existence results for the general c…
A Singular Multi-Grid Iteration Method for Bifurcation Problems
1984
We propose an efficient technique for the numerical computation of bifurcating branches of solutions of large sparse systems of nonlinear, parameter-dependent equations. The algorithm consists of a nested iteration procedure employing a multi-grid method for singular problems. The basic iteration scheme is related to the Lyapounov-Schmidt method and is widely used for proving the existence of bifurcating solutions. We present numerical examples which confirm the efficiency of the algorithm.
Separation properties of (n, m)-IFS attractors
2017
Abstract The separation properties of self similar sets are discussed in this article. An open set condition for the (n, m)- iterated function system is introduced and the concepts of self similarity, similarity dimension and Hausdorff dimension of the attractor generated by an (n, m) - iterated function system are studied. It is proved that the similarity dimension and the Hausdorff dimension of the attractor of an (n, m) - iterated function system are equal under this open set condition. Further a necessary and sufficient condition for a set to satisfy the open set condition is established.
High-order Runge–Kutta–Nyström geometric methods with processing
2001
Abstract We present new families of sixth- and eighth-order Runge–Kutta–Nystrom geometric integrators with processing for ordinary differential equations. Both the processor and the kernel are composed of explicitly computable flows associated with non trivial elements belonging to the Lie algebra involved in the problem. Their efficiency is found to be superior to other previously known algorithms of equivalent order, in some case up to four orders of magnitude.
Hermite interpolation: The barycentric approach
1991
The barycentric formulas for polynomial and rational Hermite interpolation are derived; an efficient algorithm for the computation of these interpolants is developed. Some new interpolation principles based on rational interpolation are discussed.
Numerical Study of Two Sparse AMG-methods
2003
A sparse algebraic multigrid method is studied as a cheap and accurate way to compute approximations of Schur complements of matrices arising from the discretization of some symmetric and positive definite partial differential operators. The construction of such a multigrid is discussed and numerical experiments are used to verify the properties of the method.
Solution of time-independent Schrödinger equation by the imaginary time propagation method
2007
Numerical solution of eigenvalues and eigenvectors of large matrices originating from discretization of linear and non-linear Schrodinger equations using the imaginary time propagation (ITP) method is described. Convergence properties and accuracy of 2nd and 4th order operator-splitting methods for the ITP method are studied using numerical examples. The natural convergence of the method is further accelerated with a new dynamic time step adjustment method. The results show that the ITP method has better scaling with respect to matrix size as compared to the implicitly restarted Lanczos method. An efficient parallel implementation of the ITP method for shared memory computers is also demons…
Monotone cubic spline interpolation for functions with a strong gradient
2021
Abstract Spline interpolation has been used in several applications due to its favorable properties regarding smoothness and accuracy of the interpolant. However, when there exists a discontinuity or a steep gradient in the data, some artifacts can appear due to the Gibbs phenomenon. Also, preservation of data monotonicity is a requirement in some applications, and that property is not automatically verified by the interpolator. Hence, some additional techniques have to be incorporated so as to ensure monotonicity. The final interpolator is not actually a spline as C 2 regularity and monotonicity are not ensured at the same time. In this paper, we study sufficient conditions to obtain monot…
A fast hierarchical dual boundary element method for three-dimensional elastodynamic crack problems
2010
In this work a fast solver for large-scale three-dimensional elastodynamic crack problems is presented, implemented, and tested. The dual boundary element method in the Laplace transform domain is used for the accurate dynamic analysis of cracked bodies. The fast solution procedure is based on the use of hierarchical matrices for the representation of the collocation matrix for each computed value of the Laplace parameter. An ACA (adaptive cross approximation) algorithm is used for the population of the low rank blocks and its performance at varying Laplace parameters is investigated. A preconditioned GMRES is used for the solution of the resulting algebraic system of equations. The precond…
Reprint of: Approximate Taylor methods for ODEs
2018
Abstract A new method for the numerical solution of ODEs is presented. This approach is based on an approximate formulation of the Taylor methods that has a much easier implementation than the original Taylor methods, since only the functions in the ODEs, and not their derivatives, are needed, just as in classical Runge–Kutta schemes. Compared to Runge–Kutta methods, the number of function evaluations to achieve a given order is higher, however with the present procedure it is much easier to produce arbitrary high-order schemes, which may be important in some applications. In many cases the new approach leads to an asymptotically lower computational cost when compared to the Taylor expansio…