The infinity norm bounds and characteristic polynomial for high order RK matrices

03/08/2022
by   Gayatri Čaklović, et al.
0

This paper shows that t_m ≤𝐀_∞≤√(t_m) holds, when 𝐀∈ℝ^m × m is a Runge-Kutta matrix which nodes originating from the Gaussian quadrature that integrates polynomials of degree 2m-2 exactly. It can be shown that this is also true for the Gauss-Lobatto quadrature. Additionally, the characteristic polynomial of 𝐀, when the matrix is nonsingular, is p_A(λ) = m!t^m + (m-1)!a_m-1t^m-1 + … + a_0, where the coefficients a_i are the coefficients of the polynomial of nodes ω(t) = (t - t_1) … (t - t_m) = t^m + a_m-1t^m-1 + … + a_0.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2022

On the characteristic polynomial of the A_α-matrix for some operations of graphs

Let G be a graph of order n with adjacency matrix A(G) and diagonal matr...
research
02/06/2017

Characteristic polynomials of p-adic matrices

We analyze the precision of the characteristic polynomial of an n× n p-a...
research
05/08/2020

On determinant, other characteristic polynomial coefficients, and inverses in Clifford algebras of arbitrary dimension

In this paper, we present the formulas of different types (explicit and ...
research
07/28/2021

Contact detection between an ellipsoid and a combination of quadrics

We analyze the characteristic polynomial associated to an ellipsoid and ...
research
03/31/2018

On Attractors of Isospectral Compressions of Networks

In the recently developed theory of isospectral transformations of netwo...
research
02/08/2023

A Unified Approach to Unimodality of Gaussian Polynomials

In 2013, Pak and Panova proved the strict unimodality property of q-bino...
research
07/05/2023

A Scheme to resist Fast Correlation Attack for Word Oriented LFSR based Stream Cipher

In LFSR-based stream ciphers, the knowledge of the feedback equation of ...

Please sign up or login with your details

Forgot password? Click here to reset