|
 | Up a level |
Gaddam, S and Gudi, T and Porwal, K (2022) Two new approaches for solving elliptic obstacle problems using discontinuous Galerkin methods. In: BIT Numerical Mathematics, 62 (1). pp. 89-124.
Ravibabu, M and Singh, A (2020) The Least squares and line search in extracting eigenpairs in Jacobi–Davidson method. In: BIT Numerical Mathematics, 60 (4). pp. 1033-1055.
Krishnamurthy, EV and Venkateswaran, H (1981) A parallel wilf algorithm for complex zeros of a polynomial. In: BIT Numerical Mathematics, 21 (1). pp. 104-111.
