Jonas Ballani

Computational Mathematics · 2012–2013

A researcher in the Science corpus: 4 papers; trusts 19 researchers and is trusted by 21 researchers here, as inferred from the citation graph.

Subfields

• Computational Mathematics — 26 citations into it; #129 of 612 by trust here, #210 by citations
• Computational Theory and Mathematics — 20 citations into it
• Numerical Methods & Scientific Computing — 12 citations into it; #102 of 266 by trust here, #100 by citations
• Artificial Intelligence — 11 citations into it; #15,373 of 35,345 by trust here, #19,873 by citations
• Computational Mechanics — 8 citations into it
• Signal Processing — 7 citations into it
• Biomedical Engineering — 5 citations into it

Whom Jonas Ballani trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Lars Grasedyck
2. Ivan V. Oseledets
3. E. E. Tyrtyshnikov
4. Wolfgang Hackbusch
5. Mark Coppejans
6. Tamara G. Kolda
7. Lieven De Lathauwer
8. Sergei A. Goreinov
9. Antonio Falcó
10. Brett W. Bader

Who trusts Jonas Ballani overall

1. Daniel Kressner
2. Christine Tobler
3. Roman Andreev
4. Boris N. Khoromskij
5. Reinhold Schneider
6. André Uschmajew
7. Dmitry V. Savostyanov
8. Vladimir A. Kazeev
9. V. Dolgov
10. Thorsten Rohwedder

Papers from Jonas Ballani's perspective

Ordered by how strongly the researchers Jonas Ballani trusts endorse each paper. Same corpus, a different order for every researcher.

1. Some mathematical notes on three-mode factor analysis
2. Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
3. Tensor Decompositions and Applications
4. TT-cross approximation for multidimensional arrays
5. f¨ur Mathematik in den Naturwissenschaften Leipzig Hierarchical Singular Value Decomposition of Tensors
6. Rank-One Approximation to High Order Tensors (SIAM Journal on Matrix Analysis and Applications)
7. Breaking the Curse of Dimensionality
8. The Expression of a Tensor or a Polyadic as a Sum of Products
9. F ¨ Ur Mathematik in Den Naturwissenschaften Leipzig Hybrid Cross Approximation of Integral Operators Hybrid Cross Approximation of Integral Operators
10. Efficient classical simulation of slightly entangled quantum computations.

Their papers

• Black box approximation of tensors in hierarchical Tucker format (2013) — 183 citations
• Fast evaluation of singular BEM integrals based on tensor approximations (2012) — 13 citations
• Fast Evaluation of Near-Field Boundary Integralsusing Tensor Approximations (2012) — 9 citations
• F ¨ Ur Mathematik in Den Naturwissenschaften Leipzig a Projection Method to Solve Linear Systems in Tensor Format a Projection Method to Solve Linear Systems in Tensor Format