Search results for "equation"

showing 10 items of 4219 documents

Formulation and test of an ice aggregation scheme for two-moment bulk microphysics schemes

2013

A simple formulation of aggregation for 2-moment bulk microphysical models is de-rived. The solution involves the evaluation of a double integral of the collection kernelweighted with the crystal size (or mass) distribution. This quantity is to be inserted intothe differential equation for the crystal number concentration which has classical form. The double integrals are evaluated numerically for log-normal size distributions overa large range of geometric mean masses. A polynomial fit of the results is given thatyields good accuracy. Various tests of the new parameterization are described: aggre-gation as stand-alone process, in a box-model, and in 2-D simulations of a cirrostratuscloud. …

Polynomial regressionAtmospheric ScienceMicrophysicsDifferential equationChemistryMultiple integralZirrenlcsh:QC1-999WolkenmikrophysikMoment (mathematics)lcsh:ChemistryAggregationDistribution (mathematics)Classical mechanicslcsh:QD1-999Kernel (statistics)ModelleCirrusDynamik der AtmosphäreStatistical physicsEiskristallelcsh:PhysicsAtmospheric Chemistry and Physics
researchProduct

Non-linear Local Polynomial Regression Multiresolution Methods Using $$\ell ^1$$-norm Minimization with Application to Signal Processing

2015

Harten’s Multiresolution has been developed and used for different applications such as fast algorithms for solving linear equations or compression, denoising and inpainting signals. These schemes are based on two principal operators: decimation and prediction. The goal of this paper is to construct an accurate prediction operator that approximates the real values of the signal by a polynomial and estimates the error using \(\ell ^1\)-norm in each point. The result is a non-linear multiresolution method. The order of the operator is calculated. The stability of the schemes is ensured by using a special error control technique. Some numerical tests are performed comparing the new method with…

Polynomial regressionDecimationMathematical optimizationSignal processingPolynomialOperator (computer programming)Computer scienceCompression (functional analysis)InpaintingData_CODINGANDINFORMATIONTHEORYAlgorithmLinear equation
researchProduct

FINITE ELEMENT RESOLUTION OF CONVECTION-DIFFUSION EQUATIONS WITH INTERIOR AND BOUNDARY LAYERS

1996

We present a new algorithm for the resolution of both interior and boundary layers present in the convection-diffusion equation in laminar regimes, based on the formulation of a family of polynomial-exponential elements. We have carried out an adaptation of the standard variational methods (finite element method and spectral element method), obtaining an algorithm which supplies non-oscillatory and accurate solutions. The algorithm consists of generating a coupled grid of polynomial standard elements and polynomial-exponential elements. The latter are able to represent the high gradients of the solution, while the standard elements represent the solution in the areas of smooth variation.

PolynomialApplied MathematicsMechanical EngineeringMathematical analysisSpectral element methodComputational MechanicsBoundary (topology)Laminar flowFinite element methodComputer Science ApplicationsMechanics of MaterialsMesh generationConvection–diffusion equationExtended finite element methodMathematicsInternational Journal for Numerical Methods in Fluids
researchProduct

Bézier Solutions of the Wave Equation

2004

We study polynomial solutions in the Bezier form of the wave equation in dimensions one and two. We explicitly determine which control points of the Bezier solution at two different times fix the solution.

PolynomialComputer Science::GraphicsComputer Science::MultimediaControl pointApplied mathematicsBézier curveComputer Science::Computational GeometryBiharmonic Bézier surfaceWave equationBernstein polynomialMathematics
researchProduct

More limit cycles than expected in Liénard equations

2007

The paper deals with classical polynomial Lienard equations, i.e. planar vector fields associated to scalar second order differential equations x"+ f(x)x' + x = 0 where f is a polynomial. We prove that for a well-chosen polynomial f of degree 6, the equation exhibits 4 limit cycles. It induces that for n ≥ 3 there exist polynomials f of degree 2n such that the related equations exhibit more than n limit cycles. This contradicts the conjecture of Lins, de Melo and Pugh stating that for Lienard equations as above, with f of degree 2n, the maximum number of limit cycles is n. The limit cycles that we found are relaxation oscillations which appear in slow-fast systems at the boundary of classic…

PolynomialConjectureLiénard equationZero of a functionApplied MathematicsGeneral MathematicsLimit cycleScalar (mathematics)Mathematical analysisVector fieldTEORIA QUALITATIVAScalar fieldMathematics
researchProduct

A computational approximation for the solution of retarded functional differential equations and their applications to science and engineering

2021

<p style='text-indent:20px;'>Delay differential equations are of great importance in science, engineering, medicine and biological models. These type of models include time delay phenomena which is helpful for characterising the real-world applications in machine learning, mechanics, economics, electrodynamics and so on. Besides, special classes of functional differential equations have been investigated in many researches. In this study, a numerical investigation of retarded type of these models together with initial conditions are introduced. The technique is based on a polynomial approach along with collocation points which maintains an approximated solutions to the problem. Beside…

PolynomialControl and OptimizationCollocationDifferential equationApplied MathematicsStrategy and ManagementScience and engineeringDelay differential equationNumerical Analysis (math.NA)Type (model theory)Atomic and Molecular Physics and OpticsError analysisFOS: Mathematics34K40 33C45 40C05 65L60 65G50Applied mathematicsMathematics - Numerical AnalysisBusiness and International ManagementElectrical and Electronic EngineeringMatrix methodMathematics
researchProduct

A Novel Computational Approach for Harmonic Mitigation in PV Systems with Single-Phase Five-Level CHBMI

2018

In this paper, a novel approach to low order harmonic mitigation in fundamental switching frequency modulation is proposed for high power photovoltaic (PV) applications, without trying to solve the cumbersome non-linear transcendental equations. The proposed method allows for mitigation of the first-five harmonics (third, fifth, seventh, ninth, and eleventh harmonics), to reduce the complexity of the required procedure and to allocate few computational resource in the Field Programmable Gate Array (FPGA) based control board. Therefore, the voltage waveform taken into account is different respect traditional voltage waveform. The same concept, known as “voltage cancelation”, used for single-…

PolynomialControl and OptimizationTranscendental equationComputer science020209 energyEnergy Engineering and Power Technologysoft switching02 engineering and technologySettore ING-IND/32 - Convertitori Macchine E Azionamenti ElettriciComputational resourcelcsh:Technology7. Clean energyselective harmonic mitigationmultilevel power converter0202 electrical engineering electronic engineering information engineeringElectronic engineeringWaveformElectrical and Electronic EngineeringEngineering (miscellaneous)Photovoltaic systemlcsh:TRenewable Energy Sustainability and the EnvironmentPhotovoltaic systemPower (physics)phase shiftedSettore ING-IND/31 - ElettrotecnicaHarmonicsphotovoltaic systemsvoltage cancellationEnergy (miscellaneous)VoltageEnergies
researchProduct

Upper bounds for the zeros of ultraspherical polynomials

1990

AbstractFor k = 1, 2, …, [n2] let xnk(λ) denote the Kth positive zero in decreasing order of the ultraspherical polynomial Pn(λ)(x). We establish upper bounds for xnk(λ). All the bounds become exact when λ = 0 and, in some cases (see case (iii) of Theorem 3.1), also when λ = 1. As a consequence of our results, we obtain for the largest zero xn1(λ)0.. We point out that our results remain useful for large values of λ. Numerical examples show that our upper bounds are quite sharp.

PolynomialMathematics(all)Numerical AnalysisGegenbauer polynomialsDifferential equationGeneral MathematicsApplied MathematicsMathematical analysisZero (complex analysis)Upper and lower boundsCombinatoricssymbols.namesakesymbolsOrder (group theory)Newton's methodAnalysisMathematicsJournal of Approximation Theory
researchProduct

Vanishing Abelian integrals on zero-dimensional cycles

2011

In this paper we study conditions for the vanishing of Abelian integrals on families of zero-dimensional cycles. That is, for any rational function $f(z)$, characterize all rational functions $g(z)$ and zero-sum integers $\{n_i\}$ such that the function $t\mapsto\sum n_ig(z_i(t))$ vanishes identically. Here $z_i(t)$ are continuously depending roots of $f(z)-t$. We introduce a notion of (un)balanced cycles. Our main result is an inductive solution of the problem of vanishing of Abelian integrals when $f,g$ are polynomials on a family of zero-dimensional cycles under the assumption that the family of cycles we consider is unbalanced as well as all the cycles encountered in the inductive proce…

PolynomialPure mathematicsGeneral MathematicsZero (complex analysis)34C07 34C08 34D15 34M35Rational functionFunction (mathematics)Dynamical Systems (math.DS)Composition (combinatorics)Moment problemAbelian integral; cycleFOS: MathematicsMathematics - Dynamical SystemsAbelian groupAbel equationMathematics
researchProduct

Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses

2013

International audience; We examine the problem of computing exactly the Voronoi diagram (via the dual Delaunay graph) of a set of, possibly intersecting, smooth convex \pc in the Euclidean plane, given in parametric form. Pseudo-circles are (convex) sites, every pair of which has at most two intersecting points. The Voronoi diagram is constructed incrementally. Our first contribution is to propose robust and efficient algorithms, under the exact computation paradigm, for all required predicates, thus generalizing earlier algorithms for non-intersecting ellipses. Second, we focus on \kcn, which is the hardest predicate, and express it by a simple sparse $5\times 5$ polynomial system, which a…

Polynomialexact computationAerospace Engineering02 engineering and technologyComputer Science::Computational GeometryEllipse[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]01 natural sciencesIncircle and excircles of a triangleCombinatoricsparametric curveTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY0202 electrical engineering electronic engineering information engineeringPower diagramVoronoi diagramParametric equationimplementationComputingMethodologies_COMPUTERGRAPHICSMathematicsDiscrete mathematics[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]Regular polygon020207 software engineeringCGALComputer Graphics and Computer-Aided DesignWeighted Voronoi diagram[ INFO.INFO-SC ] Computer Science [cs]/Symbolic Computation [cs.SC]0104 chemical sciences010404 medicinal & biomolecular chemistryModeling and SimulationAutomotive Engineering[ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG]InCircle predicateVoronoi diagram
researchProduct