Trond Steihaug

Orcid: 0000-0003-1734-4638

According to our database1, Trond Steihaug authored at least 44 papers between 1982 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Fibonacci and digit-by-digit computation; An example of reverse engineering in computational mathematics.
CoRR, 2022

A Story of Computational Science: Colonel Titus' Problem from the 17th Century.
Axioms, 2022

2020
Computational science in the eighteenth century. Test cases for the methods of Newton, Raphson, and Halley: 1685 to 1745.
Numer. Algorithms, 2020

2019
Approximating cube roots of integers, after Heron's Metrica III.20.
CoRR, 2019

2018
A parametrized stock-recruitment relationship derived from a slow-fast population dynamic model.
Math. Comput. Simul., 2018

2016
On the final steps of Newton and higher order methods.
Optim. Lett., 2016

2015
Derivative-Free Optimization for Population Dynamic Models.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

2014
A subclass of generating set search with convergence to second-order stationary points.
Optim. Methods Softw., 2014

Algorithm for forming derivative-free optimal methods.
Numer. Algorithms, 2014

2013
Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem.
Optim. Methods Softw., 2013

Optimal direct determination of sparse Jacobian matrices.
Optim. Methods Softw., 2013

Solving trust-region subproblem augmented with linear inequality constraints.
Optim. Methods Softw., 2013

Global convergence and the Powell singular function.
J. Glob. Optim., 2013

Graph models and their efficient implementation for sparse Jacobian matrix determination.
Discret. Appl. Math., 2013

Adaptive Curve Tailoring.
Proceedings of the Information Sciences and Systems 2013, 2013

2012
Sparsity in higher order methods for unconstrained optimization.
Optim. Methods Softw., 2012

On diagonally structured problems in unconstrained optimization using an inexact super Halley method.
J. Comput. Appl. Math., 2012

Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term.
J. Comput. Appl. Math., 2012

Structured computation in optimization and algorithmic differentiation.
ACM Commun. Comput. Algebra, 2012

Structure in Optimization: Factorable Programming and Functions.
Proceedings of the Computer and Information Sciences III, 2012

2011
A Class of Methods Combining L-BFGS and Truncated Newton.
Proceedings of the Computer and Information Sciences II, 2011

2010
Kernel-function Based Primal-Dual Algorithms for <i>P</i> <sub> * </sub>( <i>κ</i>) Linear Complementarity Problems.
RAIRO Oper. Res., 2010

On large-scale unconstrained optimization problems and higher order methods.
Optim. Methods Softw., 2010

A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions.
Optim. Methods Softw., 2010

2009
Primal-dual interior-point methods solver based on kernel functions for Linear Optimization.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2009

The CPR Method and Beyond : Prologue.
Proceedings of the Combinatorial Scientific Computing, 01.02. - 06.02.2009, 2009

2008
Graph coloring in the estimation of sparse derivative matrices: Instances and applications.
Discret. Appl. Math., 2008

Primal-dual algorithm for linear optimization problems based on a new class of kernel functions.
Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC 2008), 2008

2007
A generating set search method using curvature information.
Comput. Optim. Appl., 2007

2005
Aggregating Variables for Asynchronous Iterations.
Parallel Process. Lett., 2005

On the Convergence of an Inexact Primal-Dual Interior Point Method for Linear Programming.
Proceedings of the Large-Scale Scientific Computing, 5th International Conference, 2005

Generating a Synthetic Diffusion Tensor Dataset.
Proceedings of the 18th IEEE Symposium on Computer-Based Medical Systems (CBMS 2005), 2005

2004
Data structures in Java for matrix computations.
Concurr. Pract. Exp., 2004

Reducing the Deteriorating Effect of Old History in Asynchronous Iterations.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
On The Use of Java Arrays for Sparse Matrix Computations.
Proceedings of the Parallel Computing: Software Technology, 2003

2002
Sparsity issues in the computation of Jacobian matrices.
Proceedings of the Symbolic and Algebraic Computation, 2002

2000
An Analytical Model for a Class of Architectures under Master-Slave Paradigm.
Proceedings of the High-Performance Computing and Networking, 8th International Conference, 2000

1999
Computational Issues for a New Class of Preconditioners.
Proceedings of the Large-Scale Scientific Computation for Engineering and Environmental Problems, 1999

Application of a Class of Preconditioners to Large Scale Linear Programming Problems.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1997
Deteriorating Convergence for Asynchronous Methods on Linear Least Sqare Problems.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1985
A Test Problem Generator for Large-Scale Unconstrained Optimization.
ACM Trans. Math. Softw., 1985

1983
Local and superlinear convergence for truncated iterated projections methods.
Math. Program., 1983

Truncated-newtono algorithms for large-scale unconstrained optimization.
Math. Program., 1983

1982
Practical methods of optimization volume 1 : Unconstrained optimization, by R. Flet-cher, Wiley, New York, 1980, 120 pp. Price: $24.50.
Networks, 1982


  Loading...