English
Related papers

Related papers: A smoothness test for higher codimensions

200 papers

Solving a set of simultaneous linear equations is probably the most important topic in numerical methods. For solving linear equations, iterative methods are preferred over the direct methods especially when the coefficient matrix is…

Neural and Evolutionary Computing · Computer Science 2013-04-09 R. M. Jalal Uddin Jamali , M. M. A. Hashem , M. Mahfuz Hasan , Md. Bazlar Rahman

Extensive literature exists on how to test for normality, especially for identically and independently distributed (i.i.d) processes. The case of dependent samples has also been addressed, but only for scalar random processes. For this…

Signal Processing · Electrical Eng. & Systems 2022-02-17 Sara Elbouch , Olivier Michel , Pierre Comon

Finding the optimal hyperparameters of a model can be cast as a bilevel optimization problem, typically solved using zero-order techniques. In this work we study first-order methods when the inner optimization problem is convex but…

Smoothed analysis is a framework for analyzing the complexity of an algorithm, acting as a bridge between average and worst-case behaviour. For example, Quicksort and the Simplex algorithm are widely used in practical applications, despite…

Machine Learning · Computer Science 2015-03-29 Bichen Shi , Michel Schellekens , Georgiana Ifrim

Modern advances in general-purpose computer algebra systems offer solutions to a variety of problems, which in the past required substantial time investments by trained mathematicians. An excellent example of such development are the…

Rings and Algebras · Mathematics 2023-05-18 Dimiter Prodanov

Uncertainty is unavoidable in modeling dynamical systems and it may be represented mathematically by differential inclusions. In the past, we proposed an algorithm to compute validated solutions of differential inclusions; here we provide…

Numerical Analysis · Mathematics 2020-01-31 Sanja Zivanovic Gonzalez , Pieter Collins , Luca Geretti , Davide Bresolin , Tiziano Villa

We propose a new approach to the numerical solution of ergodic problems arising in the homogenization of Hamilton-Jacobi (HJ) equations. It is based on a Newton-like method for solving inconsistent systems of nonlinear equations, coming…

Numerical Analysis · Mathematics 2016-02-11 Simone Cacace , Fabio Camilli

The local zero structure of a smooth map may qualitatively change, when the map is subjected to small perturbations. The changes may include births and/or deaths of zeros. The qualitative properties are defined as the invariances of an…

Dynamical Systems · Mathematics 2019-11-14 Majid Gazor , Mahsa Kazemi

We use classical invariant theory to construct invariants of complex graded Gorenstein algebras of finite vector space dimension. As a consequence, we obtain a way of extracting certain numerical invariants of quasi-homogeneous isolated…

Complex Variables · Mathematics 2012-07-03 M. G. Eastwood , A. V. Isaev

A class of smoothing methods is proposed for solving mathematical programs with equimibrium constraints. We introduce new and very simple regularizations of the complementarity constraints. Some estimate distance to optimal solution and…

Optimization and Control · Mathematics 2010-01-14 Mounir Haddou

We give a short new computation of the quantum cohomology of an arbitrary smooth toric variety $X$, by showing directly that the Kodaira-Spencer map of Fukaya-Oh-Ohta-Ono defines an isomorphism onto a suitable Jacobian ring. The proof is…

Symplectic Geometry · Mathematics 2019-11-18 Jack Smith

This paper proposes a squared smoothing Newton method via the Huber smoothing function for solving semidefinite programming problems (SDPs). We first study the fundamental properties of the matrix-valued mapping defined upon the Huber…

Optimization and Control · Mathematics 2024-10-10 Ling Liang , Defeng Sun , Kim-Chuan Toh

We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…

Data Structures and Algorithms · Computer Science 2023-06-22 Thorsten Wißmann , Ulrich Dorsch , Stefan Milius , Lutz Schröder

Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…

Broyden's method is a general method commonly used for nonlinear systems of equations, when very little information is available about the problem. We develop an approach based on Broyden's method for nonlinear eigenvalue problems. Our…

Numerical Analysis · Mathematics 2018-02-22 Elias Jarlebring

In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…

Computational Geometry · Computer Science 2024-10-25 Juan Juan Gerardo Alcázar , Carlos Hermoso , Hüsnü Anıl Çoban , Uğur Gözütok

We expand the applicabilities and capabilities of an already existing space-time parallel method based on a block Jacobi smoother. First we formulate a more detailed criterion for spatial coarsening, which enables the method to deal with…

Computational Engineering, Finance, and Science · Computer Science 2019-11-22 Martin Neumüller , Martin Schwalsberger

This article presents a homogeneity test for testing the equality of several high-dimensional covariance matrices for stationary processes with ignoring the assumption of normality. We give the asymptotic distribution of the proposed test.…

Statistics Theory · Mathematics 2020-08-24 Abdullah Qayed , Dong Han

In his groundbreaking work on classification of singularities with regard to right and stable equivalence of germs, Arnold has listed normal forms for all isolated hypersurface singularities over the complex numbers with either modality…

Algebraic Geometry · Mathematics 2020-10-21 Janko Boehm , Magdaleen S. Marais , Gerhard Pfister

A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the…

Symbolic Computation · Computer Science 2015-08-28 Katsusuke Nabeshima , Shinichi Tajima
‹ Prev 1 4 5 6 7 8 10 Next ›