Certain positive definite submatrices that arise from binomial coefficient matrices

DOI10.1016/S0168-9274(00)00004-0MaRDI QIDQ5928462zbMATH OpenOpenAlexFDO

Authors Ioannis C. Demetriou, Elias A. Lipitakis

Publication date 4 July 2001

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0168-9274(00)00004-0

zbMATH Keywords

binomial coefficient matricesCholesky factorizationGauss eliminationoverdetermined systempositive definite subsystempositive definitenessToeplitz matrix

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Review text

Methods for solving an overdetermined system of compatible equations whose matrix arises from the binomial coefficients with alternating signs are discussed. The original problem is replaced by an overdetermined system of compatible equations of compatible equations (1) \(C_m\lambda= b\), where \(C_m\) is an \(n\times(n- m)\) matrix \(m\ll n\), whose nonzero elements of each column are the successive binomial coefficients with alternating signs and (1) has the same solution as the original one. It is assumed that only a subset \(A\) of the components of \(\lambda\) is nonzero.NEWLINENEWLINENEWLINEThe authors study some properties of the derived matrix that are useful to the problem of choosing and solving efficiently only \(|A|\) of these equations, where \(|A|\) denotes the number of elements of \(A\) and \(|A|\leq m\). By deleting certain elements from the first and last equations one gets an equivalent system \(L_m\lambda= \widetilde b\), where \(L_m\) is an \((n-m)\times (n-m)\) Toeplitz matrix.NEWLINENEWLINENEWLINEThey prove some lemmas about positive definiteness of the coefficient matrix, both for even and odd \(m\). The positive definiteness allows the choice of a positive definite subsystem of \(|A|\) equations, corresponding to a principal submatrix of \(L_m\). The symmetric case can be solved by Cholesky factorization while the nonsymmetric one by band Gauss elimination. Both these methods require \(O(m^2|A|)\) computer operations.

Recommendations

• Three results in connection with inverse matrices
• Efficient solution of a Toeplitz-plus-Hankel coefficient matrix system of equations
• Criterion of positive definiteness of matrices and solution of inverse problem for system of linear equations
• Matrices of small Toeplitz rank, certain representations of the solution to an unstable system of linear equations with Toeplitz coefficient matrices, and related fast algorithms for solving such systems
• scientific article; zbMATH DE number 4087843

Cites work

• A Data Smoothing Technique for Piecewise Convex/Concave Curves
• Algorithm 742: L2CXFT
• Data Smoothing using Non-Negative Divided Differences and l₂ Approximation
• scientific article; zbMATH DE number 3116984 (Why is no real title available?)
• scientific article; zbMATH DE number 3942888 (Why is no real title available?)
• scientific article; zbMATH DE number 3709947 (Why is no real title available?)
• scientific article; zbMATH DE number 45848 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• scientific article; zbMATH DE number 3304458 (Why is no real title available?)
• Moving-weighted-average smoothing extended to the extremities of the data. I. Theory
• The Minimum Sum of Squares Change to Univariate Data that gives Convexity

Cited in

(3)

• On the positivity of the coefficients of a certain polynomial defined by two positive definite matrices
• Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity
• A linearly distributed lag estimator with \(r\)-convex coefficients

Describes a project that uses

Uses Software

• L2CXFT

This page was built for publication: Certain positive definite submatrices that arise from binomial coefficient matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928462)