Bebiano | Applied and Computational Matrix Analysis | Buch | 978-3-319-49982-6 | sack.de

Buch, Englisch, Band 192, 347 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 6682 g

Reihe: Springer Proceedings in Mathematics & Statistics

Bebiano

Applied and Computational Matrix Analysis

MAT-TRIAD, Coimbra, Portugal, September 2015 Selected, Revised Contributions
1. Auflage 2017
ISBN: 978-3-319-49982-6
Verlag: Springer International Publishing

MAT-TRIAD, Coimbra, Portugal, September 2015 Selected, Revised Contributions

Buch, Englisch, Band 192, 347 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 6682 g

Reihe: Springer Proceedings in Mathematics & Statistics

ISBN: 978-3-319-49982-6
Verlag: Springer International Publishing


This volume presents recent advances in the field of matrix analysis based on contributions at the MAT-TRIAD 2015 conference. Topics covered include interval linear algebra and computational complexity, Birkhoff polynomial basis, tensors, graphs, linear pencils, K-theory and statistic inference, showing the ubiquity of matrices in different mathematical areas.

With a particular focus on matrix and operator theory, statistical models and computation, the International Conference on Matrix Analysis and its Applications 2015, held in Coimbra, Portugal, was the sixth in a series of conferences. 

Applied and Computational Matrix Analysis will appeal to graduate students and researchers in theoretical and applied mathematics, physics and engineering who are seeking an overview of recent problems and methods in matrix analysis.


Bebiano Applied and Computational Matrix Analysis jetzt bestellen!

Zielgruppe


Research


Autoren/Hrsg.


Weitere Infos & Material


1. A. Amiraslani, H. Faßbender, N. Shayanfar: Birkhoff polynomial basis.- 2. M. Hladik: On relation between P-matrices and regularity of interval matrices.- 3. J. Horacek, M. Hladik, M. Cerny: Interval Linear Algebra and Computational Complexity.- 4. P. Almeida, D. Napp, R. Pinto: On optimal extended row distance profile.- 5. M. El Oued, D. Napp, R. Pinto, M. Toste: The dual of convolutional codes over Zpr.- 6. S. Mendes: On the K-theory of the reduced C*-algebras of GL(n,R) and GL(n,C).- 7. D. Moreira Cardoso, S.J. Pinheiro: Spectral bounds for the k-regular induced subgraph problem.- 8. K. Toyonaga, C. Johnson, R. Uhrig: Multiplicities: Adding a Vertex to a Graph.- 9. M. Bendaoud, M. Jabbar, M. Sarih: Nonlinear local invertibility preservers.- 10. A. Kovacec: More on the Hankel Pencil Conjecture.- 11. P. Batra: Componentwise products of totally nonnegative matrices generated by functions in the Laguerre-Polya class.- 12. N. Bebiano, J. da Providencia, A. Nata, J.P. da Providencia: Fields of values of linear pencils and spectral inclusion regions.- 13. N. Bebiano, J. da Providencia, F. Esmaeili: The characteristic polynomial of linear pencils of small size and the numerical range.- 14. H.K. Duru, D. Bozkurt: Integer Powers of Certain Complex Pentadiagonal Toeplitz Matrices.- 15. R. Mamede: Chains and antichains in the Bruhat order for classes of (0,1)-matrices.- 16. M. Saha: Iterative method for linear system with coefficient matrix as an Mv-matrix.- 17. C. Gamas: Symmetrized tensors and spherical functions.- 18. J. Pielaszkiewicz, D. von Rosen, M. Singull: Testing independence via spectral moments.- 19. R. Kala, A. Markiewicz, S. Puntanen: Some further remarks on the linear sufficiency in the linear model.- 20. L.M. Grilo, C.A. Coelho: The exact and near-exact distributions for the statistic used to test the reality of covariance matrix in a complex normal distribution.- 21. A. Silva, M. Fonseca, J. Mexia: Variance Components Estimation in Mixed Linear Model.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.