Institute for Reliable Computing

Institute for Reliable Computing
Head: Prof. Dr. Siegfried M. Rump

INTLAB - INTerval LABoratory. The Matlab/Octave toolbox for Reliable Computing.

Overview Publications Software

TUHH

PUBLICATIONS - CHRISTIAN JANSSON

C. Jansson. An Alternative Approach to Probability in Quantum Information Science, 2024. (doi: 10.5772/intechopen.1005070)
C. Jansson. Conceptual basis of probability and quantum information theory, 2022. (doi: 10.15480/882.4590)
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.