Search results for "Numerical"

showing 10 items of 2002 documents

Spectral approach to the scattering map for the semi-classical defocusing Davey–Stewartson II equation

2019

International audience; The inverse scattering approach for the defocusing Davey–Stewartson II equation is given by a system of D-bar equations. We present a numerical approach to semi-classical D-bar problems for real analytic rapidly decreasing potentials. We treat the D-bar problem as a complex linear second order integral equation which is solved with discrete Fourier transforms complemented by a regularization of the singular parts by explicit analytic computation. The resulting algebraic equation is solved either by fixed point iterations or GMRES. Several examples for small values of the semi-classical parameter in the system are discussed.

ComputationFOS: Physical sciences010103 numerical & computational mathematicsFixed point01 natural sciencesRegularization (mathematics)[MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph]Davey-Stewartson equationsFOS: MathematicsApplied mathematicsMathematics - Numerical Analysis0101 mathematics[MATH]Mathematics [math]Mathematics[PHYS]Physics [physics]Nonlinear Sciences - Exactly Solvable and Integrable SystemsScattering010102 general mathematicsStatistical and Nonlinear PhysicsD-bar problemsNumerical Analysis (math.NA)Condensed Matter PhysicsFourier spectral methodGeneralized minimal residual methodIntegral equationAlgebraic equationInverse scattering problemExactly Solvable and Integrable Systems (nlin.SI)Limit
researchProduct

Exploring parallel capabilities of an innovative numerical method for recovering image velocity vectors field

2010

In this paper an efficient method devoted to estimate the velocity vectors field is investigated. The method is based on a quasi-interpolant operator and involves a large amount of computation. The operations characterizing the computational scheme are ideal for parallel processing because they are local, regular and repetitive. Therefore, the spatial parallelism of the process is studied to rapidly proceed in the computation on distributed multiprocessor systems. The process has shown to be synchronous, with good task balancing and requiring a small amount of data transfer.

ComputationNumerical analysisProcess (computing)MultiprocessingField (computer science)Computational scienceComputer Science ApplicationsSettore MAT/08 - Analisi NumericaOperator (computer programming)Parallel processing (DSP implementation)Modeling and SimulationModelling and SimulationImage velocity vectors field Quasi-interpolant operator B-spline functions Distributed multiprocessor systemsAlgorithmMathematicsData transmissionMathematical and Computer Modelling
researchProduct

Efficient formulation of a two-noded geometrically exact curved beam element

2021

The article extends the formulation of a 2D geometrically exact beam element proposed by Jirasek et al. (2021) to curved elastic beams. This formulation is based on equilibrium equations in their integrated form, combined with the kinematic relations and sectional equations that link the internal forces to sectional deformation variables. The resulting first-order differential equations are approximated by the finite difference scheme and the boundary value problem is converted to an initial value problem using the shooting method. The article develops the theoretical framework based on the Navier-Bernoulli hypothesis, with a possible extension to shear-flexible beams. Numerical procedures …

Computational Engineering Finance and Science (cs.CE)FOS: Computer and information sciencesNumerical Analysiscurved beam geometrically exact nonlinear beam Kirchhoff beam large rotations planar frame shooting methodApplied MathematicsGeneral EngineeringComputer Science - Computational Engineering Finance and ScienceSettore ICAR/08 - Scienza Delle Costruzioni
researchProduct

Approximation of functions over manifolds : A Moving Least-Squares approach

2021

We present an algorithm for approximating a function defined over a $d$-dimensional manifold utilizing only noisy function values at locations sampled from the manifold with noise. To produce the approximation we do not require any knowledge regarding the manifold other than its dimension $d$. We use the Manifold Moving Least-Squares approach of (Sober and Levin 2016) to reconstruct the atlas of charts and the approximation is built on-top of those charts. The resulting approximant is shown to be a function defined over a neighborhood of a manifold, approximating the originally sampled manifold. In other words, given a new point, located near the manifold, the approximation can be evaluated…

Computational Geometry (cs.CG)FOS: Computer and information sciencesComputer Science - Machine LearningClosed manifolddimension reductionMachine Learning (stat.ML)010103 numerical & computational mathematicsComplex dimensionTopology01 natural sciencesMachine Learning (cs.LG)Volume formComputer Science - GraphicsStatistics - Machine Learningmanifold learningApplied mathematics0101 mathematicsfunktiotMathematicsManifold alignmentAtlas (topology)Applied Mathematicshigh dimensional approximationManifoldGraphics (cs.GR)Statistical manifold010101 applied mathematicsregression over manifoldsComputational Mathematicsout-of-sample extensionComputer Science - Computational Geometrynumeerinen analyysimonistotapproksimointimoving least-squaresCenter manifold
researchProduct

Identification of small inhomogeneities: Asymptotic factorization

2007

We consider the boundary value problem of calculating the electrostatic potential for a homogeneous conductor containing finitely many small insulating inclusions. We give a new proof of the asymptotic expansion of the electrostatic potential in terms of the background potential, the location of the inhomogeneities and their geometry, as the size of the inhomogeneities tends to zero. Such asymptotic expansions have already been used to design direct (i.e. noniterative) reconstruction algorithms for the determination of the location of the small inclusions from electrostatic measurements on the boundary, e.g. MUSIC-type methods. Our derivation of the asymptotic formulas is based on integral …

Computational MathematicsAlgebra and Number TheoryPartial differential equationFactorizationApplied MathematicsNumerical analysisMathematical analysisBoundary (topology)Boundary value problemInverse problemAsymptotic expansionIntegral equationMathematicsMathematics of Computation
researchProduct

𝒦-convergence as a new tool in numerical analysis

2019

Abstract We adapt the concept of $\mathscr{K}$-convergence of Young measures to the sequences of approximate solutions resulting from numerical schemes. We obtain new results on pointwise convergence of numerical solutions in the case when solutions of the limit continuous problem possess minimal regularity. We apply the abstract theory to a finite volume method for the isentropic Euler system describing the motion of a compressible inviscid fluid. The result can be seen as a nonlinear version of the fundamental Lax equivalence theorem.

Computational MathematicsApplied MathematicsGeneral MathematicsNumerical analysis010102 general mathematicsApplied mathematics010103 numerical & computational mathematicsConvergence (relationship)0101 mathematics01 natural sciencesMathematicsIMA Journal of Numerical Analysis
researchProduct

A sufficient condition for the instability of theq-d algorithm

1959

Computational MathematicsApplied MathematicsNumerical analysisMathematical analysisD algorithmInstabilityMathematicsNumerische Mathematik
researchProduct

A direct impedance tomography algorithm for locating small inhomogeneities

2003

Impedance tomography seeks to recover the electrical conductivity distribution inside a body from measurements of current flows and voltages on its surface. In its most general form impedance tomography is quite ill-posed, but when additional a-priori information is admitted the situation changes dramatically. In this paper we consider the case where the goal is to find a number of small objects (inhomogeneities) inside an otherwise known conductor. Taking advantage of the smallness of the inhomogeneities, we can use asymptotic analysis to design a direct (i.e., non-iterative) reconstruction algorithm for the determination of their locations. The viability of this direct approach is documen…

Computational MathematicsAsymptotic analysisPartial differential equationApplied MathematicsAcousticsNumerical analysisDirect methodGeometryReconstruction algorithmTomographyElectrical impedanceMathematicsConductorNumerische Mathematik
researchProduct

Solving a model for 1-D, three-phase flow vertical equilibrium processes in a homogeneous porous medium by means of a Weighted Essentially Non Oscill…

2013

Mathematical models of multi-phase flow are useful in some engineering applications like enhanced oil recovery, filtration of pollutants into subsurface, etc. In this work, we derive a mathematical model for the motion of one-dimensional three-phase flow in a porous medium under the condition of vertical equilibrium, which can be viewed as an extension of some two-phase flow models described in the literature. Our model involves a system of two partial differential equations in the form of viscous conservation laws, whose solutions may contain very sharp transitions. We show that a high-order/high resolution Weighted Essentially Non Oscillatory scheme is an appropriate tool to discretize th…

Computational MathematicsConservation lawWork (thermodynamics)Partial differential equationComputational Theory and MathematicsFlow (mathematics)DiscretizationMathematical modelModeling and SimulationNumerical analysisMathematical analysisPorous mediumMathematicsComputers & Mathematics with Applications
researchProduct

On a topology optimization problem governed by two-dimensional Helmholtz equation

2015

The paper deals with a class of shape/topology optimization problems governed by the Helmholtz equation in 2D. To guarantee the existence of minimizers, the relaxation is necessary. Two numerical methods for solving such problems are proposed and theoretically justified: a direct discretization of the relaxed formulation and a level set parametrization of shapes by means of radial basis functions. Numerical experiments are given.

Computational MathematicsControl and OptimizationLevel setLevel set methodDiscretizationHelmholtz equationApplied MathematicsNumerical analysisTopology optimizationMathematical analysisRelaxation (approximation)ParametrizationMathematicsComputational Optimization and Applications
researchProduct