Search results for "Discretization"

showing 10 items of 237 documents

Order optimal preconditioners for fully implicit Runge-Kutta schemes applied to the bidomain equations

2010

The partial differential equation part of the bidomain equations is discretized in time with fully implicit Runge–Kutta methods, and the resulting block systems are preconditioned with a block diagonal preconditioner. By studying the time-stepping operator in the proper Sobolev spaces, we show that the preconditioned systems have bounded condition numbers given that the Runge–Kutta scheme is A-stable and irreducible with an invertible coefficient matrix. A new proof of order optimality of the preconditioners for the one-leg discretization in time of the bidomain equations is also presented. The theoretical results are verified by numerical experiments. Additionally, the concept of weakly po…

Numerical AnalysisPartial differential equationDiscretizationPreconditionerApplied MathematicsMathematical analysisBlock matrixComputer Science::Numerical AnalysisMathematics::Numerical Analysislaw.inventionSobolev spaceComputational MathematicsRunge–Kutta methodsInvertible matrixlawCoefficient matrixAnalysisMathematicsNumerical Methods for Partial Differential Equations
researchProduct

The MAST-edge centred lumped scheme for the flow simulation in variably saturated heterogeneous porous media

2012

A novel methodology is proposed for the solution of the flow equation in a variably saturated heterogeneous porous medium. The computational domain is descretized using triangular meshes and the governing PDEs are discretized using a lumped in the edge centres numerical technique. The dependent unknown variable of the problem is the piezometric head. A fractional time step methodology is applied for the solution of the original system, solving consecutively a prediction and a correction problem. A scalar potential of the flow field exists and in the prediction step a MArching in Space and Time (MAST) formulation is applied for the sequential solution of the Ordinary Differential Equation of…

Numerical AnalysisPhysics and Astronomy (miscellaneous)DiscretizationApplied MathematicsLinear systemScalar potentialGeometryFinite element methodSettore ICAR/01 - IdraulicaComputer Science ApplicationsComputational MathematicsHydraulic headRate of convergenceVariably saturated porous medium Numerical model Finite element Lumped scheme Mass conservation Unstructured mesh Analytical solutionModeling and SimulationOrdinary differential equationApplied mathematicsVariably saturated porous medium Numerical model Finite element Lumped scheme Mass conservation Unstructured mesh Analytical solutionConservation of massMathematicsJournal of Computational Physics
researchProduct

Time-harmonic elasticity with controllability and higher-order discretization methods

2008

The time-harmonic solution of the linear elastic wave equation is needed for a variety of applications. The typical procedure for solving the time-harmonic elastic wave equation leads to difficulties solving large-scale indefinite linear systems. To avoid these difficulties, we consider the original time dependent equation with a method based on an exact controllability formulation. The main idea of this approach is to find initial conditions such that after one time-period, the solution and its time derivative coincide with the initial conditions.The wave equation is discretized in the space domain with spectral elements. The degrees of freedom associated with the basis functions are situa…

Numerical AnalysisPhysics and Astronomy (miscellaneous)DiscretizationApplied MathematicsMathematical analysisLinear systemWave equationComputer Science ApplicationsControllabilityComputational Mathematicssymbols.namesakeModeling and SimulationDiagonal matrixTime derivativesymbolsGaussian quadratureSpectral methodMathematics
researchProduct

Solution of time-independent Schrödinger equation by the imaginary time propagation method

2007

Numerical solution of eigenvalues and eigenvectors of large matrices originating from discretization of linear and non-linear Schrodinger equations using the imaginary time propagation (ITP) method is described. Convergence properties and accuracy of 2nd and 4th order operator-splitting methods for the ITP method are studied using numerical examples. The natural convergence of the method is further accelerated with a new dynamic time step adjustment method. The results show that the ITP method has better scaling with respect to matrix size as compared to the implicitly restarted Lanczos method. An efficient parallel implementation of the ITP method for shared memory computers is also demons…

Numerical AnalysisPhysics and Astronomy (miscellaneous)DiscretizationApplied MathematicsMathematical analysisMathematicsofComputing_NUMERICALANALYSISOrder (ring theory)Computer Science::Human-Computer InteractionComputer Science ApplicationsSchrödinger equationComputational Mathematicssymbols.namesakeLanczos resamplingShared memoryModeling and SimulationConvergence (routing)symbolsScalingEigenvalues and eigenvectorsMathematicsJournal of Computational Physics
researchProduct

A velocity–diffusion method for a Lotka–Volterra system with nonlinear cross and self-diffusion

2009

The aim of this paper is to introduce a deterministic particle method for the solution of two strongly coupled reaction-diffusion equations. In these equations the diffusion is nonlinear because we consider the cross and self-diffusion effects. The reaction terms on which we focus are of the Lotka-Volterra type. Our treatment of the diffusion terms is a generalization of the idea, introduced in [P. Degond, F.-J. Mustieles, A deterministic approximation of diffusion equations using particles, SIAM J. Sci. Stat. Comput. 11 (1990) 293-310] for the linear diffusion, of interpreting Fick's law in a deterministic way as a prescription on the particle velocity. Time discretization is based on the …

Numerical AnalysisSelf-diffusionDiffusion equationDiscretizationNonlinear diffusionADI schemeApplied MathematicsNumerical analysisMathematical analysisParticle methodComputational MathematicsNonlinear systemReaction–diffusion systemPattern formationParticle velocityReaction-diffusionDiffusion (business)Travelling frontsMathematicsApplied Numerical Mathematics
researchProduct

Shakedown optimum design of reinforced concrete framed structures

1994

Structures subjected to variable repeated loads can undergo the shakedown or adaptation phenomenon,-which prevents them from collapse but may cause lack of serviceability, for the plastic deformations developed, although finite, as shakedown occurrence postulates, may exceed some maximum values imposed by external ductility criteria. This paper is devoted to the optimal design of reinforced concrete structures, subjected to variable and repeated loads. For such structures the knowledge of the actual values taken by the plastic deformations, at shakedown occurrence, is a crucial issue. An approximate assessment of such plastic deformations is needed, which is herein provided in the shape of …

Optimal designControl and OptimizationServiceability (structure)Discretizationbusiness.industryApplied MathematicsRegular polygonStructural engineeringManagement Science and Operations ResearchReinforced concreteIndustrial and Manufacturing EngineeringFinite element methodComputer Science ApplicationsShakedownQuadratic equationbusinessMathematics
researchProduct

Computational methods for optimal shakedown design of FE structures

1998

The paper concerns the optimal shakedown design of structures discretized by elastic perfectly plastic finite elements. The design problem is formulated in four alternative versions, i.e. as the search for the minimum volume design whose shakedown limit load multiplier is assigned or as the search for the maximum shakedown limit load multiplier design whose volume is assigned; both problems are approached on the grounds of the shakedown lower bound and upper bound theorems. Correspondingly four computational methods, one for each original problem, are presented. These methods consist in solving iteratively new problems which are simpler than the original ones, but expressed in such a way th…

Optimal designMathematical optimizationControl and OptimizationDiscretizationNumerical analysisGeneral EngineeringComputer Graphics and Computer-Aided DesignUpper and lower boundsFinite element methodComputer Science ApplicationsShakedownControl and Systems EngineeringLimit loadMultiplier (economics)SoftwareMathematicsStructural Optimization
researchProduct

Guaranteed lower bounds for cost functionals of time-periodic parabolic optimization problems

2019

In this paper, a new technique is shown for deriving computable, guaranteed lower bounds of functional type (minorants) for two different cost functionals subject to a parabolic time-periodic boundary value problem. Together with previous results on upper bounds (majorants) for one of the cost functionals, both minorants and majorants lead to two-sided estimates of functional type for the optimal control problem. Both upper and lower bounds are derived for the second new cost functional subject to the same parabolic PDE-constraints, but where the target is a desired gradient. The time-periodic optimal control problems are discretized by the multiharmonic finite element method leading to lar…

Optimization problemtime-periodic conditionmultiharmonic finite element methodDiscretizationtwo-sided boundsSystems and Control (eess.SY)010103 numerical & computational mathematicsSystem of linear equationsElectrical Engineering and Systems Science - Systems and Control01 natural sciencesUpper and lower boundsSaddle pointFOS: MathematicsFOS: Electrical engineering electronic engineering information engineeringApplied mathematicsMathematics - Numerical AnalysisBoundary value problem0101 mathematicsMathematics - Optimization and ControlMathematicsosittaisdifferentiaaliyhtälöt35Kxx 65M60 65M70 65M15 65K10parabolic optimal control problemsNumerical Analysis (math.NA)matemaattinen optimointiOptimal controlFinite element method010101 applied mathematicsComputational MathematicsComputational Theory and MathematicsOptimization and Control (math.OC)Modeling and Simulationa posteriori error analysisnumeerinen analyysiguaranteed lower boundsComputers & Mathematics with Applications
researchProduct

A Numerical Method for an Inverse Problem Arising in Two-Phase Fluid Flow Transport Through a Homogeneous Porous Medium

2019

In this paper we study the inverse problem arising in the model describing the transport of two-phase flow in porous media. We consider some physical assumptions so that the mathematical model (direct problem) is an initial boundary value problem for a parabolic degenerate equation. In the inverse problem we want to determine the coefficients (flux and diffusion functions) of the equation from a set of experimental data for the recovery response. We formulate the inverse problem as a minimization of a suitable cost function and we derive its numerical gradient by means of the sensitivity equation method. We start with the discrete formulation and, assuming that the direct problem is discret…

Parameter identification problemFinite volume methodFlow (mathematics)DiscretizationNumerical analysisConjugate gradient methodApplied mathematicsBoundary value problemInverse problemMathematics
researchProduct

On the local and semilocal convergence of a parameterized multi-step Newton method

2020

Abstract This paper is devoted to a family of Newton-like methods with frozen derivatives used to approximate a locally unique solution of an equation. We perform a convergence study and an analysis of the efficiency. This analysis gives us the opportunity to select the most efficient method in the family without the necessity of their implementation. The method can be applied to many type of problems, including the discretization of ordinary differential equations, integral equations, integro-differential equations or partial differential equations. Moreover, multi-step iterative methods are computationally attractive.

Partial differential equationDiscretizationIterative methodApplied MathematicsParameterized complexity010103 numerical & computational mathematics01 natural sciencesIntegral equation010101 applied mathematicsComputational Mathematicssymbols.namesakeOrdinary differential equationConvergence (routing)symbolsApplied mathematics0101 mathematicsNewton's methodMathematics
researchProduct