共查询到20条相似文献,搜索用时 31 毫秒
1.
Michael J. O'Hara 《Numerical Linear Algebra with Applications》2014,21(1):1-12
The problem of symmetric rank‐one approximation of symmetric tensors is important in independent components analysis, also known as blind source separation, as well as polynomial optimization. We derive several perturbative results that are relevant to the well‐posedness of recovering rank‐one structure from approximately‐rank‐one symmetric tensors. We also specialize the analysis of the shifted symmetric higher‐order power method, an algorithm for computing symmetric tensor eigenvectors, to approximately‐rank‐one symmetric tensors. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
2.
3.
Linda Kaufman 《Numerical Linear Algebra with Applications》2007,14(3):237-254
Let A be an n × n symmetric matrix of bandwidth 2m + 1. The matrix need not be positive definite. In this paper we will present an algorithm for factoring A which preserves symmetry and the band structure and limits element growth in the factorization. With this factorization one may solve a linear system with A as the coefficient matrix and determine the inertia of A, the number of positive, negative, and zero eigenvalues of A. The algorithm requires between 1/2nm2 and 5/4nm2 multiplications and at most (2m + 1)n locations compared to non‐symmetric Gaussian elimination which requires between nm2 and 2nm2 multiplications and at most (3m + 1)n locations. Our algorithm reduces A to block diagonal form with 1 × 1 and 2 × 2 blocks on the diagonal. When pivoting for stability and subsequent transformations produce non‐zero elements outside the original band, column/row transformations are used to retract the bandwidth. To decrease the operation count and the necessary storage, we use the fact that the correction outside the band is rank‐1 and invert the process, applying the transformations that would restore the bandwidth first, followed by a modified correction. This paper contains an element growth analysis and a computational comparison with LAPACKs non‐symmetric band routines and the Snap‐back code of Irony and Toledo. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
4.
M. Van Barel E. Van Camp N. Mastronardi 《Numerical Linear Algebra with Applications》2005,12(10):981-1000
Very recently, an algorithm, which reduces any symmetric matrix into a semiseparable one of semi‐ separability rank 1 by similar orthogonality transformations, has been proposed by Vandebril, Van Barel and Mastronardi. Partial execution of this algorithm computes a semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the Lanczos' process applied to the original matrix. Also a kind of nested subspace iteration is performed at each step. In this paper, we generalize the above results and propose an algorithm to reduce any symmetric matrix into a similar block‐semiseparable one of semiseparability rank k, with k ∈ ?, by orthogonal similarity transformations. Also in this case partial execution of the algorithm computes a block‐semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the block‐Lanczos' process with k starting vectors, applied to the original matrix. Subspace iteration is performed at each step as well. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
5.
Symmetric orthogonal approximation to symmetric tensors with applications to image reconstruction
下载免费PDF全文
![点击此处可从《Numerical Linear Algebra with Applications》网站下载免费的PDF全文](/ch/ext_images/free.gif)
The main objective of this paper is to study an approximation of symmetric tensors by symmetric orthogonal decomposition. We propose and study an iterative algorithm to determine a symmetric orthogonal approximation and analyze the convergence of the proposed algorithm. Numerical examples are reported to demonstrate the effectiveness of the proposed algorithm. We also apply the proposed algorithm to represent correlated face images. We demonstrate better face image reconstruction results by combining principal components and symmetric orthogonal approximation instead of combining principal components and higher‐order SVD results. 相似文献
6.
R. Bouyouli G. Meurant L. Smoch H. Sadok 《Numerical Linear Algebra with Applications》2009,16(3):223-236
This paper is concerned with proving theoretical results related to the convergence of the conjugate gradient (CG) method for solving positive definite symmetric linear systems. Considering the inverse of the projection of the inverse of the matrix, new relations for ratios of the A‐norm of the error and the norm of the residual are provided, starting from some earlier results of Sadok (Numer. Algorithms 2005; 40 :201–216). The proofs of our results rely on the well‐known correspondence between the CG method and the Lanczos algorithm. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
7.
We present an algorithm for the approximation of the dominant singular values and corresponding right and left singular vectors of a complex symmetric matrix. The method is based on two short-term recurrences first proposed by Saunders, Simon and Yip [24] for a non-Hermitian linear system solver. With symmetric matrices, the recurrence can be modified so as to generate a tridiagonal symmetric matrix from which the original triplets can be approximated. The recurrence formally resembles the Lanczos method, in spite of substantial differences which make usual convergence results inapplicable. Implementation aspects are discussed, such as re-orthogonalization and the use of alternative representation matrices. The method is very efficient over existing approaches which do not exploit the symmetry of the problem. Numerical experiments on application problems validate the analysis, while showing satisfactory results, especially on dense matrices. © 1997 by John Wiley & Sons, Ltd. 相似文献
8.
Ireneusz Winnicki Janusz Jasinski Slawomir Pietrek 《Numerical Methods for Partial Differential Equations》2019,35(6):2275-2304
The paper presents an enhanced analysis of the Lax‐Wendroff difference scheme—up to the eighth‐order with respect to time and space derivatives—of the modified‐partial differential equation (MDE) of the constant‐wind‐speed advection equation. The modified equation has been so far derived mainly as a fourth‐order equation. The Π ‐form of the first differential approximation (differential approximation or equivalent equation) derived by expressing the time derivatives in terms of the space derivatives is used for presenting the MDE. The obtained coefficients at higher order derivatives are analyzed for indications of the character of the dissipative and dispersive errors. The authors included a part of the stencil applied for determining the modified differential equation up to the eighth‐order of the analyzed modified differential equation for the second‐order Lax‐Wendroff scheme. Neither the derived coefficients at the space derivatives of order p ∈ (7 – 8) in the modified differential equation for the Lax‐Wendroff difference scheme nor the results of analyses on the basis of these coefficients of the group velocity, phase shift errors, or dispersive and dissipative features of the scheme have been published. The MDEs for 2 two‐step variants of the Lax‐Wendroff type difference schemes and the MacCormack predictor–corrector scheme (see MacCormack's study) constructed for the scalar hyperbolic conservation laws are also presented in this paper. The analysis of the inviscid Burgers equation solution with the initial condition in a form of a shock wave has been discussed on their basis. The inviscid Burgers equation with the source is also presented. The theory of MDE started to develop after the paper of C. W. Hirt was published in 1968. 相似文献
9.
10.
In this paper,we propose a Rayleigh quotient iteration method (RQI)to calculate the Z-eigenpairs of the symmetric tensor,which can be viewed as a generalization of shifted symmetric higher-order power method (SS-HOPM).The convergence analysis and the fixed-point analysis of this algorithm are given.Nu-merical examples show that RQI needs fewer iterations than SS-HOPM while keep the amount of computation per iteration. 相似文献
11.
12.
In this paper, we propose a fast algorithm for computing the spectral radii of symmetric nonnegative tensors. In particular, by this proposed algorithm, we are able to obtain the spectral radii of weakly reducible symmetric nonnegative tensors without requiring the partition of the tensors. As we know, it is very costly to determine the partition for large‐sized weakly reducible tensors. Numerical results are reported to show that the proposed algorithm is efficient and also able to compute the spectral radii of large‐sized tensors. As an application, we present an algorithm for testing the positive definiteness of Z‐tensors. By this algorithm, it is guaranteed to determine the positive definiteness for any Z‐tensor. 相似文献
13.
In this paper, we introduce a one-parametric class of smoothing functions in the context of symmetric cones which contains two symmetric perturbed smoothing functions as special cases, and show that it is coercive under suitable assumptions. Based on this class of smoothing functions, a smoothing Newton algorithm is extended to solve the complementarity problems over symmetric cones, and it is proved that the proposed algorithm is globally and locally superlinearly convergent under suitable assumptions. The theory of Euclidean Jordan algebras is a basic tool which is extensively used in our analysis. Preliminary numerical results for randomly generated second-order cone programs and several practical second-order cone programs from the DIMACS library are reported. 相似文献
14.
The automated multi‐level sub‐structuring (AMLS) method is a powerful technique to determine a large number of eigenpairs with moderate accuracy of huge symmetric and definite eigenvalue problems in structural analysis. This paper is concerned with an adapted version of AMLS for eigenfrequency analysis of fluid–solid interaction systems. Although fluid–solid vibrations are governed by an unsymmetric eigenproblem, the modified AMLS method needs approximately the same computational effort. An error bound related to the eigenvalue approximations is proved. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
15.
In 1952, Hestenes and Stiefel first established, along with the conjugate-gradient algorithm, fundamental relations which exist between conjugate direction methods for function minimization on the one hand and Gram-Schmidt processes relative to a given positive-definite, symmetric matrix on the other. This paper is based on a recent reformulation of these relations by Hestenes which yield the conjugate Gram-Schmidt (CGS) algorithm. CGS includes a variety of function minimization routines, one of which is the conjugate-gradient routine. This paper gives the basic equations of CGS, including the form applicable to minimizing general nonquadratic functions ofn variables. Results of numerical experiments of one form of CGS on five standard test functions are presented. These results show that this version of CGS is very effective.The preparation of this paper was sponsored in part by the US Army Research Office, Grant No. DH-ARO-D-31-124-71-G18.The authors wish to thank Mr. Paul Speckman for the many computer runs made using these algorithms. They served as a good check on the results which they had obtained earlier. Special thanks must go to Professor M. R. Hestenes whose constant encouragement and assistance made this paper possible. 相似文献
16.
Finding the maximum eigenvalue of a symmetric tensor is an important topic in tensor computation and numerical multilinear algebra. In this paper, we introduce a new class of structured tensors called W‐tensors, which not only extends the well‐studied nonnegative tensors by allowing negative entries but also covers several important tensors arising naturally from spectral hypergraph theory. We then show that finding the maximum H‐eigenvalue of an even‐order symmetric W‐tensor is equivalent to solving a structured semidefinite program and hence can be validated in polynomial time. This yields a highly efficient semidefinite program algorithm for computing the maximum H‐eigenvalue of W‐tensors and is based on a new structured sums‐of‐squares decomposition result for a nonnegative polynomial induced by W‐tensors. Numerical experiments illustrate that the proposed algorithm can successfully find the maximum H‐eigenvalue of W‐tensors with dimension up to 10,000, subject to machine precision. As applications, we provide a polynomial time algorithm for computing the maximum H‐eigenvalues of large‐size Laplacian tensors of hyperstars and hypertrees, where the algorithm can be up to 13 times faster than the state‐of‐the‐art numerical method introduced by Ng, Qi, and Zhou in 2009. Finally, we also show that the proposed algorithm can be used to test the copositivity of a multivariate form associated with symmetric extended Z‐tensors, whose order may be even or odd. 相似文献
17.
There recently has been much interest in studying optimization problems over symmetric cones. In this paper, we first investigate
a smoothing function in the context of symmetric cones and show that it is coercive under suitable assumptions. We then extend
two generic frameworks of smoothing algorithms to solve the complementarity problems over symmetric cones, and prove the proposed
algorithms are globally convergent under suitable assumptions. We also give a specific smoothing Newton algorithm which is
globally and locally quadratically convergent under suitable assumptions. The theory of Euclidean Jordan algebras is a basic
tool which is extensively used in our analysis. Preliminary numerical results for second-order cone complementarity problems
are reported. 相似文献
18.
In this paper, we propose a shifted symmetric higher‐order power method for computing the H‐eigenpairs of a real symmetric even‐order tensor. The local convergence of the method is proved. In addition, by utilizing the fixed‐point analysis, we can characterize exactly which H‐eigenpairs can be found and which cannot be found by the method. Numerical examples are presented to illustrate the performance of the method. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
19.
The present paper considers the effect of electromechanical coupling on the interlaminar stresses and the electric field strengths at free edges of laminated plates with piezoelectric material properties. The results of coupled and uncoupled piezoelectric analyses performed by use of the finite element method are compared. Exemplarily, a symmetric cross‐ply and a symmetric angle‐ply laminate are investigated under uniaxial tension and without any electrical loading. It is shown that the interlaminar stresses at the free edge are significantly higher in the coupled case for the symmetric cross‐ply laminate, whereas the coupling effect for the symmetric angle‐ply laminate is of minor significance. In addition, the occurrence of electric field strengths with singular character is revealed. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
20.
G.R. Fisher 《International Journal of Mathematical Education in Science & Technology》2013,44(4):385-403
In econometrics it is common for variables to be related together in a set of linear, multilateral and causal interdependencies. This type of system generally has properties which are unsatisfactory for application of classical regression techniques. Consequently, alternative estimation methods have been developed. This paper explores the relations between several such methods in terms of symmetric idempotents of predetermined variables and their orthogonal complements. Generalizations of two‐ and three‐stage least squares and instrumental variables are considered, including Wicken's estimator.2 The relative efficiencies of the estimators are also discussed. 相似文献