“…Chebfun2 allows us to construct polynomials from interpolation data at a tensor Chebyshev grid [43], and for this example we take the interpolation data to be the Hadamard matrices H 32 and H 64 of size 32 × 32 and 64×64, i.e., we solve (1.1), where f (x i , x j ) = H 32 (i, j), g(x i , x j ) = H 64 (i, j), and x i are Chebyshev points. The Hadamard matrices contain ±1 entries and therefore, the constructed polynomials p = f and q = g (of degrees (m p , n p , m q , n q ) = (31, 31, 63, 63)) have many zero contours and common zeros.…”