Some large-scale matrix computation problems
نویسندگان
چکیده
منابع مشابه
Some Large Scale Matrix Computation Problems
There are numerous applications in physics, statistics and electrical circuit simulation where it is required to bound entries and the trace of the inverse and the determinant of a large sparse matrix. All these computational tasks are related to the central mathematical problem studied in this paper, namely, bounding the bilinear form uXf(A)v for a given matrix A and vectors u and v, wheref is...
متن کاملDistributed Computation of Large-scale Graph Problems
Motivated by the increasing need for fast distributed processing of large-scale graphs such as the Web graph and various social networks, we study a number of fundamental graph problems in the message-passing model, where we have k machines that jointly perform a computation on an arbitrary n-node (typically, n ≫ k) input graph. The graph is assumed to be randomly partitioned among the k ≥ 2 ma...
متن کاملParallel Evolutionary Computation in Very Large Scale Eigenvalue Problems
The history of research on eigenvalue problems is rich with many outstanding contributions. Nonetheless, the rapidly increasing size of data sets requires new algorithms for old problems in the context of extremely large matrix dimensions [21]. This paper reports on new methods for finding eigenvalues of very large matrices by a synthesis of evolutionary computation, parallel programming, and e...
متن کاملParallel Computation of Large-Scale Dynamic Optimal Power Flow Problems
In this paper, a novel approach is presented to compute large Dynamic Optimal Power Flow (DOPF) problems in a distributed computing architecture, referred to as a Smart Grid Communication Middleware (SGCM) system. The time horizon is split into shorter time intervals using the SGCM system to solve one iteration of the Primal Dual Interior Point Method (PDIPM) for each sub-problem in parallel. T...
متن کاملComputation of Pseudospectral Abscissa for Large Scale Nonlinear Eigenvalue Problems
We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1996
ISSN: 0377-0427
DOI: 10.1016/0377-0427(96)00018-0