diff options
author | Thales Lima Oliveira <thaleslima.ufu@gmail.com> | 2017-10-06 17:07:39 -0300 |
---|---|---|
committer | GitHub <noreply@github.com> | 2017-10-06 17:07:39 -0300 |
commit | a32372968abb2f4b3bf0472f59c18f5028d20206 (patch) | |
tree | 054de50365749426623bed352a10e84299e84cad /Project/TransferFunction.cpp | |
parent | fa2776e9a939a793a9e46a0cc5880dda868e7028 (diff) | |
parent | 89befdb9b259d02249876e39ec6fd28860272439 (diff) | |
download | PSP.git-a32372968abb2f4b3bf0472f59c18f5028d20206.tar.gz PSP.git-a32372968abb2f4b3bf0472f59c18f5028d20206.tar.xz PSP.git-a32372968abb2f4b3bf0472f59c18f5028d20206.zip |
Merge pull request #39 from Thales1330/wip/sync-machine-saturation
Wip sync machine saturation
Diffstat (limited to 'Project/TransferFunction.cpp')
-rw-r--r-- | Project/TransferFunction.cpp | 20 |
1 files changed, 19 insertions, 1 deletions
diff --git a/Project/TransferFunction.cpp b/Project/TransferFunction.cpp index b91627a..ed6640a 100644 --- a/Project/TransferFunction.cpp +++ b/Project/TransferFunction.cpp @@ -1,3 +1,20 @@ +/* + * Copyright (C) 2017 Thales Lima Oliveira <thales@ufu.br> + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 2 of the License, or + * any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program. If not, see <https://www.gnu.org/licenses/>. + */ + #include "TransferFunction.h" #include "TransferFunctionForm.h" @@ -256,7 +273,8 @@ void TransferFunction::CalculateSpaceState(int maxIteration, double error) int order = static_cast<int>(m_denominator.size()); std::vector<double> denominator = m_denominator; std::vector<double> numerator; - + + //[Ref.] http://lpsa.swarthmore.edu/Representations/SysRepTransformations/TF2SS.html int k = order; for(int i = 0; i < order; i++) { int numIndex = i - (order - static_cast<int>(m_numerator.size())); |