scispace - formally typeset
P

Piotr Kowalczyk

Researcher at Gdańsk University of Technology

Publications -  52
Citations -  367

Piotr Kowalczyk is an academic researcher from Gdańsk University of Technology. The author has contributed to research in topics: Finite element method & Impedance parameters. The author has an hindex of 10, co-authored 52 publications receiving 301 citations. Previous affiliations of Piotr Kowalczyk include University of Gdańsk.

Papers
More filters

Advances in computational electrodynamics.

TL;DR: Artykul prezentuje wybrane metody, ktore są rozwijane w Politechnice Gdanskiej, i ktores mogą byc wykorzystane do przyspieszenia komputerowego projektowania ukladow mikrofalowych and analizy numerycznej ukladows niskiej i duzej czestotliwości as discussed by the authors.
Journal ArticleDOI

Complex Root Finding Algorithm Based on Delaunay Triangulation

TL;DR: A simple and flexible algorithm for finding zeros of a complex function is presented, based on sampling the function at nodes of a regular or a self-adaptive mesh and on the analysis of the function sign changes, which creates a set of candidate points.
Journal ArticleDOI

On root finding algorithms for complex functions with branch cuts

TL;DR: A simple and versatile method is presented, which enhances the complex root finding process by eliminating branch cuts and branch points in the analyzed domain and can significantly improve the efficiency (as well as the effectiveness) of the root finding algorithms.
Journal ArticleDOI

Global Complex Roots and Poles Finding Algorithm Based on Phase Analysis for Propagation and Radiation Problems

TL;DR: In this paper, a flexible and effective algorithm for complex roots and poles finding is presented, which is based on sampling a function at the nodes of a regular mesh, and on the analysis of the function phase.
Journal ArticleDOI

Global Complex Roots and Poles Finding Algorithm Based on Phase Analysis for Propagation and Radiation Problems

TL;DR: In this paper, a flexible and effective algorithm for complex roots and poles finding is presented, which is based on sampling a function at the nodes of a regular mesh, and on the analysis of the function phase.