We present a numerical algorithm for finding real non-negative solutions to a certain class of polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find maximum likelihood parameters for certain classes of statistical models. Since our algorithm works by iteratively improving an approximate solution, we find approximate solutions in the cases when there are no exact solutions, such as overconstrained systems
This book sets out to state computationally verifiable initial conditions for predicting the immedia...
We study systems of equations of the form $X_1 = f_1(X_1, ldots, X_n), ldots, X_n = f_n(X_1, ldots, ...
An iterative algorithm baaed on probabilistic estimation is described for obtaining the minimum-norm...
We propose several algorithms for positive polynomial approximation. The main tool is a novel iterat...
AbstractOne of the main problems dealing with iterative methods for solving polynomial systemsis the...
We discuss the positive definite solutions for the system of nonlinear matrix equations and , where...
Não disponívelThis work is intended to present contributions to solve problems which occur in the ap...
Among the problems which cannot be solved in polynomial time there is a subclass of problems that ca...
Abstract. We introduce a special class of real recurrent polynomials fn (n ≥ 1) of degree n, with un...
AbstractNew schemes for developing iterative algorithms based on a special nonlinear (multiplicative...
AbstractOne of the most important problems in solving nonlinear equations is the construction of suc...
In this chapter we present the moment based approach for computing all real solutions of a given sys...
International audienceWe present a new algorithm for solving a polynomial program P based on the rec...
This paper describes a parameter estimation algorithm applicable for the model structures in the for...
We present an iterative algorithm for nonlinear regression based on con-struction of sparse polynomi...
This book sets out to state computationally verifiable initial conditions for predicting the immedia...
We study systems of equations of the form $X_1 = f_1(X_1, ldots, X_n), ldots, X_n = f_n(X_1, ldots, ...
An iterative algorithm baaed on probabilistic estimation is described for obtaining the minimum-norm...
We propose several algorithms for positive polynomial approximation. The main tool is a novel iterat...
AbstractOne of the main problems dealing with iterative methods for solving polynomial systemsis the...
We discuss the positive definite solutions for the system of nonlinear matrix equations and , where...
Não disponívelThis work is intended to present contributions to solve problems which occur in the ap...
Among the problems which cannot be solved in polynomial time there is a subclass of problems that ca...
Abstract. We introduce a special class of real recurrent polynomials fn (n ≥ 1) of degree n, with un...
AbstractNew schemes for developing iterative algorithms based on a special nonlinear (multiplicative...
AbstractOne of the most important problems in solving nonlinear equations is the construction of suc...
In this chapter we present the moment based approach for computing all real solutions of a given sys...
International audienceWe present a new algorithm for solving a polynomial program P based on the rec...
This paper describes a parameter estimation algorithm applicable for the model structures in the for...
We present an iterative algorithm for nonlinear regression based on con-struction of sparse polynomi...
This book sets out to state computationally verifiable initial conditions for predicting the immedia...
We study systems of equations of the form $X_1 = f_1(X_1, ldots, X_n), ldots, X_n = f_n(X_1, ldots, ...
An iterative algorithm baaed on probabilistic estimation is described for obtaining the minimum-norm...