• No results found

large sparse

A Block Preconditioned Inexact Linear Solver for Computing the Complex Eigenpairs of a Large Sparse Matrix

A Block Preconditioned Inexact Linear Solver for Computing the Complex Eigenpairs of a Large Sparse Matrix

... In Section 2, we found two nonzero nullvectors for M at the root. As a result of this property of M at the root, in this section, we will describe an inexact inverse iteration technique for solving the large ...

17

Integration of a big data emerging on large sparse simulation and its 
		application on green computing platform

Integration of a big data emerging on large sparse simulation and its application on green computing platform

... analyzing large data and verifying a big data set are a challenge for understanding the fundamental concept behind ...the large-scale numerical ...from large sets of data and improving strategies for ...

10

An Efficient Storage Format for Large Sparse Matrices based on Quadtree

An Efficient Storage Format for Large Sparse Matrices based on Quadtree

... for large sparse matrices was presented in this paper based on ...the sparse matrix in two vectors, which reduce the required memory space for storage sparse ...

6

Classification with Large Sparse Datasets: Convergence Analysis and Scalable Algorithms

Classification with Large Sparse Datasets: Convergence Analysis and Scalable Algorithms

... In recent years, large sparse datasets have been the focus of collaborative filtering research. Many popular algorithms in this field rely on the assumption that the dataset is of a low rank, e.g., the ...

135

A survey of methods for computing large sparse matrix exponentials arising in Markov modelling

A survey of methods for computing large sparse matrix exponentials arising in Markov modelling

... Krylov subspace techniques have been shown to yield robust methods for the nu- merical computation of large sparse matrix exponentials and especially the transient solutions of Markov Chains. The ...

21

Efficient Large Sparse Arrays Synthesis by Means of Smooth Re-Weighted L1 Minimization

Efficient Large Sparse Arrays Synthesis by Means of Smooth Re-Weighted L1 Minimization

... Abstract: In this paper we present an efficient technique for the synthesis of very large sparse arrays, with arbitrary circularly symmetrical upper bounds for the pattern specifications. The algorithm, ...

14

Iterative Solution of Large Sparse Linear Systems Arising from Application of Interior Point Method in Computational Geomechanics

Iterative Solution of Large Sparse Linear Systems Arising from Application of Interior Point Method in Computational Geomechanics

... of large sparse linear systems arising from application of second order cone programming in computational plasticity problems is ...in large sizes, such as three dimensional cases, due to their high ...

6

Calculating the H∞-norm of large sparse systems via
Chandrasekhar iterations and extrapolation

Calculating the H∞-norm of large sparse systems via Chandrasekhar iterations and extrapolation

... We have presented an algorithm based on the Chandrasekhar iteration and initial empirical evidence that it can be used to estimate efficiently k G ( z ) k ∞ for large discrete time linea[r] ...

10

Process Scheduling in DSC and the Large Sparse Linear Systems Challenge*

Process Scheduling in DSC and the Large Sparse Linear Systems Challenge*

... unstructured sparse lin- ear systems has very coarse grain size, unlike classical methods such as conjugate gradient, which makes it very suitable for the DSC ...Such large runs would very likely not have ...

15

Efficient Methods for Inferring Large Sparse Topic Hierarchies

Efficient Methods for Inferring Large Sparse Topic Hierarchies

... of a single model for each topic size and model type. We focus on SBTDM-tall for the large corpora. We utilize expansion (see Section 4.4) for SBTDM-tall models with more than a thou- sand topics on each data set. ...

11

Robust De-anonymization of Large Sparse Datasets

Robust De-anonymization of Large Sparse Datasets

... For sparse datasets, such as most real-world datasets of individual transactions, pref- erences, and recommendations, very little background knowledge is needed (as few as 5-10 attributes in our case ...

15

Large-Scale Visualization of Sparse Matrices

Large-Scale Visualization of Sparse Matrices

... 5. Conclusions. This paper extends the work of Langr et al. [9]. It presents an updated version of the algorithm for the parallel acquisition of visualization data for large sparse matrices, along with its ...

11

A Class of Parallel Multilevel Sparse Approximate Inverse Preconditioners for Sparse Linear Systems

A Class of Parallel Multilevel Sparse Approximate Inverse Preconditioners for Sparse Linear Systems

... a large sparse nonsingular matrix of order ...the sparse linear systems of interest continues to grow, parallel iterative solution techniques that can utilize the computing power of multiple ...

14

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

... which matches the empirically observed behavior. Part of the problem may be that unlike the case with BP, the phase transition for OMP is sensitive to the distribution of the nonzero elements in the sparsest solution. ...

48

Solving Large-Scale Multi-Objective Optimization Problems with Sparse Optimal Solutions via Unsupervised Neural Networks

Solving Large-Scale Multi-Objective Optimization Problems with Sparse Optimal Solutions via Unsupervised Neural Networks

... ferent sparse LMOPs in a black-box ...solving sparse LMOPs. Besides, existing large-scale MOEAs are inefficient for solving sparse LMOPs due to the compu- tationally expensive ...example, ...

14

Recovering sparse graphs

Recovering sparse graphs

... The results that we have just mentioned concern classes of sparse graphs. While they cannot be extended to all somewhere-dense classes of graphs, see e.g. [8], it is still possible to hope for proving tractability ...

15

Adaptively Sparse Transformers

Adaptively Sparse Transformers

... using sparse normalizing transforms in attention mechanisms such as sparsemax – which can yield exactly zero probabilities for irrelevant words – may improve performance and interpretability (Malaviya et ...

11

Noisy Sparse Subspace Clustering

Noisy Sparse Subspace Clustering

... Moreover, with a minor modification in our analysis that sharpens the bound of the tuning parameter that ensures the solution is non-trivial, we are able to get a result that is stronger than Soltanolkotabi et al. (2014) ...

41

Sparse Learning in Multiclass Problems.

Sparse Learning in Multiclass Problems.

... Multi-category classification is an important topic in statistical learning and data min- ing. It has many applications, such as handwritten zip code digit recognition and cancer type DNA microarray classification. ...

84

Show all 10000 documents...

Related subjects