English
Related papers

Related papers: An effective criterion for multiple positive zeros…

200 papers

We study multi-parameter Tikhonov regularization, i.e., with multiple penalties. Such models are useful when the sought-for solution exhibits several distinct features simultaneously. Two choice rules, i.e., discrepancy principle and…

Numerical Analysis · Mathematics 2011-03-29 Kazufumi Ito , Bangti Jin , Tomoya Takeuchi

This paper proposes a new feature screening method for the multi-response ultrahigh dimensional linear model by empirical likelihood. Through a multivariate moment condition, the empirical likelihood induced ranking statistics can exploit…

Methodology · Statistics 2022-06-07 Jun Lu , Qinqin Hu , Lu Lin

This paper studies the parameter tuning problem of positive linear systems for optimizing their stability properties. We specifically show that, under certain regularity assumptions on the parametrization, the problem of finding the…

Optimization and Control · Mathematics 2019-11-26 Masaki Ogura , Masako Kishida , James Lam

In this paper, we propose a variable metric method for unconstrained multiobjective optimization problems (MOPs). First, a sequence of points is generated using different positive definite matrices in the generic framework. It is proved…

Optimization and Control · Mathematics 2022-07-18 Jian Chen , Gaoxi Li , Xinmin Yang

In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…

Numerical Analysis · Mathematics 2014-09-23 Sigurd Falk

We present a framework for deciding whether a quantum state is separable or entangled using covariance matrices of locally measurable observables. This leads to the covariance matrix criterion as a general separability criterion. We…

Quantum Physics · Physics 2008-12-03 Oleg Gittsovich , Otfried Gühne , Philipp Hyllus , Jens Eisert

Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…

Numerical Analysis · Mathematics 2017-03-14 Zhiwei Hao , Wenrong Jiang , Nan Li , Lihong Zhi

Computational problem certificates are additional data structures for each output, which can be used by a-possibly randomized-verification algorithm that proves the correctness of each output. In this paper, we give an algorithm that…

Symbolic Computation · Computer Science 2019-12-03 Jean-Guillaume Dumas , Erich Kaltofen , Emmanuel Thomé , Gilles Villard

We apply tools from real algebraic geometry to the problem of multistationarity of chemical reaction networks. A particular focus is on the case of reaction networks whose steady states admit a monomial parametrization. For such systems we…

Molecular Networks · Quantitative Biology 2019-08-14 Carsten Conradi , Alexandru Iosif , Thomas Kahle

In this paper, existence conditions and a design procedure of reduced-order switched positive observers for continuous- and discrete-time switched positive linear systems with uncertainty are established. In the analyzed class, arbitrary…

Systems and Control · Electrical Eng. & Systems 2025-05-15 Naohisa Otsuka , Daiki Kakehi , Przemysław Ignaciuk

In this work, we propose a global model selection criterion to estimate the graph of conditional dependencies of a random vector based on a finite sample. By global criterion, we mean optimizing a function over the entire set of possible…

Statistics Theory · Mathematics 2023-11-06 Florencia Leonardi , Magno T. F Severino

Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…

Complex Variables · Mathematics 2026-04-14 Ovaisa Jan , Idrees Qasim

Positivity is one of the three conditions for causal inference from observational data. The standard way to validate positivity is to analyze the distribution of propensity. However, to democratize the ability to do causal inference by…

Machine Learning · Computer Science 2021-11-09 Guy Wolf , Gil Shabat , Hanan Shteingart

We describe a general framework for weighted parametric multiple test procedures based on the closure principle. We utilize general weighting strategies that can reflect complex study objectives and include many procedures in the literature…

Methodology · Statistics 2019-08-14 Dong Xi , Ekkehard Glimm , Willi Maurer , Frank Bretz

We consider stopping criteria that balance algebraic and discretization errors for the conjugate gradient algorithm applied to high-order finite element discretizations of Poisson problems. Firstly, we introduce a new stopping criterion…

Numerical Analysis · Mathematics 2024-08-06 Yichen Guo , Eric de Sturler , Tim Warburton

We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…

Dynamical Systems · Mathematics 2017-04-07 Julia Lieb

Consider a system $f_1(x)=0,\ldots,f_n(x)=0$ of $n$ random real polynomials in $n$ variables, where each $f_i$ has a prescribed set of exponent vectors described by a set $A_i \subseteq \mathbb{Z}^n$ of cardinality $t_i$, whose convex hull…

Probability · Mathematics 2023-06-05 Peter Bürgisser

This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…

General Mathematics · Mathematics 2026-03-10 Dharm Prakash Singh , Amit Ujlayan , Bhim Sen Choudhary

We present an approach of taking a linear weighted Average of N given scalars, such that this Average is zero, if and only if, all N scalars are zero. The weights for the scalars in this Average vary asymptotically with respect to a large…

Computational Complexity · Computer Science 2012-04-10 Deepak Ponvel Chermakani

Valuation algebras abstract a large number of formalisms for automated reasoning and enable the definition of generic inference procedures. Many of these formalisms provide some notion of solution. Typical examples are satisfying…

Artificial Intelligence · Computer Science 2015-08-17 Jordi Roca-Lacostena , Jesus Cerquides , Marc Pouly