Search results for "Numerical Analysis"
showing 10 items of 883 documents
Stochastic homogenization: Theory and numerics
2015
In this chapter, we pursue two related goals. First, we derive a theoretical stochastic homogenization result for the stochastic forward problem introduced in the first chapter. The key ingredient to obtain this result is the use of the Feynman-Kac formula for the complete electrode model. The proof is constructive in the sense that it yields a strategy to achieve our second goal, the numerical approximation of the effective conductivity. In contrast to periodic homogenization, which is well understood, numerical homogenization of random media still poses major practical challenges. In order to cope with these challenges, we propose a new numerical method inspired by a highly efficient stoc…
Capturing and Indexing Rehearsals: The Design and Usage of a Digital Archive of Performing Arts
2015
International audience; Preserving the cultural heritage of the performing arts raises difficult and sensitive issues, as each performance is unique by nature and the juxtaposition between the performers and the audience cannot be easily recorded. In this paper, we report on an experimental research project to preserve another aspect of the performing arts—the history of their rehearsals. We have specifically designed non-intrusive video recording and on-site documentation techniques to make this process transparent to the creative crew, and have developed a complete workflow to publish the recorded video data and their corresponding meta-data online as Open Data using state-of-the-art audi…
Numerical analysis of masonry structures via interface models
2001
The present paper is devoted to the theoretical formulation and numerical implementation of an interface model suitable to simulate the behavior of mortar joints in masonry structures. The interface laws are formulated in the framework of elasto-plasticity for non-standard materials in order to simulate the softening response which occurs along the decohesion process in presence of shear and tension tractions. A variable material dilatancy parameter is introduced together with a further geometrical dilatancy related to the roughness of contact surfaces after joint fracture. An asperity model is adopted with the aim to describe the evolution of the contact surface shape during the loss of co…
Vibrations of weakly coupled nanoparticles
2009
The vibrations of a coupled pair of isotropic silver spheres are investigated and compared with the vibrations of the single isolated spheres. Situations of both strong coupling and also weak coupling are investigated using continuum elasticity and perturbation theory. The numerical calculation of the eigenmodes of such dimers is augmented with a symmetry analysis. This checks the convergence and applicability of the numerical method and shows how the eigenmodes of the dimer are constructed from those of the isolated spheres. The frequencies of the lowest frequency vibrations of such dimers are shown to be very sensitive to the strength of the coupling between the spheres. Some of these mod…
The effects of convolution and gradient dependence on a parametric Dirichlet problem
2020
Our objective is to study a new type of Dirichlet boundary value problem consisting of a system of equations with parameters, where the reaction terms depend on both the solution and its gradient (i.e., they are convection terms) and incorporate the effects of convolutions. We present results on existence, uniqueness and dependence of solutions with respect to the parameters involving convolutions.
Existence and comparison results for a singular semilinear elliptic equation with a lower order term
2014
This paper deals with the homogeneous Dirichlet problem for a singular semilinear elliptic equation with a first order term. When the datum is bounded we prove an existence result and we show that any solution can be compared with the solution to a suitable symmetrized problem.
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…
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 …
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.