Results 121 to 130 of about 145,037 (166)
Some of the next articles are maybe not open access.
Matrix decomposition MFS algorithms
WIT Transactions on Modelling and Simulation, Vol 42, 2006We describe the application of the Method of Fundamental Solutions (MFS) to elliptic boundary value problems in rotationally symmetric problems. In particular, we show how efficient matrix decomposition MFS algorithms can be developed for such problems. The efficiency of these algorithms is optimized by using Fast Fourier Transforms (FFTs).
Karageorghis, Andreas +3 more
openaire +2 more sources
N-decomposition and decomposition matrix for automata
Proceedings of the annual conference on - ACM'73, 1973This continues the study on generalized mutiple decomposition allowing 2-way interconnection [1]. Let NeZ+.An automaton M e D, T,F> is an N-automaton iff the set of states D ≤ πSi and each Si e πi (D) where πi is the projection map onto the ith component.
openaire +1 more source
Matrix and Tensor Decompositions
2010Advances in high-throughput technologies such as gene and protein expression microarrays in the past decade have made it possible to simultaneously measure the expression levels of thousands of transcripts. This has resulted in large amounts of biological data requiring analysis and interpretation.
openaire +1 more source