【摘 要】
：
We consider the numerical solution of a c-stable linear equation in the tensor product space Rn1×···×nd, arising from a discretized elliptic partial di
【出 处】
：
2016年张量和矩阵学术研讨会(International conference on Tensor, Matrix a
论文部分内容阅读
We consider the numerical solution of a c-stable linear equation in the tensor product space Rn1×···×nd, arising from a discretized elliptic partial differential equation in Rd. Utilizing the stability, we produce an equivalent d-stable generalized Stein-like equation which can be solved iteratively. For large-scale problems defined by sparse and structured matrices, the methods can be modified for further efficiency, producing algorithms ofO(Σini)+O(ns) computational complexity, under appropriate assumptions (with ns being the flop count for solving a linear system associated with Ai-γIni ). Numerical examples will be presented.
其他文献
Let Ω(() RN be a bounded regular domain of dimension N ≥ 1, h a positive L1 function on Ω. Elliptic equations of singular growth like -△u = h(x)/ up in
A Z-matrix is a real square matrix with non-positive off- diagonal entries. Con-sidering its generalization to Z-transformations on proper cones and Z-tenso
We will talk about some latest research results on · semi-classical solutions of nonlinear Dirac equations; · bifurcation on compact spin manifolds; · co
Let m, m, n be positive integers. Let A be an mth order n-dimensional complex tensor and B be an m0th order n-dimensional complex tensor. Suppose that Bxm i
Two major tools in the study of multi-relational datasets are (i) higher-order Markov chains and (ii) linear algebra-inspired computations on hypermatrices
It is known that computing the largest(smallest) Z-eigenvalue of a symmetric ten-sor is equivalent to maximizing(minimizing) a homogeneous polynomial over t
The nonnegative tensor (matrix) factorization finds more and more applications in various disciplines including machine learning, data mining, and blind sou
In this talk, we discuss the partition of a nonnegative tensor which is intended for finding its spectral radius via the spectral radii of its principal blo
In this talk, we consider a class of n-person noncooperative games, where the utility function of every player is given by a homogeneous polynomial defined
In this talk, we try to generalize the construction of circulant preconditioners from matrix to tensor. The preconditioners could be used to solve linear or