Spectral Decomposition Spectral Decomposition Associated with the spectral decomposition
Alan Mcintosh, Self Adjoint Operators, H N (d · 2010
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Decomposition”
Alan Mcintosh, Self Adjoint Operators, H N (d · 2010
Cited by 0
M. J. Swift, J. M. Anderson · Elsevier eBooks · 1989
Cited by 42
G. A. Ellenbroek · 1987
Cited by 0
Lachiusa, Salvatore A. · 1954
Cited by 0
Wil H. A · 2015
Cited by 0
SpringerReference · 2011
Cited by 0
H. Faßbender A, Kh. D. Ikramov B, Braunschweig Germany · 2015
Cited by 0
Marek Niezgoda · 2015
Cited by 0
Rose Ann Postma · Dordt Digital Collections (Dordt College) · 2021
Cited by 0
Thibeau, Kaitlin · DUNE - DigitalUNE (University of New England) · 2019
Original: 22"x60" mixed media including printmaking, watercolor, acrylic, and drawing. Created for UNE Studio Concentration and Exhibition Seminar courses.
Cited by 0
E. Pruliere, F. Chinesta, A. Ammar et al. · 2012
Cited by 0
Julián Andrés, Valdés Vargas, Pierre Badin et al. · 2013
Cited by 0
Matthew Brand, Matthew Brand · 2006
This paper develops an identity for additive modivations of a singular value decomposition (SVD) to reflect updates, downdates, shifts, and edits of the data matrix. This sets the stage for fast and ememory-efficient sequential algorithms for tracking singular values and subspaces. In conjunction with a fast solution for the pseudo-inverse of a submatrix of an orthogonal matrix, we develop a scheme for computing a thin SVD of streaming data in a single pass with linear time complexity: A rank-¡i¿r¡/i ¿ think SVD of a ¡i¿p¡/i ¿ x ¡i¿q¡/i ¿ matrix can be computed in O(¡i¿pqr¡/i¿) time for ¡i¿r¡/i ¿ ¡ = min(¡i¿p,q¡/i¿).
Cited by 0
Academic Studies Press eBooks · 2019
Cited by 0
Gerald R. Stephenson, Ian G. Ferris, Patrick T. Holland et al. · IUPAC Standards Online · 2016
The glossary contains definitions of more than 500 terms frequently used in relation to the chemistry, mode of action, regulation, and use of pesticides. A wide range of disciplines is involved in this field, and the glossary was developed as a step in facilitating communication among researchers, government regulatory authorities, and chemists in associated professional areas. The range of terms relates to pesticide residue analysis, sampling for analysis, good laboratory practice, metabolism, environmental fate, effects on ecosystems, computer simulation models, toxicology, and risk assessment. The number of important, “pesticide-related” terms has more than doubled since 1996, when the first IUPAC glossary of this type was developed[1], an indication of how this field has become so integrated with many other scientific and regulatory disciplines.
Cited by 0
2016
mp ies-the ble n c tive pp points are optimal and, more importantly, they may not identify all the Pareto-optimal points. In this paper, we treat redundancy allocation problem as a multi-objective problem, as is typical in practice. We decompose the original problem into several multi-objective sub-problems, efficiently and exactly lem ( ty’ ’ lit as ele esign a syste
Cited by 0
2013
Cited by 0
Shobana Padmanabhan, Roger D. Chamberlain, Yixin Chen · 2010
High-performance streaming applications are typically pipelined and deployed on architecturally diverse (hybrid)systems. Developers of such applications are interested in customizing components used, so as to benefit application performance. We present an efficient and automatic technique for design-space exploration of applications in this problem domain. We solve performance tuning as an optimization problem by formulating cost functions using results from queueing theory. This results in a mixed-integer nonlinear optimization problem which is NP-hard. We reduce the search complexity by decomposing the search space. We have developed a domain-specific decomposition technique using topological information of the application embodied in the queueing network models. Our analysis includes when our decomposition preserves optimality. Our preliminary empirical results confirm two-fold benefits--solving a problem that is currently not solvable using state-of-the-art solvers and in some problem instances, improving initial solution value from the solver by over two orders of magnitude.... Read complete abstract on page 2.
Cited by 0
United States, Forest Service, Forest Growth et al. · 2010
Cited by 0
T. Cluzeau, V. Dolean, F. Nataf et al. · 2014
Cited by 0