Related papers: On finding many solutions to S-unit equations by s…
The construction of the general solution sequence of row-finite linear systems is accomplished by implementing -ad infinitum- the Gauss-Jordan algorithm under a rightmost pivot elimination strategy. The algorithm generates a basis (finite…
This paper aims to establish counterparts of fundamental regularity statements for solutions to elliptic equations in the setting of low-dimensional structures such as, for instance, glued manifolds or CW-complexes. The main result proves…
We introduce a numerical method for the numerical solution of the so-called Lur'e matrix equations that arise in balancing-related model reduction and linear-quadratic infinite time horizon optimal control. Based on the fact that the set of…
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem. In particular, this enable us to improve the complexity bound for sign determination in…
We consider the homogenized linear feasibility problem, to find an $x$ on the unit sphere, satisfying $n$ line ar inequalities $a_i^Tx\ge 0$. To solve this problem we consider the centers of the insphere of spherical simpl ices, whose…
Recent advances in quantitative unique continuation properties for solutions to uniformly elliptic, divergence form equations (with Lipschitz coefficients) has led to a good understanding of the vanishing order and size of singular and zero…
We introduce an alternative to the method of matched asymptotic expansions. In the "traditional" implementation, approximate solutions, valid in different (but overlapping) regions are matched by using "intermediate" variables. Here we…
In this paper, using the similarity method, we construct particular solutions with singularities for degenerate high-order equations. The considered equations have singularities of the first and second kind. Particular solutions are…
We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…
We apply a variant of the square-sieve to produce a uniform upper bound for the number of rational points of bounded height on a family of surfaces that admit a fibration over the projective line, whose general fibre is a hyperelliptic…
Nonlinear ODEs invariant under the group SL(2,R) are solved numerically. We show that solution methods incorporating the Lie point symmetries provide better results than standard methods.
Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. These data structures have been analyzed from an axiomatic point of view with a parametric approach in (*)…
In this paper, we consider the solution of ill-conditioned systems of linear algebraic equations that can be determined imprecisely. To improve the stability of the solution process, we "immerse" the original imprecise linear system in an…
We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…
We consider the iterative solution of large linear systems of equations in which the coefficient matrix is the sum of two terms, a sparse matrix $A$ and a possibly dense, rank deficient matrix of the form $\gamma UU^T$, where $\gamma > 0$…
Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…
Starting from the results of Charles Fefferman and Janos Koll\`ar in Continuous Solutions of Linear Equations [1], we adopt a new approach based on Fefferman's techniques of Glaeser refinement to show a more general result than the one…
We present iterative solvers to approximate the solution of numerical schemes for stochastic Stefan problems. After briefly talking about the convergence results, we tackle the question of efficient strategies for solving the nonlinear…
We establish elliptic regularity for nonlinear inhomogeneous Cauchy-Riemann equations under minimal assumptions, and give a counterexample in a borderline case. In some cases where the inhomogeneous term has a separable factorization, the…
We provide a unified approach to S-estimation in balanced linear models with structured covariance matrices. Of main interest are S-estimators for linear mixed effects models, but our approach also includes S-estimators in several other…