A platform for research: civil engineering, architecture and urbanism
The Global Parametrix in the Riemann-Hilbert Steepest Descent Analysis for Orthogonal Polynomials
The Global Parametrix in the Riemann-Hilbert Steepest Descent Analysis for Orthogonal Polynomials
The Global Parametrix in the Riemann-Hilbert Steepest Descent Analysis for Orthogonal Polynomials
Kuijlaars, A.B.J. (author) / Mo, M.Y. (author)
COMPUTATIONAL METHODS AND FUNCTION THEORY ; 11 ; 161-178
2011-01-01
18 pages
Article (Journal)
English
DDC:
515.7
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Numerical Solution of Riemann–Hilbert Problems: Random Matrix Theory and Orthogonal Polynomials
British Library Online Contents | 2014
|A hybrid steepest descent method for a split feasibility problem in Hilbert spaces
British Library Online Contents | 2018
|Steepest Descent Day-to-Day Dynamic Toll
British Library Online Contents | 2007
|A steepest descent algorithm for circularity evaluation
Tema Archive | 2003
|Sparse Nonlinear Electromagnetic Imaging Accelerated With Projected Steepest Descent Algorithm
Online Contents | 2017
|