Skip to main content

METODOS NUMERICOS EN LA APROXIMACION DE CURVAS Y SUPERFICIES, MATRICES POSITIVAS Y APLICACIONES

MTM2015-65433-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2015
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSIDAD DE ZARAGOZA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 16
Encontrada(s) 1 página(s)

Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications

  • Marco, Ana
  • Martínez, José-Javier
  • Peña, Juan Manuel
Cauchy–Vandermonde matrices play a fundamental role in rational interpolation theory and in other fields. When all their corresponding nodes are different and positive and all poles are different and negative and follow adequate orderings, these matrices are totally positive. In this paper we provide fast algorithms for computing bidiagonal factorizations of these matrices and their inverses with high relative accuracy. These algorithms can be used to solve with high relative accuracy other algebraic problems, such as the computation of all singular values, all eigenvalues or the solution of certain linear systems. The error analysis of the algorithm for computing the bidiagonal factorization and the corresponding perturbation theory are also performed.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate and fast computations with positive extended Schoenmakers–Coffey matrices

  • Delgado, J.
  • Peña, G.
  • Peña, J.M.
Schoenmakers–Coffey matrices are correlation matrices with important financial applications. Several characterizations of positive extended Schoenmakers–Coffey matrices are presented. This paper provides an accurate and fast method to obtain the bidiagonal decomposition of the conversion of these matrices, which in turn can be used to compute with high relative accuracy the eigenvalues and inverses of positive extended Schoenmakers–Coffey matrices. Numerical examples are included.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Accurate computations with Lupas matrices

  • Delgado, J.
  • Peña, J. M.
Lupas q-analogues of the Bernstein functions play an important role in Approximation Theory and Computer Aided Geometric Design. Their collocation matrices are called Lupas matrices. In this paper, we provide algorithms for computing the bidiagonal decomposition of these matrices and their inverses to high relative accuracy. It is also shown that these algorithms can be used to perform to high relative accuracy several algebraic calculations with these matrices, such as the calculation of their inverses, their eigenvalues or their singular values. Numerical experiments are included.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Optimal Gersgorin-style estimation of the largest singular value. II

  • Johnson, C.R.
  • Peña, J.M.
  • Szulc, T.
In estimating the largest singular value in the class of matrices equiradial with a given $n$-by-$n$ complex matrix $A$, it was proved that it is attained at one of $n(n-1)$ sparse nonnegative matrices (see C.R.~Johnson, J.M.~Pe{\~n}a and T.~Szulc, Optimal Gersgorin-style estimation of the largest singular value; {\em Electronic Journal of Linear Algebra Algebra Appl.}, 25:48--59, 2011). Next, some circumstances were identified under which the set of possible optimizers of the largest singular value can be further narrowed (see C.R.~Johnson, T.~Szulc and D.~Wojtera-Tyrakowska, Optimal Gersgorin-style estimation of the largest singular value, {\it Electronic Journal of Linear Algebra Algebra Appl.}, 25:48--59, 2011). Here the cardinality of the mentioned set for $n$-by-$n$ matrices is further reduced. It is shown that the largest singular value, in the class of matrices equiradial with a given $n$-by-$n$ complex matrix, is attained at one of $n(n-1)/2$ sparse nonnegative matrices. Finally, an inequality between the spectral radius of a $3$-by-$3$ nonnegative matrix $X$ and the spectral radius of a modification of $X$ is also proposed.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

On the asymptotic optimality of error bounds for some linear complementarity problems

  • García-Esnaola, M.
  • Peña, J.M.
We introduce strong B-matrices and strong B-Nekrasov matrices, for which some error bounds for linear complementarity problems are analyzed. In particular, it is proved that the bounds of García-Esnaola and Peña (Appl. Math. Lett. 22, 1071–1075, 2009) and of (Numer. Algor. 72, 435–445, 2016) are asymptotically optimal for strong B-matrices and strong B-Nekrasov matrices, respectively. Other comparisons with a bound of Li and Li (Appl. Math. Lett. 57, 108–113, 2016) are performed.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Optimal stability of the Lagrange formula and conditioning of the Newton formula

  • Carnicer, J.M.
  • Khiar, Y.
  • Peña, J.M.
A pointwise condition number associated to a representation of an interpolation operator is introduced. It is proved that the Lagrange formula is optimal with respect to this conditioning. For other representations of the interpolation operator, an upper bound for the conditioning is derived. A quantitative measure in terms of the Skeel condition number is used to compare the conditioning with the Lagrange representation. The conditioning of the Newton representation is considered for increasing nodes and for nodes in Leja order. For the polynomial Newton formula with n+1 equidistant nodes in increasing order, it is proved that 3n is the best uniform bound of its conditioning and it is attained at the last node. Numerical experiments are included.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Comparing pivoting strategies for almost strictly sign regular matrices

  • Alonso, P.
  • Peña, J.M.
  • Serrano, M.L.
In this paper some properties of two-determinant pivoting for Neville elimination are presented. In particular, we consider a zero-increasing property and we show an optimal normwise growth factor. Comparisons with other pivoting strategies for Neville elimination and with Gaussian elimination with partial pivoting of almost strictly sign regular matrices are performed. Numerical examples are included.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Observations on interpolation by total degree polynomials in two variables

  • Carnicer, Jesús
  • Sauer, Tomás
In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space dimension coincide. Due to that, numerous constructions for interpolation sets have been devised, the most popular ones being based on intersections of lines. In this paper, we study algebraic properties of some such interpolation configurations, namely the approaches by Radon–Berzolari and Chung–Yao. By means of proper H-bases for the vanishing ideal of the configuration, we derive properties of the matrix of first syzygies of this ideal that allow us to draw conclusions on the geometry of the point configuration.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Combined matrices of almost strictly sign regular matrices

  • Alonso, P.
  • Peña, J.M.
  • Serrano, M.L.
The combined matrix is a very useful concept for many applications. Almost strictly sign regular (ASSR) matrices form an important structured class of matrices with two possible zero patterns, which are either type-I staircase or type-II staircase. We prove that, under an irreducibility condition, the pattern of zero and nonzero entries of an ASSR matrix is preserved by the corresponding combined matrix. Without the irreducibility condition, it is proved that type-I and type-II staircases are still preserved. Illustrative numerical examples are included.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Optimal interval length for the collocation of the Newton interpolation basis

  • Carnicer, J.M.
  • Khiar, Y.
  • Peña, J.M.
It is known that the Lagrange interpolation problem at equidistant nodes is ill-conditioned. We explore the influence of the interval length in the computation of divided differences of the Newton interpolation formula. Condition numbers are computed for lower triangular matrices associated to the Newton interpolation formula at equidistant nodes. We consider the collocation matrices L and PL of the monic Newton basis and a normalized Newton basis, so that PL is the lower triangular Pascal matrix. In contrast to L, PL does not depend on the interval length, and we show that the Skeel condition number of the (n + 1) × (n + 1) lower triangular Pascal matrix is 3n. The 8-norm condition number of the collocation matrix L of the monic Newton basis is computed in terms of the interval length. The minimum asymptotic growth rate is achieved for intervals of length 3.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Central orderings for the Newton interpolation formula

  • Carnicer, J.M.
  • Khiar, Y.
  • Peña, J.M.
The stability properties of the Newton interpolation formula depend on the order of the nodes and can be measured through a condition number. Increasing and Leja orderings have been previously considered (Carnicer et al. in J Approx Theory, 2017. https://doi.org/10.1016/j.jat.2017.07.005; Reichel in BIT 30:332–346, 1990). We analyze central orderings for equidistant nodes on a bounded real interval. A bound for conditioning is given. We demonstrate in particular that this ordering provides a more stable Newton formula than the natural increasing order. We also analyze of a central ordering with respect to the evaluation point, which provides low bounds for the conditioning. Numerical examples are included.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Estimation of missing prices in real-estate market agent-based simulations with machine learning and dimensionality reduction methods

  • García-Magariño, I.
  • Medrano, C.
  • Delgado, J.
The opacity of real-estate market involves some challenges in their agent-based simulation. While some real-estate Web sites provide the prices of a great amount of houses publicly, the prices of the rest are not available. The estimation of these prices is necessary for simulating their evolution from a complete initial set of houses. Additionally, this estimation could also be useful for other purposes such as appraising houses, letting buyers know which are the best offered prices (i.e., the lowest ones compared to the appraisals) and recommending the buyers to set an initial price. This work proposes combining dimensionality reduction methods with machine learning techniques to obtain the estimated prices. In particular, this work analyzes the use of nonnegative factorization, recursive feature elimination and feature selection with a variance threshold, as dimensionality reduction methods. It compares the application of linear regression, support vector regression, the k-nearest neighbors and a multilayer perceptron neural network, as machine learning techniques. This work has applied a tenfold cross-validation for comparing the estimations and errors and assessing the improvement over a basic estimator commonly used in the beginning of simulations. The developed software and the used dataset are freely available from a data research repository for the sake of reproducibility and the support to other researchers.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Infinity norm bounds for the inverse of Nekrasov matrices using scaling matrices

  • Orera, H.
  • Peña, J.M.
For many applications, it is convenient to have good upper bounds for the norm of the inverse of a given matrix. In this paper, we obtain such bounds when A is a Nekrasov matrix, by means of a scaling matrix transforming A into a strictly diagonally dominant matrix. Numerical examples and comparisons with other bounds are included. The scaling matrices are also used to derive new error bounds for the linear complementarity problems when the involved matrix is a Nekrasov matrix. These error bounds can improve considerably other previous bounds.
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices

  • Marco García, Ana|||0000-0003-4662-6327
  • Martínez Fernández De Las Heras, José Javier|||0000-0002-8322-0361
The computation of the Moore-Penrose inverse of structured strictly totally positive matrices is addressed. Since these matrices are usually very ill-conditioned, standard algorithms fail to provide accurate results. An algorithm based on the factorization and which takes advantage of the special structure and the totally positive character of these matrices is presented. The first stage of the algorithm consists of the accurate computation of the bidiagonal decomposition of the matrix. Numerical experiments illustrating the good behavior of our approach are included.Numerical experiments illustrating the good behavior of our approach are included., Ministerio de Economía y Competitividad
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression

  • Marco García, Ana|||0000-0003-4662-6327
  • Martínez Fernández de las Heras, José Javier|||0000-0002-8322-0361
  • Viaña Fernández, Raquel|||0000-0001-5484-9104
A method for solving least squares problems (A ⊗ Bi)x = b whose coefficient matrices have generalized Kronecker product structure is presented. It is based on the exploitation of the block structure of the Moore-Penrose inverse and the reflexive minimum norm g-inverse of the coefficient matrix, and on the QR method for solving least squares problems. Firstly, the general case where A is a rectangular matrix is considered, and then the special case where A is square is analyzed. This special case is applied to the problem of bivariate polynomial regression, in which the involved matrices are structured matrices (Vandermonde or Bernstein-Vandermonde matrices). In this context, the advantage of using the Bernstein basis instead of the monomial basis is shown. Numerical experiments illustrating the good behavior of the proposed algorithm are included., Ministerio de Economía y Competitividad
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications

  • Marco García, Ana|||0000-0003-4662-6327
  • Martínez Fernández de las Heras, José Javier|||0000-0002-8322-0361
  • Viaña Fernández, Raquel|||0000-0001-5484-9104
An algorithm for the computation of the bidiagonal decomposition of strictly totally positive h-Bernstein-Vandermonde matrices is presented. These matrices are collocation matrices of h-Bernstein bases (a generalization of the Bernstein basis) of the space of polynomials of degree less than or equal to n. The algorithm is fast (its computational complexity is O (n2) and has high relative accuracy. The computation of this bidiagonal decomposition is used as the initial stage for the accurate and efficient solution of several linear algebra problems with these matrices: linear system solving, eigenvalue computation and inverse computation. Numerical experiments are also included., Ministerio de Economía y Competitividad