PUBLIKATIONEN - MALTE BAESLER

• M. Baesler, S. Voigt, and T. Teufel. FPGA Implementations of Radix-10 Digit Recurrence Fixed-Point and Floating-Point Dividers. International Conference on Reconfigurable Computing and FPGAs (ReConFig), 2011:13–19, 2011. (doi:10.1109/ReConFig.2011.41)
• M. Baesler, S. Voigt, and T. Teufel. A Decimal Floating-Point Accurate Scalar Product Unit with a Parallel Fixed-Point Multiplier on a Virtex-5 FPGA. International Journal of Reconfigurable Computing, 2010. (doi:10.1155/2010/357839)
• M. Baesler, S. Voigt, and T. Teufel. A Radix-10 Digit Recurrence Division Unit with a Constant Digit Selection Function. 28th IEEE International Conference on Computer Design (ICCD), pages 241–246, 2010. (doi:10.1109/ICCD.2010.5647764)
• M. Baesler, S. Voigt, and T. Teufel. An IEEE 754-2008 Decimal Parallel and Pipelined FPGA Floating-Point Multiplier. Proceedings of the 20th International Conference on Field Programmable Logic and Applications (FPL '10), pages 489–495, 2010. (doi:10.1109/FPL.2010.98)
• S. Voigt, M. Baesler, and T. Teufel. Dynamically reconfigurable dataflow architecture for high-performance digital signal processing. Journal of Systems Architecture, 56(11):561–576, 2010. Design Flows and System Architectures for Adaptive Computing on Reconfigurable Platforms. (doi:10.1016/j.sysarc.2010.07.010)
• M. Baesler and T. Teufel. FPGA Implementation of a Decimal Floating-Point Accurate Scalar Product Unit with a Parallel Fixed-Point Multiplier. International Conference on ReConFigurable Computing and FPGAs, Cancun, Mexico, 2009. (doi:10.1109/ReConFig.2009.17)

PUBLIKATIONEN - PRASHANT BATRA

• S.M. Rump and P. Batra. Addendum to the determinant of a perturbed identity matrix. Linear Algebra and its Applications (LAA), 565:309–312, 2019. (PDF) (doi:10.1016/j.laa.2018.11.029)
• P. Batra. On Fibonacci-type polynomial recurrences of order two and the accumulation points of their set of zeros. Annales Mathematicae et Informaticae, 49:33–41, 2018. (doi:10.33039/ami.2018.05.004)
• P. Batra. Componentwise Products of Totally Non-Negative Matrices Generated by Functions in the Laguerre–Pólya Class. In N. Bebiano, editor, Applied and Computational Matrix Analysis: MAT-TRIAD, Coimbra, Portugal, September 2015 Selected, Revised Contributions, pages 151–163. Springer International Publishing, 2017. (doi:10.1007/978-3-319-49984-0_11)
• P. Batra and V. Sharma. Near Optimal Subdivision Algorithms for Real Root Isolation. Journal of Symbolic Computation, 83:4–35, 2017. (doi:10.1016/j.jsc.2016.11.004)
• P. Batra, M. Mignotte, and D. c Stefanescu. Improvements of Lagrange's bound for polynomial roots. Journal of Symbolic Computation, 82:19–25, 2017. (doi:10.1016/j.jsc.2016.10.001)
• P. Batra. On the Quality of Some Root-Bounds. In I.S. Kotsireas, S.M. Rump, and C.K. Yap, editors, Mathematical Aspects of Computer and Information Sciences, 6th International Conference, MACIS 2015, Berlin, Germany, November 11-13, 2015, volume 9582 of Springer LNCS. Springer Berlin-Heidelberg-NewYork, 2015. (doi:10.1007/978-3-319-32859-1_50)
• V. Sharma and P. Batra. Near Optimal Subdivision Algorithms for Real Root Isolation. In Proceedings of the 2015 International Symposium on Symbolic and Algebraic Computation, pages 331–338. ACM New York, NY, USA, 2015. (doi:10.1145/2755996.2756656)
• P. Batra. Deriving inequalities in the Laguerre-Polya class from properties of half-plane mappings, volume 161 of International Series of Numerical Mathematics, pages 67–86. Birkhäuser, Basel, 2012. (doi:10.1007/978-3-0348-0249-9_5)
• P. Batra. A family of necessary stability inequalities via quadratic forms. Mathematical Inequalities & Applications, 14(2):313–321, 2011. (doi:10.7153/mia-14-25)
• P. Batra. Globally convergent, iterative path-following for algebraic equations. Mathematics in Computer Science, 4(4):507–537, 2010. (doi:10.1007/s11786-011-0069-2)
• P. Batra and V. Sharma. Bounds on absolute positiveness of multivariate polynomials. Journal of Symbolic Computation, 45(6):617–628, 2010. (doi:10.1016/j.jsc.2010.01.012)
• P. Batra. Newton's method and the computational complexity of the fundamental theorem of algebra. In Proc. of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science (ENTCS), pages 201–218. Elsevier Ltd., 2008. (doi:10.1016/j.entcs.2008.03.016)
• P. Batra. On Goldberg's constant A₂. Computational Methods and Function Theory, 7:33–41, 2007. (PDF) (doi:10.1007/BF03321629)
• P. Batra. Necessary stability conditions for differential-difference systems. PAMM 12/2006, 6(1):617–618, 2006.
• P. Batra. On upper bounds for proportional stabilizing controllers. ZAMM, 86:78–84, 2006. (doi:10.1002/zamm.200410228)
• P. Batra. Some Applications of Complex Analysis to Questions of Stability and Stabilizability. Habilitationsschrift, Technische Universität Hamburg-Harburg, 2006. (hdl.handle.net/11420/8863)
• P. Batra. Subordination and stabilization of plant families. In Proc. IFAC Symposium Robust Control New Developments '06 - Toulouse, 2006. (PDF) (doi:10.3182/20060705-3-fr-2907.00034)
• P. Batra. Value-restricted functions and robust control requirements. GAMM, Luxemburg, 2005. (hdl.handle.net/11420/8684)
• P. Batra. A property of the nearly optimal root-bound. Journal of Computational and Applied Mathematics, 167(2):489–491, 2004. (doi:10.1016/j.cam.2003.10.019)
• P. Batra. Bound for all coefficient diameters of real Schur-stable interval polynomials. IEEE Transactions on Automatic Control, 49(10):1851–1852, 2004. (doi:10.1109/TAC.2004.835590)
• P. Batra. On Small Circles Containing the Zeros and Ones of Analytic Functions. Complex Variables: Theory and Applications, 49(11):787–791, 2004. (doi:10.1080/02781070412331298615)
• P. Batra. Real interpolating units via positive functions. In Proc. MTNS 2004, LEUWEN, BELGIUM, 2004. (hdl.handle.net/11420/8938)
• P. Batra. On coefficient diameters of real Schur-stable interval polynomials. In Proc. IFAC Symposium Robust Control New Developments '03 - Milano, Junio, 25-27, Robust Control Design 2003, pages 259–262. Elsevier Ltd., 2003. (PDF) (doi:10.1016/S1474-6670(17)35673-2)
• P. Batra. On necessary conditions for real robust Schur-stability. IEEE Transactions on Automatic Control, 48(2):259–261, 2003. (doi:10.1109/TAC.2002.808471)
• P. Batra. On upper bounds for real proportional stabilising controllers. In Proc. ECC '03, European Control Conference '03 – Cambridge, 2003. (PDF) (hdl.handle.net/11420/8723)
• P. Batra. Simultaneous Point Estimates for Newton's Method. BIT Numerical Mathematics, 42(3):467–476, 2002. (PDF) (hdl.handle.net/11420/8918)
• P. Batra. Abschätzungen und Iterationsverfahren für Polynom-Nullstellen. Dissertation, Technische Informatik III, TU Hamburg-Harburg, 1999.
• P. Batra. Improvement of a convergence condition for the Durand-Kerner iteration. J. Comput. Appl. Math. (JCAM), 96:117–125, 1998. (doi:10.1016/S0377-0427(98)00109-5)
• P. Batra. Hilberts Satz 90 für K2. Master's thesis, Universität Hamburg, 1994.

PUBLIKATIONEN - FLORIAN BÜNGER

• F. Bünger and S.M. Rump. When does ||f(A)|| = f(||A||) hold true? Linear and Multilinear Algebra (LAMA), 2021. (PDF) ( doi:10.1080/03081087.2021.1985054)
• F. Bünger, M. Lange, and S.M. Rump. On norms of principal submatrices. Linear Algebra and its Applications (LAA), 620:27–36, 2021. (PDF) (doi:10.1016/j.laa.2021.02.021)
• F. Bünger. Preconditioning of Taylor models, implementation and test cases. Nonlinear Theory and its Applications (NOLTA), IEICE, 12(1):2–40, 2021. (doi:10.1587/nolta.12.2)
• F. Bünger. A Taylor model toolbox for solving ODEs implemented in MATLAB/INTLAB. Journal of Computational and Applied Mathematics, 368, 2020. (doi:10.1016/j.cam.2019.112511)
• F. Bünger and S.M. Rump. Complex Disk Products and Cartesian Ovals. Journal of Geometry, 110(45), 2019. (PDF) (doi:10.1007/s00022-019-0502-2).
• F. Bünger and S.M. Rump. Lower bounds for the smallest singular value of certain Toeplitz-like triangular matrices with linearly increasing diagonal entries. Integral Equations and Operator Theory, 91:39, 2019. (PDF) (doi:10.1007/s00020-019-2537-z)
• F. Bünger and S.M. Rump. The determinant of a complex matrix and Gershgorin circles. Electronic Journal of Linear Algebra (ELA), 35:181–186, 2019. (PDF) (doi:10.13001/1081-3810.3910)
• F. Bünger. Shrink wrapping for Taylor models revisited. Numerical Algorithms, 78(4):1001–1017, 2018. (doi:10.1007/s11075-017-0410-1)
• F. Bünger. A short note on the ratio between sign-real and sign-complex spectral radius of a real square matrix. Linear Algebra and its Applications, 529:126–132, 2017. (doi:10.1016/j.laa.2017.04.022)
• F. Bünger and S.M. Rump. Yet more elementary proofs that the determinant of a symplectic matrix is 1. Linear Algebra and its Applications (LAA), 515:87–95, 2017. (PDF) (doi:10.1016/j.laa.2016.11.014)
• F. Bünger and S.M. Rump. A short note on the convexity of interval matrix-vector products. Reliable Computing, 21:74–79, 2016. (PDF) (hdl.handle.net/11420/7816)
• K. Ozaki, F. Bünger, T. Ogita, S. Oishi, and S.M. Rump. Simple floating-point filters for the two-dimensional orientation problem. BIT Numerical Mathematics, 56(2):729–749, 2016. (PDF) (doi:10.1007/s10543-015-0574-9)
• K. Ozaki, T. Ogita, F. Bünger, and S. Oishi. Accelerating interval matrix multiplication by mixed precision arithmetic. Nonlinear Theory and its Applications, IEICE, 6(3):364–376, 2015. (doi:10.1587/nolta.6.364)
• S.M. Rump, F. Bünger, and C.-P. Jeannerod. Improved Error Bounds for Floating-Point Products and Horner's Scheme. BIT Numerical Mathematics, 56(1):293–307, 2015. (PDF) (doi:10.1007/s10543-015-0555-z)
• F. Bünger. A note on the boundary shape of matrix polytope products. Reliable Computing, 20:73–88, 2014. (PDF)
• F. Bünger. Inverses, determinants, eigenvalues, and eigenvectors of real symmetric Toeplitz matrices with linearly increasing entries. Linear Algebra and Its Applications (LAA), 459:595–619, 2014. (doi:10.1016/j.laa.2014.07.023)
• F. Bünger. On the zeros of eigenpolynomials of Hermitian Toeplitz matrices. Integral Equations and Operator Theory, 80(3):323–351, 2014. (doi:10.1007/s00020-014-2164-7)
• F. Bünger. Minimizing and maximizing the Euclidean norm of the product of two polynomials. Advances in Computational Mathematics, 35(2):193–215, 2011. (doi:10.1007/s10444-010-9158-z)
• F. Bünger. Verified solutions of two-point boundary value problems for nonlinear oscillators. Nonlinear Theory and its Applications (NOLTA), IEICE, E94-N(1), 2011. (doi:10.1587/nolta.2.90)
• F. Bünger and H. Herwig. An extended similarity theory applied to heated flows in complex geometries. Zeitschrift für Angewandte Mathematik und Physik (ZAMP), 60(6):1095–1111, 2009. (doi:10.1007/s00033-009-8076-8)
• F. Bünger. Stationäre, laminare, inkompressible Nachlauf-Fernfeld-Strömungen. Diploma thesis, Universität Hamburg, 2008. (PDF)
• Z. Arad, F. Bünger, E. Fisman, and M. Muzychuk. Standard Integral Table Algebras with a Faithful Nonreal Element of Degree 5. Springer Lecture Notes in Mathematics, 1773:43–81, 2002. (doi:10.1007/3-540-45558-2_3)
• F. Bünger, F. Knüppel, and K. Nielsen. The product of two quadratic matrices. Linear Algebra and its Applications (LAA), 331:31–41, 2001. (doi:10.1016/S0024-3795(01)00277-4)
• F. Bünger and K. Nielsen. A matrix-decomposition theorem for GL(n,K). Linear Algebra and its Applications (LAA), 298:39–50, 1999. (doi:10.1016/S0024-3795(99)00138-X)
• F. Bünger. Involutionen als Erzeugende in unitären Gruppen. PhD thesis, Universität Kiel, 1997. (PDF)
• F. Bünger. Products of Involutions in Unitary Groups. In Proceedings of the 4th International Congress of Geometry, part II, pages 93–100, 1997.
• F. Bünger and F. Knüppel. Products of quasi-involutions in unitary groups. Geometria Dedicata, 65(3):313–321, 1997. (doi:10.1023/A:1004949119165)
• F. Bünger, F. Knüppel, and K. Nielsen. Products of symmetries in unitary groups. Linear Algebra and its Applications (LAA), 260:9–42, 1997. (doi:10.1016/S0024-3795(97)80003-1)
• F. Bünger. Produkte von Konjugiertenklassen in den Gruppen GL(V) und SL(V). Diploma thesis, Universität Kiel, 1994.

PUBLIKATIONEN - DENIS CHAYKIN

• D. Chaykin, C. Jansson, F. Keil, M. Lange, K.T. Ohlhus, and S.M. Rump. Rigorous Lower Bounds for the Ground State Energy of Molecules by Employing Necessary N-Representability Conditions. Journal of Chemical Theory and Computation, 2020. (doi:10.1021/acs.jctc.0c00497)
• C. Jansson, D. Chaykin, and C. Keil. Rigorous Error Bounds for the Optimal Value in Semidefinite Programming. SIAM Journal on Numerical Analysis, 46(1):180–200, 2007. (PDF) (doi:10.1137/050622870)

PUBLIKATIONEN - ANGELIKA HAILER

• A. Hailer and S.M. Rump. Evaluation of Hedge Effectiveness Tests. Journal of Derivatives Accounting (JDA), 2(1):31–52, 2005. (PDF) (doi:10.1142/S021986810500029X)
• A.C. Hailer and S.M. Rump. Evaluierung von Hedge-Effektivitätstests. Zeitschrift für das gesamte Kreditwesen, 58(20):1089–1097, 2005. (hdl.handle.net/11420/8664)
• A.C. Hailer and S.M. Rump. Hedge-Effektivität: Lösung des Problems der kleinen Zahlen. (Hedge Accounting nach FAS 133 bzw. IAS 39. Zeitschrift für das gesamte Kreditwesen, 56(2003)(11):599–603, 2003. (hdl.handle.net/11420/8697)
• A.C. Hailer, F. Loch, and P. Stork. Basel II: Optimale Zuordnung von Sicherheiten auf Kredite. Zeitschrift für das gesamte Kreditwesen, 55(2002)(22):1202–1206, 2002. (hdl.handle.net/11420/8947)
• A.C. Hailer. Bisektion im IRⁿ - Betrachtung eines Verfahrens von M.N. Vrahatis. Master's thesis, Universität Ulm, 1999.

PUBLIKATIONEN - DIRK HUSUNG

• D. Husung. TPX Version 1.1 US Precompiler for Turbo Pascal 5.0. Technical Report 93.2, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1993. (hdl.handle.net/11420/9593)
• D. Husung. TPX version 1.1 D : precompiler for Turbo Pascal 5.0 Technical Report 91.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1991. (hdl.handle.net/11420/9537)
• D. Husung and S.M. Rump. ABACUS, Sprachbeschreibung. In L. Atanassova et al., editor, Computer arithmetic and enclosure methods: Proceedings of the Third International IMACS-GAMM Symposium on Computer Arithmetic and Scientific Computing (SCAN-91), Oldenburg, Germany, 1 - 4 October 1991, Dublin, 1991.
• D. Husung. TPX version 1.01, Precompiler for Turbo Pascal 5.0 Extensions, 1990. (hdl.handle.net/11420/9497)
• D. Husung. Precompiler for Scientific Computation (TPX). Technical Report 91.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1989.
• D. Husung and S.M. Rump. ABACUS. In Proceedings SCAN '89, Tagung ''Wissenschaftliches Rechnen und Programmiersprachen'', pages 52–53, Basel, 1989. (hdl.handle.net/11420/9502)
• D. Husung. ABACUS — Programmierwerkzeug mit hochgenauer Arithmetik für Algorithmen mit verifizierten Ergebnissen. Diplomarbeit, Universität Karlsruhe, 1988.

PUBLIKATIONEN - CHRISTIAN JANSSON

• C.  Jansson. A Unified Treatment of Classical Probability, Thermodynamics, and Quantum Information Theory, 2021. (PDF) (doi:10.15480/882.3770)
• D. Chaykin, C. Jansson, F. Keil, M. Lange, K.T. Ohlhus, and S.M. Rump. Rigorous Lower Bounds for the Ground State Energy of Molecules by Employing Necessary N-Representability Conditions. Journal of Chemical Theory and Computation, 2020. (doi:10.1021/acs.jctc.0c00497)
• C. Jansson. Quantum Information Theory for Engineers: Free Climbing through Physics and Probability, 2019. Lecture Notes. (PDF) (doi:10.15480/882.2285)
• C. Jansson. Quantum Information Theory for Engineers: An Interpretative Approach, 2017. Lecture Notes. (PDF) (doi:10.15480/882.1441)
• C. Jansson. On Verified Numerical Computations in Convex Programming. Japan J. Indust. Appl. Math., 26:337–363, 2009. (PDF) (doi:10.1007/BF03186539)
• C. Jansson. A clas sical interpretation of quantum mechanics and the measurement problem,2008. quant-ph, arxiv.org/abs/0801.3189.
• C. Jansson. Guaranteed Accuracy for Conic Programming Problems in Vector Lattices, 2007. (hdl.handle.net/11420/8652)
• C. Jansson, D. Chaykin, and C. Keil. Rigorous Error Bounds for the Optimal Value in Semidefinite Programming. SIAM Journal on Numerical Analysis, 46(1):180–200, 2007. (PDF) (doi:10.1137/050622870)
• C. Jansson. On Verification of Ill-posed Optimization Problems. ECMI Newsletter, 39:18, March 2006. (hdl.handle.net/11420/8560)
• C. Jansson. Rigorous Results in Combinatorial Optimization. In Bruno Buchberger, Shin'ichi Oishi, Michael Plum, and Siegfried M. Rump, editors, Algebraic and Numerical Algorithms and Computer-assisted Proofs, number 05391 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany, 2006. (http://drops.dagstuhl.de/opus/volltexte/2006/446) (doi:10.15480/882.203)
• C. Jansson. VSDP: A MATLAB software package for Verified Semidefinite Programming. NOLTA, pages 327–330, 2006. (PDF) (hdl.handle.net/11420/8716)
• C. Jansson. VSDP: Verified SemiDefinite Programming, User's Guide, 2006. http://www.optimization-online.org/DB_HTML/2006/12/1547.html.
• C. Keil and C.Jansson. Computational Experience with Rigorous Error Bounds for the Netlib Linear Programming Library. Reliable Computing, 12, issue 4:303–321, 2006. (PDF) (doi:10.1007/s11155-006-9004-7)
• C. Jansson. On Verifed Computation in Combinatorial Optimization. International Symposium on Nonlinear Theory and its Applications (NOLTA2005), Bruges, Belgium, pages 714–717, 2005. (hdl.handle.net/11420/8665)
• C. Jansson. Termination and Verification for Ill-posed Semidefinite Programming Problems, 2005. http://www.optimization-online.org/DB_HTML/2005/06/1150.html.
• C. Jansson. A rigorous lower bound for the optimal value of convex optimization problems. J. Global Optimization, 28:121–137, 2004. (doi:10.1023/B:JOGO.0000006720.68398.8c)
• C. Jansson. Rigorous Lower and Upper Bounds in Linear Programming. SIAM J. Optimization (SIOPT), 14(3):914–935, 2004. (doi:10.1137/S1052623402416839)
• J. Garloff, C. Jansson, and A.P. Smith. Inclusion isotonicity of convex-concave extensions for polynomials based on Bernstein expansion. Computing, 70:111–119, 2003. (doi:10.1007/s00607-003-1471-7)
• J. Garloff, C. Jansson, and A.P. Smith. Lower bound functions for polynomials. J. Comput. Appl. Math. (JCAM), 157:207–225, 2003. (doi:10.1016/S0377-0427(03)00422-9)
• C. Jansson. A rigorous lower bound for the optimal value of convex optimization problems. Technical Report 03.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 2003. (PostScript, 18 pages, 3004407 bytes) (hdl.handle.net/11420/8698)
• C. Jansson. Rigorous Error Bounds for the Optimal Value of Linear Programming Problems. In Bliek et al. Ch., editor, Global Optimization and Constraint Satisfaction, Notes of the 1^st International Workshop on Global Constrained Optimization and Constraint Satisfaction, pages 59–70, 2003. (doi:10.1007/978-3-540-39901-8_5)
• J. Garloff, C. Jansson, and A.P. Smith. Affine lower bound functions for polynomials and their use in global optimization. In Notes of the 1^st International Workshop on Global Constrained Optimization and Constraint Satisfaction, 2002. (hdl.handle.net/11420/9158)
• J. Garloff, C. Jansson, and A.P. Smith. Construction of Lower Bound Functions for Polynomials. Technical Report 0201, Informatik, Fachhochschule Konstanz, 2002.
• J. Garloff, C. Jansson, and A.P. Smith. Convex-Concave Extensions for Polynomials. In Proc. Workshop on Validated Computing, pages 73–75, El Paso, Texas, 2002. SIAM. (hdl.handle.net/11420/9306)
• C. Jansson. Rigorous Lower and Upper Bounds in Linear Programming. Technical Report 02.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 2002. (PostScript) (hdl.handle.net/11420/8948)
• C. Jansson. Interval Linear Systems. In C.A. Floudas and P.M. Pardalos, editors, Encyclopedia of Optimization, volume III, pages 69–76. Kluwer Academic Publishers, 2001. (hdl.handle.net/11420/8747)
• C. Jansson. Quasi Convex-Concave Extensions. In G. Alefeld, J. Rohn, S. Rump, and T. Yamamoto, editors, Symbolic Algebraic Methods and Verification Methods, pages 117–128. Springer, Wien, New York, 2001. (doi:10.1007/978-3-7091-6280-4_12)
• C. Jansson. Quasiconvex Relaxations Based on Interval Arithmetic. Linear Algebra and its Applications (LAA), 324:27–53, 2001. (doi:10.1016/S0024-3795(00)00295-0)
• C. Jansson. Convex-Concave Extensions. BIT Numerical Mathematics, 40(2):291–313, 2000. (doi:10.1023/A:1022343007844)
• C. Jansson. Convex Relaxations for Global Constrained Optimization Problems. In F. Keil, W. Mackens, and H. Voss, editors, Scientific Computing in Chemical Engineering II, pages 322–329. Springer Verlag, Berlin, 1999. (hdl.handle.net/11420/9463)
• C. Jansson. Quasiconvex Relaxations Based on Interval Arithmetic. Technical Report 99.4, Inst. f. Informatik III, TU Hamburg-Harburg, 1999. (hdl.handle.net/11420/9349)
• C. Jansson and J. Rohn. An Algorithm for Checking Regularity of Interval Matrices. SIAM J. Matrix Anal. Appl. (SIMAX), 20(3):756–776, 1999. (doi:10.1137/S0895479896313978)
• C. Jansson. An NP-Hardness Result for Nonlinear Systems. Reliable Computing, 4:345–350, 1998. (doi:10.1023/a:1024463631728)
• C. Jansson. Construction of convex lower and concave upper bound functions. Technical Report 98.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1998. (hdl.handle.net/11420/9433)
• C. Jansson. Convex-Concav Extensions and Applications. In Proc. of SCAN98: IMACS/GAMM International Symposium On Scientific Computing, Computer Arithmetic and Validated Numerics, pages 61–63, 1998. (hdl.handle.net/11420/9435)
• C. Jansson. Calculation of Exact Bounds for the Solution Set of Linear Interval Systems. Linear Algebra and its Applications (LAA), 251:321–340, 1997. (doi:10.1016/S0024-3795(96)00681-7)
• C. Jansson. A verification algorithm for symmetric systems with interval data. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 76(Suppl. 3):267–270, 1996. (hdl.handle.net/11420/9451)
• C. Jansson and J. Rohn. An Algorithm for Checking Regularity of Interval Matrices. Technical Report 96.4, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TUHH, 1996. (hdl.handle.net/11420/9450)
• C. Jansson. On Applications of Self-Validating Methods in Optimization. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 75:423–424, 1995. (hdl.handle.net/11420/9396)
• C. Jansson and O. Knüppel. A Branch and Bound Algorithm for Bound Constrained Optimization Problems without Derivatives. J. Global Optimization, 7, No.3:297–331, 1995. (doi:10.1007/BF01279453)
• C. Jansson. On Self-Validating Methods for Optimization Problems. In J. Herzberger, editor, Topics in Validated Computations — Studies in Computational Mathematics 5, pages 381–438, North-Holland, Amsterdam, 1994. (hdl.handle.net/11420/9469)
• C. Jansson. On Self-Validating Methods for Optimization Problems (Habilitationsschrift). Technical Report 94.2, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1994. (hdl.handle.net/11420/9468)
• C. Jansson. Some Properties of Linear Interval Systems and Applications. Technical Report 94.3, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1994. (hdl.handle.net/11420/9471)
• C. Jansson and O. Knüppel. Numerical results for a Self-Validating Global Optimization Method. Technical Report 94.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1994. (hdl.handle.net/11420/9465)
• C. Jansson and S.M. Rump. Algorithmen mit Ergebnisverifikation — einige Bemerkungen zu neueren Entwicklungen. In Jahrbuch Überblicke Mathematik, pages 47–73. Vieweg, 1994. (PDF) (hdl.handle.net/11420/9466)
• C. Jansson and S.M. Rump. Self-Validating Methods - Some Recent Developements. In E. Schock, editor, Beiträge zur Angewandten Analysis und Informatik, pages 148–170. Shaker Verlag, 1994. (PDF) (hdl.handle.net/11420/9467)
• C. Jansson and O. Knüppel. A Minimization Method for Systems with Singular Value Constraints. In A. Karmann, K. Mosler, M. Schader, and G. Liebe, editors, Operations Research 92, pages 190–192. Physica Verlag, 1993. (hdl.handle.net/11420/9416)
• C. Jansson and O. Knüppel. Eine intervallanalytische Methode für globale Optimierungsprobleme. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 73(6):805–807, 1993. (hdl.handle.net/11420/9417)
• C. Jansson. A Global Optimization Method Using Interval Arithmetic. In L. Atanassova and J. Herzberger, editors, Computer Arithmetic and Enclosure Methods, IMACS, pages 259–267. Elsevier Science Publishers B.V., 1992. (hdl.handle.net/11420/9485)
• C. Jansson and O. Knüppel. A Global Minimization Method: The Multi-dimensional case. Technical Report 92.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1992. (hdl.handle.net/11420/9483)
• C. Jansson. A Geometric Approach for Computing A Posteriori Error Bounds for the Solution of a Linear System. Computing, 47:1–9, 1991. (doi:10.1007/BF02242018)
• C. Jansson. A Global Minimization Method: The One-Dimensional Case. Technical Report 91.2, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1991. (hdl.handle.net/11420/9479)
• C. Jansson. An Interval Method for Global Unconstrained Optimization. In P. Gritzmann, R. Hettich, R. Horst, and E. Sachs, editors, Operations Research 91, pages 102–105. Physica Verlag, 1991. (hdl.handle.net/11420/9480)
• C. Jansson. Interval Linear Systems with Symmetric Matrices, Skew-Symmetric Matrices, and Dependencies in the Right Hand Side. Computing, 46:265–274, 1991. (doi:10.1007/BF02238302)
• C. Jansson. Rigorous Sensitivity Analysis for Real Symmetric Matrices with Uncertain Data. In E. Kaucher, S.M. Markov, and G. Mayer, editors, Computer Arithmetic, IMACS, pages 293–316. J.C. Baltzer AG Scientific Publishing Co, 1991. (hdl.handle.net/11420/9482)
• C. Jansson and S.M. Rump. Rigorous Solution of Linear Programming Problems with Uncertain Data. ZOR — Methods and Models of Operations Research, 35:87–111, 1991. (PDF) (doi:10.1007/BF02331571)
• C. Jansson. A Fast Direct Method for Computing Verified Inclusions. Technical Report 90.4, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1990. (hdl.handle.net/11420/9493)
• C. Jansson. A Posteriori Error Bounds for the Solution of Linear Systems with Simplex Techniques. Technical Report 90.2, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1990. (hdl.handle.net/11420/9494)
• C. Jansson. Ein Verfahren zur Einschließung aller Lösungen eines linearen Optimierungsproblems mit Intervalleingabedaten. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 70(6):T753–T755, 1990. (hdl.handle.net/11420/9495)
• C. Jansson. Guaranteed Error Bounds for the Solution of Linear Systems. In C. Ullrich, editor, Contributions to Computer Arithmetic and Self-Validating numerical methods, pages 103–110. J.C. Baltzer AG Scientific Publishing Co, 1990. (hdl.handle.net/11420/9496)
• C. Jansson and S.M. Rump. Rigorous Sensitivity Analysis for Systems of Linear Equations and Linear Programming Problems. Methods of Operation Research, 62:459–473, 1990. (hdl.handle.net/11420/9492)
• C. Jansson. A Self-Validating Method for Solving Linear Programming Problems with Interval Input Data. Computing, Suppl. 6:33–45, 1988. (doi:10.1007/978-3-7091-6957-5_4)
• C. Jansson, H.G. Stark, and H. Trinkaus. The Simulation of the Charge Cycle in a Cylinder of a Combustion Engine. Bericht nr. 31, Arbeitsgruppe Technomathematik, 1988. (hdl.handle.net/11420/9499)
• C. Jansson. Numerische Sensitivitätsanalyse eines Ernährungsproblems unter Berücksichtigung der Schwankung aller Eingabedaten. In Operation Research Proc. 1987. Springer-Verlag Berlin Heidelberg, 1987. (doi:10.1007/978-3-642-73778-7_152)
• C. Jansson. Zur linearen Optimierung mit unscharfen Daten. In Operation Research Proc. 1986, pages 610–617. Springer-Verlag Berlin Heidelberg, 1987. (doi:10.1007/978-3-642-72557-9_109)
• C. Jansson. Zur linearen Optimierung mit unscharfen Daten. Dissertation, Universität Kaiserslautern, 1985.
• C. Jansson. Ein Verfahren zur Sensitivitätsanalyse basisintabiler linearer Optimierungsprobleme. Diplomarbeit, Universität Kaiserslautern, 1980.

PUBLIKATIONEN - HANS-PETER JÜLLIG

• H.-P. Jüllig. BIBINS 2.0: C++-Bibliotheken für Vektoren und Matrizen über beliebigem skalaren Datentyp unter Berücksichtigung spezieller spärlicher Strukturen sowie Intervalldatentypen. Technical Report 92.6, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1992. (hdl.handle.net/11420/9590)
• H.-P. Jüllig. Algorithmen mit Ergebnisverifikation mit C++/2.0. Technical Report 92.2, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1992. (hdl.handle.net/11420/9487)
• H.-P. Jüllig. Untersuchung zur Implementierung von Skalarproduktausdrücken. Diplomarbeit, Universität Karlsruhe, 1987.

PUBLIKATIONEN - CHRISTIAN KEIL

• D. Chaykin, C. Jansson, F. Keil, M. Lange, K.T. Ohlhus, and S.M. Rump. Rigorous Lower Bounds for the Ground State Energy of Molecules by Employing Necessary N-Representability Conditions. Journal of Chemical Theory and Computation, 2020. (doi:10.1021/acs.jctc.0c00497)
• C. Jansson, D. Chaykin, and C. Keil. Rigorous Error Bounds for the Optimal Value in Semidefinite Programming. SIAM Journal on Numerical Analysis, 46(1):180–200, 2007. (PDF) (doi:10.1137/050622870)
• C. Keil. Lurupa – Rigorous Error Bounds in Linear Programming. In B. Buchberger, S. Oishi, M. Plum, and S. M. Rump, editors, Algebraic and Numerical Algorithms and Computer-assisted Proofs, number 05391 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. http://drops.dagstuhl.de/opus/volltexte/2006/445.
• C. Keil and C. Jansson. Computational Experience with Rigorous Error Bounds for the Netlib Linear Programming Library. Reliable Computing, 12, issue 4:303–321, 2006. http://www.optimization-online.org/DB_HTML/2004/12/1018.html. (PDF)
• C. Keil. LURUPA – Rigorose Fehlerschranken für Lineare Programme. Diplomarbeit, Technische Universität Hamburg–Harburg, 2004.
• C. Keil. Verified Linear Programming – a Comparison. 2008. http://www.optimization-online.org/DB_HTML/2008/06/2007.html.

PUBLIKATIONEN - DANIEL KLIEM

• Daniel Kliem and Sven-Ole Voigt. An Asynchronous Bus Bridge for Partitioned Multi-SoC Architectures on FPGAs. In 23rd International Conference on Field Programmable Logic and Applications (FPL'13), Sep. 2013. (doi:10.1109/FPL.2013.6645569)
• Daniel Kliem and Sven-Ole Voigt. 2012 international conference on reconfigurable computing and fpgas, reconfig 2012, cancun, mexico, december 5-7, 2012. In ReConFig. IEEE, ISBN: 978-1-4673-2919-4, 2012. http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6410219.
• Daniel Kliem and Sven-Ole Voigt. A multi-core fpga-based soc architecture with domain segregation. In ReConFig, pages 1–7, 2012. (doi:10.1109/ReConFig.2012.6416764)

PUBLIKATIONEN - OLAF KNÜPPEL

• F. Bünger, F. Knüppel, and K. Nielsen. The product of two quadratic matrices. Linear Algebra and its Applications (LAA), 331:31–41, 2001. (doi:10.1016/S0024-3795(01)00277-4)
• O. Knüppel. PROFIL/BIAS V 2.0. Technical Report 99.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1999. (hdl.handle.net/11420/9438)
• O. Knüppel. PROFIL/BIAS and extensions, Version 2.0. Technical report, Inst. f. Informatik III, Technische Universität Hamburg-Harburg, 1998.
• F. Bünger and F. Knüppel. Products of quasi-involutions in unitary groups. Geometria Dedicata, 65(3):313–321, 1997. (doi:10.1023/A:1004949119165)
• F. Bünger, F. Knüppel, and K. Nielsen. Products of symmetries in unitary groups. Linear Algebra and its Applications (LAA), 260:9–42, 1997. (doi:10.1016/S0024-3795(97)80003-1)
• O. Knüppel. A PROFIL/BIAS implementation of a global minimization algorithm. Technical Report 95.4, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1995. (hdl.handle.net/11420/9459)
• C. Jansson and O. Knüppel. A Branch and Bound Algorithm for Bound Constrained Optimization Problems without Derivatives. J. Global Optimization, 7, No.3:297–331, 1995. (doi:10.1007/BF01279453)
• C. Jansson and O. Knüppel. Numerical results for a Self-Validating Global Optimization Method. Technical Report 94.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1994. (hdl.handle.net/11420/9465)
• O. Knüppel. Einschließungsmethoden zur Bestimmung der Nullstellen nichtlinearer Gleichungssysteme und ihre Implementierung. PhD thesis, Technische Universität Hamburg-Harburg, 1995. (hdl.handle.net/11420/9472)
• O. Knüppel. PROFIL / BIAS — A Fast Interval Library. Computing, 53:277–287, 1994. (doi:10.1007/BF02307379)
• C. Jansson and O. Knüppel. A Minimization Method for Systems with Singular Value Constraints. In A. Karmann, K. Mosler, M. Schader, and G. Liebe, editors, Operations Research 92, pages 190–192. Physica Verlag, 1993. (hdl.handle.net/11420/9416)
• C. Jansson and O. Knüppel. Eine intervallanalytische Methode für globale Optimierungsprobleme. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 73(6):805–807, 1993. (hdl.handle.net/11420/9417)
• O. Knüppel. PROFIL — Programmer's Runtime Optimized Fast Interval Library. Technical Report 93.4, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TUHH, 1993. (hdl.handle.net/11420/9500)
• O. Knüppel. A multiple precision arithmetic for PROFIL. Technical Report 93.6, Forschungsschwerpunkt Informations- und Kommunikationstechnik, Inst. f. Informatik III, TU Hamburg-Harburg, 1993. (hdl.handle.net/11420/9608)
• O. Knüppel and T. Simenec. PROFIL/BIAS extensions. Technical Report 93.5, Forschungsschwerpunkt Informations- und Kommunikationstechnik, Technische Universität Hamburg-Harburg, 1993. (hdl.handle.net/11420/9419)
• O. Knüppel. BIAS — Basic Interval Arithmetic Subroutines. Technical Report 93.3, Forschungsschwerpunkt Informations- und Kommunikationstechnik, Inst. f. Informatik III, TU Hamburg-Harburg, 1993. (hdl.handle.net/11420/9460)
• C. Jansson and O. Knüppel. A Global Minimization Method: The Multi-dimensional case. Technical Report 92.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1992. (hdl.handle.net/11420/9483)

PUBLIKATIONEN - STEVE KWEE

• T. Teufel and S. Kwee. Pipeline Optimization for 32bit Floating Point Units. In Proceedings of ICSPAT '97, San Diego, USA, Sept. 1997. (hdl.handle.net/11420/9395)

PUBLIKATIONEN - MARKO LANGE

• F. Bünger, M. Lange, and S.M. Rump. On norms of principal submatrices. Linear Algebra and its Applications (LAA), 620:27–36, 2021. (PDF) ( doi:10.1016/j.laa.2021.02.021)
• M. Lange. Verification methods for conic linear programming problems. Special Section on Verified Numerical Computations, Part I, Volume 11 Issue 3, 327–358, 2020. (doi:10.1587/nolta.11.327)
• M. Lange and S.M. Rump. Faithfully rounded floating-point computations. ACM transactions on mathematical software, 46(3), 2020. (doi:10.1145/3290955)
• R. Kobayashi, M. Lange, A. Minamihata, and S.M. Rump. Verified Inclusion of a Basis of the Null space. Reliable Computing, 27:26–41, 2020. (PDF) (hdl.handle.net/11420/7807)
• M. Lange and S.M. Rump. Verified inclusions of a nearest matrix of specified rank deficiency via a generalization of Wedin's sin (θ) theorem [winner of the Moore prize 2021]. BIT Numerical Mathematics, 61:361–380, 2021. (PDF) (doi:10.1007/s10543-020-00827-y)
• M. Lange and S. Oishi. A note on Dekker’s FastTwoSum algorithm. Numerische Mathematik, 145:383–403, 2020. (doi:10.1007/s00211-020-01114-2)
• D. Chaykin, C. Jansson, F. Keil, M. Lange, K.T. Ohlhus, and S.M. Rump. Rigorous Lower Bounds for the Ground State Energy of Molecules by Employing Necessary N-Representability Conditions. Journal of Chemical Theory and Computation, 2020. (doi:10.1021/acs.jctc.0c00497)
• M. Lange and S.M. Rump. Sharp estimates for perturbation errors in summations. Math. of Comp., 88:349–368, 2019. (PDF) (doi:10.1090/mcom/3355)
• M. Lange and S.M. Rump. Error estimates for the summation of real numbers with application to floating-point summation. BIT, 57:927–941, 2017. (PDF) (doi:10.1007/s10543-017-0658-9)
• S.M. Rump and M. Lange. On the Definition of Unit Roundoff. BIT Numerical Mathematics, 56(1):309–317, 2015. (PDF) (doi:10.1007/s10543-015-0554-0)
• M. Lange. A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem. MACIS: Mathematical Aspects of Computer and Information Sciences, 535–549, 2015. (doi:10.1007/978-3-319-32859-1_45)
• M. Lange. Residual bounds for some or all singular values. Linear Algebra and its Applications, 464:28–37, 2015. (doi:10.1016/j.laa.2013.06.023)
• M. Lange. mail to the Reliable computing mailing list, October 2012.

PUBLIKATIONEN - ROLF LINDEMANN

• R. Lindemann. COX - C mit Operatorkonzept. PhD thesis, TU Hamburg-Harburg, 1998. (hdl.handle.net/11420/9380)
• R. Lindemann and S.M. Rump. COX - C with Operator eXtension. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 76, Suppl. 1:53–56, 1996. (hdl.handle.net/11420/9456)

PUBLIKATIONEN - KAI TORBEN OHLHUS

• D. Chaykin, C. Jansson, F. Keil, M. Lange, K.T. Ohlhus, and S.M. Rump. Rigorous Lower Bounds for the Ground State Energy of Molecules by Employing Necessary N-Representability Conditions. Journal of Chemical Theory and Computation, 2020. (PDF) (doi:10.1021/acs.jctc.0c00497)

PUBLIKATIONEN - JOAO BATISTA S. DE OLIVEIRA

• J.B.S. Oliveira and B.R.T. Franciosi. Solving interval linear systems through linear programming, 2002. (hdl.handle.net/11420/9308)
• J.B.S. Oliveira and B.R.T. Franciosi. Including solutions for interval linear systems through linear programming, 1999. (hdl.handle.net/11420/9350)
• J.B.S. de Oliveira. New slope methods for sharper interval functions and a note on Fisher's acceleration method. Reliab. Comput., 2(3):299–320, 1996. (doi:10.1007/BF02391702)
• J.B.S. de Oliveira. Slope methods for sharper interval inclusions and their application to global optimization. Dissertation, TU Hamburg-Harburg, 1996.
• J.B.S. de Oliveira. A backward mode for slope evaluation and sharper inclusions for interval functions. Technical report, Informatik III, TU Hamburg-Harburg, 1995.
• J.B.S. Oliveira and K. Benato. Visual mining through similarity displays.
• J.B. Oliveira and D.M.S. Claudio. A User Directed Approach to Finding Roots of Polynomials.
• J.B.S. Oliveira and L.H. de Figueiredo. Images of Julia sets you can trust, SCAN conference Lyon, 2002. ( http://www.tecgraf.puc-rio.br/~lhf/ftp/doc/oral/scan2002.pdf) (hdl.handle.net/11420/9312)
• J.B.S. Oliveira and L.H. de Figueiredo. Interval Computation of Viswanath's Constant. (doi:10.1023/A:1014702122205)
• J.B.S. Oliveira and L.H. de Figueiredo. Robust Approcimation of Offsets and Bisectors of Plane Curves.

PUBLIKATIONEN - ANDREAS PIERICK

• T. Teufel and A. Pierick. Codierung von Daten für die sichere Mobilfunkübertragung. Signal + Draht, 1996(Mai), 1996. hdl.handle.net/11420/9461)

PUBLIKATIONEN - THOMAS RINGEL

• T. Ringel. Analyse, Akquisition und Verarbeitung distribuiert vorliegenden Wissens zur Diagnose von Kraftfahrzeugsystemen. PhD thesis, TU Hamburg-Harburg, 1999.

PUBLIKATIONEN - ROBERT RASENACK

• R. Rasenack and T. Teufel. Entwurf und Implementierung einer gesicherten nachrichtenbasierten Kommunikation für verteilte Anwendungen. atp, 48(10):54–62, 2006. (hdl.handle.net/11420/8865)

PUBLIKATIONEN - SIEGFRIED M. RUMP

• S.M. Rump and T. Ogita. On a quality measure for interval inclusions. Accepted for publication in BIT, 2024. (PDF)
• S.M. Rump and S. Oishi. A note on Oishi's lower bound for the smallest singular value of linearized Galerkin equations. Japan Journal of Industrial and Applied Mathematics, February 2024. (PDF) (doi:10.1007/s13160-024-00645-7)
• S.M. Rump. IEEE-754 precision-p base-β arithmetic implemented in binary. ACM transactions on mathematical software, 49(4), 1–21,2023. (PDF) (doi.acm.org?doi=3596218)
• S.M. Rump. Computation of the unit in the first place (ufp) and the unit in the last place (ulp) in precision-p base-β. BIT, 402, 2023. (PDF) (doi:10.1007/s10543-023-00970-2)
• S.M. Rump. Fast and accurate computation of the Euclidean norm of a vector. Japan Journal of Industrial and Applied Mathematics, 40, 1391–1419, 2023. (PDF) (doi.org/10.1007/s13160-023-00593-8)
• S.M. Rump and M. Lange. Fast computation of error bounds for all eigenpairs of a Hermitian and all singular pairs of a rectangular matrix with emphasis on eigen- and singular value clusters. Journal of Computational and Applied Mathematics (JCAM), 434:115332, 2023. (PDF) (doi:10.1016/j.cam.2023.115332)
• S.M. Rump. Entrywise lower and upper bounds for the Perron vector. Linear Algebra and its Applications (LAA), 653:314–319, 2022. (PDF)
• S.M. Rump. Verified error bounds for all eigenvalues and eigenvectors of a matrix. SIAM Journal Matrix Analysis (SIMAX), 43:1736–1754, 2022. (PDF)
• F. Bünger and S.M. Rump. When does ||f(A)|| = f(||A||) hold true? Linear and Multilinear Algebra (LAMA), 2021. (PDF) ( doi:10.1080/03081087.2021.1985054)
• F. Bünger, M. Lange, and S.M. Rump. On norms of principal submatrices. Linear Algebra and its Applications (LAA), 620:27–36, 2021. ( doi:10.1016/j.laa.2021.02.021)
• M. Lange and S.M. Rump. Faithfully rounded floating-point computations. ACM transactions on mathematical software, 46(3), 2020. (doi:10.1145/3290955)
• A. Minamihata, T. Ogita, S.M. Rump, and S. Oishi. Modified error bounds for approximate solutions of dense linear systems. Journal of computational and applied mathematics, 369, 2020. (doi:10.1016/j.cam.2019.112546)
• R. Kobayashi, M. Lange, A. Minamihata, and S.M. Rump. Verified Inclusion of a Basis of the Null space. Reliable Computing, 27:26–41, 2020. (PDF) (hdl.handle.net/11420/7807)
• M. Lange and S.M. Rump. Verified inclusions of a nearest matrix of specified rank deficiency via a generalization of Wedin's sin (θ) theorem [winner of the Moore prize 2021]. BIT Numerical Mathematics, 61:361–380, 2021. (PDF) (doi:10.1007/s10543-020-00827-y)
• S.M. Rump. Addendum to "On recurrences converging to the wrong limit in finite precision and some new examples". Electronic Transactions on Numerical Analysis (ETNA), 52:571–575, 2020. (PDF) (doi:10.1553/etna_vol52s575).
• S.M. Rump. On recurrences converging to the wrong limit in finite precision and some new examples. Electronic Transactions on Numerical Analysis (ETNA), 52:358–369, 2020. (PDF) (doi:10.1553/etna_vol52s358).
• S.M. Rump. Verified bounds for the determinant of real or complex point or interval matrices. Journal of Computational and Applied Mathematics (JCAM), 372. 11 pages, Article 112610, (PDF) (doi:10.1016/j.cam.2019.112610).
• D. Chaykin, C. Jansson, F. Keil, M. Lange, K.T. Ohlhus, and S.M. Rump. Rigorous Lower Bounds for the Ground State Energy of Molecules by Employing Necessary N-Representability Conditions. Journal of Chemical Theory and Computation, 2020. (doi:10.1021/acs.jctc.0c00497)
• F. Bünger and S.M. Rump. Complex Disk Products and Cartesian Ovals. Journal of Geometry, 110(45), 2019. (PDF) (doi:10.1007/s00022-019-0502-2)
• F. Bünger and S.M. Rump. Lower bounds for the smallest singular value of certain Toeplitz-like triangular matrices with linearly increasing diagonal entries. Integral Equations and Operator Theory, 91:39, 2019. (PDF) (doi:10.1007/s00020-019-2537-z)
• F. Bünger and S.M. Rump. The determinant of a complex matrix and Gershgorin circles. Electronic Journal of Linear Algebra (ELA), 35:181–186, 2019. (PDF) (doi:10.13001/1081-3810.3910)
• M. Lange and S.M. Rump. Sharp estimates for perturbation errors in summations. Math. of Comp., 88:349–368, 2019. (PDF) (doi:10.1090/mcom/3355)
• S.M. Rump. Bounds for the Determinant by Gershgorin Circles. Linear Algebra and its Application (LAA), 563:215–219, 2019. (PDF) (doi:10.1016/j.laa.2018.10.020)
• S.M. Rump. Error bounds for computer arithmetics. Summary of the plenary talk at ARITH26, Kyoto, IEEE Xplore, 2019. (PDF) (doi:10.1109/ARITH.2019.00011)
• S.M. Rump and P. Batra. Addendum to the determinant of a perturbed identity matrix. Linear Algebra and its Applications (LAA), 565:309–312, 2019. (PDF) (doi:10.1016/j.laa.2018.11.029)
• C.-P. Jeannerod and S.M. Rump. On relative errors of floating-point operations: Optimal bounds and applications. Mathematics of Computation, 87:803–819, 2018. (PDF) (doi:10.1090/mcom/3234)
• S. Oishi, K. Ichihara, M. Kashiwagi, K. Kimura, X. Liu, H. Masai, Y. Morikura, T. Ogita, K. Ozaki, S.M. Rump, K. Sekine, A. Takayasu, and N. Yamanaka. Principle of Verified Numerical Computations. Corona publisher, 311 pages, Tokyo, Japan, 2018 (in Japanese). (PDF) (doi:10.15480/882.2562)
• S.M. Rump. Estimates of the determinant of a perturbed identity matrix. Linear Algebra and its Applications (LAA), 558:101–107, 2018. (PDF) (doi:10.1016/j.laa.2018.08.009)
• S.M. Rump. Linear Systems in Matlab with Zero Residual. Reliable Computing, 26:56–66, 2018. (PDF)
• S.M. Rump. Mathematically Rigorous Global Optimization in Floating-Point Arithmetic. Optimization Methods & Software, 33(4–6):771–798, 2018. (PDF) (doi:10.1080/10556788.2018.1435649)
• F. Bünger and S.M. Rump. Yet more elementary proofs that the determinant of a symplectic matrix is 1. Linear Algebra and its Applications (LAA), 515:87–95, 2017. (PDF) (doi:10.1016/j.laa.2016.11.014)
• M. Lange and S.M. Rump. Error estimates for the summation of real numbers with application to floating-point summation. BIT, 57:927–941, 2017. (PDF) (doi:10.1007/s10543-017-0658-9)
• L. Lehmann, M. Radons, S.M. Rump, and C. Strohm. Sign controlled solvers for the absolute value equation with an application to support vector machines. submitted for publication, 2017. (PDF) (hdl.handle.net/11420/7808)
• S.M. Rump. IEEE754 precision-k base-β arithmetic inherited by precision-mbase-β; arithmeticfor k < m . ACM Trans. Math. Software, 43(3), 2017. (PDF) (doi:10.1145/2785965)
• F. Bünger and S.M. Rump. A short note on the convexity of interval matrix-vector products. Reliable Computing, 21:74–79, 2016. (PDF) (hdl.handle.net/11420/7816)
• I.S. Kotsireas, S.M. Rump, and C.K. Yap, editors. Mathematical Aspects of Computer and Information Sciences - 6th International Conference, MACIS 2015, Berlin, Germany, November 11-13, 2015, Revised Selected Papers, volume 9582 of Lecture Notes in Computer Science. Springer, 2016. (doi:10.1007/978-3-319-32859-1)
• K. Ozaki, F. Bünger, T. Ogita, S. Oishi, and S.M. Rump. Simple floating-point filters for the two-dimensional orientation problem. BIT Numerical Mathematics, 56(2):729–749, 2016. (PDF) (doi:10.1007/s10543-015-0574-9)
• S.M. Rump. Gleitkommaarithmetik auf dem Prüfstand [Wie werden verifiziert(e) numerische Lösungen berechnet?]. Jahresbericht der Deutschen Mathematiker-Vereinigung, 118(3):179–226, 2016. (PDF) (doi:10.1365/s13291-016-0138-1)
• S. Rump, T. Ogita, Y. Morikura, and S. Oishi. Interval arithmetic with fixed rounding mode. Nonlinear Theory and its Aplications (IEICE), 7(3):362–373, 2016. (PDF) (doi:10.1587/nolta.7.362)
• S.M. Rump. Computable backward error bounds for basic algorithms in linear algebra. Nonlinear Theory and Its Applications, IEICE, 6:1–4, 2015. (PDF) (doi:10.1587/nolta.6.360)
• S.M. Rump. Interval Arithmetics. In B. Engquist, editor, Encyclopedia of Applied and Computational Mathematics, pages 712–716. Springer Berlin Heidelberg, 2015. (doi:10.1007/978-3-540-70529-1)
• S.M. Rump. The componentwise structured and unstructured backward error can be arbitrarily far apart. SIAM J. Matrix Anal. Appl. (SIMAX), 36(2):385–392, 2015. (PDF) (doi:10.1137/140985500)
• S.M. Rump and M. Lange. On the Definition of Unit Roundoff. BIT Numerical Mathematics, 56(1):309–317, 2015. (PDF) (doi:10.1007/s10543-015-0554-0)
• S.M. Rump and Kashiwagi M. Implementation and improvements of affine arithmetic. Nonlinear Theory and Its Applications, IEICE,, 2(3):1101–1119, 2015. (PDF) (doi:10.1587/nolta.6.341)
• S.M. Rump, F. Bünger, and C.-P. Jeannerod. Improved Error Bounds for Floating-Point Products and Horner's Scheme. BIT Numerical Mathematics, 56(1):293–307, 2015. (PDF) (doi:10.1007/s10543-015-0555-z)
• S.M. Rump. Verified bounds for the p-norm condition number. Reliable Computing, Vol. 20, pp. 45-52, 2014. (PDF) (hdl.handle.net/11420/7659)
• S.M. Rump. Verified sharp bounds for the real gamma function over the entire floating-point range. Nonlinear Theory and Its Applications (NOLTA), IEICE, Vol.E5-N, No.3, July, 2014. (PDF) (doi:10.1587/nolta.5.339)
• S.M. Rump and C.-P. Jeannerod. Improved backward error bounds for LU and Cholesky factorizations. SIAM. J. Matrix Anal. & Appl. (SIMAX), 35(2):684–698, 2014. (PDF) (doi:10.1137/130927231)
• C.-P. Jeannerod and S.M. Rump. Improved error bounds for inner products in floating-point arithmetic. SIAM. J. Matrix Anal. & Appl. (SIMAX), 34(2):338–344, 2013. (PDF) (doi:10.1137/120894488)
• T. Nishi, S.M. Rump, and S. Oishi. A consideration on the condition number of extremely ill-conditioned matrices. Circuit Theory and Design (ECCTD), 2013 European Conference on, pages 1–4, 2013. (doi:10.1109/ECCTD.2013.6662260)
• K. Ozaki, T. Ogita, S. Oishi, and S.M. Rump. Generalization of error-free transformation for matrix multiplication and its application. Nonlinear Theory and Its Applications, IEICE, 4(1):2–11, 2013. (doi:10.1587/nolta.4.2)
• S.M. Rump. Accurate solution of dense linear systems, Part I: Algorithms in rounding to nearest. Journal of Computational and Applied Mathematics (JCAM), 242:157–184, 2013. (PDF) (doi:10.1016/j.cam.2012.10.010)
• S.M. Rump. Accurate solution of dense linear systems, Part II: Algorithms using directed rounding. Journal of Computational and Applied Mathematics (JCAM), 242:185–212, 2013. (PDF) (doi:10.1016/j.cam.2012.09.024)
• S.M. Rump. Improved componentwise verified error bounds for least squares problems and underdetermined linear systems. Numerical Algorithms, 66:309–322, 2013. (PDF) (doi:10.1007/s11075-013-9735-6)
• S.M. Rump, T. Ogita, and S. Oishi. Interval Arithmetic without Changing the Rounding Mode. submitted for publication, 2013.
• K. Ozaki, T. Ogita, S. Oishi, and S.M. Rump. Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications. Numerical Algorithms, 59(1), 2012. (PDF) (doi:10.1007/s11075-011-9478-1)
• K. Ozaki, T. Ogita, S.M. Rump, and S. Oishi. Fast algorithms for floating-point interval matrix multiplication. Journal of Computational and Applied Mathematics, 236(7):1795–1814, 2012. (doi:10.1016/j.cam.2011.10.011)
• S.M. Rump. Error estimation of floating-point summation and dot product. BIT Numerical Mathematics, 52(1):201–220, 2012. (PDF) (doi:10.1007/s10543-011-0342-4)
• S.M. Rump. Fast Interval Matrix Multiplication. Numerical Algorithms, 61(1):1–34, 2012. (PDF) (doi:10.1007/s11075-011-9524-z)
• S.M. Rump. Interval Arithmetic Over Finitely Many Endpoints. BIT Numerical Mathematics, 52(4):1059–1075, 2012. (PDF) (doi:10.1007/s10543-012-0384-2)
• S.M. Rump. Verified Bounds for Least Squares Problems and Underdetermined Linear Systems. SIAM J. Matrix Anal. Appl. (SIMAX), 33(1):130–148, 2012. (doi:10.1137/110840248) (PDF)
• T. Nishi, S.M. Rump, and S. Oishi. On the generation of very ill-conditioned integer matrices. Nonlinear Theory and Its Applications, IEICE, 2(2):226–245, 2011. (doi:10.1587/nolta.2.226) (PDF)
• S.M. Rump. Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse. BIT Numerical Mathematics, 51(2):367–384, 2011. (PDF) (doi:10.1007/s10543-010-0294-0)
• B. Kearfott, M. Nakao, S. Neumaier, A. Rump, S.P. Shary, and P. Van Hentenryck. Standardized notation in interval analysis. Reliable Computing, 15(1):7–13, 2010. (PDF) (hdl.handle.net/11420/8521)
• S. Miyajima, T. Ogita, S.M. Rump, and S. Oishi. Fast Verification of All Eigenpairs in Symmetric Positive Definite Generalized Eigenvalue Problem. Reliable Computing, 14:24–45, 2010. (PDF) (hdl.handle.net/11420/8533)
• T. Nishi, S.M. Rump, and S. Oishi. Some properties and generation methods of integer matrices with large condition number. IEICE technical Report, Circuits and Systems, 110(86):13–18, 2010. (hdl.handle.net/11420/8541) (http://ci.nii.ac.jp/naid/110007890169)
• S.M. Rump. A Model Problem for Global Optimization. In Nonlinear Theory and Its Applications (NOLTA), volume 1, pages 1–6. IEICE, 2010. (PDF) (doi:10.1587/nolta.2.68)
• S.M. Rump. Accurate and Reliable Computing in Floating-Point Arithmetic. In K. Fukuda et al., editor, Proceedings of the Third International Congress on Mathematical Software, Kobe, Japan, September 13-17, 2010 (ICMS 2010), volume 6327 of Lecture Notes in Computer Science (LNCS), pages 105–108, 2010. (doi:10.1007/978-3-642-15582-6_22)
• S.M. Rump. Verification methods: Rigorous results using floating-point arithmetic. Acta Numerica, 19:287–449, 2010. (PDF) (doi:10.1017/S096249291000005X)
• S.M. Rump and S. Graillat. Verified error bounds for multiple roots of systems of nonlinear equations. Numerical Algorithms, 54(3):359–377, 2010. (PDF) (doi:10.1007/s11075-009-9339-3)
• S.M. Rump, T. Ogita, and S. Oishi. Fast high precision summation. Nonlinear Theory and Its Applications (NOLTA), IEICE, 1(1):2–24, 2010. [received the "NOLTA Best Paper Award" by the IEICE Engineering Sciences Society]. (PDF) (doi:10.1587/nolta.1.2)
• A. Berman, Ch. Krattenthaler, S.M. Rump, I. Spitkovsky, and F. Zhang. Short biography of Shmuel Friedland for his special LAA volume. Linear Algebra and its Applications (LAA), 431(12):2277–2284, 2009. (PDF) (doi:10.1016/j.laa.2009.08.024)
• S. Oishi, T. Ogita, and S. M. Rump. Iterative Refinement for Ill-conditioned Linear Equations. Japan J. Indust. Appl. Math., 26(2):465–476, 2009. (doi:10.1007/BF03186544)
• K. Ozaki, T. Ogita, S.M. Rump, and S. Oishi. Adaptive and Efficient Algorithm for 2D Orientation Problem. Japan J. Indust. Appl. Math., 26:215–231, 2009. (doi:10.1007/BF03186532)
• S.M. Rump. Error-Free Transformations and ill-conditioned problems. In Proceedings of the ``International workshop on verified computations and related topics'', University of Karlsruhe, March 7-10, 2009. (PDF) (hdl.handle.net/11420/8629)
• S.M. Rump. Inversion of extremely ill-conditioned matrices in floating-point. Japan J. Indust. Appl. Math. (JJIAM), 26:249–277, 2009. (doi:10.1007/BF03186534)
• S.M. Rump. Ultimately Fast Accurate Summation. SIAM Journal on Scientific Computing (SISC), 31(5):3466–3502, 2009. (PDF) (doi:10.1137/080738490)
• S. M. Rump and S. Oishi. Verified Error Bounds for Double Roots of Nonlinear Equations. In 2009 International Symposium on Nonlinear Theory and its Applications, NOLTA'09, Sapporo, Japan, 2009. (PDF) (hdl.handle.net/11420/8564)
• S.M. Rump and S. Oishi. Verified computation of a disc containing exactly k roots of a univariate nonlinear function. Nonlinear Theory and Its Applications (NOLTA), IEICE, 1(1):1–8, 2009. (PDF) (doi:10.1587/nolta.1.89)
• S.M. Rump and H. Sekigawa. The ratio between the Toeplitz and the unstructured condition number. Operator Theory: Advances and Applications, 199:397–419, 2009. (PDF) (doi:10.1007/978-3-7643-8996-3_18)
• S.M. Rump, P. Zimmermann, S. Boldo, and G. Melquiond. Computing predecessor and successor in rounding to nearest. BIT Numerical Mathematics, 49(2):419–431, 2009. (PDF)
• S.M. Rump, P. Zimmermann, S. Boldo, and G. Melquiond. Interval operations in rounding to nearest. accepted for publication in BIT, 2009. (PDF)
• S. Graillat, J.-L. Lamotte, S.M. Rump, and S. Markov. Interval arithmetic on the Cell processor. In IMACS— 13th International Symposium on Scientific Computing Computer Arithmetic and Verified Numerical Computations, El Paso, Texas, USA, Sep. 29 – Oct. 3, 2008, pages 54–54, 2008. (PDF) (hdl.handle.net/11420/8572)
• T. Nishi, T. Ogita, S. Oishi, and S. M. Rump. A Method for the Generation of a Class of Ill-conditioned Matrices. In 2008 International Symposium on Nonlinear Theory and its Applications, NOLTA'08, Budapest, Hungary, September 7-10, pages 53–56, 2008. (PDF) (hdl.handle.net/11420/8607)
• T. Ogita, S.M. Rump, and S. Oishi. Verification of positive definiteness for large sparse matrices, 2008. (hdl.handle.net/11420/8608)
• S. Oishi, T. Ogita, and S. M. Rump. Iterative Refinement for Ill-conditioned Linear Equations. In 2008 International Symposium on Nonlinear Theory and its Applications, NOLTA'08, Budapest, Hungary, September 7-10, pages 516–519, 2008. (PDF)
• K. Ozaki, T. Ogita, S. M. Rump, and S. Oishi. Accurate matrix multiplication by using level 3 BLAS operation. In Proceedings of the 2008 International Symposium on Nonlinear Theory and its Applications, NOLTA'08, Budapest, Hungary, pages 508–511. IEICE, 2008. (PDF) (hdl.handle.net/11420/8569)
• S.M. Rump, T. Ogita, and S. Oishi. Accurate floating-point summation part I: Faithful rounding. SIAM J. Sci. Comput., 31(1):189–224, 2008. (PDF) (doi:10.1137/050645671)
• S.M. Rump, T. Ogita, and S. Oishi. Accurate floating-point summation part II: Sign, K-fold faithful and rounding to nearest. Siam J. Sci. Comput., 31(2):1269–1302, 2008. (PDF) (doi:10.1137/07068816X)
• N. Yamanaka, T. Ogita, S.M. Rump, and S. Oishi. A Parallel Algorithm for Accurate Dot Product. Parallel Computing, 34(6–8):392–410, 2008. (PDF) (doi:10.1016/j.parco.2008.02.002)
• S. Oishi, K. Tanabe, T. Ogita, and S.M. Rump. Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices. J. Comput. Appl. Math., 205(1):533–544, 2007. (PDF) (doi:10.1016/j.cam.2006.05.022)
• K. Ozaki, T. Ogita, S. M. Rump, and S. Oishi. Accurate matrix multiplication with multiple floating-point numbers. In Proceedings of 2007 International Symposium on Nonlinear Theory and its Applications, Vancouver, Canada, September 16-19, 2007. (PDF) (hdl.handle.net/11420/8653)
• S.M. Rump and P. Zimmermann. Interval operations in rounding to nearest. submitted for publication, 2007. (PDF)
• G. Alefeld, M.T. Nakao, and S.M. Rump. Preface. Journal of Computational and Applied Mathematics (JCAM), 199(2):197–198, 2006. Special issue on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN 2004).
• V. Kreinovich and S.M. Rump. Towards Optimal Use of Multi-Precision Arithmetic: A Remark. Reliable Computing, 12:365–369, 2006. (PDF) (doi:10.1007/s11155-006-9007-4)
• K. Ozaki, T. Ogita, S. Miyajima, S. Oishi, and S.M. Rump. A method of obtaining verified solutions for linear systems suited for Java. Journal of Computational and Applied Mathematics (JCAM), 199(2):337–344, 2006. Special issue on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN 2004). (PDF) (doi:10.1016/j.cam.2005.08.034)
• K. Ozaki, T. Ogita, S.M. Rump, and S. Oishi. Fast and robust algorithm for geometric predicates using floating-point arithmetic. Trans. Japan Soc. Ind. Appl. Math. (JSIAM), 4(16):553–562, 2006. (in Japanese). (PDF) (hdl.handle.net/11420/8843)
• S.M. Rump. Eigenvalues, pseudospectrum and structured perturbations. Linear Algebra and its Applications (LAA), 413:567–593, 2006. (PDF) (doi:10.1016/j.laa.2005.06.009)
• S.M. Rump. Error bounds for extremely ill-conditioned problems. In Proceedings of 2006 International Symposium on Nonlinear Theory and its Applications, Bologna, Italy, September 11-14, 2006. (PDF) (hdl.handle.net/11420/8890)
• S.M. Rump. INTLAB - Interval Laboratory, the Matlab toolbox for verified computations, Version 5.3, 2006. Intlab.
• S.M. Rump. Verification of Positive Definiteness. BIT Numerical Mathematics, 46:433–452, 2006. (doi:10.1007/s10543-006-0056-1)
• S.M. Rump and T. Ogita. Super-fast validated solution of linear systems. Journal of Computational and Applied Mathematics (JCAM), 199(2):199–206, 2006. Special issue on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN 2004). (PDF) (doi:10.1016/j.cam.2005.07.038)
• S. Friedland, D. Hershkowitz, and S.M. Rump. Positive entries of stable matrices. Electronic Journal of Linear Algebra (ELA), 12:17–24, 2005. (PDF) (doi:10.13001/1081-3810.1142)
• A. Hailer and S.M. Rump. Evaluation of Hedge Effectiveness Tests. Journal of Derivatives Accounting (JDA), 2(1):31–52, 2005. (PDF) (doi:10.1142/S021986810500029X)
• A.C. Hailer and S.M. Rump. Evaluierung von Hedge-Effektivitätstests. Zeitschrift für das gesamte Kreditwesen, 58(20):1089–1097, 2005. (hdl.handle.net/11420/8664)
• T. Ogita, S.M. Rump, and S. Oishi. Verified Solutions of Sparse Linear Systems by LU factorization, 2005. (PDF)
• T. Ogita, S.M. Rump, and S. Oishi. Accurate sum and dot product. SIAM Journal on Scientific Computing (SISC), 26(6):1955–1988, 2005. (PDF) (doi:10.1137/030601818)
• T. Ogita, S.M. Rump, and S. Oishi. Verified solution of linear systems without directed rounding. Technical Report 2005-04, Advanced Research Institute for Science and Engineering, Waseda University, Tokyo, Japan, 2005. (PDF) (hdl.handle.net/11420/8672)
• T. Ohta, T. Ogita, S.M. Rump, and S. Oishi. A Method of Verified Numerical Computation for Ill-conditioned Linear System of Equations. Journal of JSIAM, 15(3):269–287, 2005.
• T. Ohta, T. Ogita, S.M. Rump, and S. Oishi. Numerical Method for Dense Linear Systems with Arbitrariliy Ill-conditioned Matrices. In Proceedings of 2005 International Symposium on Nonlinear Theory and its Applications, Bruge, Belgium, October 18–21, pages 745–748, 2005. (PDF) (hdl.handle.net/11420/8673)
• T. Ohta, T. Ogita, S.M. Rump, and S. Oishi. Numerical Verification Method for Arbitrarily Ill-conditioned Linear Systems. Transactions on the Japan Society for Industrial and Applied Mathematics (Trans. JSIAM), 15(3):269–287, 2005. [received the "Best Paper Award 2005 of Japanese SIAM"]. (PDF) (doi:10.11540/jsiamt.15.3_269)
• T. Ota, S. Oishi, T. Ogita, and S.M. Rump. Verified Solutions of Extremely Ill-conditioned Linear Systems. Nihon Shimyureshon Gakkai Taikai Happyo Ronbunshu, 24:225–228, 2005. (hdl.handle.net/11420/8686)
• K. Ozaki, T. Ogita, S. Miyajima, S. Oishi, and S.M. Rump. Componentwise Verified Solutions of Linear System Suited for Java. In Proceedings of 2005 International Symposium on Nonlinear Theory and its Applications, Bruge, Belgium, October 18–21, pages 749–752, 2005. (PDF) (hdl.handle.net/11420/8666)
• S.M. Rump. Computer-assisted proofs and Self-Validating Methods. In B. Einarsson, editor, Handbook on Accuracy and Reliability in Scientific Computation, pages 195–240. SIAM, 2005. (PDF) (doi:10.1137/1.9780898718157.ch10)
• S.M. Rump. High Precision Evaluation of Nonlinear Functions. In Proceedings of 2005 International Symposium on Nonlinear Theory and its Applications, Bruge, Belgium, October 18–21, pages 733–736, 2005. (PDF) (hdl.handle.net/11420/8669)
• S.M. Rump. INTLAB - Interval Laboratory, a Matlab toolbox for verified computations, Version 5.1, 2005. Intlab.
• T. Ogita, S.M. Rump, and S. Oishi. Accurate Sum and Dot Product with Applications. Proceedings of 2004 IEEE International Symposium on Computer Aided Control Systems Design, Taipei, pages 152–155, 2004. (PDF) (hdl.handle.net/11420/8945)
• T. Ota, S. Oishi, T. Ogita, and S.M. Rump. Numerical Verification Method for Simultaneous Linear Equations using Accurate Dot Product Calculation Algorithm. Nihon Shimyureshon Gakkai Taikai Happyo Ronbunshu, 23:345–348, 2004. (hdl.handle.net/11420/8688)
• S.M. Rump. Computer-Assisted Proofs I. Bulletin of the Japan Society for Industrial and Applied Mathematics (Bull. JSIAM), 14(3):2–11, 2004. translated by T. Ogita. (PDF) (hdl.handle.net/11420/8942)
• S.M. Rump. Computer-Assisted Proofs II. Bulletin of the Japan Society for Industrial and Applied Mathematics (Bull. JSIAM), 14(4):44–57, 2004. translated by T. Ogita. (PDF) (hdl.handle.net/11420/8943)
• S.M. Rump and J. Zemke. On eigenvector bounds. BIT Numerical Mathematics, 43:823–837, 2004. (PDF) (doi:10.1023/B:BITN.0000009941.51707.26)
• A.C. Hailer and S.M. Rump. Hedge-Effektivität: Lösung des Problems der kleinen Zahlen. (Hedge Accounting nach FAS 133 bzw. IAS 39. Zeitschrift für das gesamte Kreditwesen, 56(2003)(11):599–603, 2003. (hdl.handle.net/11420/8697)
• S.M. Rump. Algorithms for Computing Validated Results. In J. Grabmeier, E. Kaltofen, and V. Weispfennig, editors, Computer Algebra Handbook, chapter 2.12.2, pages 110–112. Springer, 2003. (PDF) (hdl.handle.net/11420/8740)
• S.M. Rump. On Nishi's conditions for the Omega-property. IEICE Trans. Fundamentals Communications Electronics Information and Systems, E86(9):2357–2359, 2003. (PDF) (hdl.handle.net/11420/8702)
• S.M. Rump. On P-Matrices. Linear Algebra and its Applications (LAA), 363:237–250, 2003. (PDF) (doi:10.1016/S0024-3795(01)00590-0)
• S.M. Rump. Optimal scaling for p-norms and componentwise distance to singularity. IMA Journal of Numerical Analysis (IMAJNA), 23:1–9, 2003. (PDF) (doi:10.1093/imanum/23.1.1)
• S.M. Rump. Perron-Frobenius Theory for Complex Matrices. Linear Algebra and its Applications (LAA), 363:251–273, 2003. (PDF) (doi:10.1016/S0024-3795(02)00329-4)
• S.M. Rump. Structured Perturbations Part I: Normwise Distances. SIAM J. Matrix Anal. Appl. (SIMAX), 25(1):1–30, 2003. (PDF) (doi:10.1137/S0895479802405732)
• S.M. Rump. Structured Perturbations Part II: Componentwise Distances. SIAM J. Matrix Anal. Appl. (SIMAX), 25(1):31–56, 2003. (PDF) (doi:10.1137/S0895479802405744)
• S.M. Rump. Ten methods to bound multiple roots of polynomials. J. Comput. Appl. Math. (JCAM), 156:403–432, 2003. (PDF) (doi:10.1016/S0377-0427(03)00381-9)
• S. Oishi and S.M. Rump. Fast verification of solutions of matrix equations. Numer. Math., 90(4):755–773, 2002. (PDF) (doi:10.1007/s002110100310)
• S.M. Rump. Variational characterizations of the sign-real and the sign-complex spectral radius. Electronic Journal of Linear Algebra (ELA), 9:112–117, 2002. (PDF) (hdl.handle.net/11420/9421)
• S.M. Rump. Computational Error Bounds for Multiple or Nearly Multiple Eigenvalues. Linear Algebra and its Applications (LAA), 324:209–226, 2001. (PDF) (doi:10.1016/S0024-3795(00)00279-2)
• S.M. Rump. Conservatism of the circle criterion - solution of a problem posed by A. Megretski. IEEE Trans. Automatic Control, 46(10):1605–1608, 2001. (PDF) (doi:10.1109/9.956057)
• S.M. Rump. Fast verification algorithms in Matlab. In G. Alefeld, J. Rohn, S. Rump, and T. Yamamoto, editors, Symbolic Algebraic Methods and Verification Methods, pages 209–226. Springer Mathematics, 2001. (PDF) (doi:10.1007/978-3-7091-6280-4_20)
• S.M. Rump. Interval Arithmetic and Fuzzy Logic. In Proc. of the International NAISO congress on Information Science Innovations (ISI'2001), Dubai, pages 379–386, 2001. (hdl.handle.net/11420/8845)
• S.M. Rump. Rigorous and portable standard functions. BIT Numerical Mathematics, 41(3):540–562, 2001. (PDF) (doi:10.1023/A:1021971313412)
• S.M. Rump. Self-validating methods. Linear Algebra and its Applications (LAA), 324:3–13, 2001. (PDF) (doi:10.1016/S0024-3795(00)00195-6)
• S.M. Rump. A simple application of interval arithmetic. Brazilian Electronic Journal on Mathematics of Computation (BEJMC), 2, 2000. (PDF) (hdl.handle.net/11420/9431)
• S.M. Rump. Fast and parallel interval arithmetic. BIT Numerical Mathematics, 39(3):534–554, 1999. (PDF) (doi:10.1023/A:1022374804152)
• S.M. Rump. Ill-conditioned Matrices are componentwise near to singularity. SIAM Review (SIREV), 41(1):102–112, 1999. (PDF) (doi:10.1137/S0036144598323216)
• S.M. Rump. Ill-conditionedness need not be componentwise near to ill-posedness for least squares problems. BIT Numerical Mathematics, 39(1):143–151, 1999. (PDF) (doi:10.1023/A:1022377410087)
• S.M. Rump. Interval computations with INTLAB. Brazilian Electronic Journal on Mathematics of Computation (BEJMC), 1, 1999. (PDF) (hdl.handle.net/11420/9364)
• S.M. Rump. INTLAB - INTerval LABoratory. In Tibor Csendes, editor, Developments in Reliable Computing, pages 77–104. Kluwer Academic Publishers, Dordrecht, 1999. Intlab. (PDF) (hdl.handle.net/11420/9365)
• S.M. Rump. Verified Solution of Large Linear and Nonlinear Systems. In H. Bulgak and C. Zenger, editors, Error Control and adaptivity in Scientific Computing, pages 279–298. Kluwer Academic Publishers, 1999. (PDF) (hdl.handle.net/11420/9366)
• D. Dennis, V. Kreinovich, and S.M. Rump. Intervals and the Origins of Calculus. Reliable Computing, 4(2):191–197, 1998. (PDF) (doi:10.1023/a:1009989211143)
• S.M. Rump. A Note on Epsilon-Inflation. Reliable Computing, 4:371–375, 1998. (PDF) (doi:10.1023/a:1024419816707)
• S.M. Rump. INTLAB - Interval Laboratory. Technical Report 98.4, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1998. Intlab. (hdl.handle.net/11420/9442)
• S.M. Rump. Structured Perturbations and Symmetric Matrices. Linear Algebra and its Applications (LAA), 278:121–132, 1998. (PDF) (doi:10.1016/S0024-3795(97)10078-7)
• S.M. Rump. The sign-real spectral radius and cycle products. Linear Algebra and its Applications (LAA), 279:177–180, 1998. (PDF) (doi:10.1016/S0024-3795(98)00014-7)
• S.M. Rump. Almost Sharp Bounds for the Componentwise Distance to the Nearest Singular Matrix. Linear and Multilinear Algebra (LAMA), 42:93–107, 1997. (PDF) (doi:10.1080/03081089708818494)
• S.M. Rump. Bounds for the Componentwise Distance to the Nearest Singular Matrix. SIAM J. Matrix Anal. Appl. (SIMAX), 18(1):83–103, 1997. (PDF) (doi:10.1137/S0895479895289170)
• S.M. Rump. HARDY - High-Accuracy Arithmetic Applied to Dimensionl Metrology. In Proceedings of the 4th German-Brazilian Workshop on Information Technology, pages 9–12, Berlin, 1997. (hdl.handle.net/11420/9393)
• S.M. Rump. Inclusion of zeros of nowhere differentiable n-dimensional functions. Reliable Computing, 3(1):5–16, 1997. (PDF) (doi:10.1023/A:1009967901122)
• S.M. Rump. Theorems of Perron-Frobenius type for matrices without sign restrictions. Linear Algebra and its Applications (LAA), 266:1–42, 1997. (PDF) (doi:10.1016/S0024-3795(96)00522-8)
• R. Lindemann and S.M. Rump. COX - C with Operator eXtension. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 76, Suppl. 1:53–56, 1996. (hdl.handle.net/11420/9456)
• W. Mackens and S.M. Rump. Software Engineering im Scientific Computing. Vieweg Verlag, 1996. (doi:10.1007/978-3-322-85027-0)
• S.M. Rump. Expansion and Estimation of the Range of Nonlinear Functions. Math. Comput., 65(216):1503–1512, 1996. (PDF) (doi:10.1090/S0025-5718-96-00773-9)
• S.M. Rump. Improved Iteration Schemes for Validation Algorithms for Dense and Sparse Nonlinear Systems. Computing, 57(1):77–84, 1996. (PDF) (doi:10.1007/BF02238359)
• S.M. Rump. The distance between regularity and strong regularity. In G. Alefeld, A. Frommer, and B. Lang, editors, Scientific Computing and Validated Numerics, volume 90 of Mathematical Research, pages 105–117. Akademie Verlag, 1996. (PDF) (hdl.handle.net/11420/9458)
• S.M. Rump. Verified Computation of the Solution of Large Sparse Linear Systems. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 75:S439–S442, 1995. (PDF) (hdl.handle.net/11420/9411)
• S.M. Rump. Verified Solution of Large Systems and Global Optimization Problems. J. Comput. Appl. Math. (JCAM), 60:201–218, 1995. (PDF) (hdl.handle.net/11420/9412)
• C. Jansson and S.M. Rump. Algorithmen mit Ergebnisverifikation — einige Bemerkungen zu neueren Entwicklungen. In Jahrbuch Überblicke Mathematik, pages 47–73. Vieweg, 1994. (PDF) (hdl.handle.net/11420/9466)
• C. Jansson and S.M. Rump. Self-Validating Methods - Some Recent Developements. In E. Schock, editor, Beiträge zur Angewandten Analysis und Informatik, pages 148–170. Shaker Verlag, 1994. (PDF) (hdl.handle.net/11420/9467)
• S.M. Rump. Verification Methods for Dense and Sparse Systems of Equations. In J. Herzberger, editor, Topics in Validated Computations — Studies in Computational Mathematics, pages 63–136, Elsevier, Amsterdam, 1994. (PDF)
• D. Claudio and S.M. Rump. GANA - Guaranteed Accuracy for Numerical Algorithms. In Proceedings of the German Brazilian Workshop on Information Technology, Berlin, 1993. (hdl.handle.net/11420/9418)
• S.M. Rump. Validated Solution of Large Linear Systems. In R. Albrecht, G. Alefeld, and H.J. Stetter, editors, Validation numerics: theory and applications, volume 9 of Computing Supplementum, pages 191–212. Springer, 1993. (PDF) (doi:10.15480/882.326)
• S.M. Rump. Zur Außen- und Inneneinschließung von Eigenwerten bei toleranzbehafteten Matrizen. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 73(7-8):T861–T863, 1993. (PDF)
• S.M. Rump. Validated Solution of Large Linear Systems. Technical Report 93.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1993. (hdl.handle.net/11420/9591)
• D.M. Claudio and S.M. Rump. Inclusion methods for real and complex functions in one variable. Technical Report 92.5, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1992. (hdl.handle.net/11420/9486)
• S.M. Rump. Accuracy Control and Estimation, Self-Validating Systems and Software Environments for Scientific Computation. In P. Gaffney and E. Houstis, editors, IFIP Transactions on Programming Environments for High-Level Scientific Problem Solving, pages 49–56. North-Holland, Amsterdam, 1992. (hdl.handle.net/11420/9488)
• S.M. Rump. Inclusion of the Solution for Large Linear Systems with M-Matrix. In L. Atanassova and J. Herzberger, editors, Computer Arithmetic and Enclosure Methods, pages 339–350. Elsevier Science Publisher B.V., 1992.
• S.M. Rump. Inclusion of the Solution of Large Linear Systems with M-Matrix. Interval Computations, 1(3):22–43, 1992. (hdl.handle.net/11420/9490)
• S.M. Rump. On the Solution of Interval Linear Systems. Computing, 47:337–353, 1992. (PDF) (doi:10.1007/BF02320201)
• S.M. Rump. Recent Results in Interval Mathematics. In Proc. 5th International Conference on Scientific Computing, Benin City, 1992. (hdl.handle.net/11420/9491)
• D. Husung and S.M. Rump. ABACUS, Sprachbeschreibung. In L. Atanassova et al., editor, Computer arithmetic and enclosure methods: Proceedings of the Third International IMACS-GAMM Symposium on Computer Arithmetic and Scientific Computing (SCAN-91), Oldenburg, Germany, 1 - 4 October 1991, Dublin, 1991.
• C. Jansson and S.M. Rump. Rigorous Solution of Linear Programming Problems with Uncertain Data. ZOR — Methods and Models of Operations Research, 35:87–111, 1991. (PDF) (doi:10.1007/BF02331571)
• S.M. Rump. Inclusion of the Solution for Large Linear Systems with M-Matrix. Technical Report 91.3, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1991. (hdl.handle.net/11420/9584)
• S.M. Rump. A Class of Arbitrarily Ill-conditioned Floating-Point Matrices. SIAM J. Matrix Anal. Appl. (SIMAX), 12(4):645–653, 1991. (PDF) (doi:10.1137/0612049)
• S.M. Rump. Convergence Properties of Iterations Using Sets. Wissenschaftliche Zeitschrift, TU Leipzig, 15(6):427–432, 1991. (PDF)
• S.M. Rump. Estimation of the Sensitivity of Linear and Nonlinear Algebraic Problems. Linear Algebra and its Applications (LAA), 153:1–34, 1991. (PDF)
• S.M. Rump. On the Solution of Interval Linear Systems. Technical Report 90.5, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1990. (hdl.handle.net/11420/9576)
• C. Jansson and S.M. Rump. Rigorous Sensitivity Analysis for Systems of Linear Equations and Linear Programming Problems. Methods of Operation Research, 62:459–473, 1990. (hdl.handle.net/11420/9492)
• S.M. Rump. A Class of Arbitrarily Ill-conditioned Floating-Point Matrices. Technical Report 90.3, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1990. (hdl.handle.net/11420/9583)
• S.M. Rump. ACRITH - CALCULUS - TPX - Programmierwerkzeuge für wissenschaftliches Rechnen. In Tagungsband Wissenschaftliches Forum, Hamburg, 1990. (hdl.handle.net/11420/9498)
• S.M. Rump. Approximate inverses of almost singular matrices still contain useful information. Technical Report 90.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1990. (PDF)
• S.M. Rump. Rigorous Sensitivity Analysis for Systems of Linear and Nonlinear Equations. Math. Comput., 54(10):721–736, 1990. (PDF) (doi:10.2307/2008508)
• D. Husung and S.M. Rump. ABACUS. In Proceedings SCAN '89, Tagung ''Wissenschaftliches Rechnen und Programmiersprachen'', pages 52–53, Basel, 1989. (hdl.handle.net/11420/9502)
• S.M. Rump. CALCULUS. In U. Kulisch, editor, Wissenschaftliches Rechnen mit Ergebnisverifikation, pages 85–99. Vieweg und Akademie Verlag, Berlin, 1989.
• S.M. Rump. Guaranteed Inclusions for the Complex Generalized Eigenproblem. Computing, 42:225–238, 1989. (PDF) (doi:10.1007/BF02239750)
• S.M. Rump. Lineare Probleme. In U. Kulisch, editor, Wissenschaftliches Rechnen mit Ergebnisverifikation, pages 119–127. Vieweg und Akademie Verlag, Berlin, 1989.
• T. Merschen and S.M. Rump. Genaues Rechnen. Technical report, Fachbereich Lehre und Forschung, IBM, 1988.
• S.M. Rump. Algebraic Computation, Numerical Computation, and Verified Inclusions. In R. Janßen, editor, Trends in Computer Algebra, pages 177–197. Lecture Notes in Computer Science 296, 1988. (doi:10.1007/3-540-18928-9_13)
• S.M. Rump. Algorithms for Verified Inclusions - Theory and Practice. In R.E. Moore, editor, Reliability in Computing, volume 19 of Perspectives in Computing, pages 109–126. Academic Press, 1988. (PDF) (doi:10.1016/B978-0-12-505630-4.50012-2)
• S.M. Rump. Garantiert richtige Ergebnisse auf Rechenanlagen (ACRITH). In Tagungsband Wissenschaftliches Forum, München, 1988.
• U. Allendörfer, H. Böhm, G. Bohlender, K. Grüner, E. Kaucher, R. Kirchner, R. Klatte, U. Kulisch, M. Neaga, L.B. Rall, S.M. Rump, R. Saier, L. Schindele, Ch. Ullrich, H.W. Wippermann, and J. Wolff von Gudenberg. PASCAL-SC: A PASCAL Extension for Scientific Computation, Information Manual and Floppy Disks, Version IBM PC. B.G. Teubner und John Wiley & Sons, Stuttgart und Chichester, 1987.
• U. Allendörfer, H. Böhm, G. Bohlender, K. Grüner, E. Kaucher, R. Kirchner, R. Klatte, U. Kulisch, M. Neaga, L.B. Rall, S.M. Rump, R. Saier, L. Schindele, Ch. Ullrich, H.W. Wippermann, and J. Wolff von Gudenberg. PASCAL-SC: A PASCAL Extension for Scientific Computation for the ATARI ST, Information Manual and Floppy Disks. B.G. Teubner, Stuttgart, 1987.
• J.H. Bleher, S.M. Rump, U. Kulisch, M. Metzger, C. Ullrich, and W. Walter. FORTRAN-SC: A Study of a FORTRAN Extension for Engineering/Scientific Computation with Access to ACRITH. Computing, 39:93–110, 1987. (doi:10.1007/BF02310100)
• S.M. Rump. Introduction to ARCRITH - Accurate Scientific Algorithms. In E. Kaucher, U. Kulisch, and Ch. Ullrich, editors, Computerarithmetic, pages 296–369. B.G. Teubner, 1987.
• S.M. Rump. Numerische Software mit automatischer Verifikation. Technical report, Universität Duisburg, 1987.
• S.M. Rump. Solution of Linear Systems with Verified Accuracy. Applied Numerical Mathematics, 3:233–241, 1987. (doi:10.1016/0168-9274(87)90050-X)
• S.M. Rump, H. Böhm, and G. Schuhmacher. E-Methods for Nonlinear Problems. In E. Kaucher, U. Kulisch, and Ch. Ullrich, editors, Computerarithmetic, pages 59–80. B.G. Teubner, 1987.
• B. Buchberger, M. Feilmeier, M. Kratz, U. Kulisch, B. Kutzler, and S.M. Rump. Rechnerorientierte Verfahren. B.G. Teubner, 1986.
• U. Kulisch and S.M. Rump. Rechnerorientierte Verfahren, chapter Rechnerarithmetik und die Behandlung Algebraischer Probleme, pages 213–281. Vieweg+Teubner Verlag, Wiesbaden, 1986. (PDF)
• M. Mascagni, W.L. Miranker, and S.M. Rump. Case Studies for Augmented Floating-Point Arithmetic. In W.L. Miranker and R. Toupin, editors, Accurate Scientific Computations, volume 235 of Lecture Notes in Computer Science, pages 86–118. Springer, 1986.
• S.M. Rump. Demonstration of ACRITH - An advanced package for scientific computation. In Proceedings of the 11th IMACS World Congress, volume 85 of IMACS Transactions on Scientific Computation, pages 331–334, Oslo, Norway, 1986. North-Holland.
• S.M. Rump. New Results on Verified Inclusions. In W.L. Miranker and R. Toupin, editors, Accurate Scientific Computations, pages 31–69. Springer Lecture Notes in Computer Science 235, 1986. (PDF) (doi:10.1007/3-540-16798-6_4)
• S.M. Rump. Properties of a Higher Order Computer Arithmetic. In Proceedings of the 11th IMACS World Congress, volume 85 of IMACS Transactions on Scientific Computation, pages 163–165, Oslo, Norway, 1986. North-Holland.
• S.M. Rump. Sichere Ergebnisse auf Rechenanlagen. Informatik Spektrum, 9(3):174–183, 1986. (PDF)
• D.K. Unkauf, A.T. Gerlicher, S.M. Rump, and J.H. Bleher. Verfahren und Schaltungsanordnung zur Addition von Gleitkommazahlen - Patentanmeldung. Technical report, IBM, 1986.
• J.H. Bleher, A.E. Röder, and S.M. Rump. High Accuracy Arithmetic - ACRITH. In Proceedings of the SHARE 64 Meeting, pages 318–321, Los Angeles, California, 1985.
• S.M. Rump. ACRITH - High Accuracy Arithmetic Subroutine Library. In Proceedings of EUROCAL'85, European Conference on Computer Algebra, Linz, Austria, volume 203 of Lecture Notes in Computer Science. Springer, 1985.
• S.M. Rump. ACRITH - Numerical Methods with Verified Accuracy. In Proceedings of the Congress on Numerical Fluid Dynamics, pages 82–92, Tokyo, Japan, 1985.
• S.M. Rump. Higher Order Computer Arithmetic. In Proceedings of the ARITH 7 Conference on Computer Arithmetic, pages 302–308, Urbana, Illinois, 1985.
• S.M. Rump. Numerical Methods with Automatic Verification. In Proceedings of EUROCAL'85, European Conference on Computer Algebra, volume 203 of Lecture Notes in Computer Science, pages 26–27, Linz, Austria, 1985. Springer.
• J.H. Bleher, A.E. Röder, and S.M. Rump. ACRITH: High Accuracy Arithmetic - An Advanced Tool for Scientific Computation. In Proceedings of the SHARE 63 Meeting, pages 1–23, Miami, 1984. (PDF)
• G. Bohlender, H. Böhm, K. Grüner, E. Kaucher, D. Klatte, W. Krämer, U. Kulisch, W.L. Miranker, Ch. Ullrich, S.M. Rump, and J. Wolff v. Gudenberg. Arithmetic Specification in FORTRAN 8x. In B. Ford, J.C. Rault, and F. Thomasset, editors, Tools, Methods and Languages for Scientific and Engineering Computation, Proc. int. Conf., pages 213–243, Paris, 1984.
• S.M. Rump. Naive and Non-naive Interval Arithmetic in Scientific Computation. In Proceedings of the Conference on ''Numerical Mathematics'' , pages 1–18, Sao Carlos, Brazil, 1984.
• S.M. Rump. Solution of Linear and Nonlinear Algebraic Problems with Sharp Guaranteed Bounds. Comput. Suppl., 5:147–168, 1984. (PDF) (doi:10.1007/978-3-7091-7023-6_9)
• S.M. Rump. The use of interval arithmetic in scienfific computation. In Proceedings ''First International Conference on Computers and Applications'' , pages 719–724, Beijing, China, 1984.
• W.L. Miranker and S.M. Rump. Case Studies for ACRITH, 1. Ill posed problems and 2. Stiff Differenctial Systems. Technical report, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 1983.
• S.M. Rump. How Reliable are Results of Computers?, Translation of ``Wie zuverlässig sind die Ergebnisse unserer Rechenanlagen?''. Jahrbuch Überblicke Mathematik, pages 163–168, 1983. (PDF)
• S.M. Rump. Solving Algebraic Problems with High Accuracy. Habilitationsschrift. In U.W. Kulisch and W.L. Miranker, editors, A New Approach to Scientific Computation, pages 51–120. Academic Press, New York, 1983. (PDF)
• S.M. Rump. Wie zuverlässig sind die Ergebnisse unserer Rechenanlagen? Jahrbuch Überblicke Mathematik, pages 163–168, 1983. (PDF)
• S.M. Rump and H. Böhm. Least significant bit evaluation for arithmetic expressions in single-precision. Computing, 30:189–199, 1983. (PDF) (doi:10.1007/BF02253892)
• U. Kulisch, S.M. Rump, and J.W. von Gudenberg. Accuracy of the IBM 370 floating-point arithmetic and possible improvements. Technical report, IBM, 1982.
• S.M. Rump. Rechnervorführung, Pakete für Standardprobleme der Numerik. In U.W. Kulisch and Ch. Ullrich, editors, ''Wissenschaftliches Rechnen und Programmiersprachen'', pages 29–50. B.G. Teubner, 1982.
• S.M. Rump. Solving Nonlinear Systems with Least Significant Bit Accuracy. Computing, 29:183–200, 1982. (PDF) (doi:10.1007/BF02241697)
• G. Bohlender, K. Grüner, E. Kaucher, D. Klatte, W. Krämer, U. Kulisch, W.L. Miranker, Ch. Ullrich, S.M. Rump, and J. Wolff v. Gudenberg. PASCAL-SC - A PASCAL for Contemporary Scientific Computation. Technical report, IBM, Yorktown Heights, 1981.
• S.M. Rump. Exakte Fehlerschranken für Eigenwerte und Eigenvektoren. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 61(5):T311–313, 1981.
• S.M. Rump. Kleine, exakte Fehlerschranken für die Lösung linearer Gleichungssysteme. Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 61(5):T313–315, 1981.
• E. Kaucher and S.M. Rump. Generalized Iteration Methods for Bounds of the Solution of Fixed-Point Operator Equations. Computing, 24:131–137, 1980.
• E. Kaucher and S.M. Rump. Small bounds for the Solution of Systems of Linear Equations. Comput. Suppl., 2:157–164, 1980. (PDF) (doi:10.1007/978-3-7091-8577-3_11)
• S.M. Rump. Kleine Fehlerschranken bei Matrixproblemen. PhD thesis, Universität Karlsruhe, 1980. (PDF)
• S.M. Rump. Notiz zur Genauigkeit der Arithmetik in Rechenanlagen. Elektron. Rechenanlagen, 22(5):243–244, 1980. (PDF)
• S.M. Rump. Zur Rückführung nicht mehr benötigten Speicherplatzes in PASCAL. Elektron. Rechenanlagen, 22:55–62, 1980.
• S.M. Rump. Polynomial Minimum Root Separation. Math. Comput., 33(145):327–336, 1979. (PDF)
• S.M. Rump. Is at least one of k greater eqal 2 consecutive positive rational integers prime to all others? Technical report, Institut für Angewandte Mathematik, Universität Karlsruhe, 1978.
• S.M. Rump. Real Root Isolation for Algebraic Polynomials. ACM SIGSAM Bulletin, 11(2):327–336, 1977. (PDF)
• S.M. Rump. Ein Algorithmus zur Isolierung der reellen Nullstellen eines Polynoms mit algebraischen Koeffizienten, Rechenzeitanalyse und Implementierung. Master's thesis, Universität Kaiserslautern, 1976.
• S.M. Rump. Isolierung der reellen Nullstellen algebraischer Polynome. Technical Report 10, Arbeitsgruppe Algebra, Universität Kaiserslautern, 1976.
• S.M. Rump. On the Sign of a Real Algebraic Number. In Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, pages 238–241, New York, 1976. (PDF)

PUBLIKATIONEN - THOMAS SIMENEC

• O. Knüppel and T. Simenec. PROFIL/BIAS extensions. Technical Report 93.5, Forschungsschwerpunkt Informations- und Kommunikationstechnik, Technische Universität Hamburg-Harburg, 1993. (hdl.handle.net/11420/9419)

PUBLIKATIONEN - THOMAS TEUFEL

• M. Baesler, S. Voigt, and T. Teufel. FPGA Implementations of Radix-10 Digit Recurrence Fixed-Point and Floating-Point Dividers. International Conference on Reconfigurable Computing and FPGAs (ReConFig), 2011:13–19, 2011. (doi:10.1109/ReConFig.2011.41)
• M. Baesler, S. Voigt, and T. Teufel. A Decimal Floating-Point Accurate Scalar Product Unit with a Parallel Fixed-Point Multiplier on a Virtex-5 FPGA. International Journal of Reconfigurable Computing, 2010. (doi:10.1155/2010/357839)
• M. Baesler, S. Voigt, and T. Teufel. A Radix-10 Digit Recurrence Division Unit with a Constant Digit Selection Function. 28th IEEE International Conference on Computer Design (ICCD), pages 241–246, 2010. (doi:10.1109/ICCD.2010.5647764)
• M. Baesler, S. Voigt, and T. Teufel. An IEEE 754-2008 Decimal Parallel and Pipelined FPGA Floating-Point Multiplier. Proceedings of the 20th International Conference on Field Programmable Logic and Applications (FPL '10), pages 489–495, 2010. (doi:10.1109/FPL.2010.98)
• S. Voigt, M. Baesler, and T. Teufel. Dynamically reconfigurable dataflow architecture for high-performance digital signal processing. Journal of Systems Architecture, 56(11):561–576, 2010. Design Flows and System Architectures for Adaptive Computing on Reconfigurable Platforms. (doi:10.1016/j.sysarc.2010.07.010)
• M. Baesler and T. Teufel. FPGA Implementation of a Decimal Floating-Point Accurate Scalar Product Unit with a Parallel Fixed-Point Multiplier. International Conference on ReConFigurable Computing and FPGAs, Cancun, Mexico, 2009. (doi:10.1109/ReConFig.2009.17)
• S. Voigt and T. Teufel. Analysis of a Dynamically Reconfigurable Dataflow Architecture and its Scalable Parallel Extension for Multi-FPGA Platforms. In Proceedings of the Sixteenth IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM '08, Stanford University, CA, 2008.
• S. Voigt and T. Teufel. Dynamically Reconfigurable Dataflow Architecture for High-Performance Digital Signal Processing on Multi-FPGA Platforms. In Proceedings of the IEEE Int. Conference on Field Programmable Logic and Applications (FPL2007), pages 633–637, 2007. (doi:10.1109/FPL.2007.4380734)
• R. Rasenack and T. Teufel. Entwurf und Implementierung einer gesicherten nachrichtenbasierten Kommunikation für verteilte Anwendungen. atp, 48(10):54–62, 2006. (hdl.handle.net/11420/8865)
• T. Teufel. Neue Telematik-Dienste im ÖPNV-Bus. In IAA-Nutzfahrzeuge, 2002. (hdl.handle.net/11420/9423)
• U. Behncke and T. Teufel. Fuzzy-Logik in der Klimatechnik. atp, 42(1), 2000.
• T. Teufel. Modulare integrierter Bordrechner mit neuen Telematik-Diensten für den ÖPNV. In Inno Trans 2002, 2000. (hdl.handle.net/11420/9432)
• T. Teufel. Neuer Fahrerarbeitsplatz im ÖPHV-Bus. In International Union of Public Transport UIIP, Juni 1997.
• T. Teufel and S. Kwee. Pipeline Optimization for 32bit Floating Point Units. In Proceedings of ICSPAT '97, San Diego, USA, Sept. 1997. (hdl.handle.net/11420/9395)
• T. Teufel. A Novel VLSI Vector Arithmetic Coprocessor for Advanced DSP Applications. In Proceedings of ICSPAT '96, volume 2, pages 1894–1898, Boston, USA, October 1996. (hdl.handle.net/11420/9462)
• T. Teufel and A. Pierick. Codierung von Daten für die sichere Mobilfunkübertragung. Signal + Draht, 1996(Mai), 1996. (hdl.handle.net/11420/9461)
• T. Teufel. Genauer und trotzdem schneller - Ein neuer Coprozessor für hochgenaue Matrix- und Vektoroperationen. Elektronik, Heft 26, 1994. (hdl.handle.net/11420/9476)

PUBLIKATIONEN - SVEN-OLE VOIGT

• Daniel Kliem and Sven-Ole Voigt. An Asynchronous Bus Bridge for Partitioned Multi-SoC Architectures on FPGAs. In 23rd International Conference on Field Programmable Logic and Applications (FPL'13), Sep. 2013. (doi:10.1109/FPL.2013.6645569)
• Daniel Kliem and Sven-Ole Voigt. 2012 international conference on reconfigurable computing and fpgas, reconfig 2012, cancun, mexico, december 5-7, 2012. In ReConFig. IEEE, ISBN: 978-1-4673-2919-4, 2012. http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6410219.
• Daniel Kliem and Sven-Ole Voigt. A multi-core fpga-based soc architecture with domain segregation. In ReConFig, pages 1–7, 2012. (doi:10.1109/ReConFig.2012.6416764)
• M. Baesler, S. Voigt, and T. Teufel. FPGA Implementations of Radix-10 Digit Recurrence Fixed-Point and Floating-Point Dividers. International Conference on Reconfigurable Computing and FPGAs (ReConFig), 2011:13–19, 2011. (doi:10.1109/ReConFig.2011.41)
• M. Baesler, S. Voigt, and T. Teufel. A Decimal Floating-Point Accurate Scalar Product Unit with a Parallel Fixed-Point Multiplier on a Virtex-5 FPGA. International Journal of Reconfigurable Computing, 2010. (doi:10.1109/ICCD.2010.5647764)
• M. Baesler, S. Voigt, and T. Teufel. A Radix-10 Digit Recurrence Division Unit with a Constant Digit Selection Function. 28th IEEE International Conference on Computer Design (ICCD), pages 241–246, 2010. (doi:10.1109/ICCD.2010.5647764)
• M. Baesler, S. Voigt, and T. Teufel. An IEEE 754-2008 Decimal Parallel and Pipelined FPGA Floating-Point Multiplier. Proceedings of the 20th International Conference on Field Programmable Logic and Applications (FPL '10), pages 489–495, 2010. (doi:10.1109/FPL.2010.98)
• S. Voigt, M. Baesler, and T. Teufel. Dynamically reconfigurable dataflow architecture for high-performance digital signal processing. Journal of Systems Architecture, 56(11):561–576, 2010. Design Flows and System Architectures for Adaptive Computing on Reconfigurable Platforms. (doi:10.1016/j.sysarc.2010.07.010)
• S. Voigt. Dynamically Reconfigurable Dataflow Architecture for High-Performance Digital Signal Processing on Multi-FPGA Platforms. Dissertation. Shaker Verlag, 128 Seiten (Englisch), ISBN: 978-3-8322-7805-2, 2009. (hdl.handle.net/11420/8568)
• S. Voigt and T. Teufel. Analysis of a Dynamically Reconfigurable Dataflow Architecture and its Scalable Parallel Extension for Multi-FPGA Platforms. In Proceedings of the Sixteenth IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM '08, Stanford University, CA, 2008.
• S. Voigt and T. Teufel. Dynamically Reconfigurable Dataflow Architecture for High-Performance Digital Signal Processing on Multi-FPGA Platforms. In Proceedings of the IEEE Int. Conference on Field Programmable Logic and Applications (FPL2007), pages 633–637, 2007. (doi:10.1109/FPL.2007.4380734)

PUBLIKATIONEN - JENS ZEMKE

• J.-P.M. Zemke. Abstract Perturbed Krylov Methods. Linear Algebra and its Applications (LAA), 424:405–434, 2007. (doi:10.1016/j.laa.2007.02.011)
• J.-P. M. Zemke. Hessenberg eigenvalue-eigenmatrix relations. Linear Algebra and its Applications (LAA), 414:589–606, 2006. (doi:10.1016/j.laa.2005.11.002)
• S.M. Rump and J. Zemke. On eigenvector bounds. BIT Numerical Mathematics, 43:823–837, 2004. (PDF) (doi:10.1023/B:BITN.0000009941.51707.26)
• J. Zemke. Krylov Subspace Methods in Finite Precision: A Unified Approach. PhD thesis, Inst. f. Informatik III, Technische Universität Hamburg-Harburg, 2003. (doi:10.15480/882.8)
• J. Zemke. How Orthogonality is Lost in Krylov Methods. In G. Alefeld, J. Rohn, S. Rump, and T. Yamamoto, editors, Symbolic Algebraic Methods and Verification Methods, pages 255–266. Springer, Wien, New York, 2001. (doi:10.1007/978-3-7091-6280-4_24)
• J. Zemke. b4m : a free interval arithmetic toolbox for Matlab based on BIAS. Technical Report 99.2, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1999. (hdl.handle.net/11420/9437)
• J. Zemke. b4m - BIAS for Matlab. Technical Report, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1998.
• J.-P.M. Zemke. Symmetrien bei der numerischen Behandlung von linearen und nichtlinearen Gleichungssystemen. Master's thesis, Universität Hamburg, 1997.