Search results for "FOS: Mathematics"

showing 10 items of 1448 documents

Nonlinear Nonhomogeneous Robin Problems with Almost Critical and Partially Concave Reaction

2020

We consider a nonlinear Robin problem driven by a nonhomogeneous differential operator, with reaction which exhibits the competition of two Caratheodory terms. One is parametric, $$(p-1)$$-sublinear with a partially concave nonlinearity near zero. The other is $$(p-1)$$-superlinear and has almost critical growth. Exploiting the special geometry of the problem, we prove a bifurcation-type result, describing the changes in the set of positive solutions as the parameter $$\lambda >0$$ varies.

Competition phenomenacompetition phenomenanonlinear maximum principleAlmost critical growthLambda01 natural sciencesSet (abstract data type)symbols.namesakeMathematics - Analysis of PDEsSettore MAT/05 - Analisi Matematica0103 physical sciencesFOS: Mathematics0101 mathematicsbifurcation-type resultMathematicsParametric statisticsNonlinear regularity35J20 35J60010102 general mathematicsMathematical analysisZero (complex analysis)udc:517.956.2Differential operatorBifurcation-type resultalmost critical growthNonlinear systemDifferential geometryFourier analysissymbolsnonlinear regularity010307 mathematical physicsGeometry and TopologyNonlinear maximum principleStrong comparison principlestrong comparison principleAnalysis of PDEs (math.AP)
researchProduct

A Lebesgue-type decomposition for non-positive sesquilinear forms

2018

A Lebesgue-type decomposition of a (non necessarily non-negative) sesquilinear form with respect to a non-negative one is studied. This decomposition consists of a sum of three parts: two are dominated by an absolutely continuous form and a singular non-negative one, respectively, and the latter is majorized by the product of an absolutely continuous and a singular non-negative forms. The Lebesgue decomposition of a complex measure is given as application.

Complex measurePure mathematicsSesquilinear formType (model theory)Lebesgue integration01 natural sciencesRegularitysymbols.namesakeSettore MAT/05 - Analisi MatematicaLebesgue decomposition0103 physical sciencesDecomposition (computer science)Complex measureFOS: Mathematics0101 mathematicsMathematicsMathematics::Functional AnalysisSingularitySesquilinear formApplied Mathematics010102 general mathematicsAbsolute continuityFunctional Analysis (math.FA)Mathematics - Functional Analysis47A07 15A63 28A12 47A12Product (mathematics)symbols010307 mathematical physicsNumerical range
researchProduct

Singularity formation for Prandtl’s equations

2009

Abstract We consider Prandtl’s equations for an impulsively started disk and follow the process of the formation of the singularity in the complex plane using the singularity tracking method. We classify Van Dommelen and Shen’s singularity as a cubic root singularity. We introduce a class of initial data, uniformly bounded in H 1 , which have a dipole singularity in the complex plane. These data lead to a solution blow-up whose time can be made arbitrarily short within the class. This is numerical evidence of the ill-posedness of the Prandtl equations in H 1 . The presence of a small viscosity in the streamwise direction changes the behavior of the singularities. They stabilize at a distanc…

Complex singularitiePrandtl numberFOS: Physical sciencesRegularizing viscositySeparationPhysics::Fluid Dynamicssymbols.namesakeViscosityMathematics - Analysis of PDEsSingularityFOS: MathematicsUniform boundednessSpectral methodSettore MAT/07 - Fisica MatematicaMathematical PhysicsMathematicsMathematical analysisStatistical and Nonlinear PhysicsMathematical Physics (math-ph)Condensed Matter PhysicsPrandtl–Glauert transformationPrandtl’s equationsymbolsGravitational singularitySpectral methodComplex planeAnalysis of PDEs (math.AP)Blow–up timePhysica D: Nonlinear Phenomena
researchProduct

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

Topology-based goodness-of-fit tests for sliced spatial data

2023

In materials science and many other application domains, 3D information can often only be extrapolated by taking 2D slices. In topological data analysis, persistence vineyards have emerged as a powerful tool to take into account topological features stretching over several slices. In the present paper, we illustrate how persistence vineyards can be used to design rigorous statistical hypothesis tests for 3D microstructure models based on data from 2D slices. More precisely, by establishing the asymptotic normality of suitable longitudinal and cross-sectional summary statistics, we devise goodness-of-fit tests that become asymptotically exact in large sampling windows. We illustrate the test…

Computational Geometry (cs.CG)FOS: Computer and information sciencesStatistics and ProbabilityGoodness-of-fit testsApplied MathematicsTopological data analysisPersistence diagramMathematics - Statistics TheoryStatistics Theory (math.ST)VineyardsMaterials scienceComputational MathematicsComputational Theory and Mathematics60F05Topological data analysis Persistence diagram Materials science Vineyards Goodness-of-fit tests Asymptotic normalityFOS: MathematicsAlgebraic Topology (math.AT)Computer Science - Computational GeometryAsymptotic normalityMathematics - Algebraic TopologyComputational Statistics & Data Analysis
researchProduct

Optimal rates of convergence for persistence diagrams in Topological Data Analysis

2013

Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field. In this paper, we study topological persistence in general metric spaces, with a statistical approach. We show that the use of persistent homology can be naturally considered in general statistical frameworks and persistence diagrams can be used as statistics with interesting convergence properties. Some numerical experiments are performed in various contexts to illustrate our results.

Computational Geometry (cs.CG)FOS: Computer and information sciences[ MATH.MATH-GT ] Mathematics [math]/Geometric Topology [math.GT][STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]Topological Data analysis Persistent homology minimax convergence rates geometric complexes metric spacesGeometric Topology (math.GT)Mathematics - Statistics TheoryStatistics Theory (math.ST)[INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG][STAT.TH]Statistics [stat]/Statistics Theory [stat.TH][INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG][ STAT.TH ] Statistics [stat]/Statistics Theory [stat.TH][ INFO.INFO-LG ] Computer Science [cs]/Machine Learning [cs.LG]Machine Learning (cs.LG)Computer Science - LearningMathematics - Geometric Topology[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG][INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG][MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT]FOS: Mathematics[ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG]Computer Science - Computational Geometry[MATH.MATH-GT] Mathematics [math]/Geometric Topology [math.GT]
researchProduct

Computation of the topological type of a real Riemann surface

2012

We present an algorithm for the computation of the topological type of a real compact Riemann surface associated to an algebraic curve, i.e., its genus and the properties of the set of fixed points of the anti-holomorphic involution $\tau$, namely, the number of its connected components, and whether this set divides the surface into one or two connected components. This is achieved by transforming an arbitrary canonical homology basis to a homology basis where the $\mathcal{A}$-cycles are invariant under the anti-holomorphic involution $\tau$.

Computational Geometry (cs.CG)FOS: Computer and information sciencesreal Riemann surface[MATH.MATH-AG] Mathematics [math]/Algebraic Geometry [math.AG]homology basis[ MATH.MATH-AG ] Mathematics [math]/Algebraic Geometry [math.AG]Mathematics - Algebraic Geometryreal algebraic curveholomorphic differentialsFOS: MathematicsComputer Science - Computational Geometryreal ovals[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]Algebraic Geometry (math.AG)
researchProduct

Maximal subgroups of small index of finite almost simple groups

2022

We prove in this paper that a finite almost simple group $R$ with socle the non-abelian simple group $S$ possesses a conjugacy class of core-free maximal subgroups whose index coincides with the smallest index $\operatorname{l}(S)$ of a maximal group of $S$ or a conjugacy class of core-free maximal subgroups with a fixed index $v_S \leq {\operatorname{l}(S)^2}$, depending only on $S$. We show that the number of subgroups of the outer automorphism group of $S$ is bounded by $\log^3 {\operatorname{l}(S)}$ and $\operatorname{l}(S)^2 < |S|$.

Computational MathematicsMathematics::Group Theory20E28 20E32 20B15Algebra and Number TheoryMathematics::ProbabilityApplied MathematicsFOS: MathematicsGeometry and TopologyGroup Theory (math.GR)Mathematics::Representation TheoryMatemàticaMathematics - Group TheoryAnalysis
researchProduct

Local regularity for time-dependent tug-of-war games with varying probabilities

2016

We study local regularity properties of value functions of time-dependent tug-of-war games. For games with constant probabilities we get local Lipschitz continuity. For more general games with probabilities depending on space and time we obtain H\"older and Harnack estimates. The games have a connection to the normalized $p(x,t)$-parabolic equation $(n+p(x,t))u_t=\Delta u+(p(x,t)-2) \Delta_{\infty}^N u$.

Computer Science::Computer Science and Game TheoryPure mathematicsparabolic p(xTug of warMathematics::Analysis of PDEsHölder condition01 natural sciencesMathematics - Analysis of PDEsFOS: Mathematicsstochastic gamestug-of-war0101 mathematicsConnection (algebraic framework)Harnack's inequalityMathematicsHarnack inequalitySpacetimeHölder continuityApplied Mathematicsta111010102 general mathematicsLipschitz continuity010101 applied mathematicst)-LaplacianConstant (mathematics)AnalysisAnalysis of PDEs (math.AP)Journal of Differential Equations
researchProduct

Entropy dissipation of moving mesh adaptation

2012

Non-uniform grids and mesh adaptation have been a growing part of numerical simulation over the past years. It has been experimentally noted that mesh adaptation leads not only to locally improved solution but also to numerical stability of the underlying method. There have been though only few results on the mathematical analysis of these schemes due to the lack of proper tools that incorporate both the time evolution and the mesh adaptation step of the overall algorithm. In this paper we provide a method to perform the analysis of the mesh adaptation method, including both the mesh reconstruction and evolution of the solution. We moreover employ this method to extract sufficient condition…

Computer Science::GraphicsFOS: MathematicsNumerical Analysis (math.NA)Mathematics - Numerical AnalysisComputingMethodologies_COMPUTERGRAPHICSMathematics::Numerical Analysis
researchProduct