Wesley Vagner Inês Shirabayashi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Wesley Vagner Inês Shirabayashi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Emerson Vitor Castelani
Universidade Estadual de Maringá
3 shared publications - Akebo Yamakami
School of Electrical and Computer Engineering, University of Campinas, Campinas 13083-852, Brazil
2 shared publications - Francisco Nogueira Calmon Sobral
Department of Mathematics, State University of Maringá, Paraná, Brazil
2 shared publications Juliana Verga
Department of Agricultural Engineering, State University of Maringá, Cidade Gaúcha, PR, Brazil
1 shared publication- Juliana Verga Shirabayashi
Department of Production Engineering, Federal University of Paraná, Jandaia do Sul, Brazil
1 shared publication - Luiz Antonio Farani de Souza
Universidade Tecnológica Federal do Paraná
1 shared publication
Latest Publications
- Open Access
- 7 April 2021
- Published by Universidade Estadual de Londrina in Semina: Ciências Exatas e Tecnológicas
- Vol. 42 (1) , 63-74
Adaptation of the Newton-Raphson and Potra-Pták methods for the solution of nonlinear systems
In this paper we adapt the Newton-Raphson and Potra-Pták algorithms by combining them with the modified Newton-Raphson method by inserting a condition. Problems of systems of sparse nonlinear equations are solved the algorithms implemented in Matlab® environment. In addition, the methods are adapted and applied to space trusses problems with geometric nonlinear behavior. Structures are discretized by the Finite Element Positional Method, and nonlinear responses are obtained in an incremental and iterative process using the Linear Arc-Length path-following technique. For the studied problems, the proposed algorithms had good computational performance reaching the solution with shorter processing time and fewer iterations until convergence to a given tolerance, when compared to the standard algorithms of the Newton-Raphson and Potra-Pták methods.
- 7 April 2021
- Published by Universidade Estadual de Londrina in Semina: Ciências Exatas e Tecnológicas
- Vol. 42 (1) , 63-74
Open AccessAdaptation of the Newton-Raphson and Potra-Pták methods for the solution of nonlinear systems
In this paper we adapt the Newton-Raphson and Potra-Pták algorithms by combining them with the modified Newton-Raphson method by inserting a condition. Problems of systems of sparse nonlinear equations are solved the algorithms implemented in Matlab® environment. In addition, the methods are adapted and applied to space trusses problems with geometric nonlinear behavior. Structures are discretized by the Finite Element Positional Method, and nonlinear responses are obtained in an incremental and iterative process using the Linear Arc-Length path-following technique. For the studied problems, the proposed algorithms had good computational performance reaching the solution with shorter processing time and fewer iterations until convergence to a given tolerance, when compared to the standard algorithms of the Newton-Raphson and Potra-Pták methods.
- 4 January 2021
- Published by Springer Nature in Journal of Global Optimization
- Vol. 80 (2) , 387-414
A robust method based on LOVO functions for solving least squares problems
- 4 January 2021
- Published by Springer Nature in Journal of Global Optimization
- Vol. 80 (2) , 387-414
A robust method based on LOVO functions for solving least squares problems
- Open Access
- 2 July 2019
- Published by The Open Journal in Journal of Open Source Software
- Vol. 4 (39)
RAFF.jl: Robust Algebraic Fitting Function in Julia
- 2 July 2019
- Published by The Open Journal in Journal of Open Source Software
- Vol. 4 (39)
Open AccessRAFF.jl: Robust Algebraic Fitting Function in Julia
- Open Access
- 25 August 2015
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC)
- Vol. 3 (1)
Algoritmo de caminho mınimo para grafos coloridos aplicado a redes de transporte multimodal
Este trabalho apresenta um algoritmo para o problema de caminho mínimo em grafos coloridos baseado no algoritmo clássico de Ford-Moore-Bellman e aplicado a redes de transporte multimodal, onde cada modo de transporte considerado é representado por uma cor, podendo ter vários arcos entre dois nós do grafo. Durante o procedimento de resolução, o método detecta se houve mudança de modo e um custo referente a esta mudança é acrescentado no caminho, ao final temos um caminho mínimo multimodal com informação de qual modo foi utilizado para percorrer cada arco do caminho. Testes computacionais foram feitos a fim de comprovar a viabilidade do algoritmo proposto.
- 25 August 2015
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC)
- Vol. 3 (1)
Open AccessAlgoritmo de caminho mınimo para grafos coloridos aplicado a redes de transporte multimodal
Este trabalho apresenta um algoritmo para o problema de caminho mínimo em grafos coloridos baseado no algoritmo clássico de Ford-Moore-Bellman e aplicado a redes de transporte multimodal, onde cada modo de transporte considerado é representado por uma cor, podendo ter vários arcos entre dois nós do grafo. Durante o procedimento de resolução, o método detecta se houve mudança de modo e um custo referente a esta mudança é acrescentado no caminho, ao final temos um caminho mínimo multimodal com informação de qual modo foi utilizado para percorrer cada arco do caminho. Testes computacionais foram feitos a fim de comprovar a viabilidade do algoritmo proposto.
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 38, 801-806
Using the fuzzy sets theory in the multimodal transport network problem
In this work, an approach to solve multimodal transport network problems with uncertain costs in the edges is proposed. This kind of problem has been studied for several researchers who search solutions to the large numbers of problems relating on the transport systems like: traffic jam, pollution, delays, among others. In this work, the modelling of this problems is based on graph theory are presented, where each transport mode is represented by a subgraph and the whole graph is the union of all subgraphs. Besides, its mathematical formulation describes nonlinear conditions and the goal is to develop an algorithm that reaches a set of Pareto solutions, which find the best routes between origin and destination. A numerical example is used to illustrate the efficiency of the proposed approach.
- 1 June 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 38, 801-806
Using the fuzzy sets theory in the multimodal transport network problem
In this work, an approach to solve multimodal transport network problems with uncertain costs in the edges is proposed. This kind of problem has been studied for several researchers who search solutions to the large numbers of problems relating on the transport systems like: traffic jam, pollution, delays, among others. In this work, the modelling of this problems is based on graph theory are presented, where each transport mode is represented by a subgraph and the whole graph is the union of all subgraphs. Besides, its mathematical formulation describes nonlinear conditions and the goal is to develop an algorithm that reaches a set of Pareto solutions, which find the best routes between origin and destination. A numerical example is used to illustrate the efficiency of the proposed approach.