Search results for "numeri"
showing 10 items of 2138 documents
Produktintegration mit nicht-�quidistanten St�tzstellen
1980
For the numerical evaluation of $$\int\limits_a^b {(t - a)^{\alpha - 1} x(t)dt}$$ , 0<?<1 andx `smooth', product integration rules are applied. It is known that high-order rules, e.g. Gauss-Legendre quadrature, become `normal'-order rules in this case. In this paper it is shown that the high order is preserved by a nonequidistant spacing. Furthermore, the leading error terms of this product integration method and numerical examples are given.
Cluster sets and quasiconformal mappings
2010
Certain classical results on cluster sets and boundary cluster sets of analytic functions, due to Iversen, Lindelof, Noshiro, Tsuji, Ohtsuka, Pommerenke, Carmona, Cufi and others, are extended to n-dimensional quasiconformal mappings. Unlike what is usually the case in the context of analytic functions, our considerations are not restricted to mappings of a disk or ball only. It is shown, for instance, that quasiconformal cluster sets and boundary cluster sets, taken at a non-isolated boundary point of an arbitrary domain, coincide. More refined versions are established in the special case where the domain is the open unit ball. These include cluster set considerations of the induced radial…
Weighted Extrapolation Techniques for Finite Difference Methods on Complex Domains with Cartesian Meshes
2016
The design of numerical boundary conditions in high order schemes is a challenging problem that has been tackled in different ways depending on the nature of the problem and the scheme used to solve it numerically. In this paper we propose a technique to extrapolate the information from the computational domain to ghost cells for schemes with structured Cartesian Meshes on complex domains. This technique is based on the application of Lagrange interpolation with weighted filters for the detection of discontinuities that permits a data dependent extrapolation, with high order at smooth regions and essentially non oscillatory properties near discontinuities. This paper is a sequel of Baeza et…
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
2005
A language L over an alphabet A is said to have a neutral letter if there is a letter [email protected]?A such that inserting or deleting e's from any word in A^* does not change its membership or non-membership in L. The presence of a neutral letter affects the definability of a language in first-order logic. It was conjectured that it renders all numerical predicates apart from the order predicate useless, i.e., that if a language L with a neutral letter is not definable in first-order logic with linear order, then it is not definable in first-order logic with any set N of numerical predicates. Named after the location of its first, flawed, proof this conjecture is called the Crane Beach …
Witness computation for solving geometric constraint systems
2014
International audience; In geometric constraint solving, the constraints are represented with an equation system F(U, X) = 0, where X denotes the unknowns and U denotes a set of parameters. The target solution for X is noted XT. A witness is a couple (U_W, X_W) such that F(U_W, X_W) = 0. The witness is not the target solution, but they share the same combinatorial features, even when the witness and the target lie on two distinct connected components of the solution set of F(U, X) = 0. Thus a witness enables the qualitative study of the system: the detection of over- and under-constrained systems, the decomposition into irreducible subsystems, the computation of subsystems boundaries. This …
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
2007
The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…
Admissible perturbations of alpha-psi-pseudocontractive operators: convergence theorems
2016
In the last decades, the study of convergence of fixed point iterative methods has received an increasing attention, due to their performance as tools for solving numerical problems. As a consequence of this fact, one can access to a wide literature on iterative schemes involving different types of operators; see [2, 4, 5]. We point out that fixed point iterative approximation methods have been largely applied in dealing with stability and convergence problems; see [1, 6]. In particular, we refer to various control and optimization questions arising in pure and applied sciences involving dynamical systems, where the problem in study can be easily arranged as a fixed point problem. Then, we …
Representation and factorization theorems for almost-Lp-spaces
2019
The first and fourth authors gratefully acknowledge the support of Ministerio de Ciencia, Innovacibn y Universidades (Spain), Agencia Estatal de Investigaciones, and FEDER, under projects MTM2014-53009-P (J.M. Calabuig) and MTM2016-77054-C2-1-P (E.A. Sanchez Perez).
A General Algorithm to Calculate the Inverse Principal $p$-th Root of Symmetric Positive Definite Matrices
2019
We address the general mathematical problem of computing the inverse p-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary p-th roots and their inverses of symmetric positive definite matrices is presented. We show that the order of convergence is at least quadratic and that adaptively adjusting a parameter q always leads to an even faster convergence. In this way, a better performance than with previously known iteration schemes is achieved. The efficiency of the iterative functions is demonstrated for various matrices with different densities, condition numbers and spectral radii.
On the optimal approximation rate of certain stochastic integrals
2010
AbstractGiven an increasing function H:[0,1)→[0,∞) and An(H)≔infτ∈Tn(∑i=1n∫ti−1ti(ti−t)H(t)2dt)12, where Tn≔{τ=(ti)i=0n:0=t0<t1<⋯<tn=1}, we characterize the property An(H)≤cn, and give conditions for An(H)≤cnβ and An(H)≥1cnβ for β∈(0,1), both in terms of integrability properties of H. These results are applied to the approximation of stochastic integrals.