共查询到20条相似文献,搜索用时 46 毫秒
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.
Jacek Gancarzewicz Noureddine Rahmani Modesto Salgado 《Czechoslovak Mathematical Journal》2002,52(4):889-896
In this paper we consider a product preserving functor F of order r and a connection of order r on a manifold M. We introduce horizontal lifts of tensor fields and linear connections from M to F(M) with respect to . Our definitions and results generalize the particular cases of the tangent bundle and the tangent bundle of higher order. 相似文献
4.
Eugene Tyrtyshnikov 《高等学校计算数学学报(英文版)》2009,2(4):421-426
For an arbitrary tensor (multi-index array) with linear constraints at each direction, it is proved that the factors of any minimal canonical tensor approximation to this tensor satisfy the same linear constraints for the corresponding directions. 相似文献
5.
Numerical multilinear algebra (or called tensor computation), in which instead of matrices and vectors the higher-order tensors
are considered in numerical viewpoint, is a new branch of computational mathematics. Although it is an extension of numerical
linear algebra, it has many essential differences from numerical linear algebra and more difficulties than it. In this paper,
we present a survey on the state of the art knowledge on this topic, which is incomplete, and indicate some new trends for
further research. Our survey also contains a detailed bibliography as its important part. We hope that this new area will
be receiving more attention of more scholars.
相似文献
6.
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. 相似文献
7.
Shmuel FRIEDLAND 《Frontiers of Mathematics in China》2013,8(1):19-40
We show that a best rank one approximation to a real symmetric tensor, which in principle can be nonsymmetric, can be chosen symmetric. Furthermore, a symmetric best rank one approximation to a symmetric tensor is unique if the tensor does not lie on a certain real algebraic variety. 相似文献
8.
We consider the problem of recovering an orthogonally decomposable tensor with a subset of elements distorted by noise with arbitrarily large magnitude. We focus on the particular case where each mode in the decomposition is corrupted by noise vectors with components that are correlated locally, that is, with nearby components. We show that this deterministic tensor completion problem has the unusual property that it can be solved in polynomial time if the rank of the tensor is sufficiently large. This is the polar opposite of the low-rank assumptions of typical low-rank tensor and matrix completion settings. We show that our problem can be solved through a system of coupled Sylvester-like equations and show how to accelerate their solution by an alternating solver. This enables recovery even with a substantial number of missing entries, for instance for -dimensional tensors of rank with up to missing entries. 相似文献
9.
Jifei
Miao Guanghui Cheng Wenrui Li Eric Moreau 《Numerical Linear Algebra with Applications》2020,27(3)
Based on Givens‐like rotations, we present a unitary joint diagonalization algorithm for a set of nonsymmetric higher‐order tensors. Each unitary rotation matrix only depends on one unknown parameter which can be analytically obtained in an independent way following a reasonable assumption and a complex derivative technique. It can serve for the canonical polyadic decomposition of a higher‐order tensor with orthogonal factors. Furthermore, based on cross‐high‐order cumulants of observed signals, we show that the proposed algorithm can be applied to solve the joint blind source separation problem. The simulation results reveal that the proposed algorithm has a competitive performance compared with those of several existing related methods. 相似文献
10.
Preconditioners for higher order edge finite element discretizations of Maxwell's equations 总被引:1,自引:0,他引:1
In this paper,we are concerned with the fast solvers for higher order edge finite element discretizations of Maxwell's equations.We present the preconditioners for the first family and second family of higher order N′ed′elec element equations,respectively.By combining the stable decompositions of two kinds of edge finite element spaces with the abstract theory of auxiliary space preconditioning,we prove that the corresponding condition numbers of our preconditioners are uniformly bounded on quasi-uniform grids.We also present some numerical experiments to demonstrate the theoretical results. 相似文献
11.
By calculating some four-loop diagrams in the N=1 supersymmetric electrodynamics regularized by higher derivatives, we verify
a method for summing Feynman diagrams based on using Schwinger-Dyson equations and Ward identities. In particular, for the
diagrams considered, we prove the correctness of an additional identity for Green’s functions not reduced to the gauge Ward
identity.
__________
Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 147, No. 2, pp. 290–302, May, 2006. 相似文献
12.
Boris N. Khoromskij N. Kishore Kumar Jan Schneider 《Numerical Linear Algebra with Applications》2019,26(5)
In this article, we consider the iterative schemes to compute the canonical polyadic (CP) approximation of quantized data generated by a function discretized on a large uniform grid in an interval on the real line. This paper continues the research on the quantics‐tensor train (QTT) method (“O(d log N)‐quantics approximation of N‐d tensors in high‐dimensional numerical modeling” in Constructive Approximation, 2011) developed for the tensor train (TT) approximation of the quantized images of function related data. In the QTT approach, the target vector of length 2L is reshaped to a Lth‐order tensor with two entries in each mode (quantized representation) and then approximated by the QTT tensor including 2r2L parameters, where r is the maximal TT rank. In what follows, we consider the alternating least squares (ALS) iterative scheme to compute the rank‐r CP approximation of the quantized vectors, which requires only 2rL?2L parameters for storage. In the earlier papers (“Tensors‐structured numerical methods in scientific computing: survey on recent advances” in Chemom Intell Lab Syst, 2012), such a representation was called QCan format, whereas in this paper, we abbreviate it as the QCP (quantized canonical polyadic) representation. We test the ALS algorithm to calculate the QCP approximation on various functions, and in all cases, we observed the exponential error decay in the QCP rank. The main idea for recovering a discretized function in the rank‐r QCP format using the reduced number of the functional samples, calculated only at O(2rL) grid points, is presented. The special version of the ALS scheme for solving the arising minimization problem is described. This approach can be viewed as the sparse QCP‐interpolation method that allows to recover all 2rL representation parameters of the rank‐r QCP tensor. Numerical examples show the efficiency of the QCP‐ALS‐type iteration and indicate the exponential convergence rate in r. 相似文献
13.
We generalize the matrix Kronecker product to tensors and propose the tensor Kronecker product singular value decomposition that decomposes a real k‐way tensor into a linear combination of tensor Kronecker products with an arbitrary number of d factors. We show how to construct , where each factor is also a k‐way tensor, thus including matrices (k=2) as a special case. This problem is readily solved by reshaping and permuting into a d‐way tensor, followed by a orthogonal polyadic decomposition. Moreover, we introduce the new notion of general symmetric tensors (encompassing symmetric, persymmetric, centrosymmetric, Toeplitz and Hankel tensors, etc.) and prove that when is structured then its factors will also inherit this structure. 相似文献
14.
We compare the calculation of the two-loop -function in the N=1 supersymmetric electrodynamics regularized via higher derivatives and via dimensional reduction. We show that the renormalized effective action is the same for both regularizations. But in the method of higher derivatives, unlike in the dimensional reduction, the -function defined as the derivative of the renormalized coupling constant with respect to log turns out to be purely one-loop. The anomaly problem therefore does not occur in this regularization, because in the method of higher derivatives, the diagrams with counterterm insertions make a nonzero contribution, which is evaluated exactly in all orders of the perturbation theory. When dimensional reduction is used, this contribution is zero. We argue that this result is a consequence of the mathematical inconsistency of the dimensional reduction method and that just this inconsistency leads to the anomaly problem. 相似文献
15.
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. 相似文献
16.
We calculate three-loop corrections to the effective action for N=1 supersymmetric electrodynamics regularized by higher derivatives. Using the obtained results, we investigate the anomaly problem in the considered model. 相似文献
17.
K. V. Stepanyantz 《Theoretical and Mathematical Physics》2005,142(1):29-47
Using Schwinger-Dyson equations and Ward identities in the N=1 supersymmetric electrodynamics regularized by higher derivatives, we find that we can calculate some contributions to the two-point Greens function of the gauge field and to the -function exactly in all orders of the perturbation theory. We use the results to investigate the anomaly puzzle in the considered theory.Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 142, No. 1, pp. 35–56, January, 2005. 相似文献
18.
A new fast algebraic method for obtaining an ‐approximation of a matrix from its entries is presented. The main idea behind the method is based on the nested representation and the maximum volume principle to select submatrices in low‐rank matrices. A special iterative approach for the computation of so‐called representing sets is established. The main advantage of the method is that it uses only the hierarchical partitioning of the matrix and does not require special ‘proxy surfaces’ to be selected in advance. The numerical experiments for the electrostatic problem and for the boundary integral operator confirm the effectiveness and robustness of the approach. The complexity is linear in the matrix size and polynomial in the ranks. The algorithm is implemented as an open‐source Python package that is available online. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
19.
We use the higher covariant derivative regularization to investigate a new identity for Green’s functions. It relates certain coefficients of the matter superfield vertex function for which one of the external matter legs is not chiral. Calculations in the first nontrivial order (for the two-loop vertex function) demonstrate that the new identity also holds in the non-Abelian Yang-Mills theory with matter fields. We demonstrate that the new identity follows because the three-loop integrals determining the Gell-Mann-Low function are integrals of total derivatives. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 156, No. 2, pp. 270–281, August, 2008. 相似文献
20.
Josep Clotet M. Dolors Magret Marta Peña 《Mathematical Methods in the Applied Sciences》2009,32(14):1753-1767
In order to study stress–strain tensors, we consider their representations as pairs of symmetric 3 × 3‐matrices and the space of such pairs of matrices partitioned into equivalence classes corresponding to change of bases. We see that these equivalence classes are differentiable submanifolds; in fact, orbits under the action of a Lie group. We compute their dimension and obtain miniversal deformations. Finally, we prove that the space of coaxial stress–strain tensors is a finite union of differentiable submanifolds. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献