Search results for "Numerical Analysis"
showing 10 items of 883 documents
Dimension bounds in monotonicity methods for the Helmholtz equation
2019
The article [B. Harrach, V. Pohjola, and M. Salo, Anal. PDE] established a monotonicity inequality for the Helmholtz equation and presented applications to shape detection and local uniqueness in inverse boundary problems. The monotonicity inequality states that if two scattering coefficients satisfy $q_1 \leq q_2$, then the corresponding Neumann-to-Dirichlet operators satisfy $\Lambda(q_1) \leq \Lambda(q_2)$ up to a finite-dimensional subspace. Here we improve the bounds for the dimension of this space. In particular, if $q_1$ and $q_2$ have the same number of positive Neumann eigenvalues, then the finite-dimensional space is trivial. peerReviewed
A remarkable equality referring to spline functions in Hilbert spaces
2010
In the introduction of this paper is presented the definition of the generalized spline functions as solutions of a variational problem and are shown some theorems regarding to the existence and uniqueness. The main result of this article consists in a remarkable equality verified by the generalized spline elements, based on the properties of the spaces, operator and interpolatory set involved, which can be used as a characterization theorem of the generalized spline functions in Hilbert spaces.
Stability of radial symmetry for a Monge-Ampère overdetermined problem
2008
Recently the symmetry of solutions to overdetermined problems has been established for the class of Hessian operators, including the Monge-Ampère operator. In this paper we prove that the radial symmetry of the domain and of the solution to an overdetermined Dirichlet problem for the Monge-Ampère equation is stable under suitable perturbations of the data. © 2008 Fondazione Annali di Matematica Pura ed Applicata and Springer-Verlag.
Speeding up a few orders of magnitude the Jacobi method: high order Chebyshev-Jacobi over GPUs
2017
In this technical note we show how to reach a remarkable speed up when solving elliptic partial differential equations with finite differences thanks to the joint use of the Chebyshev-Jacobi method with high order discretizations and its parallel implementation over GPUs.
Simplifying differential equations for multi-scale Feynman integrals beyond multiple polylogarithms
2017
In this paper we exploit factorisation properties of Picard-Fuchs operators to decouple differential equations for multi-scale Feynman integrals. The algorithm reduces the differential equations to blocks of the size of the order of the irreducible factors of the Picard-Fuchs operator. As a side product, our method can be used to easily convert the differential equations for Feynman integrals which evaluate to multiple polylogarithms to $\varepsilon$-form.
The kite integral to all orders in terms of elliptic polylogarithms
2016
We show that the Laurent series of the two-loop kite integral in $D=4-2\varepsilon$ space-time dimensions can be expressed in each order of the series expansion in terms of elliptic generalisations of (multiple) polylogarithms. Using differential equations we present an iterative method to compute any desired order. As an example, we give the first three orders explicitly.
A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
2013
This is a partly non-technical introduction to selected topics on tensor network methods, based on several lectures and introductory seminars given on the subject. It should be a good place for newcomers to get familiarized with some of the key ideas in the field, specially regarding the numerics. After a very general introduction we motivate the concept of tensor network and provide several examples. We then move on to explain some basics about Matrix Product States (MPS) and Projected Entangled Pair States (PEPS). Selected details on some of the associated numerical methods for 1d and 2d quantum lattice systems are also discussed.
On the graded identities and cocharacters of the algebra of 3×3 matrices
2004
Abstract Let M2,1(F) be the algebra of 3×3 matrices over an algebraically closed field F of characteristic zero with non-trivial Z 2 -grading. We study the graded identities of this algebra through the representation theory of the hyperoctahedral group Z 2 ∼S n . After splitting the space of multilinear polynomial identities into the sum of irreducibles under the Z 2 ∼S n -action, we determine all the irreducible Z 2 ∼S n -characters appearing in this decomposition with non-zero multiplicity. We then apply this result in order to study the graded cocharacter of the Grassmann envelope of M2,1(F). Finally, using the representation theory of the general linear group, we determine all the grade…
A new calculation procedure for non-uniform residual stress analysis by the hole-drilling method
1998
The hole-drilling method is one of the most used semi-destructive techniques for residual stress analysis in mechanical parts. In the presence of non-uniform residual stress, the stress field can be determined from the measured relaxed strains using several calculation methods, but the most used one is the so-called integral method. This method is characterized by some simplifications that lead to approximate results, especially when the residual stress varies abruptly. In this paper a new calculation procedure called the spline methods is proposed, which allows these drawbacks to be overcome. Numerical simulations and an experimental test have corroborated the best performance of the prop…
Optimal calculation steps for the evaluation of residual stress by the incremental hole-drilling method
1999
The integral method is a suitable calculation procedure for the determination of nonuniform residual stresses by semidestructive mechanical methods such as the hole-drilling method and the ring-core method. However, the high sensitivity to strain measurement errors due to the ill conditioning of the equations has hindered its practical use. the analysis of the influence of the strain measurment error on the computed stresses carried out in the present work has showed that, given both maximum hole depth and number of total steps, the error sensitivity depends on the particular depth increment distribution used. By means of the matrix formulation, the depth increment distribution that optimiz…