Search results for "Numerical"

Splineapproximationen von beliebigem Defekt zur numerischen L�sung gew�hnlicher Differentialgleichungen. Teil III

1980

In the first part [5] a general procedure is presented to obtain polynomial spline approximations of arbitrary defect for the solution of the initial value problem of ordinary differential equations. The essential result is a divergence theorem in dependence of the polynomial degree and the defect of the spline functions. In this second part the convergent procedures are investigated and two convergence theorems are proved. Furthermore the question is treated, whether the convergent procedures are appropriate for the numerical solution of stiff equations. The paper is finished by a convergence theorem for a procedure producing spline approximations in a natural way by the discrete approxima…

Maximale Konvergenzordnung bei der numerischen Lösung von Anfangswertproblemen mit Splines

1982

In [10] a general procedureV is presented to obtain spline approximations by collocation for the solutions of initial value problems for first order ordinary differential equations. In this paper the attainable order of convergence with respect to the maximum norm is characterized in dependence of the parameters involved inV; in particular the appropriate choice of the collocation points is considered.

Shooting methods for 1D steady-state free boundary problems

1993

AbstractIn this note, we present two numerical methods based on shooting methods to solve steady-state diffusion-absorption models.

An analysis of Ralston's quadrature

1987

Ralston's quadrature achieves higher accuracy in composite rules than analogous Newton-Cotes or Gaussian formulas. His rules are analyzed, computable expressions for the weights and knots are given, and a more suitable form of the remainder is derived.

Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation

1970

If, for each zero of a polynomial, an approximation is known, estimates for the errors of these approximations are given, based on the evaluation of the polynomial at these points. The procedure can be carried over to the case of multiple roots and root clusters using derivatives up to the orderk - 1, wherek is the multiplicity of the cluster.

Gaussian quadrature rule for arbitrary weight function and interval

2019

Abstract A program for calculating abscissas and weights of Gaussian quadrature rules for arbitrary weight functions and intervals is reported. The program is written in Mathematica. The only requirement is that the moments of the weight function can be evaluated analytically in Mathematica. The result is a FORTRAN subroutine ready to be utilized for quadrature. Title of program: AWGQ Catalogue Id: ADVB_v1_0 Nature of problem Integration of functions. Versions of this program held in the CPC repository in Mendeley Data ADVB_v1_0; AWGQ; 10.1016/j.cpc.2004.12.010 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)

Efficient boundary integral-resonant mode expansion method implementation for full-wave analysis of passive devices based on circular waveguides with…

2013

In this study, the efficient full-wave analysis of passive devices composed of circular and arbitrarily-shaped waveguides is considered. For this purpose, the well-known boundary integral-resonant mode expansion (BI RME) method has been properly extended. Circular waveguides are used for resonant mode expansion, whereas the arbitrary contour is defined by any combination of straight, circular and elliptical segments, thus allowing the exact representation of the most widely used geometries. The proposed algorithm extends previous implementations of the BI RME method based on circular waveguides by considering circular and elliptical arcs for defining arbitrary geometries. Similarly, it allo…

Fermion sign problem in imaginary-time projection continuum quantum Monte Carlo with local interaction

2016

We use the Shadow Wave Function formalism as a convenient model to study the fermion sign problem affecting all projector Quantum Monte Carlo methods in continuum space. We demonstrate that the efficiency of imaginary time projection algorithms decays exponentially with increasing number of particles and/or imaginary-time propagation. Moreover, we derive an analytical expression that connects the localization of the system with the magnitude of the sign problem, illustrating this prediction through some numerical results. Finally, we discuss the fermion sign problem computational complexity and methods for alleviating its severity.

Numerical methods in the design process of a sailing yacht

2014

[Editorial] Special issue on computational intelligence and nature-inspired algorithms for real-world data analytics and pattern recognition

2018

Cagnoni, S., & Castelli, M. (2018). [Editorial]. Special issue on computational intelligence and nature-inspired algorithms for real-world data analytics and pattern recognition. Algorithms, 11(3), 1-2. DOI: 10.3390/a11030025 This special issue of Algorithms is devoted to the study of Computational Intelligence and Nature-Inspired Algorithms for Real-World Data Analytics and Pattern Recognition. The special issue considered both theoretical contributions able to advance the state-of-the-art in this field and practical applications that describe novel approaches for solving real-world problems. published