Catálogo de publicaciones - libros

Compartir en
redes sociales

Computational Electromagnetics

Anders Bondeson Thomas Rylander Pär Ingelström

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

Applications of Mathematics; Optics and Electrodynamics; Computational Science and Engineering; Electrical Engineering; Mathematics of Computing

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2005 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-0-387-26158-4

ISBN electrónico

978-0-387-26160-7

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Springer Science+Business Media, Inc. 2005

Cobertura temática

matematica

Matemáticas

Tabla de contenidos

doi: 10.1007/0-387-26160-5_1

Introduction

Anders Bondeson; Thomas Rylander; Pär Ingelström

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 1-9

doi: 10.1007/0-387-26160-5_2

Convergence

Anders Bondeson; Thomas Rylander; Pär Ingelström

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 11-17

doi: 10.1007/0-387-26160-5_3

Finite Differences

Anders Bondeson; Thomas Rylander; Pär Ingelström

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 19-35

doi: 10.1007/0-387-26160-5_4

Eigenvalues

Anders Bondeson; Thomas Rylander; Pär Ingelström

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 37-55

doi: 10.1007/0-387-26160-5_5

The Finite-Difference Time-Domain Method

Anders Bondeson; Thomas Rylander; Pär Ingelström

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 57-86

doi: 10.1007/0-387-26160-5_6

The Finite Element Method

Anders Bondeson; Thomas Rylander; Pär Ingelström

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 87-151

doi: 10.1007/0-387-26160-5_7

The Method of Moments

Anders Bondeson; Thomas Rylander; Pär Ingelström

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 153-189

doi: 10.1007/0-387-26160-5_8

Summary and Overview

Anders Bondeson; Thomas Rylander; Pär Ingelström

We introduce -synchronous relations for a rational number . We show that if a rational relation is both - and ′-synchronous for two different numbers and ′, then it is recognizable. We give a synchronization algorithm for -synchronous transducers. We also prove the closure under boolean operations and composition of -synchronous relations.

Pp. 191-199