The following pages link to Ezequiel Dratman (Q495062):
Displaying 17 items.
- Newton's method and a mesh-independence principle for certain semilinear boundary-value problems (Q495063) (← links)
- Robust algorithms for generalized Pham systems (Q626616) (← links)
- Partial characterization of graphs having a single large Laplacian eigenvalue (Q668039) (← links)
- On the solution of the polynomial systems arising in the discretization of certain ODEs (Q836949) (← links)
- Approximation of the solution of certain nonlinear ODEs with linear complexity (Q847187) (← links)
- Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with large absorption (Q1758415) (← links)
- Improved bounds for the inverses of diagonally dominant tridiagonal matrices (Q2002808) (← links)
- On the spectral radius of block graphs having all their blocks of the same size (Q2052182) (← links)
- Computing the determinant of the distance matrix of a bicyclic graph (Q2132376) (← links)
- On the rank of the distance matrix of graphs (Q2161884) (← links)
- On the spectral radius of block graphs with prescribed independence number \(\alpha\) (Q2229475) (← links)
- The determinant of the distance matrix of graphs with blocks at most bicyclic (Q2229502) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- On graphs with a single large Laplacian eigenvalue (Q2413188) (← links)
- Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with small absorption (Q2434924) (← links)
- On the spectral radius of unbalanced signed bipartite graphs (Q6740379) (← links)
- Singularly cospectral circulant graphs (Q6740380) (← links)
