diff --git a/Utilities/ITK/Utilities/vxl/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/CMakeLists.txt
index 10be92f47dd442d605e592df1e48c452119e6558..71dc02ff7f05ed0e38daf84be2cf92240d9c1d55 100644
--- a/Utilities/ITK/Utilities/vxl/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/CMakeLists.txt
@@ -3,12 +3,6 @@ PROJECT(vxl)
INCLUDE_REGULAR_EXPRESSION("^.*$")
-IF(NOT ITK_SOURCE_DIR)
- SET(BUILD_TESTING 1)
- SET(LIBRARY_OUTPUT_PATH ${vxl_BINARY_DIR}/bin)
- SET(EXECUTABLE_OUTPUT_PATH ${vxl_BINARY_DIR}/bin)
-ENDIF(NOT ITK_SOURCE_DIR)
-
# CMake support directory.
INCLUDE(${vxl_SOURCE_DIR}/config/cmake/config/vxl_utils.cmake)
SET(VXL_CMAKE_DIR ${vxl_SOURCE_DIR}/config/cmake/Modules)
@@ -22,20 +16,25 @@ SUBDIRS(vcl v3p core)
# Standard include directories.
SET(VXLCORE_INCLUDE_DIR ${vxl_BINARY_DIR}/core ${vxl_SOURCE_DIR}/core)
-SET(VXLCORE_INSTALL_INCLUDE_DIR ${CMAKE_INSTALL_PREFIX}/include/vxl/core)
SET(VCL_INCLUDE_DIR ${vxl_BINARY_DIR}/vcl ${vxl_SOURCE_DIR}/vcl)
-SET(VCL_INSTALL_INCLUDE_DIR ${CMAKE_INSTALL_PREFIX}/include/vxl/vcl)
INCLUDE_DIRECTORIES(${VCL_INCLUDE_DIR} ${VXLCORE_INCLUDE_DIR})
-SET(VXL_INSTALL_ROOT ${ITK_INSTALL_INCLUDE_DIR}/Utilities/vxl)
-SET(VXL_INSTALL_LIB_DIR ${ITK_INSTALL_LIB_DIR})
-SET(VXL_INSTALL_BIN_DIR ${ITK_INSTALL_BIN_DIR})
-SET(VXL_INSTALL_NO_DEVELOPMENT ${ITK_INSTALL_NO_DEVELOPMENT})
-SET(VXL_INSTALL_NO_LIBRARIES ${ITK_INSTALL_NO_LIBRARIES})
-
-STRING(REGEX REPLACE "^/" "" VXL_INSTALL_LIB_DIR_CM24 "${VXL_INSTALL_LIB_DIR}")
-STRING(REGEX REPLACE "^/" "" VXL_INSTALL_BIN_DIR_CM24 "${VXL_INSTALL_BIN_DIR}")
+IF(NOT VXL_INSTALL_EXPORT_NAME)
+ SET(VXL_INSTALL_EXPORT_NAME VXL-targets)
+ENDIF()
+IF(NOT VXL_INSTALL_RUNTIME_DIR)
+ SET(VXL_INSTALL_RUNTIME_DIR bin)
+ENDIF()
+IF(NOT VXL_INSTALL_LIBRARY_DIR)
+ SET(VXL_INSTALL_LIBRARY_DIR lib)
+ENDIF()
+IF(NOT VXL_INSTALL_ARCHIVE_DIR)
+ SET(VXL_INSTALL_ARCHIVE_DIR lib)
+ENDIF()
+IF(NOT VXL_INSTALL_INCLUDE_DIR)
+ SET(VXL_INSTALL_INCLUDE_DIR include)
+ENDIF()
IF(WIN32)
IF(NOT UNIX)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/mex/CMakeSystemConfig.cmake.in b/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/mex/CMakeSystemConfig.cmake.in
index 737374caeb0e0a51746da714d5e2f7a3c3882810..3dd66a465ece4754f3cb4ef913dc03410af5621a 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/mex/CMakeSystemConfig.cmake.in
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/mex/CMakeSystemConfig.cmake.in
@@ -5,7 +5,6 @@
SET (CMAKE_INSTALL_PREFIX @prefix@ CACHE PATH
"Install path prefix, prepended onto install directories")
SET (CMAKE_WORDS_BIGENDIAN @CMAKE_WORDS_BIGENDIAN@ )
-SET (CMAKE_USE_SPROC @CMAKE_USE_SPROC@ CACHE BOOL "Use sproc libs.")
SET (CMAKE_USE_PTHREADS @CMAKE_USE_PTHREADS@ CACHE BOOL
"Use the pthreads library")
SET (CMAKE_USE_WIN32_THREADS @CMAKE_USE_WIN32_THREADS@ CACHE BOOL
@@ -70,7 +69,6 @@ FIND_PROGRAM(CMAKE_MAKE_PROGRAM NAMES gmake make )
MARK_AS_ADVANCED(
CMAKE_X_LIBS
CMAKE_USE_WIN32_THREADS
-CMAKE_USE_SPROC
CMAKE_USE_PTHREADS
CMAKE_SHLIB_SUFFIX
CMAKE_MODULE_SUFFIX
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/DLLHeader.dsptemplate b/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/DLLHeader.dsptemplate
index a7f3ad59983c72661aeaa8b021a92b31a38d1c51..83494f5fce5e44bcd28bfca9c89871e18960492b 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/DLLHeader.dsptemplate
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/DLLHeader.dsptemplate
@@ -1,141 +1,141 @@
-# Microsoft Developer Studio Project File - Name="OUTPUT_LIBNAME" - Package Owner=<4>
-# Microsoft Developer Studio Generated Build File, Format Version 6.00
-# ** DO NOT EDIT **
-
-# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
-
-CFG=OUTPUT_LIBNAME - Win32 Debug
-!MESSAGE This is not a valid makefile. To build this project using NMAKE,
-!MESSAGE use the Export Makefile command and run
-!MESSAGE
-!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak".
-!MESSAGE
-!MESSAGE You can specify a configuration when running NMAKE
-!MESSAGE by defining the macro CFG on the command line. For example:
-!MESSAGE
-!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak" CFG="OUTPUT_LIBNAME - Win32 Debug"
-!MESSAGE
-!MESSAGE Possible choices for configuration are:
-!MESSAGE
-!MESSAGE "OUTPUT_LIBNAME - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
-!MESSAGE "OUTPUT_LIBNAME - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
-!MESSAGE "OUTPUT_LIBNAME - Win32 MinSizeRel" (based on "Win32 (x86) Dynamic-Link Library")
-!MESSAGE
-
-# ITK DSP Header file
-# This file is read by the build system of itk, and is used as the top part of
-# a microsoft project dsp header file
-# IF this is in a dsp file, then it is not the header, but has
-# already been used, so do not edit here...
-
-# variables to REPLACE
-#
-# BUILD_INCLUDES == include path
-# EXTRA_DEFINES == compiler defines
-# LIBRARY_OUTPUT_PATH == override in output directory
-# OUTPUT_LIBNAME == name of output library
-
-# Begin Project
-# PROP AllowPerConfigDependencies 0
-# PROP Scc_ProjName ""
-# PROP Scc_LocalPath ""
-CPP=cl.exe
-MTL=midl.exe
-RSC=rc.exe
-
-!IF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Release"
-
-# PROP BASE Use_MFC 0
-# PROP BASE Use_Debug_Libraries 0
-# PROP BASE Output_Dir "Release"
-# PROP BASE Intermediate_Dir "Release"
-# PROP BASE Target_Dir ""
-# PROP Use_MFC 0
-# PROP Use_Debug_Libraries 0
-# PROP Output_Dir "LIBRARY_OUTPUT_PATHRelease"
-# PROP Intermediate_Dir "Release"
-# PROP Ignore_Export_Lib 0
-# PROP Target_Dir ""
-# ADD BASE CPP /nologo /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "OUTPUT_LIBNAME_EXPORTS" /FD /c
-# ADD CPP /nologo /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /FD /c
-# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
-# ADD CPP CMAKE_CXX_FLAGS
-# ADD CPP CMAKE_CXX_FLAGS_RELEASE
-# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
-# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
-# ADD BASE RSC /l 0x409 /d "NDEBUG"
-# ADD RSC /l 0x409 /d "NDEBUG"
-BSC32=bscmake.exe
-# ADD BASE BSC32 /nologo
-# ADD BSC32 /nologo
-LINK32=link.exe
-# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386
-# ADD LINK32 CM_OPTIMIZED_LIBRARIES CM_LIBRARIES kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386
-
-!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Debug"
-
-# PROP BASE Use_MFC 0
-# PROP BASE Use_Debug_Libraries 1
-# PROP BASE Output_Dir "Debug"
-# PROP BASE Intermediate_Dir "Debug"
-# PROP BASE Target_Dir ""
-# PROP Use_MFC 0
-# PROP Use_Debug_Libraries 1
-# PROP Output_Dir "LIBRARY_OUTPUT_PATHDebug"
-# PROP Intermediate_Dir "Debug"
-# PROP Ignore_Export_Lib 0
-# PROP Target_Dir ""
-# ADD BASE CPP /nologo /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "OUTPUT_LIBNAME_EXPORTS" /FD /c
-# ADD CPP /nologo /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /FD /c
-# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
-# ADD CPP CMAKE_CXX_FLAGS
-# ADD CPP CMAKE_CXX_FLAGS_DEBUG
-# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32
-# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
-# ADD BASE RSC /l 0x409 /d "_DEBUG"
-# ADD RSC /l 0x409 /d "_DEBUG"
-BSC32=bscmake.exe
-# ADD BASE BSC32 /nologo
-# ADD BSC32 /nologo
-LINK32=link.exe
-# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept
-# ADD LINK32 CM_DEBUG_LIBRARIES CM_LIBRARIES kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept
-
-!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 MinSizeRel"
-
-# PROP BASE Use_MFC 0
-# PROP BASE Use_Debug_Libraries 0
-# PROP BASE Output_Dir "MinSizeRel"
-# PROP BASE Intermediate_Dir "MinSizeRel"
-# PROP BASE Ignore_Export_Lib 0
-# PROP BASE Target_Dir ""
-# PROP Use_MFC 0
-# PROP Use_Debug_Libraries 0
-# PROP Output_Dir "LIBRARY_OUTPUT_PATHMinSizeRel"
-# PROP Intermediate_Dir "MinSizeRel"
-# PROP Ignore_Export_Lib 0
-# PROP Target_Dir ""
-# ADD BASE CPP /nologo /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /FD /c
-# SUBTRACT BASE CPP /YX
-# ADD CPP /nologo /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /FD /c
-# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
-# ADD CPP CMAKE_CXX_FLAGS
-# ADD CPP CMAKE_CXX_FLAGS_MINSIZEREL
-# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
-# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
-# ADD BASE RSC /l 0x409 /d "NDEBUG"
-# ADD RSC /l 0x409 /d "NDEBUG"
-BSC32=bscmake.exe
-# ADD BASE BSC32 /nologo
-# ADD BSC32 /nologo
-LINK32=link.exe
-# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /stack:0x989680 /dll /machine:I386
-# ADD LINK32 CM_OPTIMIZED_LIBRARIES CM_LIBRARIES kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /stack:0x989680 /dll /machine:I386
-
-!ENDIF
-
-# Begin Target
-
-# Name "OUTPUT_LIBNAME - Win32 Release"
-# Name "OUTPUT_LIBNAME - Win32 Debug"
-# Name "OUTPUT_LIBNAME - Win32 MinSizeRel"
+# Microsoft Developer Studio Project File - Name="OUTPUT_LIBNAME" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
+
+CFG=OUTPUT_LIBNAME - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE
+!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak".
+!MESSAGE
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE
+!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak" CFG="OUTPUT_LIBNAME - Win32 Debug"
+!MESSAGE
+!MESSAGE Possible choices for configuration are:
+!MESSAGE
+!MESSAGE "OUTPUT_LIBNAME - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "OUTPUT_LIBNAME - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "OUTPUT_LIBNAME - Win32 MinSizeRel" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE
+
+# ITK DSP Header file
+# This file is read by the build system of itk, and is used as the top part of
+# a microsoft project dsp header file
+# IF this is in a dsp file, then it is not the header, but has
+# already been used, so do not edit here...
+
+# variables to REPLACE
+#
+# BUILD_INCLUDES == include path
+# EXTRA_DEFINES == compiler defines
+# LIBRARY_OUTPUT_PATH == override in output directory
+# OUTPUT_LIBNAME == name of output library
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+MTL=midl.exe
+RSC=rc.exe
+
+!IF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "LIBRARY_OUTPUT_PATHRelease"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "OUTPUT_LIBNAME_EXPORTS" /FD /c
+# ADD CPP /nologo /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /FD /c
+# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
+# ADD CPP CMAKE_CXX_FLAGS
+# ADD CPP CMAKE_CXX_FLAGS_RELEASE
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386
+# ADD LINK32 CM_OPTIMIZED_LIBRARIES CM_LIBRARIES kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386
+
+!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "LIBRARY_OUTPUT_PATHDebug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "OUTPUT_LIBNAME_EXPORTS" /FD /c
+# ADD CPP /nologo /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /FD /c
+# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
+# ADD CPP CMAKE_CXX_FLAGS
+# ADD CPP CMAKE_CXX_FLAGS_DEBUG
+# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 CM_DEBUG_LIBRARIES CM_LIBRARIES kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept
+
+!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 MinSizeRel"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "MinSizeRel"
+# PROP BASE Intermediate_Dir "MinSizeRel"
+# PROP BASE Ignore_Export_Lib 0
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "LIBRARY_OUTPUT_PATHMinSizeRel"
+# PROP Intermediate_Dir "MinSizeRel"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /FD /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /FD /c
+# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
+# ADD CPP CMAKE_CXX_FLAGS
+# ADD CPP CMAKE_CXX_FLAGS_MINSIZEREL
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /stack:0x989680 /dll /machine:I386
+# ADD LINK32 CM_OPTIMIZED_LIBRARIES CM_LIBRARIES kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /stack:0x989680 /dll /machine:I386
+
+!ENDIF
+
+# Begin Target
+
+# Name "OUTPUT_LIBNAME - Win32 Release"
+# Name "OUTPUT_LIBNAME - Win32 Debug"
+# Name "OUTPUT_LIBNAME - Win32 MinSizeRel"
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/EXEHeader.dsptemplate b/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/EXEHeader.dsptemplate
index cb11378db5c7bbd5ce9b30e31d9f0ae63f79203f..18d2042e2f420426d4f458650a6798cd325d12ca 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/EXEHeader.dsptemplate
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/EXEHeader.dsptemplate
@@ -1,137 +1,137 @@
-# Microsoft Developer Studio Project File - Name="pcbuilder" - Package Owner=<4>
-# Microsoft Developer Studio Generated Build File, Format Version 6.00
-# ** DO NOT EDIT **
-
-# CM DSP Header file
-# This file is read by the build system of cm, and is used as the top part of
-# a microsoft project dsp header file
-# IF this is in a dsp file, then it is not the header, but has
-# already been used, so do not edit here...
-
-# variables to REPLACE
-#
-# BUILD_INCLUDES == include path
-# EXECUTABLE_OUTPUT_PATH == override in output directory
-# EXTRA_DEFINES == compiler defines
-# OUTPUT_LIBNAME == name of output library
-# CM_LIBRARIES == libraries linked in
-# TARGTYPE "Win32 (x86) Application" 0x0103
-
-CFG=OUTPUT_LIBNAME - Win32 Debug
-!MESSAGE This is not a valid makefile. To build this project using NMAKE,
-!MESSAGE use the Export Makefile command and run
-!MESSAGE
-!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak".
-!MESSAGE
-!MESSAGE You can specify a configuration when running NMAKE
-!MESSAGE by defining the macro CFG on the command line. For example:
-!MESSAGE
-!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak" CFG="OUTPUT_LIBNAME - Win32 Debug"
-!MESSAGE
-!MESSAGE Possible choices for configuration are:
-!MESSAGE
-!MESSAGE "OUTPUT_LIBNAME - Win32 Release" (based on "Win32 (x86) Application")
-!MESSAGE "OUTPUT_LIBNAME - Win32 Debug" (based on "Win32 (x86) Application")
-!MESSAGE "OUTPUT_LIBNAME - Win32 MinSizeRel" (based on "Win32 (x86) Application")
-!MESSAGE
-
-# Begin Project
-# PROP AllowPerConfigDependencies 0
-# PROP Scc_ProjName ""
-# PROP Scc_LocalPath ""
-CPP=cl.exe
-MTL=midl.exe
-RSC=rc.exe
-
-!IF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Release"
-
-# PROP BASE Use_MFC 2
-# PROP BASE Use_Debug_Libraries 0
-# PROP BASE Output_Dir "Release"
-# PROP BASE Intermediate_Dir "Release"
-# PROP BASE Target_Dir ""
-# PROP Use_MFC 2
-# PROP Use_Debug_Libraries 0
-# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHRelease"
-# PROP Intermediate_Dir "Release"
-# PROP Target_Dir ""
-# ADD BASE CPP /nologo /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /FD /c
-# ADD CPP /nologo /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "_AFXDLL" /FD /c
-# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
-# ADD CPP CMAKE_CXX_FLAGS
-# ADD CPP CMAKE_CXX_FLAGS_RELEASE
-# ADD BASE RSC /l 0x409 /d "NDEBUG"
-# ADD RSC /l 0x409 /d "NDEBUG" /d "_AFXDLL"
-BSC32=bscmake.exe
-# ADD BASE BSC32 /nologo
-# ADD BSC32 /nologo
-LINK32=link.exe
-# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /IGNORE:4089
-# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /IGNORE:4089
-CM_MULTILINE_OPTIMIZED_LIBRARIES
-CM_MULTILINE_LIBRARIES
-
-!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Debug"
-
-# PROP BASE Use_MFC 2
-# PROP BASE Use_Debug_Libraries 1
-# PROP BASE Output_Dir "Debug"
-# PROP BASE Intermediate_Dir "Debug"
-# PROP BASE Target_Dir ""
-# PROP Use_MFC 2
-# PROP Use_Debug_Libraries 1
-# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHDebug"
-# PROP Intermediate_Dir "Debug"
-# PROP Target_Dir ""
-# ADD BASE CPP /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c
-# ADD CPP /nologo /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "_AFXDLL" /FD /GZ /c
-# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
-# ADD CPP CMAKE_CXX_FLAGS
-# ADD CPP CMAKE_CXX_FLAGS_DEBUG
-# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32
-# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
-# ADD BASE RSC /l 0x409 /d "_DEBUG"
-# ADD RSC /l 0x409 /d "_DEBUG" /d "_AFXDLL"
-BSC32=bscmake.exe
-# ADD BASE BSC32 /nologo
-# ADD BSC32 /nologo
-LINK32=link.exe
-# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /IGNORE:4089
-# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /IGNORE:4089
-CM_MULTILINE_DEBUG_LIBRARIES
-CM_MULTILINE_LIBRARIES
-
-!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 MinSizeRel"
-# PROP BASE Use_MFC 2
-# PROP BASE Use_Debug_Libraries 0
-# PROP BASE Output_Dir "MinSizeRel"
-# PROP BASE Intermediate_Dir "MinSizeRel"
-# PROP BASE Target_Dir ""
-# PROP Use_MFC 2
-# PROP Use_Debug_Libraries 0
-# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHMinSizeRel"
-# PROP Intermediate_Dir "MinSizeRel"
-# PROP Target_Dir ""
-# ADD BASE CPP /nologo /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /FD /c
-# ADD CPP /nologo /D "WIN32" BUILD_INCLUDES EXTRA_DEFINES /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "_AFXDLL" /FD /c
-# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
-# ADD CPP CMAKE_CXX_FLAGS
-# ADD CPP CMAKE_CXX_FLAGS_MINSIZEREL
-# ADD BASE RSC /l 0x409 /d "NDEBUG"
-# ADD RSC /l 0x409 /d "NDEBUG" /d "_AFXDLL"
-BSC32=bscmake.exe
-# ADD BASE BSC32 /nologo
-# ADD BSC32 /nologo
-LINK32=link.exe
-# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /IGNORE:4089
-# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /IGNORE:4089
-CM_MULTILINE_OPTIMIZED_LIBRARIES
-CM_MULTILINE_LIBRARIES
-
-!ENDIF
-
-# Begin Target
-
-# Name "OUTPUT_LIBNAME - Win32 Release"
-# Name "OUTPUT_LIBNAME - Win32 Debug"
-# Name "OUTPUT_LIBNAME - Win32 MinSizeRel"
+# Microsoft Developer Studio Project File - Name="pcbuilder" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# CM DSP Header file
+# This file is read by the build system of cm, and is used as the top part of
+# a microsoft project dsp header file
+# IF this is in a dsp file, then it is not the header, but has
+# already been used, so do not edit here...
+
+# variables to REPLACE
+#
+# BUILD_INCLUDES == include path
+# EXECUTABLE_OUTPUT_PATH == override in output directory
+# EXTRA_DEFINES == compiler defines
+# OUTPUT_LIBNAME == name of output library
+# CM_LIBRARIES == libraries linked in
+# TARGTYPE "Win32 (x86) Application" 0x0103
+
+CFG=OUTPUT_LIBNAME - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE
+!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak".
+!MESSAGE
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE
+!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak" CFG="OUTPUT_LIBNAME - Win32 Debug"
+!MESSAGE
+!MESSAGE Possible choices for configuration are:
+!MESSAGE
+!MESSAGE "OUTPUT_LIBNAME - Win32 Release" (based on "Win32 (x86) Application")
+!MESSAGE "OUTPUT_LIBNAME - Win32 Debug" (based on "Win32 (x86) Application")
+!MESSAGE "OUTPUT_LIBNAME - Win32 MinSizeRel" (based on "Win32 (x86) Application")
+!MESSAGE
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+MTL=midl.exe
+RSC=rc.exe
+
+!IF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Release"
+
+# PROP BASE Use_MFC 2
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 2
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHRelease"
+# PROP Intermediate_Dir "Release"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /FD /c
+# ADD CPP /nologo /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "_AFXDLL" /FD /c
+# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
+# ADD CPP CMAKE_CXX_FLAGS
+# ADD CPP CMAKE_CXX_FLAGS_RELEASE
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG" /d "_AFXDLL"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /IGNORE:4089
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /IGNORE:4089
+CM_MULTILINE_OPTIMIZED_LIBRARIES
+CM_MULTILINE_LIBRARIES
+
+!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Debug"
+
+# PROP BASE Use_MFC 2
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 2
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHDebug"
+# PROP Intermediate_Dir "Debug"
+# PROP Target_Dir ""
+# ADD BASE CPP /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FD /GZ /c
+# ADD CPP /nologo /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /D "_AFXDLL" /FD /GZ /c
+# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
+# ADD CPP CMAKE_CXX_FLAGS
+# ADD CPP CMAKE_CXX_FLAGS_DEBUG
+# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG" /d "_AFXDLL"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /IGNORE:4089
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept /IGNORE:4089
+CM_MULTILINE_DEBUG_LIBRARIES
+CM_MULTILINE_LIBRARIES
+
+!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 MinSizeRel"
+# PROP BASE Use_MFC 2
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "MinSizeRel"
+# PROP BASE Intermediate_Dir "MinSizeRel"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 2
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHMinSizeRel"
+# PROP Intermediate_Dir "MinSizeRel"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /FD /c
+# ADD CPP /nologo /D "WIN32" BUILD_INCLUDES EXTRA_DEFINES /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /D "_AFXDLL" /FD /c
+# ADD CPP BUILD_INCLUDES EXTRA_DEFINES /D "OUTPUT_LIBNAME_EXPORTS"
+# ADD CPP CMAKE_CXX_FLAGS
+# ADD CPP CMAKE_CXX_FLAGS_MINSIZEREL
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG" /d "_AFXDLL"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /IGNORE:4089
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /IGNORE:4089
+CM_MULTILINE_OPTIMIZED_LIBRARIES
+CM_MULTILINE_LIBRARIES
+
+!ENDIF
+
+# Begin Target
+
+# Name "OUTPUT_LIBNAME - Win32 Release"
+# Name "OUTPUT_LIBNAME - Win32 Debug"
+# Name "OUTPUT_LIBNAME - Win32 MinSizeRel"
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/UtilityHeader.dsptemplate b/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/UtilityHeader.dsptemplate
index 71d4ebcae43e65776314d3e14d2864055d817ebb..d3a1f38ce58346731dbfafdb716fa19310bd5fe2 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/UtilityHeader.dsptemplate
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/DSPTemplates/with_mfc/UtilityHeader.dsptemplate
@@ -1,76 +1,76 @@
-# Microsoft Developer Studio Project File - Name="OUTPUT_LIBNAME" - Package Owner=<4>
-# Microsoft Developer Studio Generated Build File, Format Version 6.00
-# ** DO NOT EDIT **
-
-# TARGTYPE "Win32 (x86) Generic Project" 0x010a
-
-CFG=OUTPUT_LIBNAME - Win32 Debug
-!MESSAGE This is not a valid makefile. To build this project using NMAKE,
-!MESSAGE use the Export Makefile command and run
-!MESSAGE
-!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak".
-!MESSAGE
-!MESSAGE You can specify a configuration when running NMAKE
-!MESSAGE by defining the macro CFG on the command line. For example:
-!MESSAGE
-!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak" CFG="OUTPUT_LIBNAME - Win32 Debug"
-!MESSAGE
-!MESSAGE Possible choices for configuration are:
-!MESSAGE
-!MESSAGE "OUTPUT_LIBNAME - Win32 Release" (based on "Win32 (x86) Generic Project")
-!MESSAGE "OUTPUT_LIBNAME - Win32 Debug" (based on "Win32 (x86) Generic Project")
-!MESSAGE "OUTPUT_LIBNAME - Win32 MinSizeRel" (based on "Win32 (x86) Generic Project")
-!MESSAGE
-
-# Begin Project
-# PROP AllowPerConfigDependencies 0
-# PROP Scc_ProjName ""
-# PROP Scc_LocalPath ""
-MTL=midl.exe
-
-!IF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Release"
-
-# PROP BASE Use_MFC 0
-# PROP BASE Use_Debug_Libraries 0
-# PROP BASE Output_Dir "Release"
-# PROP BASE Intermediate_Dir "Release"
-# PROP BASE Target_Dir ""
-# PROP Use_MFC 0
-# PROP Use_Debug_Libraries 0
-# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHRelease"
-# PROP Intermediate_Dir "Release"
-# PROP Target_Dir ""
-
-!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Debug"
-
-# PROP BASE Use_MFC 0
-# PROP BASE Use_Debug_Libraries 1
-# PROP BASE Output_Dir "Debug"
-# PROP BASE Intermediate_Dir "Debug"
-# PROP BASE Target_Dir ""
-# PROP Use_MFC 0
-# PROP Use_Debug_Libraries 1
-# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHDebug"
-# PROP Intermediate_Dir "Debug"
-# PROP Target_Dir ""
-
-!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 MinSizeRel"
-
-# PROP BASE Use_MFC 0
-# PROP BASE Use_Debug_Libraries 0
-# PROP BASE Output_Dir "MinSizeRel"
-# PROP BASE Intermediate_Dir "MinSizeRel"
-# PROP BASE Target_Dir ""
-# PROP Use_MFC 0
-# PROP Use_Debug_Libraries 0
-# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHMinSizeRel"
-# PROP Intermediate_Dir "MinSizeRel"
-# PROP Target_Dir ""
-
-!ENDIF
-
-# Begin Target
-
-# Name "OUTPUT_LIBNAME - Win32 Release"
-# Name "OUTPUT_LIBNAME - Win32 Debug"
-# Name "OUTPUT_LIBNAME - Win32 MinSizeRel"
+# Microsoft Developer Studio Project File - Name="OUTPUT_LIBNAME" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Generic Project" 0x010a
+
+CFG=OUTPUT_LIBNAME - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE
+!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak".
+!MESSAGE
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE
+!MESSAGE NMAKE /f "OUTPUT_LIBNAME.mak" CFG="OUTPUT_LIBNAME - Win32 Debug"
+!MESSAGE
+!MESSAGE Possible choices for configuration are:
+!MESSAGE
+!MESSAGE "OUTPUT_LIBNAME - Win32 Release" (based on "Win32 (x86) Generic Project")
+!MESSAGE "OUTPUT_LIBNAME - Win32 Debug" (based on "Win32 (x86) Generic Project")
+!MESSAGE "OUTPUT_LIBNAME - Win32 MinSizeRel" (based on "Win32 (x86) Generic Project")
+!MESSAGE
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+MTL=midl.exe
+
+!IF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHRelease"
+# PROP Intermediate_Dir "Release"
+# PROP Target_Dir ""
+
+!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHDebug"
+# PROP Intermediate_Dir "Debug"
+# PROP Target_Dir ""
+
+!ELSEIF "$(CFG)" == "OUTPUT_LIBNAME - Win32 MinSizeRel"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "MinSizeRel"
+# PROP BASE Intermediate_Dir "MinSizeRel"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "EXECUTABLE_OUTPUT_PATHMinSizeRel"
+# PROP Intermediate_Dir "MinSizeRel"
+# PROP Target_Dir ""
+
+!ENDIF
+
+# Begin Target
+
+# Name "OUTPUT_LIBNAME - Win32 Release"
+# Name "OUTPUT_LIBNAME - Win32 Debug"
+# Name "OUTPUT_LIBNAME - Win32 MinSizeRel"
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/CTestCustom.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/CTestCustom.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..1c65b4d803900f06d85f1e6aab6cfc7e99c28a3c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/CTestCustom.cmake
@@ -0,0 +1,13 @@
+# VXL custom settings for ctest
+
+# This file is only used by ctest if it is in the build tree so it is
+# copied to the build tree by vxl/CMakeLists.txt
+
+# default is to report 50 errors and 50 warnings
+SET (CTEST_CUSTOM_MAXIMUM_NUMBER_OF_ERRORS 500)
+SET (CTEST_CUSTOM_MAXIMUM_NUMBER_OF_WARNINGS 500)
+
+SET (CTEST_CUSTOM_MAXIMUM_FAILED_TEST_OUTPUT_SIZE 102400)
+
+# default is 1024
+SET (CTEST_CUSTOM_MAXIMUM_PASSED_TEST_OUTPUT_SIZE 102400)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindGEOTIFF.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindGEOTIFF.cmake
index 9e23f15f0fc995adb555514192302272280e67fb..156944758f37386fbd64ca51ac742e40cbaaea37 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindGEOTIFF.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindGEOTIFF.cmake
@@ -33,11 +33,16 @@ ELSE(GEOTIFF_FOUND)
#
IF(EXISTS ${vxl_SOURCE_DIR}/v3p/geotiff/geotiff.h)
-
- SET( GEOTIFF_FOUND "YES" )
- SET( GEOTIFF_INCLUDE_DIR ${vxl_SOURCE_DIR}/v3p/geotiff)
- SET( GEOTIFF_INSTALL_INCLUDE_DIR ${CMAKE_INSTALL_DIR}/include/vxl/v3p/geotiff)
- SET( GEOTIFF_LIBRARIES geotiff )
+ # Use FIND_PATH here to allow the user to set the path to IGNORE
+ # to disable geotiff support.
+ FIND_PATH(GEOTIFF_INCLUDE_DIR geotiff.h
+ ${vxl_SOURCE_DIR}/v3p/geotiff
+ )
+ IF( GEOTIFF_INCLUDE_DIR )
+ SET( GEOTIFF_FOUND "YES" )
+ SET( GEOTIFF_INSTALL_INCLUDE_DIR ${CMAKE_INSTALL_DIR}/include/vxl/v3p/geotiff)
+ SET( GEOTIFF_LIBRARIES geotiff )
+ ENDIF( GEOTIFF_INCLUDE_DIR )
ENDIF(EXISTS ${vxl_SOURCE_DIR}/v3p/geotiff/geotiff.h)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindJPEG.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindJPEG.cmake
index cf3a550489d9d36cb2beccadba0d0a2ea44215d5..51061da3edfb50ada4c5d905c7eda9627b3f21ff 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindJPEG.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindJPEG.cmake
@@ -16,7 +16,7 @@
# If this FORCE variable is unset or is FALSE, try to find a native library.
IF( VXL_FORCE_V3P_JPEG )
ELSE( VXL_FORCE_V3P_JPEG )
- INCLUDE( ${CMAKE_ROOT}/Modules/FindJPEG.cmake )
+ FIND_PACKAGE( JPEG QUIET )
ENDIF( VXL_FORCE_V3P_JPEG )
IF(JPEG_FOUND)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindMPEG2.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindMPEG2.cmake
index 3d35d781c9106277ee0c021d2f31a529fd0fc468..054eb3ffe4b0f0d0bb8fee797a17b2eeb252fc6b 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindMPEG2.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindMPEG2.cmake
@@ -16,7 +16,7 @@
# If this FORCE variable is unset or is FALSE, try to find a native library.
IF( VXL_FORCE_V3P_MPEG2 )
ELSE( VXL_FORCE_V3P_MPEG2 )
- INCLUDE( ${CMAKE_ROOT}/Modules/FindMPEG2.cmake )
+ FIND_PACKAGE( MPEG2 QUIET )
ENDIF( VXL_FORCE_V3P_MPEG2 )
IF( MPEG2_FOUND )
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindOpenJPEG2.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindOpenJPEG2.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..a94409b1b697e608d896b641c4f41a53fb1cce8d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindOpenJPEG2.cmake
@@ -0,0 +1,75 @@
+# Copyright 2011 by Kitware, Inc. All Rights Reserved. Please refer to
+# KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,
+# Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.
+#
+# Author: Chuck Atkins <chuck dot atkins at kitware dot com>
+#
+# Locate the system installed OpenJPEG v2
+#
+# The following variables will be set:
+#
+# OPENJPEG2_FOUND - Set to true if OpenJPEG v2 can be found
+# OPENJPEG2_INCLUDE_DIR - The path to the OpenJPEG v2 header files
+# OPENJPEG2_LIBRARIES - The full path to the OpenJPEG v2 library
+# OPENJPEG2_DEFINITIONS - You should ADD_DEFINITONS(${OPENJPEG2_DEFINITIONS})
+# before compiling code that includes OpenJPEG2 library files.
+
+if( NOT VXL_FORCE_V3P_OPENJPEG2 )
+ if( NOT OPENJPEG2_FOUND )
+ include(CheckTypeSize)
+ include(CheckFunctionExists)
+
+ find_path( OPENJPEG2_INCLUDE_DIR openjpeg.h )
+# message(STATUS "Looking for openjpeg.h - ${OPENJPEG2_INCLUDE_DIR}")
+
+ if( OPENJPEG2_INCLUDE_DIR )
+ #The opj_cio struct is only preset in the old v1 API
+ set( CMAKE_REQUIRED_INCLUDES "${OPENJPEG2_INCLUDE_DIR}" )
+ set( CMAKE_EXTRA_INCLUDE_FILES "openjpeg.h" )
+ CHECK_TYPE_SIZE("struct opj_cio" STRUCT_OPJ_CIO)
+ unset( CMAKE_REQUIRED_INCLUDES )
+ unset( CMAKE_EXTRA_INCLUDE_FILES )
+ if(HAVE_STRUCT_OPJ_CIO)
+ set(OPENJPEG2_INCLUDE_V2 FALSE)
+ else(HAVE_STRUCT_OPJ_CIO)
+ set(OPENJPEG2_INCLUDE_V2 TRUE)
+ endif(HAVE_STRUCT_OPJ_CIO)
+# message(STATUS "Checking OpenJPEG header for v2 API - " ${OPENJPEG2_INCLUDE_V2})
+ endif( OPENJPEG2_INCLUDE_DIR )
+
+ find_library( OPENJPEG2_LIBRARIES "libopenjpeg" )
+# message(STATUS "Looking for libopenjpeg - ${OPENJPEG2_LIBRARIES}")
+
+ if( OPENJPEG2_LIBRARIES )
+ #opj_cio_open is part of the old API and has been removed in v2
+ set(CMAKE_REQUIRED_LIBRARIES "${OPENJPEG2_LIBRARIES}")
+ CHECK_FUNCTION_EXISTS("opj_cio_open" HAVE_OPJ_CIO_OPEN)
+ unset(CMAKE_REQUIRED_LIBRARIES)
+ if(HAVE_OPJ_CIO_OPEN)
+ set(OPENJPEG2_LIBRARIES_V2 FALSE)
+ else(HAVE_OPJ_CIO_OPEN)
+ set(OPENJPEG2_LIBRARIES_V2 TRUE)
+ endif(HAVE_OPJ_CIO_OPEN)
+# message(STATUS "Checking OpenJPEG library for v2 API - " ${OPENJPEG2_LIBRARIES_V2})
+ endif(OPENJPEG2_LIBRARIES)
+ include( FindPackageHandleStandardArgs )
+ FIND_PACKAGE_HANDLE_STANDARD_ARGS( OPENJPEG2 OPENJPEG2_INCLUDE_DIR OPENJPEG2_INCLUDE_V2 OPENJPEG2_LIBRARIES OPENJPEG2_LIBRARIES_V2 )
+ endif(NOT OPENJPEG2_FOUND)
+endif(NOT VXL_FORCE_V3P_OPENJPEG2)
+
+set(OPENJPEG2_DEFINITIONS "")
+
+
+if(OPENJPEG2_FOUND)
+ set(VXL_USING_NATIVE_OPENJPEG2 "YES")
+else(OPENJPEG2_FOUND)
+ if( EXISTS ${vxl_SOURCE_DIR}/v3p/openjpeg2/openjpeg.h)
+ set(OPENJPEG2_FOUND TRUE)
+ set(OPENJPEG2_INCLUDE_DIR ${vxl_SOURCE_DIR}/v3p/openjpeg2)
+ set(OPENJPEG2_LIBRARIES openjpeg2)
+ if (NOT BUILD_SHARED_LIBRARIES)
+ set(OPENJPEG2_DEFINITIONS ${OPENJPEG2_DEFINITIONS} -DOPJ_STATIC)
+ endif (NOT BUILD_SHARED_LIBRARIES)
+ endif( EXISTS ${vxl_SOURCE_DIR}/v3p/openjpeg2/openjpeg.h)
+endif(OPENJPEG2_FOUND)
+
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindPNG.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindPNG.cmake
index 3dfc31ef5146b2068e32714114bb6b54d4eafc5e..2be886fd3e60846c0f71d4ddd4663c2cd6b1decf 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindPNG.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindPNG.cmake
@@ -18,7 +18,10 @@
# If this FORCE variable is unset or is FALSE, try to find a native library.
IF( VXL_FORCE_V3P_PNG )
ELSE( VXL_FORCE_V3P_PNG )
- INCLUDE( ${CMAKE_ROOT}/Modules/FindPNG.cmake )
+# Suppress not found messages
+ SET( ZLIB_FIND_QUIETLY "YES" )
+ FIND_PACKAGE( PNG QUIET )
+ SET( ZLIB_FIND_QUIETLY )
ENDIF( VXL_FORCE_V3P_PNG )
IF(PNG_FOUND)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindTIFF.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindTIFF.cmake
index 31ba1b5908212c2a7f5fbc98adb0c888282f1c1f..600e6ab09b6136916d677c4bc5e9ff1b20d976f8 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindTIFF.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindTIFF.cmake
@@ -16,7 +16,7 @@
# If this FORCE variable is unset or is FALSE, try to find a native library.
IF( VXL_FORCE_V3P_TIFF )
ELSE( VXL_FORCE_V3P_TIFF )
- INCLUDE( ${CMAKE_ROOT}/Modules/FindTIFF.cmake )
+ FIND_PACKAGE( TIFF QUIET )
ENDIF( VXL_FORCE_V3P_TIFF )
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindZLIB.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindZLIB.cmake
index 7226ca0430360a4b0c434001f463396173445c86..b027fe71baa72d5fb0337f70eaaa2dbb0a4f3e53 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindZLIB.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/FindZLIB.cmake
@@ -16,7 +16,8 @@
# If this FORCE variable is unset or is FALSE, try to find a native library.
IF( VXL_FORCE_V3P_ZLIB )
ELSE( VXL_FORCE_V3P_ZLIB )
- INCLUDE( ${CMAKE_ROOT}/Modules/FindZLIB.cmake )
+ # Suppress not found messages
+ FIND_PACKAGE( ZLIB QUIET )
ENDIF( VXL_FORCE_V3P_ZLIB )
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindCoin3D.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindCoin3D.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..800e578dbe190afda8352ceee5c46c6de72414aa
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindCoin3D.cmake
@@ -0,0 +1,74 @@
+# Try to find Coin3D
+# Once done this will define
+#
+# COIN3D_FOUND - system has Coin3D - Open Inventor
+# COIN3D_INCLUDE_DIR - where the Inventor include directory can be found
+# COIN3D_LIBRARY - Link this to use Coin3D
+#
+
+
+IF (WIN32)
+ IF (CYGWIN)
+
+ FIND_PATH(COIN3D_INCLUDE_DIR Inventor/So.h)
+
+ FIND_LIBRARY(COIN3D_LIBRARY Coin)
+
+ ELSE (CYGWIN)
+
+ FIND_PATH(COIN3D_INCLUDE_DIR Inventor/So.h
+ "[HKEY_LOCAL_MACHINE\\SOFTWARE\\SIM\\Coin3D\\2;Installation Path]/include"
+ )
+
+ FIND_LIBRARY(COIN3D_LIBRARY_DEBUG coin2d
+ "[HKEY_LOCAL_MACHINE\\SOFTWARE\\SIM\\Coin3D\\2;Installation Path]/lib"
+ )
+
+ FIND_LIBRARY(COIN3D_LIBRARY_RELEASE coin2
+ "[HKEY_LOCAL_MACHINE\\SOFTWARE\\SIM\\Coin3D\\2;Installation Path]/lib"
+ )
+
+ IF (COIN3D_LIBRARY_DEBUG AND COIN3D_LIBRARY_RELEASE)
+ SET(COIN3D_LIBRARY optimized ${COIN3D_LIBRARY_RELEASE}
+ debug ${COIN3D_LIBRARY_DEBUG})
+ ELSE (COIN3D_LIBRARY_DEBUG AND COIN3D_LIBRARY_RELEASE)
+ IF (COIN3D_LIBRARY_DEBUG)
+ SET (COIN3D_LIBRARY ${COIN3D_LIBRARY_DEBUG})
+ ENDIF (COIN3D_LIBRARY_DEBUG)
+ IF (COIN3D_LIBRARY_RELEASE)
+ SET (COIN3D_LIBRARY ${COIN3D_LIBRARY_RELEASE})
+ ENDIF (COIN3D_LIBRARY_RELEASE)
+ ENDIF (COIN3D_LIBRARY_DEBUG AND COIN3D_LIBRARY_RELEASE)
+
+ IF (COIN3D_LIBRARY)
+ ADD_DEFINITIONS ( -DCOIN_NOT_DLL )
+ ENDIF (COIN3D_LIBRARY)
+
+ ENDIF (CYGWIN)
+
+ELSE (WIN32)
+ IF(APPLE)
+ FIND_PATH(COIN3D_INCLUDE_DIR Inventor/So.h
+ /Library/Frameworks/Inventor.framework/Headers
+ )
+ FIND_LIBRARY(COIN3D_LIBRARY Coin
+ /Library/Frameworks/Inventor.framework/Libraries
+ )
+ SET(COIN3D_LIBRARY "-framework Coin3d" CACHE STRING "Coin3D library for OSX")
+ ELSE(APPLE)
+
+ FIND_PATH(COIN3D_INCLUDE_DIR Inventor/So.h)
+
+ FIND_LIBRARY(COIN3D_LIBRARY Coin)
+ ENDIF(APPLE)
+
+ENDIF (WIN32)
+
+# handle the QUIETLY and REQUIRED arguments and set COIN3D_FOUND to TRUE if
+# all listed variables are TRUE
+INCLUDE(FindPackageHandleStandardArgs)
+FIND_PACKAGE_HANDLE_STANDARD_ARGS(Coin3D DEFAULT_MSG COIN3D_LIBRARY COIN3D_INCLUDE_DIR)
+
+MARK_AS_ADVANCED(COIN3D_INCLUDE_DIR COIN3D_LIBRARY )
+
+
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDC1394.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDC1394.cmake
index 52380c59b29c3b0dccffe25c9fcefb0ebbbbc954..ec1a6fa196fbf61c1d205cfeb3e2abe6534a701e 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDC1394.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDC1394.cmake
@@ -1,36 +1,33 @@
#
-# try to find dc1394 library and include files
+# try to find the dc1394 library (version 2) and include files
#
# DC1394_INCLUDE_DIR, where to find dc1394/dc1394_control.h, etc.
# DC1394_LIBRARIES, the libraries to link against to use DC1394.
# DC1394_FOUND, If false, do not try to use DC1394.
#
-# Currently this code works with libdc1394 version 2.0.0-rc7.
+# Look for one of the header files
+FIND_PATH( DC1394_INCLUDE_DIR dc1394/dc1394.h)
-FIND_PATH( DC1394_INCLUDE_DIR dc1394/control.h
- /usr/include
- /usr/local/include
-)
+# Look for the library
+FIND_LIBRARY( DC1394_LIBRARIES dc1394)
-FIND_LIBRARY( DC1394_LIBRARY dc1394
- /usr/lib64
- /usr/lib
- /usr/local/lib
-)
+# handle the QUIETLY and REQUIRED arguments and set DC1394_FOUND to TRUE if
+# all listed variables are TRUE
+INCLUDE(FindPackageHandleStandardArgs)
+FIND_PACKAGE_HANDLE_STANDARD_ARGS(DC1394 DEFAULT_MSG DC1394_LIBRARIES DC1394_INCLUDE_DIR)
+
+MARK_AS_ADVANCED(DC1394_INCLUDE_DIR DC1394_LIBRARIES )
+
+
+# Find Apple Framework dependencies
+IF(APPLE AND DC1394_FOUND)
+ SET(DC1394_LIBRARIES ${DC1394_LIBRARIES}
+ "-framework CoreServices"
+ "-framework IOKit" )
+ENDIF(APPLE AND DC1394_FOUND)
-SET( DC1394_FOUND "NO" )
-IF(DC1394_INCLUDE_DIR)
- IF(DC1394_LIBRARY)
- SET( DC1394_LIBRARIES
- ${DC1394_LIBRARY}
- )
- SET( DC1394_FOUND "YES" )
-#The following deprecated settings are for backwards compatibility with CMake1.4
- SET (DC1394_INCLUDE_PATH ${DC1394_INCLUDE_DIR})
- ENDIF(DC1394_LIBRARY)
-ENDIF(DC1394_INCLUDE_DIR)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDCMTK.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDCMTK.cmake
index 992e0f4c6772e45145a9d25b989be2210aea6794..aea9020177cc895308ceca5bc7666784bc44fed1 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDCMTK.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDCMTK.cmake
@@ -15,6 +15,10 @@
# VXL only requires dcmimgle and its dependents, so we only check for
# these. A more general version may want to check for the rest.
+FIND_PATH( DCMTK_ROOT_INCLUDE_DIR dcmtk
+ ${DCMTK_DIR}/include
+)
+
FIND_PATH( DCMTK_config_INCLUDE_DIR osconfig.h
${DCMTK_DIR}/config/include
)
@@ -51,7 +55,7 @@ FIND_LIBRARY( DCMTK_dcmimgle_LIBRARY dcmimgle
${DCMTK_DIR}/dcmimgle/Debug
)
-
+IF( DCMTK_ROOT_INCLUDE_DIR )
IF( DCMTK_config_INCLUDE_DIR )
IF( DCMTK_ofstd_INCLUDE_DIR )
IF( DCMTK_ofstd_LIBRARY )
@@ -62,6 +66,7 @@ IF( DCMTK_dcmimgle_LIBRARY )
SET( DCMTK_FOUND "YES" )
SET( DCMTK_INCLUDE_DIR
+ ${DCMTK_ROOT_INCLUDE_DIR}
${DCMTK_config_INCLUDE_DIR}
${DCMTK_ofstd_INCLUDE_DIR}
${DCMTK_dcmdata_INCLUDE_DIR}
@@ -86,6 +91,7 @@ ENDIF( DCMTK_dcmdata_INCLUDE_DIR )
ENDIF( DCMTK_ofstd_LIBRARY )
ENDIF( DCMTK_ofstd_INCLUDE_DIR )
ENDIF( DCMTK_config_INCLUDE_DIR )
+ENDIF( DCMTK_ROOT_INCLUDE_DIR )
IF( NOT DCMTK_FOUND )
SET( DCMTK_DIR "" CACHE PATH "Root of DCMTK source tree (optional)." )
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDirectShow.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDirectShow.cmake
index 9c8ae5c792f87f9d475938ced0cf6efd780daad6..2248409835102f179a06d345a6bd2a76d81e4b3c 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDirectShow.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindDirectShow.cmake
@@ -1,82 +1,146 @@
# - Test for DirectShow on Windows.
# Once loaded this will define
# DIRECTSHOW_FOUND - system has DirectShow
-# DIRECTSHOW_INCLUDE_DIR - include directory for DirectShow
+# DIRECTSHOW_INCLUDE_DIRS - include directory for DirectShow
# DIRECTSHOW_LIBRARIES - libraries you need to link to
SET(DIRECTSHOW_FOUND "NO")
# DirectShow is only available on Windows platforms
IF(MSVC)
- # Find DirectX Include Directory
+ # Find DirectX Include Directory (dshow depends on it)
FIND_PATH(DIRECTX_INCLUDE_DIR ddraw.h
- "C:/Program Files/Microsoft Visual Studio .NET 2003/Vc7/PlatformSDK/Include"
- "C:/Program Files/Microsoft DirectX SDK (August 2007)/Include"
- "C:/Program Files/Microsoft DirectX SDK (February 2006)/Include"
- "C:/Program Files/Microsoft DirectX 9.0 SDK (June 2005)/Include"
- "C:/Program Files (x86)/Microsoft DirectX SDK (June 2006)/Include"
+ # WindowsSDK: includes ddraw and dshow
+ "[HKEY_LOCAL_MACHINE\\SOFTWARE\\Microsoft\\Microsoft SDKs\\Windows;CurrentInstallFolder]/Include"
+ # VS 7.1 PlatformSDK: includes ddraw and dshow
+ "[HKEY_LOCAL_MACHINE\\SOFTWARE\\Microsoft\\VisualStudio\\7.1\\Setup\\VC;ProductDir]/PlatformSDK/Include"
+ # Newer DirectX: dshow not included; requires Platform SDK
+ "$ENV{DXSDK_DIR}/Include"
+ # Older DirectX: dshow included
"C:/DXSDK/Include"
DOC "What is the path where the file ddraw.h can be found"
+ NO_DEFAULT_PATH
)
# if DirectX found, then find DirectShow include directory
IF(DIRECTX_INCLUDE_DIR)
FIND_PATH(DIRECTSHOW_INCLUDE_DIR dshow.h
- "C:/Program Files/Microsoft Visual Studio .NET 2003/Vc7/PlatformSDK/Include"
+ "${DIRECTX_INCLUDE_DIR}"
"C:/Program Files/Microsoft Platform SDK for Windows Server 2003 R2/Include"
"C:/Program Files/Microsoft Platform SDK/Include"
- "C:/DXSDK/Include"
DOC "What is the path where the file dshow.h can be found"
+ NO_DEFAULT_PATH
)
# if DirectShow include dir found, then find DirectShow libraries
IF(DIRECTSHOW_INCLUDE_DIR)
- FIND_LIBRARY(DIRECTSHOW_strmiids_LIBRARY strmiids
- "C:/Program Files/Microsoft Visual Studio .NET 2003/Vc7/PlatformSDK/Lib"
- "C:/Program Files/Microsoft Platform SDK for Windows Server 2003 R2/Lib"
- "C:/Program Files/Microsoft Platform SDK/Lib"
- "C:/DXSDK/Include/Lib"
- DOC "Where can the DirectShow strmiids library be found"
- )
- FIND_LIBRARY(DIRECTSHOW_quartz_LIBRARY quartz
- "C:/Program Files/Microsoft Visual Studio .NET 2003/Vc7/PlatformSDK/Lib"
- "C:/Program Files/Microsoft Platform SDK for Windows Server 2003 R2/Lib"
- "C:/Program Files/Microsoft Platform SDK/Lib"
- "C:/DXSDK/Include/Lib"
- DOC "Where can the DirectShow quartz library be found"
- )
-
- # if DirectShow libraries found, then we're ok
- IF(DIRECTSHOW_strmiids_LIBRARY)
- IF(DIRECTSHOW_quartz_LIBRARY)
- # everything found
- SET(DIRECTSHOW_FOUND "YES")
- ENDIF(DIRECTSHOW_quartz_LIBRARY)
- ENDIF(DIRECTSHOW_strmiids_LIBRARY)
+ IF(CMAKE_CL_64)
+ FIND_LIBRARY(DIRECTSHOW_STRMIIDS_LIBRARY strmiids
+ "${DIRECTSHOW_INCLUDE_DIR}/../Lib/x64"
+ DOC "Where can the DirectShow strmiids library be found"
+ NO_DEFAULT_PATH
+ )
+ FIND_LIBRARY(DIRECTSHOW_QUARTZ_LIBRARY quartz
+ "${DIRECTSHOW_INCLUDE_DIR}/../Lib/x64"
+ DOC "Where can the DirectShow quartz library be found"
+ NO_DEFAULT_PATH
+ )
+ ELSE(CMAKE_CL_64)
+ FIND_LIBRARY(DIRECTSHOW_STRMIIDS_LIBRARY strmiids
+ "${DIRECTSHOW_INCLUDE_DIR}/../Lib"
+ "${DIRECTSHOW_INCLUDE_DIR}/../Lib/x86"
+ DOC "Where can the DirectShow strmiids library be found"
+ NO_DEFAULT_PATH
+ )
+ FIND_LIBRARY(DIRECTSHOW_QUARTZ_LIBRARY quartz
+ "${DIRECTSHOW_INCLUDE_DIR}/../Lib"
+ "${DIRECTSHOW_INCLUDE_DIR}/../Lib/x86"
+ DOC "Where can the DirectShow quartz library be found"
+ NO_DEFAULT_PATH
+ )
+ ENDIF(CMAKE_CL_64)
ENDIF(DIRECTSHOW_INCLUDE_DIR)
ENDIF(DIRECTX_INCLUDE_DIR)
ENDIF(MSVC)
-
#---------------------------------------------------------------------
-IF(DIRECTSHOW_FOUND)
- SET(DIRECTSHOW_INCLUDE_DIR
- ${DIRECTSHOW_INCLUDE_DIR}
- ${DIRECTX_INCLUDE_DIR}
+SET(DIRECTSHOW_INCLUDE_DIRS
+ "${DIRECTX_INCLUDE_DIR}"
+ "${DIRECTSHOW_INCLUDE_DIR}"
)
- SET(DIRECTSHOW_LIBRARIES
- ${DIRECTSHOW_strmiids_LIBRARY}
- ${DIRECTSHOW_quartz_LIBRARY}
+SET(DIRECTSHOW_LIBRARIES
+ "${DIRECTSHOW_STRMIIDS_LIBRARY}"
+ "${DIRECTSHOW_QUARTZ_LIBRARY}"
)
-ELSE(DIRECTSHOW_FOUND)
- # make FIND_PACKAGE friendly
- IF(NOT DIRECTSHOW_FIND_QUIETLY)
- IF(DIRECTSHOW_FIND_REQUIRED)
- MESSAGE(FATAL_ERROR
- "DirectShow required, please specify it's location.")
- ELSE(DIRECTSHOW_FIND_REQUIRED)
- MESSAGE(STATUS "DirectShow was not found.")
- ENDIF(DIRECTSHOW_FIND_REQUIRED)
- ENDIF(NOT DIRECTSHOW_FIND_QUIETLY)
-ENDIF(DIRECTSHOW_FOUND)
+
+#---------------------------------------------------------------------
+INCLUDE (CheckCXXSourceCompiles)
+
+SET(CMAKE_REQUIRED_INCLUDES ${DIRECTSHOW_INCLUDE_DIRS})
+SET(CMAKE_REQUIRED_LIBRARIES ${DIRECTSHOW_LIBRARIES})
+CHECK_CXX_SOURCE_COMPILES("
+ #include <atlbase.h>
+ #include <dshow.h>
+ #include <qedit.h>
+
+ int main()
+ {
+ CComPtr<IFilterGraph2> filter_graph;
+ filter_graph.CoCreateInstance(CLSID_FilterGraph);
+ return 0;
+ }
+" DIRECTSHOW_SOURCE_COMPILES)
+SET(CMAKE_REQUIRED_INCLUDES)
+SET(CMAKE_REQUIRED_LIBRARIES)
+
+#---------------------------------------------------------------------
+# FIXME: When cmake_minimum_version reaches 2.6.0 the
+# FindPackageHandleStandardArgs module can be used.
+IF(CMAKE_MINIMUM_REQUIRED_VERSION GREATER 2.5)
+ MESSAGE(FATAL_ERROR
+ "Uncomment code below: FindPackageHandleStandardArgs is now available.")
+ENDIF(CMAKE_MINIMUM_REQUIRED_VERSION GREATER 2.5)
+
+#INCLUDE(FindPackageHandleStandardArgs)
+#FIND_PACKAGE_HANDLE_STANDARD_ARGS(
+# DIRECTSHOW
+# DEFAULT_MSG
+# DIRECTX_INCLUDE_DIR
+# DIRECTSHOW_INCLUDE_DIR
+# DIRECTSHOW_STRMIIDS_LIBRARY
+# DIRECTSHOW_QUARTZ_LIBRARY
+# DIRECTSHOW_SOURCE_COMPILES
+# )
+
+SET(_NAME DIRECTSHOW)
+SET(_NAME_UPPER DIRECTSHOW)
+SET(MISSING_VARS "")
+# check if all passed variables are valid
+SET(${_NAME_UPPER}_FOUND TRUE)
+FOREACH(_CURRENT_VAR
+ DIRECTX_INCLUDE_DIR
+ DIRECTSHOW_INCLUDE_DIR
+ DIRECTSHOW_STRMIIDS_LIBRARY
+ DIRECTSHOW_QUARTZ_LIBRARY
+ DIRECTSHOW_SOURCE_COMPILES
+ )
+ IF(NOT "${_CURRENT_VAR}")
+ SET(${_NAME_UPPER}_FOUND FALSE)
+ SET(MISSING_VARS "${MISSING_VARS} ${_CURRENT_VAR}")
+ ENDIF(NOT "${_CURRENT_VAR}")
+ENDFOREACH(_CURRENT_VAR)
+
+IF (${_NAME_UPPER}_FOUND)
+ IF(NOT ${_NAME}_FIND_QUIETLY)
+ MESSAGE(STATUS "Found ${_NAME}")
+ ENDIF(NOT ${_NAME}_FIND_QUIETLY)
+ELSE (${_NAME_UPPER}_FOUND)
+ IF (${_NAME}_FIND_REQUIRED)
+ MESSAGE(FATAL_ERROR "Could NOT find ${_NAME} (missing: ${MISSING_VARS})")
+ ELSE (${_NAME}_FIND_REQUIRED)
+ IF (NOT ${_NAME}_FIND_QUIETLY)
+ MESSAGE(STATUS "Could NOT find ${_NAME} (missing: ${MISSING_VARS})")
+ ENDIF (NOT ${_NAME}_FIND_QUIETLY)
+ ENDIF (${_NAME}_FIND_REQUIRED)
+ENDIF (${_NAME_UPPER}_FOUND)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindECW.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindECW.cmake
index aaaeaad3d8a7c6527eb7b6b429b77ecf1885a24b..461114c0704dbcaebcc5a17f9903b83027d90b2b 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindECW.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindECW.cmake
@@ -1,10 +1,15 @@
-# Find the ECW library
+# Find the ECW library - Enhanced Compression Wavelets for JPEG2000.
#
# Sets
# ECW_FOUND. If false, don't try to use ecw
# ECW_INCLUDE_DIR
# ECW_LIBRARIES
+# The original sponsorring website of this library appears to have vanished,
+# but there are still traces at http://www.gdal.org/frmt_ecw.html and a
+# distribution at https://svn.zib.de/lenne3d/lib/libecw/current - IMS 7-Dec-2009.
+IF( VXL_FORCE_V3P_J2K )
+ELSE( VXL_FORCE_V3P_J2K )
SET( ECW_FOUND "NO" )
FIND_PATH( ECW_INCLUDE_DIR NCSEcw.h
@@ -27,7 +32,7 @@ IF( ECW_INCLUDE_DIR )
/usr/lib64
/usr/local/lib64
)
-
+
IF( ECW_ncsutil_LIBRARY )
IF( ECW_ncsecw_LIBRARY )
@@ -39,3 +44,31 @@ IF( ECW_INCLUDE_DIR )
ENDIF( ECW_INCLUDE_DIR )
+ENDIF( VXL_FORCE_V3P_J2K )
+
+IF( ECW_FOUND )
+ SET(VXL_USING_NATIVE_J2K "YES")
+ELSE( ECW_FOUND )
+INCLUDE(${MODULE_PATH}/NewCMake/FindWin32SDK.cmake)
+INCLUDE(${CMAKE_ROOT}/Modules/FindMFC.cmake)
+
+SET(J2K_SOURCES_FOUND "NO")
+IF (EXISTS ${vxl_SOURCE_DIR}/v3p/j2k/Source/include/NCSEcw.h )
+IF (EXISTS ${vxl_SOURCE_DIR}/v3p/j2k/Source/include/NCSUtil.h)
+IF (EXISTS${vxl_SOURCE_DIR}/v3p/j2k/Source/include/NCSCnet.h)
+SET(J2K_SOURCES_FOUND "YES")
+ENDIF (EXISTS${vxl_SOURCE_DIR}/v3p/j2k/Source/include/NCSCnet.h)
+ENDIF (EXISTS ${vxl_SOURCE_DIR}/v3p/j2k/Source/include/NCSUtil.h)
+ENDIF (EXISTS ${vxl_SOURCE_DIR}/v3p/j2k/Source/include/NCSEcw.h )
+
+
+
+ IF( WIN32 AND J2K_SOURCES_FOUND AND WIN32SDK_FOUND AND MFC_FOUND)
+
+ SET( ECW_FOUND "YES" )
+ SET( ECW_INCLUDE_DIR ${vxl_SOURCE_DIR}/v3p/j2k/Source/include)
+ SET( ECW_INSTALL_INCLUDE_DIR ${CMAKE_INSTALL_DIR}/include/vxl/v3p/j2k)
+ SET( ECW_LIBRARIES NCSEcw NCSUtil )
+
+ ENDIF( WIN32 AND J2K_SOURCES_FOUND AND WIN32SDK_FOUND AND MFC_FOUND )
+ ENDIF( ECW_FOUND )
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindFFMPEG.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindFFMPEG.cmake
index 3f76fa3fdc4134685a4d3f45441e78efb41900fa..2a76e4f2e287c9be3044aa5ea8ccf37381fb90c9 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindFFMPEG.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindFFMPEG.cmake
@@ -2,16 +2,29 @@
#
# Sets
# FFMPEG_FOUND. If false, don't try to use ffmpeg
+# FFMPEG_FOUND_SEVERAL. If true, there are several directories with headers (not only ../ffmpeg/)
# FFMPEG_INCLUDE_DIR
# FFMPEG_LIBRARIES
SET( FFMPEG_FOUND "NO" )
-
-FIND_PATH( FFMPEG_INCLUDE_DIR ffmpeg/avcodec.h
+FIND_PATH( FFMPEG_INCLUDE1_DIR ffmpeg/avcodec.h
/usr/include
/usr/local/include
)
+FIND_PATH( FFMPEG_INCLUDE2_DIR libavcodec/avcodec.h
+ /usr/include
+ /usr/local/include
+)
+IF( FFMPEG_INCLUDE1_DIR)
+ SET (FFMPEG_INCLUDE_DIR ${FFMPEG_INCLUDE1_DIR} )
+ SET( FFMPEG_FOUND_SEVERAL "NO" )
+ENDIF ( FFMPEG_INCLUDE1_DIR)
+
+IF( FFMPEG_INCLUDE2_DIR)
+ SET (FFMPEG_INCLUDE_DIR ${FFMPEG_INCLUDE2_DIR} )
+ SET( FFMPEG_FOUND_SEVERAL "YES" )
+ENDIF ( FFMPEG_INCLUDE2_DIR)
IF( FFMPEG_INCLUDE_DIR )
@@ -48,6 +61,13 @@ ELSE( FFMPEG_CONFIG )
/usr/lib64
/usr/local/lib64
)
+
+ FIND_LIBRARY( FFMPEG_swscale_LIBRARY swscale
+ /usr/lib
+ /usr/local/lib
+ /usr/lib64
+ /usr/local/lib64
+ )
IF( FFMPEG_avcodec_LIBRARY )
IF( FFMPEG_avformat_LIBRARY )
@@ -57,6 +77,9 @@ ELSE( FFMPEG_CONFIG )
IF( FFMPEG_avutil_LIBRARY )
SET( FFMPEG_LIBRARIES ${FFMPEG_LIBRARIES} ${FFMPEG_avutil_LIBRARY} )
ENDIF( FFMPEG_avutil_LIBRARY )
+ IF( FFMPEG_swscale_LIBRARY )
+ SET( FFMPEG_LIBRARIES ${FFMPEG_LIBRARIES} ${FFMPEG_swscale_LIBRARY} )
+ ENDIF( FFMPEG_swscale_LIBRARY )
ENDIF( FFMPEG_avformat_LIBRARY )
ENDIF( FFMPEG_avcodec_LIBRARY )
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGEOTIFF.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGEOTIFF.cmake
index 88be69baacf6031ac7aae2907922f1120e352b5a..9e5013f4dd6237a9f80cc8a404ab409a1404cae8 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGEOTIFF.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGEOTIFF.cmake
@@ -18,6 +18,7 @@ FIND_LIBRARY(GEOTIFF_LIBRARY
PATHS /usr/lib /usr/local/lib
)
+SET( GEOTIFF_FOUND "NO" )
IF(GEOTIFF_INCLUDE_DIR)
IF(GEOTIFF_LIBRARY)
SET( GEOTIFF_FOUND "YES" )
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGLUT.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGLUT.cmake
index 31844221672f9ebd718ad755946d8bc1239e08bb..6b0b19904938227be7c0bb2c725b2fbfb3075f89 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGLUT.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGLUT.cmake
@@ -10,8 +10,9 @@
# GLUT_Xmu_LIBRARY, where to find the Xmu library if available.
# GLUT_Xi_LIBRARY, where to find the Xi Library if available.
-IF (WIN32)
+IF (WIN32)
+ FIND_PATH( OPENGL_LIBRARY_DIR glut32.lib )
IF(CYGWIN)
FIND_PATH( GLUT_INCLUDE_DIR GL/glut.h
@@ -117,4 +118,5 @@ MARK_AS_ADVANCED(
GLUT_glut_LIBRARY
GLUT_Xmu_LIBRARY
GLUT_Xi_LIBRARY
+ OPENGL_LIBRARY_DIR
)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGTK2.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGTK2.cmake
index ba7d4a3075cedda2b630580f86b30d3486fd87ab..a9be0eb1ae6bf8c5b4b61ae092cd5cee01566f01 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGTK2.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindGTK2.cmake
@@ -25,8 +25,8 @@ IF( PKG_CONFIG )
EXEC_PROGRAM( ${PKG_CONFIG} ARGS "--libs gtkglext-1.0" OUTPUT_VARIABLE GTK2_glext_LIBRARIES )
SET( GTK2_FOUND "YES" )
- SET( GTK2_DEFINITIONS "${GTK2_gtk_DEFINITIONS} ${GTK2_glext_DEFINITIONS}" )
- SET( GTK2_LIBRARIES "${GTK2_gtk_LIBRARIES} ${GTK2_glext_LIBRARIES}" )
+ SET( GTK2_DEFINITIONS ${GTK2_gtk_DEFINITIONS} ${GTK2_glext_DEFINITIONS} )
+ SET( GTK2_LIBRARIES ${GTK2_gtk_LIBRARIES} ${GTK2_glext_LIBRARIES} )
ENDIF( ${GTK2_PKG_RET_VAL} MATCHES "0" )
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindOpenCL.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindOpenCL.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..5f4f47e5e99d3bd85829da3872a700d2abdc344a
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindOpenCL.cmake
@@ -0,0 +1,83 @@
+#
+# This open cl setup is based on the requirements for the AMD SDK.
+# http://developer.amd.com/gpu/ATIStreamSDKBetaProgram/Pages/default.aspx
+# Undoubtedly a different setup is required for the Nvidia SDK
+#
+# 3/14/2009 Support for both ATI and NVIDIA SDKs added by Octavian
+# 4/06/2009 Force check of actual lib files in the path's provided using FIND_LIBRARY added by Octavian
+
+SET(OPENCL_FOUND "NO")
+SET(NVIDIA_FOUND "NO")
+SET(ATI_FOUND "NO")
+
+IF (WIN32)
+ FIND_PATH( OPENCL_INCLUDE_PATH CL/cl_gl.h)
+
+ IF (OPENCL_INCLUDE_PATH)
+
+ FIND_PATH( OPENCL_NVIDIA_LIBRARY_PATH OpenCL.lib )
+ FIND_PATH( OPENCL_ATI_LIBRARY_PATH aticalcl.lib )
+
+ IF (OPENCL_NVIDIA_LIBRARY_PATH)
+ FIND_LIBRARY(OPENCL_NVIDIA_LIBRARY NAMES OpenCL.lib PATHS ${OPENCL_NVIDIA_LIBRARY_PATH} ${OPENCL_NVIDIA_LIBRARY_PATH}/x64 ${OPENCL_NVIDIA_LIBRARY_PATH}/Win32)
+ IF (OPENCL_NVIDIA_LIBRARY)
+ SET(OPENCL_FOUND "YES")
+ SET(NVIDIA_FOUND "YES")
+ SET( OPENCL_LIBRARIES ${OPENCL_NVIDIA_LIBRARY})
+ ENDIF (OPENCL_NVIDIA_LIBRARY)
+ ENDIF (OPENCL_NVIDIA_LIBRARY_PATH)
+
+ IF (OPENCL_ATI_LIBRARY_PATH)
+ SET(OPENCL_CALC_LIBRARY "${OPENCL_ATI_LIBRARY_PATH}/aticalcl.lib")
+ SET(OPENCL_ATICALRT_LIBRARY "${OPENCL_ATI_LIBRARY_PATH}/aticalrt.lib")
+ IF( CMAKE_CL_64 )
+ SET( OPENCL_ATI_LIBRARY "${OPENCL_ATI_LIBRARY_PATH}/x86_64/OpenCL.lib")
+ ELSE( CMAKE_CL_64 )
+ SET(OPENCL_ATI_LIBRARY "${OPENCL_ATI_LIBRARY_PATH}/x86/OpenCL.lib")
+ ENDIF( CMAKE_CL_64 )
+
+ #IF (OPENCL_CALC_LIBRARY AND OPENCL_ATICALRT_LIBRARY AND OPENCL_ATI_LIBRARY)
+ SET(OPENCL_LIBRARIES ${OPENCL_CALC_LIBRARY} ${OPENCL_ATICALRT_LIBRARY} ${OPENCL_ATI_LIBRARY})
+ IF (OPENCL_LIBRARIES)
+ SET(OPENCL_FOUND "YES")
+ SET(ATI_FOUND "YES")
+ ENDIF (OPENCL_LIBRARIES)
+ ENDIF (OPENCL_ATI_LIBRARY_PATH)
+
+ IF (ATI_FOUND AND NVIDIA_FOUND)
+
+ OPTION (USE_NVIDIA_SDK "Default to NVIDIA SDK?" YES)
+
+ IF (USE_NVIDIA_SDK)
+ SET( OPENCL_LIBRARIES OPENCL_NVIDIA_LIBRARY)
+ ELSE (USE_NVIDIA_SDK)
+ SET(OPENCL_LIBRARIES OPENCL_CALC_LIBRARY OPENCL_AMUABI_LIBRARY OPENCL_ATICALRT_LIBRARY OPENCL_ATI_LIBRARY)
+ ENDIF (USE_NVIDIA_SDK)
+
+ ENDIF (ATI_FOUND AND NVIDIA_FOUND)
+ ENDIF (OPENCL_INCLUDE_PATH)
+ENDIF (WIN32)
+
+IF (APPLE)
+ FIND_PATH(OPENCL_INCLUDE_PATH cl.h "Include for OpenCL on OSX")
+ IF (OPENCL_INCLUDE_PATH)
+ FIND_LIBRARY(OPENCL_LIBRARY OpenCL "OpenCL lib for OSX")
+ IF (OPENCL_LIBRARY)
+ SET(OPENCL_FOUND "YES")
+ SET(OPENCL_LIBRARIES ${OPENCL_LIBRARY})
+ ENDIF (OPENCL_LIBRARY)
+ ENDIF (OPENCL_INCLUDE_PATH)
+ENDIF (APPLE)
+
+IF (UNIX)
+ FIND_PATH( OPENCL_INCLUDE_PATH CL/cl_gl.h PATHS /usr/include /usr/include/nvidia-current)
+ FIND_PATH(OPENCL_LIBRARY_PATH libOpenCL.so PATHS /usr/lib /usr/lib/nvidia-current)
+ FIND_LIBRARY(OPENCL_LIBRARIES NAMES libOpenCL.so PATHS /usr/lib /usr/lib/nvidia-current)
+ IF (OPENCL_INCLUDE_PATH)
+ IF (OPENCL_LIBRARY_PATH)
+ IF (OPENCL_LIBRARIES)
+ SET(OPENCL_FOUND "YES")
+ ENDIF (OPENCL_LIBRARIES)
+ ENDIF (OPENCL_LIBRARY_PATH)
+ ENDIF (OPENCL_INCLUDE_PATH)
+ENDIF (UNIX)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindPython.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindPython.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..a28656e41cc04b71a50369c90b7801d954efcf88
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindPython.cmake
@@ -0,0 +1,62 @@
+# - Test for Python
+# Once loaded this will define
+# PYTHON_FOUND - system has Python
+# PYTHON_INCLUDE_DIR - path to where Python.h is found
+# PYTHON_INCLUDE_DIRS - combined include path
+# PYTHON_PC_INCLUDE_PATH - PC directory for Win
+# PYTHON_LIBRARY - libraries you need to link to
+# PYTHON_DEBUG_LIBRARY - path to the debug library
+
+# Flag that determines if we were able to successfully build Python.
+# Initialize to NO. Change below if yes.
+SET(PYTHON_FOUND "NO" CACHE INTERNAL "Was Python successfully built?" )
+
+INCLUDE( ${CMAKE_ROOT}/Modules/FindPythonLibs.cmake )
+IF(PYTHON_INCLUDE_DIR)
+ IF(PYTHON_LIBRARY OR PYTHON_DEBUG_LIBRARY)
+ # everything found
+ SET(PYTHON_FOUND "YES" CACHE INTERNAL "Was Python successfully built?")
+
+ IF( WIN32 )
+ FIND_PATH(PYTHON_PC_INCLUDE_PATH
+ NAMES pyconfig.h
+
+ PATHS
+ ${PYTHON_INCLUDE_DIRS}
+ ${PYTHON_FRAMEWORK_INCLUDES}
+ [HKEY_LOCAL_MACHINE\\SOFTWARE\\Python\\PythonCore\\2.6\\InstallPath]/PC
+ [HKEY_LOCAL_MACHINE\\SOFTWARE\\Python\\PythonCore\\2.5\\InstallPath]/PC
+ [HKEY_LOCAL_MACHINE\\SOFTWARE\\Python\\PythonCore\\2.4\\InstallPath]/PC
+ [HKEY_LOCAL_MACHINE\\SOFTWARE\\Python\\PythonCore\\2.3\\InstallPath]/PC
+ [HKEY_LOCAL_MACHINE\\SOFTWARE\\Python\\PythonCore\\2.2\\InstallPath]/PC
+ [HKEY_LOCAL_MACHINE\\SOFTWARE\\Python\\PythonCore\\2.1\\InstallPath]/PC
+ [HKEY_LOCAL_MACHINE\\SOFTWARE\\Python\\PythonCore\\2.0\\InstallPath]/PC
+ [HKEY_LOCAL_MACHINE\\SOFTWARE\\Python\\PythonCore\\1.6\\InstallPath]/PC
+ [HKEY_LOCAL_MACHINE\\SOFTWARE\\Python\\PythonCore\\1.5\\InstallPath]/PC
+
+ PATH_SUFFIXES
+ python2.6
+ python2.5
+ python2.4
+ python2.3
+ python2.2
+ python2.1
+ python2.0
+ python1.6
+ python1.5
+ )
+
+ SET(PYTHON_INCLUDE_DIRS
+ ${PYTHON_INCLUDE_DIR}
+ ${PYTHON_PC_INCLUDE_PATH}
+ )
+ #MESSAGE(${PYTHON_INCLUDE_DIRS})
+
+ MARK_AS_ADVANCED(
+ PYTHON_PC_INCLUDE_PATH
+ )
+
+ ENDIF(WIN32)
+
+ ENDIF(PYTHON_LIBRARY OR PYTHON_DEBUG_LIBRARY)
+ENDIF(PYTHON_INCLUDE_DIR)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindSIMVoleon.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindSIMVoleon.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..c4658eb948e8be4ca77b061e8c4e17c19d1e4c85
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindSIMVoleon.cmake
@@ -0,0 +1,75 @@
+# find SimVoleon library for Coin3D based Volume Rendering
+# Once done this will define
+#
+# SIMVOLEON_FOUND - system has SIMVOLEON - volume rendering library
+# SIMVOLEON_INCLUDE_DIR - where the SimVoleon include directory can be found
+# SIMVOLEON_LIBRARY - Linking library
+#
+IF(COIN3D_FOUND)
+ IF (WIN32)
+ IF (CYGWIN)
+
+ FIND_PATH(SIMVOLEON_INCLUDE_DIR VolumeViz/nodes/SoVolumeRender.h
+ /usr/include/
+ /usr/local/include/
+ )
+
+ FIND_LIBRARY(SIMVOLEON_LIBRARY SIMVoleon
+ /usr/lib
+ /usr/local/lib
+ )
+
+ ELSE (CYGWIN)
+
+ FIND_PATH(SIMVOLEON_INCLUDE_DIR VolumeViz/nodes/SoVolumeRender.h
+ "[HKEY_LOCAL_MACHINE\\SOFTWARE\\Coin3D;InstallPath]/include"
+
+ )
+
+ FIND_LIBRARY(SIMVOLEON_LIBRARY simvoleon2
+ "[HKEY_LOCAL_MACHINE\\SOFTWARE\\Coin3D;InstallPath]/lib"
+ )
+
+ IF (SIMVOLEON_LIBRARY)
+ ADD_DEFINITIONS ( -DSIMVOLEON_NOT_DLL )
+ ELSE (SIMVOLEON_LIBRARY)
+ SET (SIMVOLEON_LIBRARY simvoleon2 CACHE STRING "SIMVoleon Library - Coin3D based Volume Rendering API")
+ ENDIF (SIMVOLEON_LIBRARY)
+
+ ENDIF (CYGWIN)
+
+ ELSE (WIN32)
+ IF(APPLE)
+ FIND_PATH(SIMVOLEON_INCLUDE_DIR VolumeViz/nodes/SoVolumeRender.h
+ /usr/include
+ /usr/local/include
+ )
+
+ FIND_LIBRARY(SIMVOLEON_LIBRARY SimVoleon
+ /usr/lib
+ /usr/local/lib
+ )
+
+ ELSE(APPLE)
+
+ FIND_PATH(SIMVOLEON_INCLUDE_DIR VolumeViz/nodes/SoVolumeRender.h
+ /usr/include
+ /usr/local/include
+ )
+
+ FIND_LIBRARY(SIMVOLEON_LIBRARY SimVoleon
+ /usr/lib
+ /usr/local/lib
+ )
+
+ ENDIF(APPLE)
+
+ ENDIF (WIN32)
+
+ENDIF(COIN3D_FOUND)
+
+ SET( SIMVOLEON_FOUND "NO" )
+ IF(SIMVOLEON_LIBRARY)
+ SET( SIMVOLEON_FOUND "YES" )
+ ENDIF(SIMVOLEON_LIBRARY)
+
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindWin32SDK.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindWin32SDK.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..291815a38e68ac89a962821469d0910a44fb2731
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindWin32SDK.cmake
@@ -0,0 +1,47 @@
+# Find Win32 SDK Installation on Windows
+
+# WIN32SDK_INCLUDE_DIR - Directories to include to use WIN32SDK
+# WIN32SDK_LIBRARIES - Files to link against to use WIN32SDK
+# WIN32SDK_FOUND - Was Win32 SDK support found
+
+# Assume no Win32 SDK support at first
+SET( WIN32SDK_FOUND "NO" )
+
+# Add Win32 SDK support if Win32 SDK installation is found
+IF( WIN32 )
+ FIND_PATH(WIN32SDK_INCLUDE_DIR
+ NAMES windows.h winresrc.h
+ PATHS
+ "c:/Program Files/Microsoft SDKs/Windows"
+ "c:/Program Files (x86)/Microsoft SDKs/Windows"
+ PATH_SUFFIXES
+ "v6.0a/include"
+ "v6.1/include"
+ "v7.0A/include"
+ )
+
+ FIND_LIBRARY(WIN32SDK_LIBRARIES
+ NAMES kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib
+ PATHS
+ "c:/Program Files/Microsoft SDKs/Windows"
+ "c:/Program Files (x86)/Microsoft SDKs/Windows"
+ PATH_SUFFIXES
+ "v6.0a/lib"
+ "v6.1/lib"
+ "v7.0A/lib"
+ )
+
+ IF( WIN32SDK_INCLUDE_DIR )
+ IF(WIN32SDK_LIBRARIES)
+ SET( WIN32SDK_FOUND "YES" )
+ ENDIF(WIN32SDK_LIBRARIES)
+ ENDIF( WIN32SDK_INCLUDE_DIR )
+
+ MARK_AS_ADVANCED(
+ WIN32SDK_INCLUDE_DIR
+ WIN32SDK_LIBRARIES
+ )
+
+ENDIF( WIN32 )
+
+
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindwxWidgets.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindwxWidgets.cmake
deleted file mode 100644
index a8c05bf72cd49c1226d6b3c8f91a7358d079739d..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/FindwxWidgets.cmake
+++ /dev/null
@@ -1,485 +0,0 @@
-# - Find a wxWidgets (a.k.a., wxWindows) installation.
-# This module finds if wxWidgets is installed and selects a default
-# configuration to use.
-#
-# The following variables are searched for and set to defaults in case
-# of multiple choices. Change them if the defaults are not desired:
-#
-# WXWIDGETS_ROOT_DIR - Base wxWidgets directory
-# (e.g., C:/wxWidgets-2.6.3).
-# WXWIDGETS_LIB_DIR - Path to wxWidgets libraries
-# (e.g., C:/wxWidgets-2.6.3/lib/vc_lib).
-# WXWIDGETS_CONFIGURATION - Configuration to use
-# (e.g., msw, mswd, mswu, mswunivud, etc.)
-# WXWIDGETS_USE_LIBS - Libraries to use besides the common
-# required ones; set to base and core by
-# default.
-#
-# The following are set after configuration is done:
-#
-# WXWIDGETS_FOUND - Set to TRUE if wxWidgets was found.
-# WXWIDGETS_INCLUDE_DIR - Include directories for WIN32 (i.e.,
-# where to find "wx/wx.h" and
-# "wx/setup.h"); empty for unices.
-# WXWIDGETS_LIBRARIES - Path to the wxWidgets libraries.
-# WXWIDGETS_LINK_DIRECTORIES - Link dirs, useful for rpath on UNIX.
-# Empty string in WIN32 environment.
-# WXWIDGETS_CXX_FLAGS - Include dirs and ompiler flags for
-# unices, empty on WIN32. Esentially
-# "`wx-config --cxxflags`".
-#
-# Sample usage:
-#
-# SET(WXWIDGETS_USE_LIBS base core gl net)
-# FIND_PACKAGE(wxWidgets)
-# IF(WXWIDGETS_FOUND)
-# MESSAGE(STATUS "Found wxWidgets!")
-# IF(WIN32)
-# INCLUDE_DIRECTORIES(${WXWIDGETS_INCLUDE_DIR})
-# ELSE(WIN32)
-# SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${WXWIDGETS_CXX_FLAGS}")
-# LINK_DIRECTORIES(${WXWIDGETS_LINK_DIRECTORIES})
-# ENDIF(WIN32)
-# TARGET_LINK_LIBRARIES(target ${WXWIDGETS_LIBRARIES})
-# ENDIF(WXWIDGETS_FOUND)
-#
-# NOTES
-#
-# This module has been tested on the WIN32 platform with wxWidgets
-# 2.6.2, 2.6.3, and 2.5.3. However, it has been designed to be easily
-# extended to support all possible builds (e.g., static/shared,
-# debug/release, unicode, universal, multilib/monolithic, etc.).
-#
-# If you want to use the module and your build type is not supported
-# out-of-the-box, please contact me to exchange information on how
-# your system is setup and I'll try to add support for it.
-#
-# AUTHOR
-# Miguel A. Figueroa-Villanueva (miguelf at ieee dot org).
-#
-# Based on previous works of: Jan Woetzel (FindwxWindows.cmake),
-# and Jorgen Bodde (FindwxWin.cmake).
-
-#
-# Helper macro to control the debugging output globally.
-# - NOTE: This and all the DBG_MSG calls should be removed after the
-# module stabilizes.
-#
-MACRO(DBG_MSG _MSG)
-# MESSAGE(STATUS ${_MSG})
-ENDMACRO(DBG_MSG)
-
-#
-# Clear return values in case the module is loaded more than once.
-#
-SET(WXWIDGETS_FOUND FALSE)
-#
-SET(WXWIDGETS_INCLUDE_DIR "")
-SET(WXWIDGETS_LIBRARIES "")
-SET(WXWIDGETS_LINK_DIRECTORIES "")
-SET(WXWIDGETS_CXX_FLAGS "")
-
-#=====================================================================
-#=====================================================================
-IF(WIN32)
-
-#---------------------------------------------------------------------
-# WIN32: Helper MACROS
-#---------------------------------------------------------------------
-#
-# Get filename components for a configuration. For example,
-# if _CONFIGURATION = mswunivud, then _UNV=univ, _UCD=u _DBG=d
-# if _CONFIGURATION = mswu, then _UNV="", _UCD=u _DBG=""
-#
-MACRO(WX_GET_NAME_COMPONENTS _CONFIGURATION _UNV _UCD _DBG)
- STRING(REGEX MATCH "univ" ${_UNV} "${_CONFIGURATION}")
- STRING(REGEX REPLACE "msw.*(u)[d]*$" "u" ${_UCD} "${_CONFIGURATION}")
- IF(${_UCD} STREQUAL ${_CONFIGURATION})
- SET(${_UCD} "")
- ENDIF(${_UCD} STREQUAL ${_CONFIGURATION})
- STRING(REGEX MATCH "d$" ${_DBG} "${_CONFIGURATION}")
-ENDMACRO(WX_GET_NAME_COMPONENTS)
-
-#
-# Find libraries associated to a configuration.
-#
-MACRO(WX_FIND_LIBS _UNV _UCD _DBG)
- DBG_MSG("m_unv = ${_UNV}")
- DBG_MSG("m_ucd = ${_UCD}")
- DBG_MSG("m_dbg = ${_DBG}")
-
- # Find wxWidgets common libraries
- FOREACH(LIB png tiff jpeg zlib regex expat)
- FIND_LIBRARY(WX_${LIB}${_DBG}
- NAMES
- wx${LIB}${_UCD}${_DBG} # for regex
- wx${LIB}${_DBG}
- PATHS ${WX_LIB_DIR}
- NO_DEFAULT_PATH
- )
- MARK_AS_ADVANCED(WX_${LIB}${_DBG})
- ENDFOREACH(LIB)
-
- # Find wxWidgets multilib base libraries
- FIND_LIBRARY(WX_base${_DBG}
- NAMES
- wxbase26${_UCD}${_DBG}
- wxbase25${_UCD}${_DBG}
- PATHS ${WX_LIB_DIR}
- NO_DEFAULT_PATH
- )
- MARK_AS_ADVANCED(WX_base${_DBG})
- FOREACH(LIB net odbc xml)
- FIND_LIBRARY(WX_${LIB}${_DBG}
- NAMES
- wxbase26${_UCD}${_DBG}_${LIB}
- wxbase25${_UCD}${_DBG}_${LIB}
- PATHS ${WX_LIB_DIR}
- NO_DEFAULT_PATH
- )
- MARK_AS_ADVANCED(WX_${LIB}${_DBG})
- ENDFOREACH(LIB)
-
- # Find wxWidgets monolithic library
- FIND_LIBRARY(WX_mono${_DBG}
- NAMES
- wxmsw${_UNV}26${_UCD}${_DBG}
- wxmsw${_UNV}25${_UCD}${_DBG}
- PATHS ${WX_LIB_DIR}
- NO_DEFAULT_PATH
- )
- MARK_AS_ADVANCED(WX_mono${_DBG})
-
- # Find wxWidgets multilib libraries
- FOREACH(LIB core adv html media xrc dbgrid gl qa)
- FIND_LIBRARY(WX_${LIB}${_DBG}
- NAMES
- wxmsw${_UNV}26${_UCD}${_DBG}_${LIB}
- wxmsw${_UNV}25${_UCD}${_DBG}_${LIB}
- PATHS ${WX_LIB_DIR}
- NO_DEFAULT_PATH
- )
- MARK_AS_ADVANCED(WX_${LIB}${_DBG})
- ENDFOREACH(LIB)
-ENDMACRO(WX_FIND_LIBS)
-
-#
-# Clear all library paths, so that FIND_LIBRARY refinds them.
-#
-# Clear a lib, reset its found flag, and mark as advanced.
-MACRO(WX_CLEAR_LIB _LIB)
- SET(${_LIB} "${_LIB}-NOTFOUND" CACHE FILEPATH "Cleared." FORCE)
- SET(${_LIB}_FOUND FALSE)
- MARK_AS_ADVANCED(${_LIB})
-ENDMACRO(WX_CLEAR_LIB)
-# Clear all debug or release library paths (arguments are "d" or "").
-MACRO(WX_CLEAR_ALL_LIBS _DBG)
- # Clear wxWidgets common libraries
- FOREACH(LIB png tiff jpeg zlib regex expat)
- WX_CLEAR_LIB(WX_${LIB}${_DBG})
- ENDFOREACH(LIB)
-
- # Clear wxWidgets multilib base libraries
- WX_CLEAR_LIB(WX_base${_DBG})
- FOREACH(LIB net odbc xml)
- WX_CLEAR_LIB(WX_${LIB}${_DBG})
- ENDFOREACH(LIB)
-
- # Clear wxWidgets monolithic library
- WX_CLEAR_LIB(WX_mono${_DBG})
-
- # Clear wxWidgets multilib libraries
- FOREACH(LIB core adv html media xrc dbgrid gl qa)
- WX_CLEAR_LIB(WX_${LIB}${_DBG})
- ENDFOREACH(LIB)
-ENDMACRO(WX_CLEAR_ALL_LIBS)
-# Clear all wxWidgets debug libraries.
-MACRO(WX_CLEAR_ALL_DBG_LIBS)
- WX_CLEAR_ALL_LIBS("d")
-ENDMACRO(WX_CLEAR_ALL_DBG_LIBS)
-# Clear all wxWidgets release libraries.
-MACRO(WX_CLEAR_ALL_REL_LIBS)
- WX_CLEAR_ALL_LIBS("")
-ENDMACRO(WX_CLEAR_ALL_REL_LIBS)
-
-#
-# Set the WXWIDGETS_LIBRARIES variable.
-# Also, Sets output variable WXWIDGETS_FOUND to FALSE if it fails.
-#
-MACRO(WX_SET_LIBRARIES _LIBS _DBG)
- IF(WX_USE_REL_AND_DBG)
- FOREACH(LIB ${${_LIBS}})
- DBG_MSG("Finding ${LIB} and ${LIB}d")
- DBG_MSG("WX_${LIB} : ${WX_${LIB}}")
- DBG_MSG("WX_${LIB}d : ${WX_${LIB}d}")
- IF(WX_${LIB} AND WX_${LIB}d)
- DBG_MSG("Found ${LIB} and ${LIB}d")
- SET(WXWIDGETS_LIBRARIES ${WXWIDGETS_LIBRARIES}
- debug ${WX_${LIB}d}
- optimized ${WX_${LIB}}
- )
- ELSE(WX_${LIB} AND WX_${LIB}d)
- SET(WXWIDGETS_FOUND FALSE)
- ENDIF(WX_${LIB} AND WX_${LIB}d)
- ENDFOREACH(LIB)
- ELSE(WX_USE_REL_AND_DBG)
- FOREACH(LIB ${${_LIBS}})
- DBG_MSG("Finding ${LIB}${_DBG}")
- DBG_MSG("WX_${LIB}${_DBG} : ${WX_${LIB}${_DBG}}")
- IF(WX_${LIB}${_DBG})
- DBG_MSG("Found ${LIB}${_DBG}")
- SET(WXWIDGETS_LIBRARIES ${WXWIDGETS_LIBRARIES}
- ${WX_${LIB}${_DBG}}
- )
- ELSE(WX_${LIB}${_DBG})
- SET(WXWIDGETS_FOUND FALSE)
- ENDIF(WX_${LIB}${_DBG})
- ENDFOREACH(LIB)
- ENDIF(WX_USE_REL_AND_DBG)
-
- FOREACH(LIB ${${_LIBS}})
- DBG_MSG("required: ${LIB}")
- IF(LIB STREQUAL "gl")
- DBG_MSG("gl required: ${LIB}")
- SET(WXWIDGETS_LIBRARIES ${WXWIDGETS_LIBRARIES}
- opengl32
- glu32
- )
- ENDIF(LIB STREQUAL "gl")
- ENDFOREACH(LIB ${${_LIBS}})
-
- SET(WXWIDGETS_LIBRARIES ${WXWIDGETS_LIBRARIES}
- winmm
- comctl32
- rpcrt4
- wsock32
- )
-ENDMACRO(WX_SET_LIBRARIES)
-
-#---------------------------------------------------------------------
-# WIN32: Start actual work.
-#---------------------------------------------------------------------
-#
-# Look for an installation tree.
-#
-FIND_PATH(WXWIDGETS_ROOT_DIR include/wx/wx.h
- $ENV{WXWIN}
- "[HKEY_LOCAL_MACHINE\\SOFTWARE\\Microsoft\\Windows\\CurrentVersion\\Uninstall\\wxWidgets_is1;Inno Setup: App Path]" ## WX 2.6.x
-# "[HKEY_LOCAL_MACHINE\\SOFTWARE\\Microsoft\\Windows\\CurrentVersion\\Uninstall\\wxWindows_is1;Inno Setup: App Path]" ## WX 2.4.x
- C:\\wxWidgets-2.6.3
- D:\\wxWidgets-2.6.3
- C:\\wxWidgets-2.6.2
- D:\\wxWidgets-2.6.2
- C:\\wxWidgets-2.6.1
- D:\\wxWidgets-2.6.1
- C:\\wxWidgets-2.6.0
- D:\\wxWidgets-2.6.0
- C:\\wxWidgets-2.5.5
- D:\\wxWidgets-2.5.5
- C:\\wxWidgets-2.5.4
- D:\\wxWidgets-2.5.4
- C:\\wxWidgets-2.5.3
- D:\\wxWidgets-2.5.3
- C:\\wxWidgets-2.5.2
- D:\\wxWidgets-2.5.2
- C:\\wxWidgets-2.5.1
- D:\\wxWidgets-2.5.1
-# C:\\wxWindows-2.4.2
-# D:\\wxWindows-2.4.2
- DOC "wxWidgets base/installation directory?"
-)
-DBG_MSG("WXWIDGETS_ROOT_DIR: ${WXWIDGETS_ROOT_DIR}")
-
-# If WXWIDGETS_ROOT_DIR changed, clear all libraries and lib dir.
-IF(NOT WX_ROOT_DIR STREQUAL WXWIDGETS_ROOT_DIR)
- SET(WX_ROOT_DIR ${WXWIDGETS_ROOT_DIR} CACHE INTERNAL "WXWIDGETS_ROOT_DIR")
-# WX_CLEAR_ALL_DBG_LIBS()
-# WX_CLEAR_ALL_REL_LIBS()
- SET(WXWIDGETS_LIB_DIR "WXWIDGETS_LIB_DIR-NOTFOUND" CACHE PATH "Cleared." FORCE)
-ENDIF(NOT WX_ROOT_DIR STREQUAL WXWIDGETS_ROOT_DIR)
-DBG_MSG("WX_ROOT_DIR: ${WX_ROOT_DIR}")
-
-IF(WX_ROOT_DIR)
-
-# *** Temporary hack for cmake 2.2-patch3 and older.
-# FIND_PATH(<VAR> NAMES ... PATHS ...) not available
-# ***
-#FIND_PATH(WXWIDGETS_LIB_DIR
-# NAMES wxpng.lib wxpngd.lib
-# PATHS
-# ${WX_ROOT_DIR}/lib/vc_lib
-# ${WX_ROOT_DIR}/lib/vc_dll
-# NO_DEFAULT_PATH
-#)
-IF(NOT WXWIDGETS_LIB_DIR AND EXISTS ${WX_ROOT_DIR}/lib/vc_lib)
- SET(WXWIDGETS_LIB_DIR ${WX_ROOT_DIR}/lib/vc_lib CACHE PATH "Path to wxWidgets libraries." FORCE)
-ENDIF(NOT WXWIDGETS_LIB_DIR AND EXISTS ${WX_ROOT_DIR}/lib/vc_lib)
-IF(NOT WXWIDGETS_LIB_DIR AND EXISTS ${WX_ROOT_DIR}/lib/vc_dll)
- SET(WXWIDGETS_LIB_DIR ${WX_ROOT_DIR}/lib/vc_dll CACHE PATH "Path to wxWidgets libraries." FORCE)
-ENDIF(NOT WXWIDGETS_LIB_DIR AND EXISTS ${WX_ROOT_DIR}/lib/vc_dll)
-DBG_MSG("WXWIDGETS_LIB_DIR: ${WXWIDGETS_LIB_DIR}")
-
-# If WXWIDGETS_LIB_DIR changed, clear all libraries.
-IF(NOT WX_LIB_DIR STREQUAL WXWIDGETS_LIB_DIR)
- SET(WX_LIB_DIR ${WXWIDGETS_LIB_DIR} CACHE INTERNAL "WXWIDGETS_LIB_DIR")
- WX_CLEAR_ALL_DBG_LIBS()
- WX_CLEAR_ALL_REL_LIBS()
-ENDIF(NOT WX_LIB_DIR STREQUAL WXWIDGETS_LIB_DIR)
-DBG_MSG("WX_LIB_DIR: ${WX_LIB_DIR}")
-
-IF(WX_LIB_DIR)
- SET(WXWIDGETS_FOUND TRUE)
-
-#---------------------------------------------------------------------
-# WIN32: ???
-#---------------------------------------------------------------------
-# Search for possible configuration type availabilities
-# ***** SET(WX_LAST_CFG "")
-FOREACH(CFG mswunivud mswunivd mswud mswd mswunivu mswuniv mswu msw)
- SET(WX_${CFG}_FOUND FALSE)
- IF(EXISTS ${WX_LIB_DIR}/${CFG})
- SET(WX_CONFIGURATION_LIST ${WX_CONFIGURATION_LIST} ${CFG})
- SET(WX_${CFG}_FOUND TRUE)
- SET(WX_CONFIGURATION ${CFG})
- ENDIF(EXISTS ${WX_LIB_DIR}/${CFG})
-ENDFOREACH(CFG)
-
-# ***** SET(WX_USE_REL_AND_DBG FALSE)
-IF(WX_CONFIGURATION)
- # if selected configuration wasn't found, force the default one
- # else, use it but still force a refresh for the list in doc string
- IF(NOT WX_${WXWIDGETS_CONFIGURATION}_FOUND)
- SET(WXWIDGETS_CONFIGURATION ${WX_CONFIGURATION} CACHE STRING
- "Set wxWidgets configuration (${WX_CONFIGURATION_LIST})" FORCE)
- ELSE(NOT WX_${WXWIDGETS_CONFIGURATION}_FOUND)
- SET(WXWIDGETS_CONFIGURATION ${WXWIDGETS_CONFIGURATION} CACHE STRING
- "Set wxWidgets configuration (${WX_CONFIGURATION_LIST})" FORCE)
- ENDIF(NOT WX_${WXWIDGETS_CONFIGURATION}_FOUND)
-
- # if release config was selected, and both release/debug exist
- IF(WX_${WXWIDGETS_CONFIGURATION}d_FOUND)
- OPTION(WXWIDGETS_USE_REL_AND_DBG
- "Use release and debug configurations?" TRUE)
- SET(WX_USE_REL_AND_DBG ${WXWIDGETS_USE_REL_AND_DBG})
- ELSE(WX_${WXWIDGETS_CONFIGURATION}d_FOUND)
- # if the option exists, force it to false
- IF(WXWIDGETS_USE_REL_AND_DBG)
- SET(WXWIDGETS_USE_REL_AND_DBG FALSE CACHE BOOL
- "No ${WXWIDGETS_CONFIGURATION}d found." FORCE)
- ENDIF(WXWIDGETS_USE_REL_AND_DBG)
- SET(WX_USE_REL_AND_DBG FALSE)
- ENDIF(WX_${WXWIDGETS_CONFIGURATION}d_FOUND)
-
- # Get configuration parameters from the name.
- WX_GET_NAME_COMPONENTS(${WXWIDGETS_CONFIGURATION} UNV UCD DBG)
-
- # Set wxWidgets main include directory.
- IF(EXISTS ${WX_ROOT_DIR}/include/wx/wx.h)
- SET(WXWIDGETS_INCLUDE_DIR ${WX_ROOT_DIR}/include)
- ELSE(EXISTS ${WX_ROOT_DIR}/include/wx/wx.h)
- SET(WXWIDGETS_FOUND FALSE)
- ENDIF(EXISTS ${WX_ROOT_DIR}/include/wx/wx.h)
-
- # Set wxWidgets lib setup include directory.
- IF(EXISTS ${WX_LIB_DIR}/${WXWIDGETS_CONFIGURATION}/wx/setup.h)
- SET(WXWIDGETS_INCLUDE_DIR ${WXWIDGETS_INCLUDE_DIR}
- ${WX_LIB_DIR}/${WXWIDGETS_CONFIGURATION})
- ELSE(EXISTS ${WX_LIB_DIR}/${WXWIDGETS_CONFIGURATION}/wx/setup.h)
- SET(WXWIDGETS_FOUND FALSE)
- ENDIF(EXISTS ${WX_LIB_DIR}/${WXWIDGETS_CONFIGURATION}/wx/setup.h)
- #FIND_PATH(WX_SETUP_INCLUDE_DIR wx/setup.h
- # ${WX_LIB_DIR}/${WXWIDGETS_CONFIGURATION})
- #MARK_AS_ADVANCED(WX_SETUP_INCLUDE_DIR)
-
- # Find wxWidgets libraries.
- WX_FIND_LIBS("${UNV}" "${UCD}" "${DBG}")
- IF(WX_USE_REL_AND_DBG)
- WX_FIND_LIBS("${UNV}" "${UCD}" "d")
- ENDIF(WX_USE_REL_AND_DBG)
-
- # Libraries we are interested in.
- IF(WXWIDGETS_USE_LIBS)
- # Add the common required libs.
- SET(WXWIDGETS_USE_LIBS ${WXWIDGETS_USE_LIBS}
- png tiff jpeg zlib regex expat
- )
- ELSE(WXWIDGETS_USE_LIBS)
- # Default minimal use setting (i.e., link to only core and base).
- SET(WXWIDGETS_USE_LIBS base core
- png tiff jpeg zlib regex expat
- )
- ENDIF(WXWIDGETS_USE_LIBS)
-
- # Settings for requested libs (i.e., include dir, libraries, etc.).
- WX_SET_LIBRARIES(WXWIDGETS_USE_LIBS "${DBG}")
-
-ENDIF(WX_CONFIGURATION)
-ENDIF(WX_LIB_DIR)
-ENDIF(WX_ROOT_DIR)
-
-
-#=====================================================================
-#=====================================================================
-ELSE(WIN32)
- FIND_PROGRAM(WXWIDGETS_CONFIG_EXE wx-config)
- IF(WXWIDGETS_CONFIG_EXE)
- SET(WXWIDGETS_FOUND TRUE)
-
- # run the wx-config program to get cxxflags
- EXEC_PROGRAM(${WXWIDGETS_CONFIG_EXE}
- ARGS "--cxxflags"
- OUTPUT_VARIABLE WXWIDGETS_CXX_FLAGS
- RETURN_VALUE RET)
- IF(NOT RET EQUAL 0)
- SET(WXWIDGETS_FOUND FALSE)
- ENDIF(NOT RET EQUAL 0)
-
- # run the wx-config program to get the libs
- # - NOTE: wx-config doesn't verify that the libs requested exist
- # it just produces the names. Maybe a TRY_COMPILE would
- # be useful here...
- #STRING(REPLACE ";" "," WXWIDGETS_USE_LIBS "${WXWIDGETS_USE_LIBS}")
- STRING(REGEX REPLACE ";" "," WXWIDGETS_USE_LIBS "${WXWIDGETS_USE_LIBS}")
- DBG_MSG(${WXWIDGETS_USE_LIBS})
- EXEC_PROGRAM(${WXWIDGETS_CONFIG_EXE}
- ARGS "--libs ${WXWIDGETS_USE_LIBS}"
- OUTPUT_VARIABLE WXWIDGETS_LIBRARIES
- RETURN_VALUE RET)
- IF(RET EQUAL 0)
- SEPARATE_ARGUMENTS(WXWIDGETS_LIBRARIES)
- STRING(REGEX REPLACE "-framework;" "-framework "
- WXWIDGETS_LIBRARIES
- "${WXWIDGETS_LIBRARIES}")
-
- # extract linkdirs (-L) for rpath (i.e., LINK_DIRECTORIES)
- STRING(REGEX MATCHALL "[-][L][^ ;]+"
- WXWIDGETS_LINK_DIRECTORIES
- "${WXWIDGETS_LIBRARIES}")
- STRING(REGEX REPLACE "[-][L]" ""
- WXWIDGETS_LINK_DIRECTORIES
- "${WXWIDGETS_LINK_DIRECTORIES}")
- ELSE(RET EQUAL 0)
- SET(WXWIDGETS_FOUND FALSE)
- ENDIF(RET EQUAL 0)
- ENDIF(WXWIDGETS_CONFIG_EXE)
-ENDIF(WIN32)
-
-DBG_MSG("WXWIDGETS_FOUND : ${WXWIDGETS_FOUND}" )
-DBG_MSG("WXWIDGETS_INCLUDE_DIR: ${WXWIDGETS_INCLUDE_DIR}")
-DBG_MSG("WXWIDGETS_LIBRARIES : ${WXWIDGETS_LIBRARIES}" )
-DBG_MSG("WXWIDGETS_LINK_DIRECTORIES: ${WXWIDGETS_LINK_DIRECTORIES}")
-DBG_MSG("WXWIDGETS_CXX_FLAGS : ${WXWIDGETS_CXX_FLAGS}" )
-
-#=====================================================================
-#=====================================================================
-IF(NOT WXWIDGETS_FOUND)
- # make FIND_PACKAGE friendly
- IF(NOT wxWidgets_FIND_QUIETLY)
- IF(wxWidgets_FIND_REQUIRED)
- MESSAGE(FATAL_ERROR
- "wxWidgets required, please specify it's location.")
- ELSE(wxWidgets_FIND_REQUIRED)
- MESSAGE(STATUS "Warning: wxWidgets was not found.")
- ENDIF(wxWidgets_FIND_REQUIRED)
- ENDIF(NOT wxWidgets_FIND_QUIETLY)
-ENDIF(NOT WXWIDGETS_FOUND)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/readme.txt b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/readme.txt
index 3f8ef0d56fbb0fc9f1f7eb6cab23f23aa9d10c59..b69c3592570d99e3de8c98529706272985dedf79 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/readme.txt
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/NewCMake/readme.txt
@@ -1,2 +1,13 @@
This directory contains Module files which will be available from the CMake distribution in the next release.
Any files in this directory should be identical to the latest versions in the CMake repository.
+
+To facilitate the deprecation of modules, place code similar to the
+following in the FindXXX.cmake as soon as it becomes part of a CMake
+release:
+
+# FIXME: When cmake_minimum_version reaches 2.6.2 the FindXXX
+# module in this directory is not needed anymore.
+IF(CMAKE_MINIMUM_REQUIRED_VERSION GREATER 2.6.1)
+ MESSAGE(FATAL_ERROR
+ "FindXXX not needed in vxl; it is now available in CMake.")
+ENDIF(CMAKE_MINIMUM_REQUIRED_VERSION GREATER 2.6.1)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/UseBGUI3D.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/UseBGUI3D.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..01a426abc7ca11756684e9ce40db8b4686f15ab9
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/UseBGUI3D.cmake
@@ -0,0 +1,37 @@
+# modified by Kongbin to add support for volume rendering
+
+SET (HAS_BGUI3D "NO")
+IF (BGUI3D_FOUND)
+
+ # Find the Coin3D library
+ INCLUDE( ${MODULE_PATH}/NewCMake/FindCoin3D.cmake )
+
+ IF (COIN3D_FOUND)
+ INCLUDE_DIRECTORIES( ${COIN3D_INCLUDE_DIR} )
+ SET( HAS_BGUI3D "YES" )
+ ADD_DEFINITIONS( -DHAS_BGUI3D )
+ LINK_LIBRARIES( ${COIN3D_LIBRARY} )
+ ENDIF (COIN3D_FOUND)
+
+ # Find the SimVoleon library
+ INCLUDE( ${MODULE_PATH}/NewCMake/FindSIMVoleon.cmake )
+
+ IF (SIMVOLEON_FOUND)
+ INCLUDE_DIRECTORIES( ${SIMVOLEON_INCLUDE_DIR} )
+ LINK_LIBRARIES ( ${SIMVOLEON_LIBRARY} )
+ ENDIF (SIMVOLEON_FOUND)
+
+ INCLUDE_DIRECTORIES( ${brl_INCLUDE_DIR} )
+
+ENDIF (BGUI3D_FOUND)
+
+# This case is for using BGUI3D in an external project
+IF (VXL_BGUI3D_FOUND)
+
+ INCLUDE_DIRECTORIES( ${VXL_BRL_INCLUDE_DIR} )
+ INCLUDE_DIRECTORIES( ${VXL_COIN3D_INCLUDE_DIR} )
+ ADD_DEFINITIONS( -DHAS_BGUI3D )
+ ADD_DEFINITIONS ( -DCOIN_NOT_DLL )
+ SET( HAS_BGUI3D "YES" )
+
+ENDIF (VXL_BGUI3D_FOUND)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/UseVXL.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/UseVXL.cmake
index 7f8da6c715ea1ea53669ab28bb55d2abf55ad651..92c2f822432e5609df3f9f39edfc82ea71adaf31 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/UseVXL.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/UseVXL.cmake
@@ -1,4 +1,4 @@
-# vxl/config/cmake/UseVXL.cmake
+# vxl/config/cmake/Modules/UseVXL.cmake
# (also copied by CMake to the top-level of the vxl build tree)
#
# This CMake file may be included by projects outside VXL. It
@@ -96,12 +96,14 @@ IF(VXL_CONFIG_CMAKE)
SET(OXL_INCLUDE_DIR ${VXL_OXL_INCLUDE_DIR})
SET(RPL_INCLUDE_DIR ${VXL_RPL_INCLUDE_DIR})
SET(TBL_INCLUDE_DIR ${VXL_TBL_INCLUDE_DIR})
+ SET(PYTHON_INCLUDE_PATH ${VXL_PYTHON_INCLUDE_PATH})
SET(CONVERSIONS_INCLUDE_DIR ${VXL_CONVERSIONS_INCLUDE_DIR})
SET(BUILD_VGUI ${VXL_VGUI_FOUND})
SET(BUILD_BRL ${VXL_BRL_FOUND})
SET(BUILD_BGUI3D ${VXL_BGUI3D_FOUND})
SET(COIN3D_FOUND ${VXL_COIN3D_FOUND})
+ SET(PYTHON_FOUND ${VXL_PYTHON_FOUND})
SET(BUILD_OUL ${VXL_OUL_FOUND})
SET(BUILD_CONTRIB ${VXL_CONTRIB_FOUND})
SET(BUILD_TARGETJR ${VXL_TARGETJR_FOUND})
@@ -128,7 +130,10 @@ IF(VXL_CONFIG_CMAKE)
SET(MODULE_PATH ${VXL_CMAKE_DIR})
SET(VXL_LIBRARY_PATH ${VXL_LIBRARY_DIR})
ENDIF(VXL_PROVIDE_OLD_CACHE_NAMES)
-
+
+ # Allow use of VXL's cmake/doxygen framework
+ INCLUDE(${VXL_CMAKE_DOXYGEN_DIR}/doxygen.cmake)
+
IF(VXL_PROVIDE_STANDARD_OPTIONS)
# Provide the standard set of VXL CMake options to the project.
INCLUDE(${VXL_CMAKE_DIR}/VXLStandardOptions.cmake)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLConfig.cmake.in b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLConfig.cmake.in
index 6f4b43a5902bae1b18c2be529544b5aa0f62b8cd..9ab92f1f693864ac3a05a18b3b41574962a671fc 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLConfig.cmake.in
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLConfig.cmake.in
@@ -40,10 +40,20 @@ SET(VXL_LIBRARY_DIR "@LIBRARY_OUTPUT_PATH@")
# Clients projects should not use the Find*.cmake files in this directory.
SET(VXL_CMAKE_DIR "@VXL_CMAKE_DIR@")
-# VXL Configuration options.
+# Doxygen Support
+SET(VXL_CMAKE_DOXYGEN_DIR "@VXL_CMAKE_DOXYGEN_DIR@")
+
+
+
+# VXL Configuration options. You don't have to build with the same options as VXL, but it often helps.
SET(VXL_BUILD_SHARED_LIBS "@BUILD_SHARED_LIBS@")
SET(VXL_BUILD_TESTS "@BUILD_TESTS@")
SET(VXL_BUILD_EXAMPLES "@BUILD_EXAMPLES@")
+SET(VXL_EXTRA_CMAKE_CXX_FLAGS "@VXL_EXTRA_CMAKE_CXX_FLAGS@")
+SET(VXL_EXTRA_CMAKE_C_FLAGS "@VXL_EXTRA_CMAKE_C_FLAGS@")
+SET(VXL_EXTRA_CMAKE_EXE_LINKER_FLAGS "@VXL_EXTRA_CMAKE_EXE_LINKER_FLAGS@")
+SET(VXL_EXTRA_CMAKE_MODULE_LINKER_FLAGS "@VXL_EXTRA_CMAKE_MODULE_LINKER_FLAGS@")
+SET(VXL_EXTRA_CMAKE_SHARED_LINKER_FLAGS "@VXL_EXTRA_CMAKE_SHARED_LINKER_FLAGS@")
# VXL has many parts that are optional, depending on selections made
# when building. The stanzas below give a consistent (though
@@ -51,8 +61,9 @@ SET(VXL_BUILD_EXAMPLES "@BUILD_EXAMPLES@")
# determine whether a part was built (_FOUND), where its headers are
# located (_INCLUDE_DIR) and in some cases what libraries must be
# linked to use the part (_LIBRARIES). Most client projects will
-# likely still refer to vcl by hard-wired "vcl" instead of using the
-# variable VXL_VCL_LIBRARIES, but it is there just in case.
+# likely still refer to individual VXL libraries such as vcl, for
+# example, by hard-wired "vcl" instead of using the variable
+# VXL_VCL_LIBRARIES, but it is there just in case.
SET(VXL_VCL_FOUND "YES" ) # VXL vcl is always FOUND. It is not optional.
SET(VXL_VCL_INCLUDE_DIR "@VCL_INCLUDE_DIR@")
@@ -62,10 +73,16 @@ SET(VXL_CORE_FOUND "YES" ) # VXL core is always FOUND. It is not optional.
SET(VXL_CORE_INCLUDE_DIR "@VXLCORE_INCLUDE_DIR@")
# VXL core has many libraries
+SET(VXL_CORE_VIDEO_FOUND "@CORE_VIDEO_FOUND@" )
+SET(VXL_CORE_VIDEO_INCLUDE_DIR "@VXLCORE_INCLUDE_DIR@")
+SET(VXL_CORE_VIDEO_LIBRARIES "vidl1 vidl_vil1 vidl")
+
SET(VXL_VGUI_FOUND "@VGUI_FOUND@")
SET(VXL_VGUI_INCLUDE_DIR "@OPENGL_INCLUDE_DIR@")
SET(VXL_VGUI_LIBRARIES "vgui")
+SET(VXL_VGUI_WX_FOUND "@BUILD_VGUI_WX@")
+
SET(VXL_CONTRIB_FOUND "@BUILD_CONTRIB@")
# VXL contrib has subdirectories handled independently below
# VXL contrib has many libraries
@@ -97,6 +114,7 @@ SET(VXL_OXL_INCLUDE_DIR "@OXL_INCLUDE_DIR@")
# VXL OXL has many libraries
SET(VXL_RPL_FOUND "@BUILD_RPL@")
+SET(VXL_RPL_RGTL_FOUND "@BUILD_RPL_RGTL@")
SET(VXL_RPL_INCLUDE_DIR "@RPL_INCLUDE_DIR@")
# VXL RPL has many libraries
@@ -153,8 +171,19 @@ SET(VXL_RPLY_INCLUDE_DIR "@RPLY_INCLUDE_DIR@")
SET(VXL_RPLY_LIBRARIES "@RPLY_LIBRARIES@")
SET(VXL_COIN3D_FOUND "@COIN3D_FOUND@")
+SET(VXL_COIN3D_INCLUDE_DIR "@COIN3D_INCLUDE_DIR@")
SET(VXL_COIN3D_LIBRARY "@COIN3D_LIBRARY@")
+SET(VXL_PYTHON_FOUND "@PYTHON_FOUND@")
+SET(VXL_PYTHON_INCLUDE_PATH "@PYTHON_INCLUDE_PATH@")
+SET(VXL_PYTHON_PC_INCLUDE_PATH "@PYTHON_PC_INCLUDE_PATH@")
+SET(VXL_PYTHON_LIBRARY "@PYTHON_LIBRARY@")
+SET(VXL_PYTHON_DEBUG_LIBRARY "@PYTHON_DEBUG_LIBRARY@")
+
+SET(VXL_EXPAT_FOUND "@EXPAT_FOUND@")
+SET(VXL_EXPAT_INCLUDE_DIR "@EXPAT_INCLUDE_DIR@")
+SET(VXL_EXPAT_LIBRARIES "@EXPAT_LIBRARIES@")
+
# Tell UseVXL.cmake that VXLConfig.cmake has been included.
SET(VXL_CONFIG_CMAKE 1)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLConfig_export.cmake.in b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLConfig_export.cmake.in
index d438c052463067ba08ba22ca46e09b78899b30ec..31d18705beb617f60435f089a0d3c77eebf2642a 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLConfig_export.cmake.in
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLConfig_export.cmake.in
@@ -1,3 +1,4 @@
+
# vxl/config/cmake/VXLConfig_export.cmake.in
# also configured by CMake to
# @vxl_BINARY_DIR@/config/cmake/export/VXLConfig.cmake
@@ -40,10 +41,15 @@ SET(VXL_LIBRARY_DIR "@CMAKE_INSTALL_PREFIX@/lib")
# Clients projects should not use the Find*.cmake files in this directory.
SET(VXL_CMAKE_DIR "@CMAKE_INSTALL_PREFIX@/share/vxl/cmake")
-# VXL Configuration options.
+# VXL Configuration options. You don't have to build with the same options as VXL, but it often helps.
SET(VXL_BUILD_SHARED_LIBS "@BUILD_SHARED_LIBS@")
SET(VXL_BUILD_TESTS "@BUILD_TESTS@")
SET(VXL_BUILD_EXAMPLES "@BUILD_EXAMPLES@")
+SET(VXL_EXTRA_CMAKE_CXX_FLAGS "@VXL_EXTRA_CMAKE_CXX_FLAGS@")
+SET(VXL_EXTRA_CMAKE_C_FLAGS "@VXL_EXTRA_CMAKE_C_FLAGS@")
+SET(VXL_EXTRA_CMAKE_EXE_LINKER_FLAGS "@VXL_EXTRA_CMAKE_EXE_LINKER_FLAGS@")
+SET(VXL_EXTRA_CMAKE_MODULE_LINKER_FLAGS "@VXL_EXTRA_CMAKE_MODULE_LINKER_FLAGS@")
+SET(VXL_EXTRA_CMAKE_SHARED_LINKER_FLAGS "@VXL_EXTRA_CMAKE_SHARED_LINKER_FLAGS@")
# VXL has many parts that are optional, depending on selections made
# when building. The stanzas below give a consistent (though
@@ -51,8 +57,9 @@ SET(VXL_BUILD_EXAMPLES "@BUILD_EXAMPLES@")
# determine whether a part was built (_FOUND), where its headers are
# located (_INCLUDE_DIR) and in some cases what libraries must be
# linked to use the part (_LIBRARIES). Most client projects will
-# likely still refer to vcl by hard-wired "vcl" instead of using the
-# variable VXL_VCL_LIBRARIES, but it is there just in case.
+# likely still refer to individual VXL libraries such as vcl, for
+# example, by hard-wired "vcl" instead of using the variable
+# VXL_VCL_LIBRARIES, but it is there just in case.
SET(VXL_VCL_FOUND "YES" ) # VXL vcl is always FOUND. It is not optional.
SET(VXL_VCL_INCLUDE_DIR "@VCL_INSTALL_INCLUDE_DIR@")
@@ -62,10 +69,16 @@ SET(VXL_CORE_FOUND "YES" ) # VXL core is always FOUND. It is not optional.
SET(VXL_CORE_INCLUDE_DIR "@VXLCORE_INSTALL_INCLUDE_DIR@")
# VXL core has many libraries
+SET(VXL_CORE_VIDEO_FOUND "@CORE_VIDEO_FOUND@" )
+SET(VXL_CORE_VIDEO_INCLUDE_DIR "@VXLCORE_INSTALL_INCLUDE_DIR@")
+SET(VXL_CORE_VIDEO_LIBRARIES "vidl1 vidl_vil1 vidl")
+
SET(VXL_VGUI_FOUND "@VGUI_FOUND@")
SET(VXL_VGUI_INCLUDE_DIR "@OPENGL_INCLUDE_DIR@")
SET(VXL_VGUI_LIBRARIES "vgui")
+SET(VXL_VGUI_WX_FOUND "@BUILD_VGUI_WX@")
+
SET(VXL_CONTRIB_FOUND "@BUILD_CONTRIB@")
# VXL contrib has subdirectories handled independently below
# VXL contrib has many libraries
@@ -101,6 +114,7 @@ SET(VXL_PRIP_INCLUDE_DIR "@PRIP_INSTALL_INCLUDE_DIR@")
# VXL PRIP has many libraries
SET(VXL_RPL_FOUND "@BUILD_RPL@")
+SET(VXL_RPL_RGTL_FOUND "@BUILD_RPL_RGTL@")
SET(VXL_RPL_INCLUDE_DIR "@RPL_INSTALL_INCLUDE_DIR@")
# VXL RPL has many libraries
@@ -156,6 +170,16 @@ SET(VXL_COIN3D_FOUND "@COIN3D_FOUND@")
SET(VXL_COIN3D_INCLUDE_DIR "@COIN3D_INSTALL_INCLUDE_DIR@")
SET(VXL_COIN3D_LIBRARY "@COIN3D_LIBRARY@")
+SET(VXL_PYTHON_FOUND "@PYTHON_FOUND@")
+SET(VXL_PYTHON_INCLUDE_PATH "@PYTHON_INCLUDE_PATH@")
+SET(VXL_PYTHON_PC_INCLUDE_PATH "@PYTHON_PC_INCLUDE_PATH@")
+SET(VXL_PYTHON_LIBRARY "@PYTHON_LIBRARY@")
+SET(VXL_PYTHON_DEBUG_LIBRARY "@PYTHON_DEBUG_LIBRARY@")
+
+SET(VXL_EXPAT_FOUND "@EXPAT_FOUND@")
+SET(VXL_EXPAT_INCLUDE_DIR "@EXPAT_INSTALL_INCLUDE_DIR@")
+SET(VXL_EXPAT_LIBRARIES "@EXPAT_LIBRARIES@")
+
# Tell UseVXL.cmake that VXLConfig.cmake has been included.
SET(VXL_CONFIG_CMAKE 1)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLStandardOptions.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLStandardOptions.cmake
index d1823fd5d2dcef3b0fc3c51522a585c3cd9dffde..3236f282456fb4a098d06549039097ee00216d1f 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLStandardOptions.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/Modules/VXLStandardOptions.cmake
@@ -21,7 +21,7 @@
# Everything here should be valid for both the vxl source and for
# client projects.
-INCLUDE( ${CMAKE_ROOT}/Modules/Dart.cmake )
+INCLUDE(CTest)
IF( WIN32 )
OPTION( BUILD_SHARED_LIBS "Should shared libraries be the default?" NO )
@@ -34,26 +34,6 @@ IF( CMAKE_SYSTEM MATCHES "SunOS.*" )
SET( SOLARIS 1 )
ENDIF( CMAKE_SYSTEM MATCHES "SunOS.*" )
-# if this is a dashboard build
-IF( DART_ROOT )
- ADD_DEFINITIONS( -DDART_BUILD )
-ENDIF( DART_ROOT)
-
-# Some people may want to build the test cases even though they aren't
-# using Dart.
-IF( NOT DART_ROOT )
- IF( WIN32 )
- OPTION( BUILD_TESTING "Should the tests be built?" NO )
- ELSE( WIN32 )
- OPTION( BUILD_TESTING "Should the tests be built?" YES )
- ENDIF( WIN32 )
-
- IF( BUILD_TESTING )
- ENABLE_TESTING()
- ENDIF( BUILD_TESTING )
-ENDIF( NOT DART_ROOT )
-OPTION( BUILD_TESTING "Should the tests be built?" YES )
-
# By default, build examples when building tests.
OPTION( BUILD_EXAMPLES "Should the examples be built?" ${BUILD_TESTING} )
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/config/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/config/cmake/config/CMakeLists.txt
index 6d382c3db8fa1f2526bc03b45d4bb44321e961c6..75c9404a8beaa1481b07c07e79242f1a5d6ef3cd 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/config/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/config/CMakeLists.txt
@@ -21,9 +21,9 @@ MARK_AS_ADVANCED( VXL_UPDATE_CONFIGURATION )
# to update cached results. Whenever you make a change that makes it
# necessary for cached values to be updated, increment the serial
# number. The format follows a DNS-style numbering: the current date
-# followed by a modification time within the day.
+# followed by a modification count within the day.
#
-SET( VXL_CONFIG_SERIAL_CURRENT "2007-13-09-001" )
+SET( VXL_CONFIG_SERIAL_CURRENT "2009-04-28-001" )
IF( ${VXL_CONFIG_SERIAL_CURRENT} MATCHES "^${VXL_CONFIG_SERIAL_LAST}$" )
# The configuration is current
@@ -125,6 +125,15 @@ IF(APPLE)
ENDIF(NOT ${VXL_APPLE_HAS_ISNAND})
ENDIF(APPLE)
+# Check if Windows have wchar_t defined
+IF(WIN32)
+ PERFORM_CMAKE_TEST(vxl_platform_tests.cxx VXL_HAS_WIN_WCHAR_T)
+ENDIF(WIN32)
+
+
+# Test the ability of shared libraries to link to static vxl libriares
+PERFORM_CMAKE_TEST_CUSTOM(vxl_shared_link_test VXL_PIC_COMPATIBLE)
+
#
# Find header files
#
@@ -186,6 +195,30 @@ PERFORM_CHECK_HEADER(ieeefp.h VXL_HAS_IEEEFP_H)
PERFORM_CHECK_HEADER(iso646.h VCL_CXX_HAS_HEADER_ISO646_H)
PERFORM_CHECK_HEADER(emmintrin.h VXL_HAS_EMMINTRIN_H)
+#
+# Check for new C++0x standard additions (including TR1)
+#
+
+PERFORM_CHECK_HEADER(tr1/memory VCL_CXX_HAS_TR1)
+CHECK_TYPE_EXISTS_ZERO(std::shared_ptr<void> memory VCL_MEMORY_HAS_SHARED_PTR)
+CHECK_TYPE_EXISTS_ZERO(std::tr1::shared_ptr<void> tr1/memory VCL_TR1_MEMORY_HAS_SHARED_PTR)
+
+IF(VCL_MEMORY_HAS_SHARED_PTR OR VCL_TR1_MEMORY_HAS_SHARED_PTR)
+ OPTION(VCL_INCLUDE_CXX_0X "Enable C++0x standard extensions" ${YES_FOR_VXL_DASHBOARD})
+ MARK_AS_ADVANCED(VCL_INCLUDE_CXX_0X)
+ELSE(VCL_MEMORY_HAS_SHARED_PTR OR VCL_TR1_MEMORY_HAS_SHARED_PTR)
+ SET(VCL_INCLUDE_CXX_0X 0)
+ENDIF(VCL_MEMORY_HAS_SHARED_PTR OR VCL_TR1_MEMORY_HAS_SHARED_PTR)
+
+# Make sure boolean values are (0,1) not (NO,YES)
+IF(VCL_INCLUDE_CXX_0X)
+ SET(VCL_INCLUDE_CXX_0X 1)
+ELSE(VCL_INCLUDE_CXX_0X)
+ SET(VCL_INCLUDE_CXX_0X 0)
+ENDIF(VCL_INCLUDE_CXX_0X)
+
+
+
# check for hardware support for sse2 with the current compiler flags
PERFORM_CMAKE_TEST_RUN(vxl_platform_tests.cxx VXL_HAS_SSE2_HARDWARE_SUPPORT)
@@ -199,11 +232,8 @@ IF(NOT VXL_HAS_SSE2_HARDWARE_SUPPORT)
SET( VXL_SSE2_HARDWARE_SUPPORT_POSSIBLE_HELP
"The current compiler flags do not allow the SSE2 instructions to be used. "
"It looks like if you add the flag '-msse2' you will be able to use the "
- "SSE2 instructions. If you chose to set VNL_CONFIG_ENABLE_SSE or "
- "VNL_CONFIG_ENABLE_SSE2_ROUNDING to ON, cmake will put this flag for you. "
- "You can also add this flag yourself. If you still see this message, after "
- "the flag change, you may need to set VXL_UPDATE_CONFIGURATION to ON and "
- "rerun cmake."
+ "SSE2 instructions. If you make this change and still see this message, "
+ " you may need to set VXL_UPDATE_CONFIGURATION to ON."
CACHE INTERNAL "help string for how to enable SSE2 support" )
SET(CMAKE_REQUIRED_FLAGS ${VXL_SSE_TEST_FLAG_BACKUP})
ENDIF(CMAKE_COMPILER_IS_GNUCXX)
@@ -261,6 +291,17 @@ SET_INVERT(VXL_LITTLE_ENDIAN "${VXL_BIG_ENDIAN}")
SET(VCL_USE_NATIVE_STL 1) # change if no
SET(VCL_USE_NATIVE_COMPLEX 1)
SET(VCL_USE_IMPLICIT_TEMPLATES 1) # change if no
+SET(VCL_USE_ATOMIC_COUNT 1)
+#OPTION(VCL_USE_ATOMIC_COUNT
+# "Whether thread-safe vcl_atomic_count implementations are used." ON)
+#MARK_AS_ADVANCED( VCL_USE_ATOMIC_COUNT )
+## Need to enforce 1/0 values for configuration.
+#IF(VCL_USE_ATOMIC_COUNT)
+# SET(VCL_USE_ATOMIC_COUNT 1)
+#ELSE(VCL_USE_ATOMIC_COUNT)
+# SET(VCL_USE_ATOMIC_COUNT 0)
+#ENDIF(VCL_USE_ATOMIC_COUNT)
+
SET(VXL_TWO_ARG_GETTIME 0) # not used
IF(NOT VCL_CAN_DO_IMPLICIT_TEMPLATES)
@@ -322,6 +363,13 @@ ELSE(HAVE_UNISTD_H)
SET(VXL_UNISTD_HAS_GETPID 1)
ENDIF(HAVE_UNISTD_H)
+#
+# Check the address model of the build, i.e. 32-bit (4-byte) or 64-bit (8-byte).
+# The type of size_t is directly related to address model on most machines and compilers.
+# Hence, we detect the size of size_t instead.
+#
+check_type_size(size_t VXL_SIZEOF_SIZE_T)
+MATH(EXPR VXL_ADDRESS_BITS 8*${VXL_SIZEOF_SIZE_T} )
#
# Check numeric_limits infinity stuff
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_config_macros.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_config_macros.cmake
index dfc49469be72980085538c4745be6538a8302ed4..83ebe5740da658eb930bf8d6ad1605fb1ca6934d 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_config_macros.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_config_macros.cmake
@@ -46,6 +46,52 @@ MACRO(PERFORM_CMAKE_TEST FILE TEST)
ENDIF("${TEST}" MATCHES "^${TEST}$")
ENDMACRO(PERFORM_CMAKE_TEST FILE TEST)
+#
+# Perform a custom VXL try compile test with status output
+#
+# DIR is the directory containing the test project
+#
+# Sets the TEST to 1 if the corresponding program could be compiled
+# and linked
+#
+
+MACRO(PERFORM_CMAKE_TEST_CUSTOM DIR TEST)
+ IF( VXL_UPDATE_CONFIGURATION )
+ SET( ${TEST} "${TEST}" )
+ ENDIF( VXL_UPDATE_CONFIGURATION )
+ IF("${TEST}" MATCHES "^${TEST}$")
+ # Perform test
+ SET(MACRO_CHECK_FUNCTION_DEFINITIONS
+ "-D${TEST} ${CMAKE_REQUIRED_FLAGS}")
+ IF(CMAKE_REQUIRED_LIBRARIES)
+ SET(TEST_ADD_LIBRARIES
+ "-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}")
+ ENDIF(CMAKE_REQUIRED_LIBRARIES)
+ MESSAGE(STATUS "Performing Test ${TEST}")
+
+ TRY_COMPILE(${TEST}
+ ${CMAKE_BINARY_DIR}/config/${DIR}
+ ${vxl_config_SOURCE_DIR}/${DIR}
+ ${TEST}
+ CMAKE_FLAGS -DCOMPILE_DEFINITIONS:STRING=${MACRO_CHECK_FUNCTION_DEFINITIONS}
+ -DCMAKE_CXX_FLAGS:STRING=${CMAKE_CXX_FLAGS}
+ -DCMAKE_C_FLAGS:STRING=${CMAKE_C_FLAGS}
+ "${TEST_ADD_LIBRARIES}"
+ OUTPUT_VARIABLE OUTPUT)
+ IF(${TEST})
+ SET(${TEST} 1 CACHE INTERNAL "VXL test ${FUNCTION}")
+ MESSAGE(STATUS "Performing Test ${TEST} - Success")
+ ELSE(${TEST})
+ MESSAGE(STATUS "Performing Test ${TEST} - Failed")
+ SET(${TEST} 0 CACHE INTERNAL "Test ${FUNCTION}")
+ WRITE_FILE(${CMAKE_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/CMakeError.log
+ "Performing Test ${TEST} failed with the following output:\n"
+ "${OUTPUT}\n" APPEND)
+ ENDIF(${TEST})
+ ENDIF("${TEST}" MATCHES "^${TEST}$")
+ FILE(REMOVE_RECURSE ${CMAKE_BINARY_DIR}/config/${DIR})
+ENDMACRO(PERFORM_CMAKE_TEST_CUSTOM DIR TEST)
+
#
# Perform the VXL specific try-run test with status output
#
@@ -249,23 +295,18 @@ MACRO( DETERMINE_TYPE VAR INTEGRAL_TYPE SIZE TYPE_LIST )
# line to avoid issues with spaces. (In "long double", for
# example)
WRITE_FILE( ${CMAKE_BINARY_DIR}/CMakeTmp/config.h "#define THE_TYPE ${TYPE}\n#define THE_SIZE ${SIZE}\n#define INTEGRAL_TYPE ${INTEGRAL_TYPE}" )
- SET( MACRO_DETERMINE_TYPE_FLAGS "-DVXL_HAS_TYPE_OF_SIZE -I\"${CMAKE_BINARY_DIR}/CMakeTmp\"" )
+ SET( MACRO_DETERMINE_TYPE_FLAGS "-DVXL_HAS_TYPE_OF_SIZE" )
MESSAGE( STATUS "${MSG} [Checking ${TYPE}...]" )
- TRY_RUN( RUN_RESULT COMPILE_RESULT
+ TRY_COMPILE(COMPILE_RESULT
${CMAKE_BINARY_DIR}
${vxl_config_SOURCE_DIR}/vxl_platform_tests.cxx
CMAKE_FLAGS -DCOMPILE_DEFINITIONS:STRING=${MACRO_DETERMINE_TYPE_FLAGS}
+ -DINCLUDE_DIRECTORIES:STRING=${CMAKE_BINARY_DIR}/CMakeTmp
-DLINK_LIBRARIES:STRING=${CMAKE_REQUIRED_LIBRARIES}
OUTPUT_VARIABLE OUTPUT )
IF( COMPILE_RESULT )
- IF( NOT RUN_RESULT )
- SET( VXL_${VAR} ${TYPE} )
- SET( VXL_HAS_${VAR} 1 )
- ELSE( NOT RUN_RESULT )
- WRITE_FILE( ${CMAKE_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/CMakeError.log
- "${MSG} Failed to run with the following output:\n(FLAGS=${MACRO_DETERMINE_TYPE_FLAGS})\n${OUTPUT}\n"
- APPEND )
- ENDIF( NOT RUN_RESULT )
+ SET( VXL_${VAR} ${TYPE} )
+ SET( VXL_HAS_${VAR} 1 )
ELSE( COMPILE_RESULT )
WRITE_FILE( ${CMAKE_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/CMakeError.log
"${MSG} Failed to compile with the following output:\n(FLAGS=${MACRO_DETERMINE_TYPE_FLAGS})\n${OUTPUT}\n"
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_platform_tests.cxx b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_platform_tests.cxx
index 84df6812872b463485342d2413afe3abe4549a9d..9fdc893173ad17efa78453e2f9356ff8da12757c 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_platform_tests.cxx
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_platform_tests.cxx
@@ -1039,9 +1039,13 @@ double cast( THE_TYPE a )
}
#endif // INTEGRAL_TYPE
+// These declarations conflict unless the sizes match.
+extern int (*verify_size)[sizeof(THE_TYPE) * CHAR_BIT];
+extern int (*verify_size)[THE_SIZE];
+
int main()
{
- return sizeof(THE_TYPE) * CHAR_BIT == THE_SIZE ? 0 : 1;
+ return 0;
}
#endif // VXL_HAS_TYPE_OF_SIZE
@@ -1124,6 +1128,24 @@ int main()
}
#endif // VXL_APPLE_HAS_INLINE_ISNAND
+//-------------------------------------
+#ifdef VXL_HAS_WIN_WCHAR_T
+
+#ifdef _WCHAR_T_DEFINED
+#include <wchar.h>
+int main()
+{
+ wchar_t buf [10];
+ buf[0] = L'1';
+ buf[1] = L'\0';
+ return 0;
+}
+#else
+ int main() { return 1; }
+#endif
+
+#endif
+
//-------------------------------------
#ifdef VXL_HAS_MM_MALLOC
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_shared_link_test/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_shared_link_test/CMakeLists.txt
new file mode 100644
index 0000000000000000000000000000000000000000..25f26b1629ffcf4a8cb512f4b1b5a561e2b5f3d6
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_shared_link_test/CMakeLists.txt
@@ -0,0 +1,8 @@
+# vxl/config/cmake/config/vxl_shared_link_test/CMakeLists.txt
+#
+
+PROJECT(vxl_pic_compatible)
+
+ADD_LIBRARY(cmTryCompileStaticLib STATIC static_src.cxx)
+ADD_LIBRARY(cmTryCompileSharedLib SHARED shared_src.cxx)
+TARGET_LINK_LIBRARIES(cmTryCompileSharedLib cmTryCompileStaticLib ${LINK_LIBRARIES})
\ No newline at end of file
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_shared_link_test/shared_src.cxx b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_shared_link_test/shared_src.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..8ab85a317db6d7ba5d5d5dff3a90b12f776c0597
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_shared_link_test/shared_src.cxx
@@ -0,0 +1,7 @@
+
+void vxl_static_test_function(int i);
+
+void vxl_shared_test_function(int i)
+{
+ vxl_static_test_function(i);
+}
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_shared_link_test/static_src.cxx b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_shared_link_test/static_src.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..272c46eaf8cd04552aada9405e1ce278ff21acea
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_shared_link_test/static_src.cxx
@@ -0,0 +1,4 @@
+
+void vxl_static_test_function(int i)
+{
+}
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_utils.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_utils.cmake
index a1bce20a1f83520a408900bff17bc16f8aaec594..0a46ad79030303dff51f6bb41682e8a62441dc46 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_utils.cmake
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/config/vxl_utils.cmake
@@ -7,7 +7,7 @@
MACRO(INSTALL_NOBASE_HEADER_FILES prefix)
FOREACH(file ${ARGN})
- IF(${file} MATCHES "\\.(h|txx)(\\.in)?$")
+ IF(${file} MATCHES "\\.(h|hxx|txx)(\\.in)?$")
STRING(REGEX REPLACE "\\.in$" "" install_file ${file})
STRING(REGEX REPLACE "^/" "" prefix_cm24 "${prefix}")
GET_FILENAME_COMPONENT(dir ${install_file} PATH)
@@ -18,7 +18,7 @@ FOREACH(file ${ARGN})
INSTALL(FILES "${install_prefix}/${install_file}"
DESTINATION ${prefix_cm24}/${dir}
COMPONENT Development)
- ENDIF(${file} MATCHES "\\.(h|txx)(\\.in)?$")
+ ENDIF(${file} MATCHES "\\.(h|hxx|txx)(\\.in)?$")
ENDFOREACH(file ${filelist})
ENDMACRO(INSTALL_NOBASE_HEADER_FILES)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/ctest-scripts/dash_example.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/ctest-scripts/dash_example.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..9e4236e2dfca6a57ca52601956087759b06fb127
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/ctest-scripts/dash_example.cmake
@@ -0,0 +1,24 @@
+# VXL Example Dashboard Script
+#
+# Copy this example script and edit as necessary for your client.
+# See vxl_common.cmake for more instructions.
+
+# Client maintainer: someone@users.sourceforge.net
+set(CTEST_SITE "machine.site")
+set(CTEST_BUILD_NAME "Linux-gcc")
+#set(CTEST_BUILD_FLAGS "-j2") # parallel build for makefiles
+set(CTEST_BUILD_CONFIGURATION Release)
+set(CTEST_CMAKE_GENERATOR "Unix Makefiles")
+#set(CTEST_UPDATE_COMMAND /path/to/svn)
+
+#set(dashboard_model Experimental)
+#set(dashboard_model Continuous)
+
+#set(dashboard_do_memcheck 1)
+#set(dashboard_do_coverage 1)
+
+#set(dashboard_cache "
+#BUILD_SHARED_LIBS:BOOL=ON
+#")
+
+include(${CTEST_SCRIPT_DIRECTORY}/vxl_common.cmake)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/ctest-scripts/vxl_common.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/ctest-scripts/vxl_common.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..76d34d060614c06f74bc5809902f2f215510844f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/ctest-scripts/vxl_common.cmake
@@ -0,0 +1,183 @@
+# VXL Common Dashboard Script
+#
+# This script is shared among most vxl dashboard client machines.
+# It contains basic dashboard driver code common to all clients.
+#
+# Checkout the directory containing this script to a path such as
+# "/.../Dashboards/ctest-scripts/". Create a file next to this
+# script, say 'my_dashboard.cmake', with code of the following form:
+#
+# # Client maintainer: someone@users.sourceforge.net
+# set(CTEST_SITE "machine.site")
+# set(CTEST_BUILD_NAME "Platform-Compiler")
+# set(CTEST_BUILD_CONFIGURATION Debug)
+# set(CTEST_CMAKE_GENERATOR "Unix Makefiles")
+# include(${CTEST_SCRIPT_DIRECTORY}/vxl_common.cmake)
+#
+# Then run a scheduled task (cron job) with a command line such as
+#
+# ctest -S /.../Dashboards/ctest-scripts/my_dashboard.cmake -V
+#
+# By default the source and build trees will be placed in the path
+# "/.../Dashboards/My Tests/".
+#
+# The following variables may be set before including this script
+# to configure it:
+#
+# dashboard_model = Nightly | Experimental | Continuous
+# dashboard_cache = Initial CMakeCache.txt file content
+# dashboard_url = Subversion url to checkout
+# dashboard_do_coverage = True to enable coverage (ex: gcov)
+# dashboard_do_memcheck = True to enable memcheck (ex: valgrind)
+# CTEST_UPDATE_COMMAND = path to svn command-line client
+# CTEST_BUILD_FLAGS = build tool arguments (ex: -j2)
+# CTEST_DASHBOARD_ROOT = Where to put source and build trees
+
+cmake_minimum_required(VERSION 2.6)
+
+# Drop this block when 2.6.3 is minimum version.
+if(POLICY CMP0011)
+ cmake_policy(SET CMP0011 NEW)
+endif()
+
+set(CTEST_PROJECT_NAME vxl)
+
+# Select the top dashboard directory.
+if(NOT DEFINED CTEST_DASHBOARD_ROOT)
+ get_filename_component(CTEST_DASHBOARD_ROOT "${CTEST_SCRIPT_DIRECTORY}/../My Tests" ABSOLUTE)
+endif()
+
+# Select the model (Nightly, Experimental, Continuous).
+if(NOT DEFINED dashboard_model)
+ set(dashboard_model Nightly)
+endif()
+
+# Default to a Debug build.
+if(NOT DEFINED CTEST_BUILD_CONFIGURATION)
+ set(CTEST_BUILD_CONFIGURATION Debug)
+endif()
+
+# Select svn source to use.
+if(NOT DEFINED dashboard_url)
+ set(dashboard_url "http://vxl.svn.sourceforge.net/svnroot/vxl/trunk")
+endif()
+
+# Select a source directory name.
+if(NOT DEFINED CTEST_SOURCE_DIRECTORY)
+ set(CTEST_SOURCE_DIRECTORY "${CTEST_DASHBOARD_ROOT}/vxl")
+endif()
+
+# Select a build directory name.
+if(NOT DEFINED CTEST_BINARY_DIRECTORY)
+ set(CTEST_BINARY_DIRECTORY ${CTEST_SOURCE_DIRECTORY}-build)
+endif()
+make_directory(${CTEST_BINARY_DIRECTORY})
+
+# Look for a Subversion command-line client.
+if(NOT DEFINED CTEST_UPDATE_COMMAND)
+ find_program(CTEST_UPDATE_COMMAND svn)
+endif()
+
+# Support initial checkout if necessary.
+if(NOT EXISTS "${CTEST_SOURCE_DIRECTORY}"
+ AND NOT DEFINED CTEST_CHECKOUT_COMMAND
+ AND CTEST_UPDATE_COMMAND)
+ get_filename_component(_name "${CTEST_SOURCE_DIRECTORY}" NAME)
+ set(CTEST_CHECKOUT_COMMAND "\"${CTEST_UPDATE_COMMAND}\" co \"${dashboard_url}\" \"${_name}\"")
+endif()
+
+# Send the main script as a note.
+list(APPEND CTEST_NOTES_FILES
+ "${CTEST_SCRIPT_DIRECTORY}/${CTEST_SCRIPT_NAME}"
+ )
+
+# Check for required variables.
+foreach(req
+ CTEST_CMAKE_GENERATOR
+ CTEST_SITE
+ CTEST_BUILD_NAME
+ )
+ if(NOT DEFINED ${req})
+ message(FATAL_ERROR "The containing script must set ${req}")
+ endif()
+endforeach(req)
+
+# Print summary information.
+foreach(v
+ CTEST_SITE
+ CTEST_BUILD_NAME
+ CTEST_SOURCE_DIRECTORY
+ CTEST_BINARY_DIRECTORY
+ CTEST_CMAKE_GENERATOR
+ CTEST_BUILD_CONFIGURATION
+ CTEST_UPDATE_COMMAND
+ CTEST_CHECKOUT_COMMAND
+ CTEST_SCRIPT_DIRECTORY
+ )
+ set(vars "${vars} ${v}=[${${v}}]\n")
+endforeach(v)
+message("Configuration:\n${vars}\n")
+
+# Avoid non-ascii characters in tool output.
+set(ENV{LC_ALL} C)
+
+# Helper macro to write the initial cache.
+macro(write_cache)
+ if(CTEST_CMAKE_GENERATOR MATCHES "Make")
+ set(cache_build_type CMAKE_BUILD_TYPE:STRING=${CTEST_BUILD_CONFIGURATION})
+ endif()
+ file(WRITE ${CTEST_BINARY_DIRECTORY}/CMakeCache.txt "
+SITE:STRING=${CTEST_SITE}
+BUILDNAME:STRING=${CTEST_BUILD_NAME}
+${cache_build_type}
+${dashboard_cache}
+")
+endmacro(write_cache)
+
+# Start with a fresh build tree.
+message("Clearing build tree...")
+ctest_empty_binary_directory(${CTEST_BINARY_DIRECTORY})
+
+# Support each testing model
+if(dashboard_model STREQUAL Continuous)
+ # Build once and then when updates are found.
+ while(${CTEST_ELAPSED_TIME} LESS 43200)
+ set(START_TIME ${CTEST_ELAPSED_TIME})
+ ctest_start(Continuous)
+
+ # always build if the tree is missing
+ if(NOT EXISTS "${CTEST_BINARY_DIRECTORY}/CMakeCache.txt")
+ message("Starting fresh build...")
+ write_cache()
+ set(res 1)
+ endif()
+
+ ctest_update(RETURN_VALUE res)
+ message("Found ${res} changed files")
+ if(res GREATER 0)
+ ctest_configure()
+ ctest_read_custom_files(${CTEST_BINARY_DIRECTORY})
+ ctest_build()
+ ctest_test()
+ ctest_submit()
+ endif()
+
+ # Delay until at least 5 minutes past START_TIME
+ ctest_sleep(${START_TIME} 300 ${CTEST_ELAPSED_TIME})
+ endwhile()
+else()
+ write_cache()
+ ctest_start(${dashboard_model})
+ ctest_update()
+ ctest_configure()
+ ctest_read_custom_files(${CTEST_BINARY_DIRECTORY})
+ ctest_build()
+ ctest_test()
+ if(dashboard_do_coverage)
+ ctest_coverage()
+ endif()
+ if(dashboard_do_memcheck)
+ ctest_memcheck()
+ endif()
+ ctest_submit()
+endif()
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxy_header.html b/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxy_header.html
new file mode 100644
index 0000000000000000000000000000000000000000..075131e029d2fc3a4bdeb87b49aebf618df62073
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxy_header.html
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN"
+"http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
+<head>
+ <title>@title@</title>
+ <link href="doxygen.css" rel="stylesheet" type="text/css" />
+ <link href="tabs.css" rel="stylesheet" type="text/css" />
+ <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+</head>
+<body>
\ No newline at end of file
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxyfile.in b/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxyfile.in
new file mode 100644
index 0000000000000000000000000000000000000000..5c34e8381f4864f9ca1bfb63a8637ffd25ed7972
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxyfile.in
@@ -0,0 +1,1363 @@
+# Doxyfile 1.5.5
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project
+#
+# All text after a hash (#) is considered a comment and will be ignored
+# The format is:
+# TAG = value [value, ...]
+# For lists items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (" ")
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all
+# text before the first occurrence of this tag. Doxygen uses libiconv (or the
+# iconv built into libc) for the transcoding. See
+# http://www.gnu.org/software/libiconv for the list of possible encodings.
+
+DOXYFILE_ENCODING = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded
+# by quotes) that should identify the project.
+
+PROJECT_NAME = @library@
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number.
+# This could be handy for archiving the generated documentation or
+# if some version control system is used.
+
+PROJECT_NUMBER =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute)
+# base path where the generated documentation will be put.
+# If a relative path is entered, it will be relative to the location
+# where doxygen was started. If left blank the current directory will be used.
+
+OUTPUT_DIRECTORY = @DOXYGEN_OUTPUT_DIR@/html/@library@
+
+# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create
+# 4096 sub-directories (in 2 levels) under the output directory of each output
+# format and will distribute the generated files over these directories.
+# Enabling this option can be useful when feeding doxygen a huge amount of
+# source files, where putting all generated files in the same directory would
+# otherwise cause performance problems for the file system.
+
+CREATE_SUBDIRS = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# The default language is English, other supported languages are:
+# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional,
+# Croatian, Czech, Danish, Dutch, Farsi, Finnish, French, German, Greek,
+# Hungarian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, Polish,
+# Portuguese, Romanian, Russian, Serbian, Slovak, Slovene, Spanish, Swedish,
+# and Ukrainian.
+
+OUTPUT_LANGUAGE = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will
+# include brief member descriptions after the members that are listed in
+# the file and class documentation (similar to JavaDoc).
+# Set to NO to disable this.
+
+BRIEF_MEMBER_DESC = YES
+
+# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend
+# the brief description of a member or function before the detailed description.
+# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+
+REPEAT_BRIEF = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator
+# that is used to form the text in various listings. Each string
+# in this list, if found as the leading text of the brief description, will be
+# stripped from the text and the result after processing the whole list, is
+# used as the annotated text. Otherwise, the brief description is used as-is.
+# If left blank, the following values are used ("$name" is automatically
+# replaced with the name of the entity): "The $name class" "The $name widget"
+# "The $name file" "is" "provides" "specifies" "contains"
+# "represents" "a" "an" "the"
+
+ABBREVIATE_BRIEF =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# Doxygen will generate a detailed section even if there is only a brief
+# description.
+
+ALWAYS_DETAILED_SEC = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+
+INLINE_INHERITED_MEMB = YES
+
+# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full
+# path before files name in the file list and in the header files. If set
+# to NO the shortest path that makes the file name unique will be used.
+
+FULL_PATH_NAMES = YES
+
+# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag
+# can be used to strip a user-defined part of the path. Stripping is
+# only done if one of the specified strings matches the left-hand part of
+# the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the
+# path to strip.
+
+STRIP_FROM_PATH = @CMAKE_SOURCE_DIR@/
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of
+# the path mentioned in the documentation of a class, which tells
+# the reader which header file to include in order to use a class.
+# If left blank only the name of the header file containing the class
+# definition is used. Otherwise one should specify the include paths that
+# are normally passed to the compiler using the -I flag.
+
+STRIP_FROM_INC_PATH =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter
+# (but less readable) file names. This can be useful is your file systems
+# doesn't support long names like on DOS, Mac, or CD-ROM.
+
+SHORT_NAMES = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen
+# will interpret the first line (until the first dot) of a JavaDoc-style
+# comment as the brief description. If set to NO, the JavaDoc
+# comments will behave just like regular Qt-style comments
+# (thus requiring an explicit @brief command for a brief description.)
+
+JAVADOC_AUTOBRIEF = YES
+
+# If the QT_AUTOBRIEF tag is set to YES then Doxygen will
+# interpret the first line (until the first dot) of a Qt-style
+# comment as the brief description. If set to NO, the comments
+# will behave just like regular Qt-style comments (thus requiring
+# an explicit \brief command for a brief description.)
+
+QT_AUTOBRIEF = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen
+# treat a multi-line C++ special comment block (i.e. a block of //! or ///
+# comments) as a brief description. This used to be the default behaviour.
+# The new default is to treat a multi-line C++ comment block as a detailed
+# description. Set this tag to YES if you prefer the old behaviour instead.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the DETAILS_AT_TOP tag is set to YES then Doxygen
+# will output the detailed description near the top, like JavaDoc.
+# If set to NO, the detailed description appears after the member
+# documentation.
+
+DETAILS_AT_TOP = YES
+
+# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented
+# member inherits the documentation from any documented member that it
+# re-implements.
+
+INHERIT_DOCS = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce
+# a new page for each member. If set to NO, the documentation of a member will
+# be part of the file/class/namespace that contains it.
+
+SEPARATE_MEMBER_PAGES = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab.
+# Doxygen uses this value to replace tabs by spaces in code fragments.
+
+TAB_SIZE = 2
+
+# This tag can be used to specify a number of aliases that acts
+# as commands in the documentation. An alias has the form "name=value".
+# For example adding "sideeffect=\par Side Effects:\n" will allow you to
+# put the command \sideeffect (or @sideeffect) in the documentation, which
+# will result in a user-defined paragraph with heading "Side Effects:".
+# You can put \n's in the value part of an alias to insert newlines.
+
+ALIASES =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C
+# sources only. Doxygen will then generate output that is more tailored for C.
+# For instance, some of the names that are used will be different. The list
+# of all members will be omitted, etc.
+
+OPTIMIZE_OUTPUT_FOR_C = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java
+# sources only. Doxygen will then generate output that is more tailored for
+# Java. For instance, namespaces will be presented as packages, qualified
+# scopes will look different, etc.
+
+OPTIMIZE_OUTPUT_JAVA = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources only. Doxygen will then generate output that is more tailored for
+# Fortran.
+
+OPTIMIZE_FOR_FORTRAN = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for
+# VHDL.
+
+OPTIMIZE_OUTPUT_VHDL = NO
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should
+# set this tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string); v.s.
+# func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+
+BUILTIN_STL_SUPPORT = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+
+CPP_CLI_SUPPORT = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip sources only.
+# Doxygen will parse them like normal C++ but will assume all classes use public
+# instead of private inheritance when no explicit protection keyword is present.
+
+SIP_SUPPORT = NO
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES, then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+
+DISTRIBUTE_GROUP_DOC = NO
+
+# Set the SUBGROUPING tag to YES (the default) to allow class member groups of
+# the same type (for instance a group of public functions) to be put as a
+# subgroup of that type (e.g. under the Public Functions section). Set it to
+# NO to prevent subgrouping. Alternatively, this can be done per class using
+# the \nosubgrouping command.
+
+SUBGROUPING = YES
+
+# When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum
+# is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically
+# be useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+
+TYPEDEF_HIDES_STRUCT = NO
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in
+# documentation are documented, even if no documentation was available.
+# Private class members and static file members will be hidden unless
+# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
+
+EXTRACT_ALL = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES all private members of a class
+# will be included in the documentation.
+
+EXTRACT_PRIVATE = YES
+
+# If the EXTRACT_STATIC tag is set to YES all static members of a file
+# will be included in the documentation.
+
+EXTRACT_STATIC = NO
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs)
+# defined locally in source files will be included in the documentation.
+# If set to NO only classes defined in header files are included.
+
+EXTRACT_LOCAL_CLASSES = YES
+
+# This flag is only useful for Objective-C code. When set to YES local
+# methods, which are defined in the implementation section but not in
+# the interface are included in the documentation.
+# If set to NO (the default) only methods in the interface are included.
+
+EXTRACT_LOCAL_METHODS = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base
+# name of the file that contains the anonymous namespace. By default
+# anonymous namespace are hidden.
+
+EXTRACT_ANON_NSPACES = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all
+# undocumented members of documented classes, files or namespaces.
+# If set to NO (the default) these members will be included in the
+# various overviews, but no documentation section is generated.
+# This option has no effect if EXTRACT_ALL is enabled.
+
+HIDE_UNDOC_MEMBERS = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy.
+# If set to NO (the default) these classes will be included in the various
+# overviews. This option has no effect if EXTRACT_ALL is enabled.
+
+HIDE_UNDOC_CLASSES = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all
+# friend (class|struct|union) declarations.
+# If set to NO (the default) these declarations will be included in the
+# documentation.
+
+HIDE_FRIEND_COMPOUNDS = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any
+# documentation blocks found inside the body of a function.
+# If set to NO (the default) these blocks will be appended to the
+# function's detailed documentation block.
+
+HIDE_IN_BODY_DOCS = NO
+
+# The INTERNAL_DOCS tag determines if documentation
+# that is typed after a \internal command is included. If the tag is set
+# to NO (the default) then the documentation will be excluded.
+# Set it to YES to include the internal documentation.
+
+INTERNAL_DOCS = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate
+# file names in lower-case letters. If set to YES upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+
+CASE_SENSE_NAMES = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen
+# will show members with their full class and namespace scopes in the
+# documentation. If set to YES the scope will be hidden.
+
+HIDE_SCOPE_NAMES = NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen
+# will put a list of the files that are included by a file in the documentation
+# of that file.
+
+SHOW_INCLUDE_FILES = YES
+
+# If the INLINE_INFO tag is set to YES (the default) then a tag [inline]
+# is inserted in the documentation for inline members.
+
+INLINE_INFO = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen
+# will sort the (detailed) documentation of file and class members
+# alphabetically by member name. If set to NO the members will appear in
+# declaration order.
+
+SORT_MEMBER_DOCS = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the
+# brief documentation of file, namespace and class members alphabetically
+# by member name. If set to NO (the default) the members will appear in
+# declaration order.
+
+SORT_BRIEF_DOCS = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the
+# hierarchy of group names into alphabetical order. If set to NO (the default)
+# the group names will appear in their defined order.
+
+SORT_GROUP_NAMES = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be
+# sorted by fully-qualified names, including namespaces. If set to
+# NO (the default), the class list will be sorted only by class name,
+# not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the
+# alphabetical list.
+
+SORT_BY_SCOPE_NAME = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or
+# disable (NO) the todo list. This list is created by putting \todo
+# commands in the documentation.
+
+GENERATE_TODOLIST = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or
+# disable (NO) the test list. This list is created by putting \test
+# commands in the documentation.
+
+GENERATE_TESTLIST = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or
+# disable (NO) the bug list. This list is created by putting \bug
+# commands in the documentation.
+
+GENERATE_BUGLIST = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or
+# disable (NO) the deprecated list. This list is created by putting
+# \deprecated commands in the documentation.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional
+# documentation sections, marked by \if sectionname ... \endif.
+
+ENABLED_SECTIONS =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines
+# the initial value of a variable or define consists of for it to appear in
+# the documentation. If the initializer consists of more lines than specified
+# here it will be hidden. Use a value of 0 to hide initializers completely.
+# The appearance of the initializer of individual variables and defines in the
+# documentation can be controlled using \showinitializer or \hideinitializer
+# command in the documentation regardless of this setting.
+
+MAX_INITIALIZER_LINES = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated
+# at the bottom of the documentation of classes and structs. If set to YES the
+# list will mention the files that were used to generate the documentation.
+
+SHOW_USED_FILES = YES
+
+# If the sources in your project are distributed over multiple directories
+# then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy
+# in the documentation. The default is NO.
+
+SHOW_DIRECTORIES = NO
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command <command> <input-file>, where <command> is the value of
+# the FILE_VERSION_FILTER tag, and <input-file> is the name of an input file
+# provided by doxygen. Whatever the program writes to standard output
+# is used as the file version. See the manual for examples.
+
+FILE_VERSION_FILTER =
+
+#---------------------------------------------------------------------------
+# configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated
+# by doxygen. Possible values are YES and NO. If left blank NO is used.
+
+QUIET = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated by doxygen. Possible values are YES and NO. If left blank
+# NO is used.
+
+WARNINGS = YES
+
+# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings
+# for undocumented members. If EXTRACT_ALL is set to YES then this flag will
+# automatically be disabled.
+
+WARN_IF_UNDOCUMENTED = YES
+
+# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some
+# parameters in a documented function, or documenting parameters that
+# don't exist or using markup commands wrongly.
+
+WARN_IF_DOC_ERROR = YES
+
+# This WARN_NO_PARAMDOC option can be abled to get warnings for
+# functions that are documented, but have no documentation for their parameters
+# or return value. If set to NO (the default) doxygen will only warn about
+# wrong or incomplete parameter documentation, but not about the absence of
+# documentation.
+
+WARN_NO_PARAMDOC = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that
+# doxygen can produce. The string should contain the $file, $line, and $text
+# tags, which will be replaced by the file and line number from which the
+# warning originated and the warning text. Optionally the format may contain
+# $version, which will be replaced by the version of the file (if it could
+# be obtained via FILE_VERSION_FILTER)
+
+WARN_FORMAT = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning
+# and error messages should be written. If left blank the output is written
+# to stderr.
+
+WARN_LOGFILE =
+
+#---------------------------------------------------------------------------
+# configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag can be used to specify the files and/or directories that contain
+# documented source files. You may enter file names like "myfile.cpp" or
+# directories like "/usr/src/myproject". Separate the files or directories
+# with spaces.
+
+INPUT = ./@library@
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is
+# also the default input encoding. Doxygen uses libiconv (or the iconv built
+# into libc) for the transcoding. See http://www.gnu.org/software/libiconv for
+# the list of possible encodings.
+
+INPUT_ENCODING = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
+# and *.h) to filter out the source-files in the directories. If left
+# blank the following patterns are tested:
+# *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx
+# *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py *.f90
+
+FILE_PATTERNS = *.h \
+ *.cxx \
+ *.txx \
+ *_doxy.txt
+
+# The RECURSIVE tag can be used to turn specify whether or not subdirectories
+# should be searched for input files as well. Possible values are YES and NO.
+# If left blank NO is used.
+
+RECURSIVE = YES
+
+# The EXCLUDE tag can be used to specify files and/or directories that should
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+
+EXCLUDE =
+
+# The EXCLUDE_SYMLINKS tag can be used select whether or not files or
+# directories that are symbolic links (a Unix filesystem feature) are excluded
+# from the input.
+
+EXCLUDE_SYMLINKS = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories. Note that the wildcards are matched
+# against the file with absolute path, so to exclude all test directories
+# for example use the pattern */test/*
+
+EXCLUDE_PATTERNS = */Linux2/* \
+ */Test/* \
+ */tests/* \
+ */Templates/* \
+ */example*
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+
+EXCLUDE_SYMBOLS =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or
+# directories that contain example code fragments that are included (see
+# the \include command).
+
+EXAMPLE_PATH = .
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
+# and *.h) to filter out the source-files in the directories. If left
+# blank all files are included.
+
+EXAMPLE_PATTERNS =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude
+# commands irrespective of the value of the RECURSIVE tag.
+# Possible values are YES and NO. If left blank NO is used.
+
+EXAMPLE_RECURSIVE = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or
+# directories that contain image that are included in the documentation (see
+# the \image command).
+
+IMAGE_PATH =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command <filter> <input-file>, where <filter>
+# is the value of the INPUT_FILTER tag, and <input-file> is the name of an
+# input file. Doxygen will then use the output that the filter program writes
+# to standard output. If FILTER_PATTERNS is specified, this tag will be
+# ignored.
+
+INPUT_FILTER = @DOXYGEN_INPUT_FILTER@
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form:
+# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further
+# info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER
+# is applied to all files.
+
+FILTER_PATTERNS =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will be used to filter the input files when producing source
+# files to browse (i.e. when SOURCE_BROWSER is set to YES).
+
+FILTER_SOURCE_FILES = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will
+# be generated. Documented entities will be cross-referenced with these sources.
+# Note: To get rid of all source code in the generated output, make sure also
+# VERBATIM_HEADERS is set to NO.
+
+SOURCE_BROWSER = YES
+
+# Setting the INLINE_SOURCES tag to YES will include the body
+# of functions and classes directly in the documentation.
+
+INLINE_SOURCES = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct
+# doxygen to hide any special comment blocks from generated source code
+# fragments. Normal C and C++ comments will always remain visible.
+
+STRIP_CODE_COMMENTS = NO
+
+# If the REFERENCED_BY_RELATION tag is set to YES (the default)
+# then for each documented function all documented
+# functions referencing it will be listed.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES (the default)
+# then for each documented function all documented entities
+# called/used by that function will be listed.
+
+REFERENCES_RELATION = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES (the default)
+# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from
+# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will
+# link to the source code. Otherwise they will link to the documentstion.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code
+# will point to the HTML generated by the htags(1) tool instead of doxygen
+# built-in source browser. The htags tool is part of GNU's global source
+# tagging system (see http://www.gnu.org/software/global/global.html). You
+# will need version 4.8.6 or higher.
+
+USE_HTAGS = NO
+
+# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen
+# will generate a verbatim copy of the header file for each class for
+# which an include is specified. Set to NO to disable this.
+
+VERBATIM_HEADERS = YES
+
+#---------------------------------------------------------------------------
+# configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index
+# of all compounds will be generated. Enable this if the project
+# contains a lot of classes, structs, unions or interfaces.
+
+ALPHABETICAL_INDEX = YES
+
+# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then
+# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns
+# in which this list will be split (can be a number in the range [1..20])
+
+COLS_IN_ALPHA_INDEX = 2
+
+# In case all classes in a project start with a common prefix, all
+# classes will be put under the same header in the alphabetical index.
+# The IGNORE_PREFIX tag can be used to specify one or more prefixes that
+# should be ignored while generating the index headers.
+
+IGNORE_PREFIX = @prefix@
+
+#---------------------------------------------------------------------------
+# configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES (the default) Doxygen will
+# generate HTML output.
+
+GENERATE_HTML = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `html' will be used as the default path.
+
+HTML_OUTPUT =
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for
+# each generated HTML page (for example: .htm,.php,.asp). If it is left blank
+# doxygen will generate files with .html extension.
+
+HTML_FILE_EXTENSION = .html
+
+# The HTML_HEADER tag can be used to specify a personal HTML header for
+# each generated HTML page. If it is left blank doxygen will generate a
+# standard header.
+
+HTML_HEADER = "@CMAKE_BINARY_DIR@/doxy/output/doxy_header.html"
+
+# The HTML_FOOTER tag can be used to specify a personal HTML footer for
+# each generated HTML page. If it is left blank doxygen will generate a
+# standard footer.
+
+HTML_FOOTER =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading
+# style sheet that is used by each HTML page. It can be used to
+# fine-tune the look of the HTML output. If the tag is left blank doxygen
+# will generate a default style sheet. Note that doxygen will try to copy
+# the style sheet file to the HTML output directory, so don't put your own
+# stylesheet in the HTML output directory as well, or it will be erased!
+
+HTML_STYLESHEET = @DOXYGEN_STYLESHEET@
+
+# If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes,
+# files or namespaces will be aligned in HTML using tables. If set to
+# NO a bullet list will be used.
+
+HTML_ALIGN_MEMBERS = YES
+
+# If the GENERATE_HTMLHELP tag is set to YES, additional index files
+# will be generated that can be used as input for tools like the
+# Microsoft HTML help workshop to generate a compiled HTML help file (.chm)
+# of the generated HTML documentation.
+
+GENERATE_HTMLHELP = NO
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files
+# will be generated that can be used as input for Apple's Xcode 3
+# integrated development environment, introduced with OSX 10.5 (Leopard).
+# To create a documentation set, doxygen will generate a Makefile in the
+# HTML output directory. Running make will produce the docset in that
+# directory and running "make install" will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find
+# it at startup.
+
+GENERATE_DOCSET = NO
+
+# When GENERATE_DOCSET tag is set to YES, this tag determines the name of the
+# feed. A documentation feed provides an umbrella under which multiple
+# documentation sets from a single provider (such as a company or product suite)
+# can be grouped.
+
+DOCSET_FEEDNAME = "Doxygen generated docs"
+
+# When GENERATE_DOCSET tag is set to YES, this tag specifies a string that
+# should uniquely identify the documentation set bundle. This should be a
+# reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen
+# will append .docset to the name.
+
+DOCSET_BUNDLE_ID = org.doxygen.Project
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded. For this to work a browser that supports
+# JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox
+# Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari).
+
+HTML_DYNAMIC_SECTIONS = NO
+
+# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can
+# be used to specify the file name of the resulting .chm file. You
+# can add a path in front of the file if the result should not be
+# written to the html output directory.
+
+CHM_FILE =
+
+# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can
+# be used to specify the location (absolute path including file name) of
+# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run
+# the HTML help compiler on the generated index.hhp.
+
+HHC_LOCATION =
+
+# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag
+# controls if a separate .chi index file is generated (YES) or that
+# it should be included in the master .chm file (NO).
+
+GENERATE_CHI = NO
+
+# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag
+# controls whether a binary table of contents is generated (YES) or a
+# normal table of contents (NO) in the .chm file.
+
+BINARY_TOC = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members
+# to the contents of the HTML help documentation and to the tree view.
+
+TOC_EXPAND = NO
+
+# The DISABLE_INDEX tag can be used to turn on/off the condensed index at
+# top of each HTML page. The value NO (the default) enables the index and
+# the value YES disables it.
+
+DISABLE_INDEX = NO
+
+# This tag can be used to set the number of enum values (range [1..20])
+# that doxygen will group on one line in the generated HTML documentation.
+
+ENUM_VALUES_PER_LINE = 4
+
+# If the GENERATE_TREEVIEW tag is set to YES, a side panel will be
+# generated containing a tree-like index structure (just like the one that
+# is generated for HTML Help). For this to work a browser that supports
+# JavaScript, DHTML, CSS and frames is required (for instance Mozilla 1.0+,
+# Netscape 6.0+, Internet explorer 5.0+, or Konqueror). Windows users are
+# probably better off using the HTML help feature.
+
+GENERATE_TREEVIEW = NO
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be
+# used to set the initial width (in pixels) of the frame in which the tree
+# is shown.
+
+TREEVIEW_WIDTH = 250
+
+#---------------------------------------------------------------------------
+# configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will
+# generate Latex output.
+
+GENERATE_LATEX = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `latex' will be used as the default path.
+
+LATEX_OUTPUT =
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked. If left blank `latex' will be used as the default command name.
+
+LATEX_CMD_NAME = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to
+# generate index for LaTeX. If left blank `makeindex' will be used as the
+# default command name.
+
+MAKEINDEX_CMD_NAME = makeindex
+
+# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact
+# LaTeX documents. This may be useful for small projects and may help to
+# save some trees in general.
+
+COMPACT_LATEX = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used
+# by the printer. Possible values are: a4, a4wide, letter, legal and
+# executive. If left blank a4wide will be used.
+
+PAPER_TYPE = a4wide
+
+# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX
+# packages that should be included in the LaTeX output.
+
+EXTRA_PACKAGES =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for
+# the generated latex document. The header should contain everything until
+# the first chapter. If it is left blank doxygen will generate a
+# standard header. Notice: only use this tag if you know what you are doing!
+
+LATEX_HEADER =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated
+# is prepared for conversion to pdf (using ps2pdf). The pdf file will
+# contain links (just like the HTML output) instead of page references
+# This makes the output suitable for online browsing using a pdf viewer.
+
+PDF_HYPERLINKS = NO
+
+# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of
+# plain latex in the generated Makefile. Set this option to YES to get a
+# higher quality PDF documentation.
+
+USE_PDFLATEX = NO
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode.
+# command to the generated LaTeX files. This will instruct LaTeX to keep
+# running if errors occur, instead of asking the user for help.
+# This option is also used when generating formulas in HTML.
+
+LATEX_BATCHMODE = NO
+
+# If LATEX_HIDE_INDICES is set to YES then doxygen will not
+# include the index chapters (such as File Index, Compound Index, etc.)
+# in the output.
+
+LATEX_HIDE_INDICES = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output
+# The RTF output is optimized for Word 97 and may not look very pretty with
+# other RTF readers or editors.
+
+GENERATE_RTF = NO
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `rtf' will be used as the default path.
+
+RTF_OUTPUT =
+
+# If the COMPACT_RTF tag is set to YES Doxygen generates more compact
+# RTF documents. This may be useful for small projects and may help to
+# save some trees in general.
+
+COMPACT_RTF = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated
+# will contain hyperlink fields. The RTF file will
+# contain links (just like the HTML output) instead of page references.
+# This makes the output suitable for online browsing using WORD or other
+# programs which support those fields.
+# Note: wordpad (write) and others do not support links.
+
+RTF_HYPERLINKS = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's
+# config file, i.e. a series of assignments. You only have to provide
+# replacements, missing definitions are set to their default value.
+
+RTF_STYLESHEET_FILE =
+
+# Set optional variables used in the generation of an rtf document.
+# Syntax is similar to doxygen's config file.
+
+RTF_EXTENSIONS_FILE =
+
+#---------------------------------------------------------------------------
+# configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES (the default) Doxygen will
+# generate man pages
+
+GENERATE_MAN = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `man' will be used as the default path.
+
+MAN_OUTPUT =
+
+# The MAN_EXTENSION tag determines the extension that is added to
+# the generated man pages (default is the subroutine's section .3)
+
+MAN_EXTENSION = .3
+
+# If the MAN_LINKS tag is set to YES and Doxygen generates man output,
+# then it will generate one additional man file for each entity
+# documented in the real man page(s). These additional files
+# only source the real man page, but without them the man command
+# would be unable to find the correct page. The default is NO.
+
+MAN_LINKS = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES Doxygen will
+# generate an XML file that captures the structure of
+# the code including all documentation.
+
+GENERATE_XML = NO
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be
+# put in front of it. If left blank `xml' will be used as the default path.
+
+XML_OUTPUT = xml
+
+# The XML_SCHEMA tag can be used to specify an XML schema,
+# which can be used by a validating XML parser to check the
+# syntax of the XML files.
+
+XML_SCHEMA =
+
+# The XML_DTD tag can be used to specify an XML DTD,
+# which can be used by a validating XML parser to check the
+# syntax of the XML files.
+
+XML_DTD =
+
+# If the XML_PROGRAMLISTING tag is set to YES Doxygen will
+# dump the program listings (including syntax highlighting
+# and cross-referencing information) to the XML output. Note that
+# enabling this will significantly increase the size of the XML output.
+
+XML_PROGRAMLISTING = YES
+
+#---------------------------------------------------------------------------
+# configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will
+# generate an AutoGen Definitions (see autogen.sf.net) file
+# that captures the structure of the code including all
+# documentation. Note that this feature is still experimental
+# and incomplete at the moment.
+
+GENERATE_AUTOGEN_DEF = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES Doxygen will
+# generate a Perl module file that captures the structure of
+# the code including all documentation. Note that this
+# feature is still experimental and incomplete at the
+# moment.
+
+GENERATE_PERLMOD = NO
+
+# If the PERLMOD_LATEX tag is set to YES Doxygen will generate
+# the necessary Makefile rules, Perl scripts and LaTeX code to be able
+# to generate PDF and DVI output from the Perl module output.
+
+PERLMOD_LATEX = NO
+
+# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be
+# nicely formatted so it can be parsed by a human reader. This is useful
+# if you want to understand what is going on. On the other hand, if this
+# tag is set to NO the size of the Perl module output will be much smaller
+# and Perl will parse it just the same.
+
+PERLMOD_PRETTY = YES
+
+# The names of the make variables in the generated doxyrules.make file
+# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX.
+# This is useful so different doxyrules.make files included by the same
+# Makefile don't overwrite each other's variables.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will
+# evaluate all C-preprocessor directives found in the sources and include
+# files.
+
+ENABLE_PREPROCESSING = YES
+
+# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro
+# names in the source code. If set to NO (the default) only conditional
+# compilation will be performed. Macro expansion can be done in a controlled
+# way by setting EXPAND_ONLY_PREDEF to YES.
+
+MACRO_EXPANSION = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES
+# then the macro expansion is limited to the macros specified with the
+# PREDEFINED and EXPAND_AS_DEFINED tags.
+
+EXPAND_ONLY_PREDEF = NO
+
+# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files
+# in the INCLUDE_PATH (see below) will be search if a #include is found.
+
+SEARCH_INCLUDES = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by
+# the preprocessor.
+
+INCLUDE_PATH =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will
+# be used.
+
+INCLUDE_FILE_PATTERNS =
+
+# The PREDEFINED tag can be used to specify one or more macro names that
+# are defined before the preprocessor is started (similar to the -D option of
+# gcc). The argument of the tag is a list of macros of the form: name
+# or name=definition (no spaces). If the definition and the = are
+# omitted =1 is assumed. To prevent a macro definition from being
+# undefined via #undef or recursively expanded use the := operator
+# instead of the = operator.
+
+PREDEFINED = DOXYGEN_SHOULD_SKIP_THIS
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then
+# this tag can be used to specify a list of macro names that should be expanded.
+# The macro definition that is found in the sources will be used.
+# Use the PREDEFINED tag if you want to use a different macro definition.
+
+EXPAND_AS_DEFINED =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then
+# doxygen's preprocessor will remove all function-like macros that are alone
+# on a line, have an all uppercase name, and do not end with a semicolon. Such
+# function macros are typically used for boiler-plate code, and will confuse
+# the parser if not removed.
+
+SKIP_FUNCTION_MACROS = YES
+
+#---------------------------------------------------------------------------
+# Configuration::additions related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES option can be used to specify one or more tagfiles.
+# Optionally an initial location of the external documentation
+# can be added for each tagfile. The format of a tag file without
+# this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where "loc1" and "loc2" can be relative or absolute paths or
+# URLs. If a location is present for each tag, the installdox tool
+# does not have to be run to correct the links.
+# Note that each tag file must have a unique name
+# (where the name does NOT include the path)
+# If a tag file is not located in the directory in which doxygen
+# is run, you must also specify the path to the tagfile here.
+
+TAGFILES = @tagfiles@
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create
+# a tag file that is based on the input files it reads.
+
+GENERATE_TAGFILE = @DOXYGEN_OUTPUT_DIR@/tags/@libname@.tag
+
+# If the ALLEXTERNALS tag is set to YES all external classes will be listed
+# in the class index. If set to NO only the inherited external classes
+# will be listed.
+
+ALLEXTERNALS = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will
+# be listed.
+
+EXTERNAL_GROUPS = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of `which perl').
+
+PERL_PATH = @PERL_EXECUTABLE@
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will
+# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base
+# or super classes. Setting the tag to NO turns the diagrams off. Note that
+# this option is superseded by the HAVE_DOT option below. This is only a
+# fallback. It is recommended to install and use dot, since it yields more
+# powerful graphs.
+
+CLASS_DIAGRAMS = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see
+# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH =
+
+# If set to YES, the inheritance and collaboration graphs will hide
+# inheritance and usage relations if the target is undocumented
+# or is not a class.
+
+HIDE_UNDOC_RELATIONS = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz, a graph visualization
+# toolkit from AT&T and Lucent Bell Labs. The other options in this section
+# have no effect if this option is set to NO (the default)
+
+HAVE_DOT = @DOXYGEN_USE_DOT@
+
+# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen
+# will generate a graph for each documented class showing the direct and
+# indirect inheritance relations. Setting this tag to YES will force the
+# the CLASS_DIAGRAMS tag to NO.
+
+CLASS_GRAPH = YES
+
+# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen
+# will generate a graph for each documented class showing the direct and
+# indirect implementation dependencies (inheritance, containment, and
+# class references variables) of the class with other documented classes.
+
+COLLABORATION_GRAPH = NO
+
+# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen
+# will generate a graph for groups, showing the direct groups dependencies
+
+GROUP_GRAPHS = YES
+
+# If the UML_LOOK tag is set to YES doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+
+UML_LOOK = NO
+
+# If set to YES, the inheritance and collaboration graphs will show the
+# relations between templates and their instances.
+
+TEMPLATE_RELATIONS = YES
+
+# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT
+# tags are set to YES then doxygen will generate a graph for each documented
+# file showing the direct and indirect include dependencies of the file with
+# other documented files.
+
+INCLUDE_GRAPH = NO
+
+# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and
+# HAVE_DOT tags are set to YES then doxygen will generate a graph for each
+# documented header file showing the documented files that directly or
+# indirectly include this file.
+
+INCLUDED_BY_GRAPH = NO
+
+# If the CALL_GRAPH and HAVE_DOT options are set to YES then
+# doxygen will generate a call dependency graph for every global function
+# or class method. Note that enabling this option will significantly increase
+# the time of a run. So in most cases it will be better to enable call graphs
+# for selected functions only using the \callgraph command.
+
+CALL_GRAPH = NO
+
+# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then
+# doxygen will generate a caller dependency graph for every global function
+# or class method. Note that enabling this option will significantly increase
+# the time of a run. So in most cases it will be better to enable caller
+# graphs for selected functions only using the \callergraph command.
+
+CALLER_GRAPH = NO
+
+# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen
+# will graphical hierarchy of all classes instead of a textual one.
+
+GRAPHICAL_HIERARCHY = YES
+
+# If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES
+# then doxygen will show the dependencies a directory has on other directories
+# in a graphical way. The dependency relations are determined by the #include
+# relations between the files in the directories.
+
+DIRECTORY_GRAPH = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. Possible values are png, jpg, or gif
+# If left blank png will be used.
+
+DOT_IMAGE_FORMAT = png
+
+# The tag DOT_PATH can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+
+DOT_PATH =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the
+# \dotfile command).
+
+DOTFILE_DIRS =
+
+# The MAX_DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of
+# nodes that will be shown in the graph. If the number of nodes in a graph
+# becomes larger than this value, doxygen will truncate the graph, which is
+# visualized by representing a node as a red box. Note that doxygen if the
+# number of direct children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note
+# that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+
+DOT_GRAPH_MAX_NODES = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the
+# graphs generated by dot. A depth value of 3 means that only nodes reachable
+# from the root by following a path via at most 3 edges will be shown. Nodes
+# that lay further from the root node will be omitted. Note that setting this
+# option to 1 or 2 may greatly reduce the computation time needed for large
+# code bases. Also note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+
+MAX_DOT_GRAPH_DEPTH = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is enabled by default, which results in a transparent
+# background. Warning: Depending on the platform used, enabling this option
+# may lead to badly anti-aliased labels on the edges of a graph (i.e. they
+# become hard to read).
+
+DOT_TRANSPARENT = YES
+
+# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10)
+# support this, this feature is disabled by default.
+
+DOT_MULTI_TARGETS = NO
+
+# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will
+# generate a legend page explaining the meaning of the various boxes and
+# arrows in the dot generated graphs.
+
+GENERATE_LEGEND = YES
+
+# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will
+# remove the intermediate dot files that are used to generate
+# the various graphs.
+
+DOT_CLEANUP = YES
+
+#---------------------------------------------------------------------------
+# Configuration::additions related to the search engine
+#---------------------------------------------------------------------------
+
+# The SEARCHENGINE tag specifies whether or not a search engine should be
+# used. If set to NO the values of all tags below this one will be ignored.
+
+SEARCHENGINE = NO
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxygen.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxygen.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..1c856a4b7af29474112c893356a4d4fc5e0346b9
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxygen.cmake
@@ -0,0 +1,232 @@
+option(BUILD_DOCUMENTATION
+ "Build doxygen-based code documentation." OFF)
+
+# Dummy stubs to avoid BUILD_DOCUMENTATION ocnditionals around calls.
+function(doxygen_add_book)
+endfunction(doxygen_add_book)
+function(doxygen_add_package)
+endfunction(doxygen_add_package)
+function(doxygen_add_library)
+endfunction(doxygen_add_library)
+
+if(BUILD_DOCUMENTATION)
+ #-------------------------------------------------------------------
+ # helper functions
+ #-------------------------------------------------------------------
+ # doxygen_add_book(<package> <description>)
+ #
+ # - package : package or site (e.g., core, contrib/mul, etc.)
+ # - description : comment describing the package
+ #
+ # Example usage:
+ #
+ # doxygen_add_package(contrib/mul
+ # "Manchester University Libraries overview documentation"
+ # )
+ function(doxygen_add_book _book _description)
+ if(TEXI2HTML_EXECUTABLE)
+ string(REPLACE / _ bookname ${_book})
+ file(APPEND "${CMAKE_BINARY_DIR}/doxygen_configuration.cmake"
+ "set(DOXYGEN_BOOK_LIST \${DOXYGEN_BOOK_LIST} ${_book})\n"
+ "set(DOXYGEN_${bookname}_BOOK_DESCRIPTION\n"
+ " \"${_description}\")\n"
+ )
+ endif()
+ endfunction(doxygen_add_book)
+
+ # doxygen_add_package(<package> <description>)
+ #
+ # - package : package or site (e.g., core, contrib/mul, etc.)
+ # - description : comment describing the package
+ #
+ # Example usage:
+ #
+ # doxygen_add_package(contrib/mul
+ # "Manchester University Libraries"
+ # )
+ function(doxygen_add_package _package _description)
+ string(REPLACE / _ packname ${_package})
+ file(APPEND "${CMAKE_BINARY_DIR}/doxygen_configuration.cmake"
+ "set(DOXYGEN_PACKAGE_LIST \${DOXYGEN_PACKAGE_LIST} ${_package})\n"
+ "set(DOXYGEN_${packname}_DESCRIPTION \"${_description}\")\n"
+ )
+ endfunction(doxygen_add_package)
+
+ # doxygen_add_library(<lib>
+ # [DEPENDS <dep1> <dep2> ...]
+ # [PACKAGE <package>]
+ # [DESCRIPTION <description>]
+ # )
+ #
+ # - lib : name of library
+ # - package : package to which it belongs
+ # - depN : dependencies of this lib
+ # - description : comment describing the library
+ #
+ # Example usage:
+ #
+ # doxygen_add_library(contrib/gel/mrc/vpgl
+ # DEPENDS core/vcsl core/vgl core/vnl core/vbl
+ # PACKAGE contrib/gel
+ # DESCRIPTION "Photogrammetry Library"
+ # )
+ function(doxygen_add_library _library)
+ # parse arguments
+ set(DEPENDS)
+ set(PACKAGE)
+ set(DESCRIPTION)
+ set(active_option)
+ set(options_list PACKAGE DEPENDS DESCRIPTION)
+ foreach(arg ${ARGN})
+ list(FIND options_list ${arg} result)
+ if(result EQUAL -1)
+ set(${active_option} ${${active_option}} ${arg})
+ if(NOT "${active_option}" STREQUAL "DEPENDS")
+ set(active_option)
+ endif()
+ else()
+ set(active_option ${arg})
+ endif()
+ endforeach()
+ if(NOT PACKAGE)
+ set(PACKAGE other)
+ endif()
+
+ # start work
+ set(library ${_library})
+
+ string(REPLACE / _ libname ${library})
+ string(REPLACE / _ packname ${PACKAGE})
+
+ get_filename_component(prefix ${library} NAME)
+ set(prefix ${prefix}_)
+
+ # NOTE: tagfiles will be resolved in doxygen_makeall.cmake
+ set(tagfiles @tagfiles@)
+ configure_file(
+ "${DOXYGEN_SCRIPT_DIR}/doxyfile.in"
+ "${CMAKE_BINARY_DIR}/doxy/output/doxyfile.${libname}"
+ @ONLY
+ )
+
+ file(APPEND "${CMAKE_BINARY_DIR}/doxygen_configuration.cmake"
+ "set(DOXYGEN_LIBRARY_LIST\n"
+ " \${DOXYGEN_LIBRARY_LIST} ${library})\n"
+ "set(DOXYGEN_${libname}_DEPS \"${DEPENDS}\")\n"
+ "set(DOXYGEN_${libname}_DESCRIPTION \"${DESCRIPTION}\")\n"
+ "set(DOXYGEN_${packname}_LIBRARY_LIST\n"
+ " \${DOXYGEN_${packname}_LIBRARY_LIST} ${library})\n"
+ )
+ endfunction(doxygen_add_library)
+
+ #-------------------------------------------------------------------
+ # find packages needed
+ #-------------------------------------------------------------------
+ find_package(Doxygen REQUIRED)
+ find_package(Perl REQUIRED)
+
+ find_program(TEXI2HTML_EXECUTABLE texi2html)
+ if(NOT TEXI2HTML_EXECUTABLE)
+ message(WARNING "Texi2html not found; no books will be built.")
+ endif()
+
+ find_package(Subversion QUIET)
+ find_program(PSTOPNM_EXECUTABLE pstopnm)
+ find_program(PNMTOPNG_EXECUTABLE pnmtopng)
+ if(PSTOPNM_EXECUTABLE AND PNMTOPNG_EXECUTABLE)
+ set(NetPBM_FOUND TRUE)
+ else()
+ find_package(ImageMagick QUIET COMPONENTS convert)
+ endif()
+
+ #-------------------------------------------------------------------
+ #
+ #-------------------------------------------------------------------
+ # FIXME: Should others be cached?: DOXYGEN_STYLESHEET.
+ set(DOXYGEN_OUTPUT_DIR "${CMAKE_BINARY_DIR}/doxy"
+ CACHE PATH "Path to your doxygen output."
+ )
+ set(DOXYGEN_INDEX_FILE index.html
+ CACHE STRING "Name of your multi-lib global index."
+ )
+ set(DOXYGEN_MERGE_DOCS_WITH ""
+ CACHE STRING "Merge documentation to existing index."
+ )
+
+ get_filename_component(DOXYGEN_SCRIPT_DIR
+ "${CMAKE_CURRENT_LIST_FILE}" PATH
+ )
+ set(DOXYGEN_SOURCE_DIR "${CMAKE_SOURCE_DIR}")
+ set(DOXYGEN_INPUT_FILTER "${DOXYGEN_SCRIPT_DIR}/vxl_doxy.pl")
+ set(DOXYGEN_STYLESHEET) # FIXME: This is not really used so far...
+ if(DOXYGEN_DOT_FOUND)
+ option(DOXYGEN_USE_GRAPHVIZ
+ "Use graphviz to generate class diagrams" ON)
+ if(DOXYGEN_USE_GRAPHVIZ)
+ set(DOXYGEN_USE_DOT YES)
+ else(DOXYGEN_USE_GRAPHVIZ)
+ set(DOXYGEN_USE_DOT NO)
+ endif(DOXYGEN_USE_GRAPHVIZ)
+ endif(DOXYGEN_DOT_FOUND)
+
+ # make configuration loadable when running build_doxygen_doc target
+ file(WRITE "${CMAKE_BINARY_DIR}/doxygen_configuration.cmake"
+ "# Doxygen configuration variables for:\n"
+ "# ${DOXYGEN_SCRIPT_DIR}/doxygen_makeall.cmake\n"
+ "# *** This is a auto-generated file. DO NOT edit! ***\n"
+ "\n"
+ "set(Subversion_FOUND ${Subversion_FOUND})\n"
+ "set(Subversion_SVN_EXECUTABLE ${Subversion_SVN_EXECUTABLE})\n"
+ "\n"
+ "set(PERL_EXECUTABLE ${PERL_EXECUTABLE})\n"
+ "set(TEXI2HTML_EXECUTABLE ${TEXI2HTML_EXECUTABLE})\n"
+ "set(NetPBM_FOUND ${NetPBM_FOUND})\n"
+ "set(PSTOPNM_EXECUTABLE ${PSTOPNM_EXECUTABLE})\n"
+ "set(PNMTOPNG_EXECUTABLE ${PNMTOPNG_EXECUTABLE})\n"
+ "set(ImageMagick_FOUND ${ImageMagick_FOUND})\n"
+ "set(ImageMagick_convert_EXECUTABLE ${ImageMagick_convert_EXECUTABLE})\n"
+ "\n"
+ "set(DOXYGEN_EXECUTABLE ${DOXYGEN_EXECUTABLE})\n"
+ "set(DOXYGEN_OUTPUT_DIR ${DOXYGEN_OUTPUT_DIR})\n"
+ "set(DOXYGEN_INDEX_FILE ${DOXYGEN_INDEX_FILE})\n"
+ "set(DOXYGEN_MERGE_DOCS_WITH ${DOXYGEN_MERGE_DOCS_WITH})\n"
+ "set(DOXYGEN_SCRIPT_DIR ${DOXYGEN_SCRIPT_DIR})\n"
+ "set(DOXYGEN_SOURCE_DIR ${DOXYGEN_SOURCE_DIR})\n"
+ "set(DOXYGEN_LIBRARY_LIST)\n"
+ "set(DOXYGEN_BOOK_LIST)\n"
+ "\n"
+ #"set( ${})\n"
+ )
+
+ # prepare header for use by doxygen
+ set(title "\$title")
+ configure_file(
+ "${DOXYGEN_SCRIPT_DIR}/doxy_header.html"
+ "${CMAKE_BINARY_DIR}/doxy/output/doxy_header.html"
+ )
+
+ #-------------------------------------------------------------------
+ #
+ #-------------------------------------------------------------------
+ if(CMAKE_MINIMUM_REQUIRED_VERSION GREATER 2.6.3)
+ message(FATAL_ERROR
+ "config/cmake/doxygen/doxygen.cmake can now use SOURCES option"
+ "in add_custome_target command; un-comment the hidden code and"
+ "remove this conditional statement."
+ )
+ endif(CMAKE_MINIMUM_REQUIRED_VERSION GREATER 2.6.3)
+ add_custom_target(build_doxygen_doc
+ ${CMAKE_COMMAND} -P "${DOXYGEN_SCRIPT_DIR}/doxygen_makeall.cmake"
+ WORKING_DIRECTORY "${CMAKE_BINARY_DIR}"
+ COMMENT "Build Doxygen Documentation"
+ VERBATIM
+ #SOURCES
+ # "${DOXYGEN_SCRIPT_DIR}/doxygen.cmake"
+ # "${DOXYGEN_SCRIPT_DIR}/doxygen_makeall.cmake"
+ # "${DOXYGEN_SCRIPT_DIR}/doxyfile.in"
+ # "${DOXYGEN_SCRIPT_DIR}/doxy_header.html"
+ # "${DOXYGEN_SCRIPT_DIR}/vxl_doxy.pl"
+ # "${CMAKE_BINARY_DIR}/doxygen_configuration.cmake"
+ # "${CMAKE_BINARY_DIR}/doxygen_last_build_rev.cmake"
+ )
+endif(BUILD_DOCUMENTATION)
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxygen_makeall.cmake b/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxygen_makeall.cmake
new file mode 100644
index 0000000000000000000000000000000000000000..ea4cb00ed58cc47e93ec75772900f25960701876
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/doxygen_makeall.cmake
@@ -0,0 +1,352 @@
+#---------------------------------------------------------------------
+# Helper functions.
+#---------------------------------------------------------------------
+function(doxygen_module_has_changed _module _modname _changed)
+ set(changed TRUE)
+
+ # check if we need to build this
+ if(Subversion_FOUND AND EXISTS ${DOXYGEN_SOURCE_DIR}/${_module}/.svn)
+ Subversion_WC_INFO(${DOXYGEN_SOURCE_DIR}/${_module} ${_modname})
+
+ if(DOXYGEN_${_modname}_LAST_BUILD_REV)
+ if(NOT ${_modname}_WC_LAST_CHANGED_REV GREATER ${DOXYGEN_${_modname}_LAST_BUILD_REV})
+ # check whether there are uncommitted modifications
+ execute_process(
+ COMMAND "${Subversion_SVN_EXECUTABLE}"
+ status "${DOXYGEN_SOURCE_DIR}/${_module}"
+ OUTPUT_VARIABLE svn_log_output
+ OUTPUT_STRIP_TRAILING_WHITESPACE
+ )
+
+ if(NOT svn_log_output)
+ set(changed FALSE)
+ endif()
+ endif()
+ endif()
+
+ # Save the last revision built (or attempted to build).
+ if(${_modname}_WC_REVISION)
+ file(APPEND "${CMAKE_BINARY_DIR}/doxygen_last_build_rev.cmake"
+ "set(DOXYGEN_${_modname}_LAST_BUILD_REV ${${_modname}_WC_REVISION})\n"
+ )
+ endif()
+ endif()
+
+ set(${_changed} ${changed} PARENT_SCOPE)
+endfunction(doxygen_module_has_changed)
+
+function(_print_header _index_html)
+ set(title "VXL Documentation")
+ file(READ "${DOXYGEN_SCRIPT_DIR}/doxy_header.html" index_html)
+ string(CONFIGURE "${index_html}" index_html @ONLY)
+ set(index_html "${index_html}
+<h1>VXL Documentation</h1>
+<p>C++ Libraries for Computer Vision Research and Implementation</p>
+<hr />"
+ )
+ set(${_index_html} "${index_html}" PARENT_SCOPE)
+endfunction(_print_header)
+
+function(_print_book_links _index_html)
+ set(index_html "${${_index_html}}")
+ foreach(book ${DOXYGEN_BOOK_LIST})
+ string(REPLACE / _ bname ${book})
+ set(index_html "${index_html}
+<a href=\"books/${book}/book.html\">
+ ${book} : ${DOXYGEN_${bname}_BOOK_DESCRIPTION}
+</a>
+<br />"
+ )
+ endforeach()
+ set(${_index_html} "${index_html}" PARENT_SCOPE)
+endfunction(_print_book_links)
+
+function(_print_library_links _index_html)
+ set(index_html "${${_index_html}}")
+ foreach(package ${DOXYGEN_PACKAGE_LIST})
+ string(REPLACE / _ packname ${package})
+ if(DOXYGEN_${packname}_LIBRARY_LIST)
+ set(index_html "${index_html}
+<h3>${package} : ${DOXYGEN_${packname}_DESCRIPTION}</h3>
+<blockquote>"
+ )
+ foreach(library ${DOXYGEN_${packname}_LIBRARY_LIST})
+ string(REPLACE / _ libname ${library})
+ string(REGEX REPLACE ".*/" "" lib ${library})
+ if(DOXYGEN_${libname}_DESCRIPTION)
+ set(index_html "${index_html}
+ <a href=\"${library}/html/index.html\">
+ ${lib} : ${DOXYGEN_${libname}_DESCRIPTION}
+ </a>
+ <br />"
+ )
+ else()
+ set(index_html "${index_html}
+ <a href=\"${library}/html/index.html\">${lib}</a><br />"
+ )
+ endif()
+ endforeach()
+ set(index_html "${index_html}
+</blockquote>"
+ )
+ endif()
+ endforeach()
+ set(${_index_html} "${index_html}" PARENT_SCOPE)
+endfunction(_print_library_links)
+
+function(_print_footer _index_html)
+ set(index_html "${${_index_html}}")
+ execute_process(
+ COMMAND ${PERL_EXECUTABLE}
+ -e "$date = localtime(time()); print $date"
+ OUTPUT_VARIABLE date
+ OUTPUT_STRIP_TRAILING_WHITESPACE
+ )
+ set(index_html "${index_html}
+<h2>Download</h2>
+See the <a href=\"http://vxl.sourceforge.net/\">VXL Homepage</a>.
+The source for VXL can be downloaded from
+<a href=\"http://sourceforge.net/projects/vxl\">
+ sourceforge.net/projects/vxl
+</a>
+<br />
+<hr />
+<h2>Search this Documentation Tree - using Google Site Search</h2>
+<form method=\"get\" action=\"http://www.google.com/search\">
+ <input type=\"text\"
+ name=\"q\" size=\"31\" maxlength=\"255\" value=\"\" />
+ <input type=\"submit\" value=\"Google Search\" /><br />
+ <input type=\"radio\" name=\"sitesearch\" value=\"\" />
+ The Web<br />
+ <input type=\"radio\" name=\"sitesearch\"
+ value=\"paine.wiau.man.ac.uk/pub/doc_vxl/\" checked />
+ Manchester VXL Documentation<br />
+ <input type=\"radio\" name=\"sitesearch\"
+ value=\"public.kitware.com/vxl/doc/\">
+ Kitware VXL Documentation<br />
+ <input type=\"radio\" name=\"sitesearch\"
+ value=\"lems.brown.edu/vision/vxl_doc/\">
+ Brown VXL Documentation<br />
+</form>
+<br />
+<hr />
+Index generated by <em>config/cmake/doxygen/doxygen_makeall.cmake</em>
+on ${date}.
+<hr />
+</body>
+</html>"
+ )
+ set(${_index_html} "${index_html}" PARENT_SCOPE)
+endfunction(_print_footer)
+
+#---------------------------------------------------------------------
+# Initial configuration.
+#---------------------------------------------------------------------
+# All the variables used in this script must be loaded from here.
+include("${CMAKE_BINARY_DIR}/doxygen_configuration.cmake" OPTIONAL)
+
+# Read in last revision built.
+include("${CMAKE_BINARY_DIR}/doxygen_last_build_rev.cmake" OPTIONAL)
+
+find_package(Subversion QUIET)
+
+# Reset the file for new values.
+file(WRITE "${CMAKE_BINARY_DIR}/doxygen_last_build_rev.cmake"
+ "# *** This is a auto-generated file. DO NOT edit! ***\n\n"
+ )
+
+#---------------------------------------------------------------------
+# Process each book.
+#---------------------------------------------------------------------
+foreach(book ${DOXYGEN_BOOK_LIST})
+ string(REPLACE / _ bname ${book})
+
+ doxygen_module_has_changed(${book}/doc/book ${bname}_book changed)
+ if(changed)
+ message(STATUS "Texi2html: ${book} being processed.")
+
+ set(book_source_dir "${DOXYGEN_SOURCE_DIR}/${book}/doc/book")
+ set(book_output_dir "${DOXYGEN_OUTPUT_DIR}/html/books/${book}")
+
+ file(GLOB image_list "${book_source_dir}/*.eps")
+ foreach(image ${image_list})
+ get_filename_component(output_image ${image} NAME_WE)
+
+ # copy if acceptable format is in source
+ set(image_copied FALSE)
+ foreach(ext png jpg jpeg)
+ if(EXISTS "${book_source_dir}/${output_image}.${ext}")
+ configure_file(
+ "${book_source_dir}/${output_image}.${ext}"
+ "${book_output_dir}/${output_image}.${ext}"
+ COPYONLY
+ )
+ set(image_copied TRUE)
+ break()
+ endif()
+ endforeach()
+
+ # convert eps image to png
+ if(NOT image_copied)
+ if(NetPBM_FOUND)
+ execute_process(
+ COMMAND ${PSTOPNM_EXECUTABLE} -portrait -stdout ${image}
+ COMMAND ${PNMTOPNG_EXECUTABLE}
+ OUTPUT_FILE "${book_output_dir}/${output_image}.png"
+ )
+ elseif(ImageMagick_FOUND)
+ execute_process(
+ COMMAND ${ImageMagick_convert_EXECUTABLE}
+ "${image}" "${output_image}.png"
+ WORKING_DIRECTORY "${book_output_dir}"
+ )
+ endif()
+ endif()
+ endforeach()
+
+ # copy texi files; else texi2html uses absolute paths for images
+ file(GLOB texifile_list RELATIVE "${book_source_dir}"
+ "${book_source_dir}/*.texi"
+ )
+ foreach(texifile ${texifile_list})
+ configure_file(
+ "${book_source_dir}/${texifile}"
+ "${book_output_dir}/${texifile}"
+ COPYONLY
+ )
+ endforeach()
+
+ execute_process(
+ COMMAND ${TEXI2HTML_EXECUTABLE}
+ -split=chapter -number -output=. -I=. book.texi
+ WORKING_DIRECTORY "${book_output_dir}"
+ OUTPUT_FILE
+ "${CMAKE_BINARY_DIR}/doxy/output/texi2html_${bname}.out"
+ ERROR_FILE
+ "${CMAKE_BINARY_DIR}/doxy/output/texi2html_${bname}.out"
+ )
+ else()
+ message(STATUS "Texi2html: ${book} previously processed.")
+ endif()
+endforeach()
+
+#---------------------------------------------------------------------
+# Process each library.
+#---------------------------------------------------------------------
+file(MAKE_DIRECTORY "${DOXYGEN_OUTPUT_DIR}/tags")
+foreach(library ${DOXYGEN_LIBRARY_LIST})
+ string(REPLACE / _ libname ${library})
+
+ doxygen_module_has_changed(${library} ${libname} changed)
+ if(changed)
+ message(STATUS "Doxygen: ${library} being processed.")
+
+ # generate dep list
+ set(prev_result 0)
+ list(REMOVE_DUPLICATES DOXYGEN_${libname}_DEPS)
+ list(LENGTH DOXYGEN_${libname}_DEPS result)
+ while(NOT result EQUAL prev_result)
+ set(prev_result ${result})
+ foreach(dep ${DOXYGEN_${libname}_DEPS})
+ string(REPLACE / _ depname ${dep})
+ if(DOXYGEN_${depname}_DEPS)
+ list(APPEND DOXYGEN_${libname}_DEPS ${DOXYGEN_${depname}_DEPS})
+ endif()
+ endforeach()
+ list(REMOVE_DUPLICATES DOXYGEN_${libname}_DEPS)
+ list(LENGTH DOXYGEN_${libname}_DEPS result)
+ endwhile()
+
+ # Work out how to get from current library to base
+ # (e.g., "dir1" -> "..", "dir1/dir2" -> "../..", etc).
+ string(REGEX REPLACE "[^/]+" .. relpath ${library})
+
+ # set tagfiles for configuring @tagfiles@ entry in doxyfile
+ set(tagfiles)
+ foreach(dep ${DOXYGEN_${libname}_DEPS})
+ string(REPLACE / _ depname ${dep})
+ set(tagfiles
+ "${tagfiles} \\\n \"${DOXYGEN_OUTPUT_DIR}/tags/${depname}.tag")
+ set(tagfiles
+ "${tagfiles} \\\n = ${relpath}/../${dep}/html\"")
+ endforeach()
+
+ # configure @tagfiles@ entry
+ configure_file(
+ "${CMAKE_BINARY_DIR}/doxy/output/doxyfile.${libname}"
+ "${CMAKE_BINARY_DIR}/doxy/output/doxyfile.${libname}"
+ )
+
+ file(MAKE_DIRECTORY "${DOXYGEN_OUTPUT_DIR}/html/${library}/html")
+ execute_process(
+ COMMAND
+ ${DOXYGEN_EXECUTABLE}
+ "${CMAKE_BINARY_DIR}/doxy/output/doxyfile.${libname}"
+ WORKING_DIRECTORY "${DOXYGEN_SOURCE_DIR}"
+ OUTPUT_FILE
+ "${CMAKE_BINARY_DIR}/doxy/output/${libname}.doxy_out"
+ ERROR_FILE
+ "${CMAKE_BINARY_DIR}/doxy/output/${libname}.doxy_out"
+ )
+ else()
+ message(STATUS "Doxygen: ${library} previously processed.")
+ endif()
+endforeach()
+
+#---------------------------------------------------------------------
+# Build global index.
+#---------------------------------------------------------------------
+message(STATUS
+ "Doxygen: generating index at "
+ "${DOXYGEN_OUTPUT_DIR}/html/${DOXYGEN_INDEX_FILE}."
+ )
+
+if(DOXYGEN_MERGE_DOCS_WITH)
+ set(external_books_tag "@external_books@")
+ set(external_libraries_tag "@external_libraries@")
+ set(external_books "-->")
+ _print_book_links(external_books)
+ set(external_books "${external_books}
+<!-- @external_books_tag@ "
+ )
+
+ set(external_libraries "-->")
+ _print_library_links(external_libraries)
+ set(external_libraries "${external_libraries}
+<!-- @external_libraries_tag@ "
+ )
+
+ file(READ "${DOXYGEN_OUTPUT_DIR}/html/${DOXYGEN_MERGE_DOCS_WITH}"
+ index_html
+ )
+ string(CONFIGURE "${index_html}" index_html)
+else()
+ _print_header(index_html)
+ set(index_html "${index_html}
+<h2>Overview Documentation</h2>
+<a href=\"http://vxl.sourceforge.net\">VXL Homepage</a>
+<br />
+<br />
+<p>
+ Overviews are compiled from the doc/book directory of each package.
+</p>"
+ )
+ _print_book_links(index_html)
+ set(index_html "${index_html}
+<!-- @external_books@ -->
+<br />
+<hr />
+<h2>Library Documentation</h2>"
+ )
+ _print_library_links(index_html)
+ set(index_html "${index_html}
+<!-- @external_libraries@ -->
+<br />
+<hr />"
+ )
+ _print_footer(index_html)
+endif()
+
+file(WRITE "${DOXYGEN_OUTPUT_DIR}/html/${DOXYGEN_INDEX_FILE}"
+ "${index_html}"
+ )
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/vxl_doxy.pl b/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/vxl_doxy.pl
new file mode 100644
index 0000000000000000000000000000000000000000..86672cb5626aec34ceddebf40c140d4f98a67fa8
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/doxygen/vxl_doxy.pl
@@ -0,0 +1,131 @@
+#!/bin/sh
+# -*- perl -*-
+exec perl -w -x $0 ${1+"$@"}
+#!perl
+#line 6
+# If Windows barfs at line 3 here, you will need to run perl -x this_file.pl
+# You can set up as a permanent file association using the following commands
+# >assoc .pl-PerlScript
+# >ftype PerlScript=Perl=C:\Perl\bin\Perl.exe -x "%1" %*
+
+# Script to change the perceps documentation format to Doxygen (JavaDoc) format
+# Authors:
+# Dave Cooper
+# Maarten Vergauwen
+# Date:
+# 17/02/2000
+# Modified:
+# 11 April 2001 Ian Scott. Remove support for old perceps commands
+# 5 May 2001 Geoff Cross. Correctly handle end of verbatim blocks. Allow two contiguous comments
+# 10 May 2001 Ian Scott. Merged Geoffs and my changes
+
+
+# patterns to be matched
+$verbpatt = '\\\\verbatim';
+$endverbpatt = '\\\\endverbatim';
+$slashslashpatt = '^\\s*//';
+$slashslashcolonpatt = '^\\s*//:';
+$slashstarstarpatt = '/**';
+$spacespacepatt = ' ';
+$starpatt = '*';
+$starslashpatt = '*/';
+
+# variables that keep state:
+
+# comment found -> first line should start with /**, next lines with *, last line with */
+$comment = 0;
+
+# verbatim found -> lines should not start with * (visible in Doxygen)
+$verbatim = 0;
+# finish verbatim mode at the end of this line.
+$should_end_verbatim = 0;
+
+$debug = 0;
+
+# mainloop
+while (<>)
+{
+ # preprocessing
+ s/\bVCL_SUNPRO_CLASS_SCOPE_HACK\s*\([^()]*\)//g;
+ s/\bVCL_SUNPRO_ALLOCATOR_HACK\s*\(([^()]*)\)/$1/g;
+ s/\bVCL_CAN_STATIC_CONST_INIT_(INT|FLOAT)\b/1/g;
+ s/\bVCL_STATIC_CONST_INIT_(INT|FLOAT)\s*\(([^()]*)\)/= $2/g;
+ s/\bVCL_DFL_TYPE_PARAM_STLDECL\s*\(([^,()]*),([^,()]*)\)/class $1 = $2 /g;
+ s/\bDECLARE_DYNCREATE\s*\([^()]*\)//g; # for MFC
+ s/\bTODO\b/\\todo/g;
+
+ if ( $should_end_verbatim )
+ {
+ $verbatim = 0;
+ $should_end_verbatim = 0;
+ }
+
+ # found verbatim ?
+ if ( m/$verbpatt/ ) { $verbatim = 1; };
+
+ # found endverbatim ?
+ if ( m/$endverbpatt/ ) { $should_end_verbatim = 1; };
+
+ # found start of comment: "//:" ?
+ if ( s!$slashslashcolonpatt!$slashstarstarpatt! )
+ {
+ chomp; s/\s*$//;
+ # escape a space following a dot, add a dot at the end,
+# # and finish brief doc, unless the line is empty or only has '\file':
+ unless (m!^\s*\/\*\*\s*(\\file)?\s*$!) {
+# s/\. /.\\ /g; s/(\.)?\s*$/. \*\/\n\/\*/;
+ s/\. /.\\ /g; s/(\.)?\s*$/.\n/;
+ }
+ else { s/$/\n/; }
+
+ if ($comment)
+ {
+ # Previous comment hasn't ended--two contiguous comment blocks.
+ # (Should not happen.)
+ print STDERR "Two contiguous comment blocks -- this should not happen\n";
+ print "*/\n";
+ }
+ $comment = 1;
+ print; next;
+ }
+
+ # Replace '$' with '\f$' (TeX math mode)
+ s/(\\f)?\$(.+?)(\\f)?\$/\\f\$$2\\f\$/g if ($comment);
+
+ # found continuation of comment WITH verbatim -> no "*"
+ if ( m!$slashslashpatt! && $verbatim && $comment)
+ {
+ s!$slashslashpatt!$spacespacepatt!;
+# # Make 'Modifications' a section title:
+# s!\b(Modifications?)\b\:?!\<H2\>$1\<\/H2\>!;
+ # remove lines of the form ========= or +-+-+-+-+ or ********* or longer:
+ print unless m/^\s*[*=+-]{9,}\s*$/; next;
+ }
+
+ # found continuation of comment WITHOUT verbatim -> start line with "*"
+ if ( m!$slashslashpatt! && $comment )
+ {
+ s!$slashslashpatt!$starpatt!;
+ # remove lines of the form ========= or +-+-+-+-+ or ********* or longer:
+ print unless m/^\s*[*=+-]{9,}\s*$/;
+ # found \brief: finish it after single line:
+ # print "\n" if ( m!\\brief\b!);
+ next;
+ }
+
+ # found end of comment -> start line with */
+ # NOTE that *every* line within a comment (also empty lines) *must* start with // !
+ # (In an earlier version of this script, empty lines were allowed inside comments.)
+ if ( $comment && ! m!$slashslashpatt! )
+ {
+ print "$starslashpatt";
+ $comment = 0;
+ print; next;
+ }
+
+ # just print line if not in comment or in file
+ if ( !$comment ) { print; next; }
+
+ # debug - print unprocessed lines (s.b. none)
+ if ($debug) { print "LNP:\t"; print; }
+}
diff --git a/Utilities/ITK/Utilities/vxl/config/cmake/export/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/config/cmake/export/CMakeLists.txt
index 8ffcf5ca561ddd78ca2d2b17dee19994759b4bf6..2c2bfcdce8b85c55064d215889432d4327487ac1 100644
--- a/Utilities/ITK/Utilities/vxl/config/cmake/export/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/config/cmake/export/CMakeLists.txt
@@ -14,6 +14,9 @@ INCLUDE( ${MODULE_PATH}/FindJPEG.cmake )
INCLUDE( ${MODULE_PATH}/FindTIFF.cmake )
INCLUDE( ${MODULE_PATH}/FindGEOTIFF.cmake )
INCLUDE( ${MODULE_PATH}/FindMPEG2.cmake )
+SET( EXPAT_FIND_QUIETLY "YES" )
+INCLUDE( ${vxl_SOURCE_DIR}/contrib/brl/bmods/FindEXPAT.cmake )
+SET( EXPAT_FIND_QUIETLY )
# Save the compiler settings so another project can import them.
INCLUDE(${CMAKE_ROOT}/Modules/CMakeExportBuildSettings.cmake)
@@ -24,6 +27,7 @@ SET(VXL_EXPORT_BUILD_SETTINGS_FILE
CMAKE_EXPORT_BUILD_SETTINGS(${VXL_BUILD_SETTINGS_FILE})
# Save library dependencies.
+SET(VXL_CMAKE_DOXYGEN_DIR ${vxl_SOURCE_DIR}/config/cmake/doxygen)
SET(VXL_LIBRARY_DEPENDS_FILE ${vxl_BINARY_DIR}/VXLLibraryDepends.cmake)
SET(VXL_INSTALL_LIBRARY_DEPENDS_FILE
${CMAKE_INSTALL_PREFIX}/share/vxl/cmake/VXLLibraryDepends.cmake
diff --git a/Utilities/ITK/Utilities/vxl/core/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/core/CMakeLists.txt
index 99c50800f91ba42f7ce7db8cceb1798c151ded12..41a084a8371ae4948159c9760aee227de4452607 100644
--- a/Utilities/ITK/Utilities/vxl/core/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/core/CMakeLists.txt
@@ -7,11 +7,11 @@ SET(global_sources
)
IF(NOT VXL_INSTALL_NO_DEVELOPMENT)
- INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_ROOT}/core ${global_sources})
+ INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_INCLUDE_DIR} ${global_sources})
ENDIF(NOT VXL_INSTALL_NO_DEVELOPMENT)
# common test executable
-SUBDIRS(testlib)
+#SUBDIRS(testlib)
# numerics
SUBDIRS(vnl)
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/core/testlib/CMakeLists.txt
deleted file mode 100644
index 2d732332db140dc1e35b24330792b0972f0b42b4..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/CMakeLists.txt
+++ /dev/null
@@ -1,29 +0,0 @@
-# ./vxl/testlib/CMakeLists.txt
-
-SET(TESTLIB_VCL_WHERE_ROOT_DIR_H ${vxl_BINARY_DIR}/vcl/vcl_where_root_dir.h)
-
-IF (TESTLIB_VCL_WHERE_ROOT_DIR_H)
- ADD_DEFINITIONS(-DVCL_WHERE_ROOT_DIR_H_EXISTS)
-ENDIF(TESTLIB_VCL_WHERE_ROOT_DIR_H)
-
-SET( testlib_sources
-
- # Useful utilities for the tests
- testlib_test.h testlib_test.cxx
-
- # For use by the driver program
- testlib_register.h
-
- # The main function of the driver executable
- testlib_main.cxx
-
- # Used to locate test files in source tree
- testlib_root_dir.h testlib_root_dir.cxx
-)
-
-ADD_LIBRARY( itktestlib ${testlib_sources} )
-TARGET_LINK_LIBRARIES( itktestlib itkvcl )
-
-IF( BUILD_TESTING )
- SUBDIRS( tests )
-ENDIF( BUILD_TESTING )
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/introduction_doxy.txt b/Utilities/ITK/Utilities/vxl/core/testlib/introduction_doxy.txt
deleted file mode 100644
index b1ec6e246c7f0d3dc1abbaf4e853c8e3fbfab911..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/introduction_doxy.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-// The following text is included in the main documentation page by doxygen
-/*! \mainpage testlib : Testing Library
-*
-* testlib provides some common functionality used in testing vxl. It
-* provides a framework for generating a single test driver that will
-* run a bunch of tests, thus minimising the number of test executables
-* generated.
-*
-* testlib_root_dir() can be used to find golden data files.
-*/
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_main.cxx b/Utilities/ITK/Utilities/vxl/core/testlib/testlib_main.cxx
deleted file mode 100644
index 6ee1897f5fce1bd2868794c1992be9911d9893a7..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_main.cxx
+++ /dev/null
@@ -1,205 +0,0 @@
-#include "testlib_register.h"
-
-#include <vcl_iostream.h>
-#include <vcl_string.h>
-#include <vcl_vector.h>
-#include <vcl_cstdlib.h>
-#if VCL_HAS_EXCEPTIONS
-#include <vcl_exception.h>
-#endif
-
-# include <stdlib.h>
-
-#if defined(VCL_VC) || defined(VCL_BORLAND)
-# include <crtdbg.h>
-# include <windows.h>
-# include <vcl_cstdio.h>
-
-LONG WINAPI vxl_exception_filter( struct _EXCEPTION_POINTERS *ExceptionInfo )
-{
- // Retrieve exception information
- PVOID ExceptionAddress = ExceptionInfo->ExceptionRecord->ExceptionAddress;
- DWORD ExceptionCode = ExceptionInfo->ExceptionRecord->ExceptionCode;
- DWORD* ExceptionInformation = (DWORD*)ExceptionInfo->ExceptionRecord->ExceptionInformation;
-
- vcl_fprintf(stderr, "\nTOP-LEVEL EXCEPTION HANDLER\n");
- switch (ExceptionCode)
- {
- case EXCEPTION_ACCESS_VIOLATION:
- vcl_fprintf(stderr, "The instruction at \"0x%.8p\" failed to %s memory at \"0x%.8x\".\n\n",
- ExceptionAddress, ExceptionInformation[0] ? "write to" :"read",
- ExceptionInformation[1]);
- break;
-
- case EXCEPTION_INT_DIVIDE_BY_ZERO:
- vcl_fprintf(stderr, "The instruction at \"0x%.8p\" caused an exception of integer devision by zero.\n\n",
- ExceptionAddress);
- break;
- default:
- vcl_fprintf(stderr, "The instruction at \"0x%.8p\" caused an unknown exception (exception code: \"0x%.8x\").\n\n",
- ExceptionAddress,
- ExceptionCode);
- }
-
- // Default action is to abort
- vcl_printf("Execution aborted!\n");
- return EXCEPTION_EXECUTE_HANDLER;
-}
-#endif // defined(VCL_WIN32)
-
-#if defined(VCL_BORLAND)
-# include <math.h>
-# include <float.h> // for _control87()
-#endif // defined(VCL_BORLAND)
-
-static vcl_vector<TestMainFunction> testlib_test_func_;
-static vcl_vector<vcl_string> testlib_test_name_;
-
-void
-list_test_names( vcl_ostream& ostr )
-{
- ostr << "The registered test names are:\n";
- for ( unsigned int i = 0; i < testlib_test_name_.size(); ++i )
- ostr << " " << testlib_test_name_[i] << '\n';
- ostr << "\nOmitting a test name, or specifying the name \"all\" will run all the tests.\n";
-}
-
-
-void
-testlib_enter_stealth_mode()
-{
- // check for Dashboard test
- char * env_var1 = getenv("DART_TEST_FROM_DART");
- char * env_var2 = getenv("DASHBOARD_TEST_FROM_CTEST"); // DART Client built in CMake
- if ( env_var1 || env_var2 ) {
-
- // Don't allow DART test to open critical error dialog boxes
-#if defined(VCL_VC)
- // No abort or ANSI assertion failure dialog box
- _CrtSetReportMode(_CRT_ERROR, _CRTDBG_MODE_FILE);
- _CrtSetReportFile(_CRT_ERROR, _CRTDBG_FILE_STDERR);
-
- // No Windows style ASSERT failure dialog box
- _CrtSetReportMode(_CRT_ASSERT, _CRTDBG_MODE_FILE);
- _CrtSetReportFile(_CRT_ASSERT, _CRTDBG_FILE_STDERR);
-
- // No unhandled exceptions dialog box,
- // such as access violation and integer division by zero
- SetUnhandledExceptionFilter( vxl_exception_filter );
-#endif //defined(VCL_VC)
-
- // Disable Borland's floating point exceptions.
-#if defined(VCL_BORLAND)
- _control87(MCW_EM, MCW_EM);
-#endif // defined(VCL_BORLAND)
- }
-
-}
-
-
-int testlib_run_test_unit(vcl_vector<vcl_string>::size_type i, int argc, char *argv[])
-{
-#if VCL_HAS_EXCEPTIONS
- char * env_var1 = getenv("DART_TEST_FROM_DART");
- char * env_var2 = getenv("DASHBOARD_TEST_FROM_CTEST"); // DART Client built in CMake
- if ( env_var1 || env_var2 ) {
- try {
- return testlib_test_func_[i]( argc, argv );
- }
- catch (const vcl_exception &e)
- {
- vcl_cerr << "\nTOP-LEVEL EXCEPTION HANDLER **FAILED**\n"
- << e.what() << "\n\n";
- return 1;
- }
- }
-// Leave MS structured exceptions to the SE handler.
- else
-#endif
- return testlib_test_func_[i]( argc, argv );
-}
-
-
-int
-testlib_main( int argc, char* argv[] )
-{
- // The caller should already have called register_tests().
-
- // NOT to produce any dialog windows
- testlib_enter_stealth_mode();
-
- // Assume the index type for vector<string> and
- // vector<TestMainFunction> are the same.
- typedef vcl_vector<vcl_string>::size_type vec_size_t;
-
- // Error check.
- if ( testlib_test_func_.size() != testlib_test_name_.size() ) {
- vcl_cerr << "Error: " << testlib_test_func_.size() << " test functions are registered, but "
- << testlib_test_name_.size() << " test names are registered.\n";
- return 1;
- }
-
-
- // If a test name is given, try to run it. Otherwise, try to run all
- // the tests. The first argument, if available, is assumed to be a
- // test name. The special test name "all" can be used to run all the tests
- // with the subsequent arguments passed to each test.
-
- bool test_name_given = argc >= 2;
-
- if ( test_name_given && vcl_string("all") == argv[1] )
- {
- --argc; ++argv; test_name_given = false;
- }
- if ( test_name_given )
- {
- for ( vec_size_t i = 0; i < testlib_test_name_.size(); ++i )
- if ( testlib_test_name_[i] == argv[1] )
- return testlib_run_test_unit(i, argc-1, argv+1);
-
-
- vcl_cerr << "Test " << argv[1] << " not registered.\n";
- list_test_names( vcl_cerr );
- }
- else
- {
- vcl_cout << "No test name provided. Attempting to run all tests.\n";
- list_test_names( vcl_cout );
- vcl_cout << "If you want to run a single test, specify one of the above on the command line.\n\n" << vcl_flush;
-
- bool all_pass = true;
- for ( vec_size_t i = 0; i < testlib_test_name_.size(); ++i )
- {
- vcl_cout << "----------------------------------------\n"
- << "Running: " << testlib_test_name_[i] << '\n'
- << "----------------------------------------\n" << vcl_flush;
-
- int result = testlib_run_test_unit(i, argc, argv);
-
- vcl_cout << "----------------------------------------\n"
- << testlib_test_name_[i] << " returned " << result << ' '
- << ( result==0 ? "(PASS)" : "(FAIL)" ) << '\n'
- << "----------------------------------------\n" << vcl_flush;
- all_pass &= (result == 0);
- }
-
- vcl_cout << "\n\nCombined result of " << testlib_test_name_.size() << " tests: "
- << ( all_pass ? "PASS" : "FAIL" ) << vcl_endl;
- return all_pass ? 0 : 1;
- }
-
- return 1;
-}
-
-void testlib_register_test(const vcl_string & name, TestMainFunction func)
-{
- testlib_test_func_.push_back(func);
- testlib_test_name_.push_back(name);
-}
-
-
-void testlib_cleanup()
-{
- testlib_test_func_.clear();
- testlib_test_func_.clear();
-}
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_register.h b/Utilities/ITK/Utilities/vxl/core/testlib/testlib_register.h
deleted file mode 100644
index 5660f47930e8a585d0ee1922c94a3cc54e898148..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_register.h
+++ /dev/null
@@ -1,65 +0,0 @@
-#ifndef TESTLIB_REGISTER_H_
-#define TESTLIB_REGISTER_H_
-//:
-// \file
-// \author Amitha Perera
-// \brief Macros for registering the tests with the driver.
-//
-// A test driver program would simply look like
-// \code
-// #include <testlib/testlib_register.h>
-// DECLARE( some_test_name );
-// void register_tests()
-// {
-// REGISTER( some_test_name );
-// }
-// DEFINE_MAIN;
-// \endcode
-// The DEFINE_MAIN macro will define the main() function for the driver.
-// You will also have to link in a file defining a function
-// \code
-// int some_test_name_main(int,char*[])
-// \endcode
-// See the vxl tests for further examples (such as vil/tests).
-
-#include <vcl_string.h>
-
-#if 0 // ifdef VCL_VC - gives compiler errors - PVr
-typedef int ( (__cdecl *const) TestMainFunction)( int, char*[] );
-#else
-typedef int (*TestMainFunction)( int, char*[] );
-#endif
-
-
-//: Declare the existence of the test.
-// If you DECLARE( x ), then you will need to define a function int x_main(int,char*[]).
-#ifdef VCL_VC
-#define DECLARE( testname ) int _cdecl testname ## _main ( int argc, char* argv[] )
-#else
-#define DECLARE( testname ) int testname ## _main ( int argc, char* argv[] )
-#endif
-
-void testlib_register_test(const vcl_string &, TestMainFunction);
-
-//: Register the test with the driver.
-// \param testname should be the same as one of the tests declared with DECLARE.
-#define REGISTER( testname ) \
- testlib_register_test(#testname, & testname ## _main );
-
-//: Define the main() routine for this test driver.
-// This allows the main function to be defined in the driver code
-// itself--instead of in the testlib library--thus avoiding
-// "awf-weirdness". This also means that functionality from the test
-// library, such as testlib_root_dir, can be used even if it is not
-// used to create a test driver.
-#define DEFINE_MAIN \
- int testlib_main(int,char*[]); \
- void testlib_cleanup(); \
- int main( int argc, char* argv[] ) { \
- register_tests(); \
- int retval = testlib_main( argc, argv ); \
- testlib_cleanup(); \
- return retval; \
- }
-
-#endif // TESTLIB_REGISTER_H_
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_root_dir.cxx b/Utilities/ITK/Utilities/vxl/core/testlib/testlib_root_dir.cxx
deleted file mode 100644
index ca7c4e71f570295a35f00ff02b3001a6b90c5106..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_root_dir.cxx
+++ /dev/null
@@ -1,42 +0,0 @@
-// This is core/testlib/testlib_root_dir.cxx
-#include "testlib_root_dir.h"
-//:
-// \file
-
-#include <vcl_cstdlib.h>
-#include <vcl_iostream.h>
-
-// The following should have been created automatically by the
-// configuration scripts from vcl_where_root_dir.h.in
-// We need to check for its existence and if it doesn't exist - do something else.
-#ifdef VCL_WHERE_ROOT_DIR_H_EXISTS
-#include <vcl_where_root_dir.h>
-//: Return source root directory (ie the one just below vcl).
-vcl_string testlib_root_dir()
-{
- return vcl_string(VCL_SOURCE_ROOT_DIR);
-}
-#else
-//: Return source root directory (ie the one just below vcl and vxl).
-vcl_string testlib_root_dir()
-{
- char* ptr;
-
- ptr= vcl_getenv("VXLSRC");
- if (ptr)
- return vcl_string(ptr);
-
- ptr= vcl_getenv("VCLSRC");
- if (ptr)
- return vcl_string(ptr);
-
- ptr= vcl_getenv("VXL_SRC");
- if (ptr)
- return vcl_string(ptr);
-
- vcl_cerr<<"ERROR: testlib_root_dir() Unable to retrieve directory from\n"
- <<"$VCLSRC or $VXLSRC or $VXL_SRC. Sorry.\n";
- return vcl_string("");
-}
-
-#endif
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_root_dir.h b/Utilities/ITK/Utilities/vxl/core/testlib/testlib_root_dir.h
deleted file mode 100644
index d0df083e2e84919898d6eca4f26376bec7ec9c79..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_root_dir.h
+++ /dev/null
@@ -1,23 +0,0 @@
-#ifndef testlib_root_dir_h_
-#define testlib_root_dir_h_
-//:
-// \file
-// \brief Function to return root directory (ie the one just below vcl).
-// \author Tim Cootes
-// \verbatim
-// Modifications
-// 17-05-2001 I. Scott - Moved from vul to testlib
-// \endverbatim
-#include <vcl_string.h>
-
-//: Return source root directory (ie the one just below vcl).
-// If the file vcl_where_root_dir.h has been automatically generated
-// during configuration (which will happen with cmake) then the
-// appropriate source directory will be returned.
-//
-// If another build system is used in which this is not created,
-// the function will return the value of either of the environment
-// variables: VXLSRC, VCLSRC or VXL_SRC in that order.
-vcl_string testlib_root_dir();
-
-#endif // testlib_root_dir_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_test.cxx b/Utilities/ITK/Utilities/vxl/core/testlib/testlib_test.cxx
deleted file mode 100644
index 311da060e66459c274d2adcd8d655ef35e2f53a3..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_test.cxx
+++ /dev/null
@@ -1,167 +0,0 @@
-// This is core/testlib/testlib_test.cxx
-#include "testlib_test.h"
-//
-// Copyright (C) 1991 Texas Instruments Incorporated.
-//
-// Permission is granted to any individual or institution to use, copy, modify,
-// and distribute this software, provided that this complete copyright and
-// permission notice is maintained, intact, in all copies and supporting
-// documentation.
-//
-// Texas Instruments Incorporated provides this software "as is" without
-// express or implied warranty.
-//
-// Created: 11-Mar-2001: TFC Copy of vnl_test
-// Created: 25-Apr-2002: AGAP Modified copy of testlib_test
-//
-#include <vcl_cmath.h>
-#include <vcl_cstdlib.h> // for abs(long)
-#include <vcl_iostream.h>
-#include <vcl_iomanip.h> // for setfill, setw
-#include <vcl_complex.h>
-
-static int num_test;
-static int tests_passed;
-static int tests_failed;
-static const char* test_name;
-
-void testlib_test_start(const char* name)
-{
- num_test = 0;
- tests_passed = 0;
- tests_failed = 0;
- test_name = name;
- vcl_cout << "-----------------------------------------------------------------------------\n"
- << "Start Testing";
- if (test_name != NULL) vcl_cout << ' ' << test_name;
- vcl_cout << ":\n-----------------------------------------------------------------------------\n" << vcl_flush;
- }
-
-void testlib_test_begin(const char* msg)
-{
- num_test++;
- vcl_cout <<" Test "<< vcl_setw(3) << vcl_right << vcl_setfill('0') << num_test
- <<": "<< vcl_setw(53) << vcl_left << vcl_setfill(' ')<< msg <<" --> "
- << vcl_flush;
-}
-
-// NOTE: We don't pass in the message (see test_begin) because
-// we want to ensure that the message is printed BEFORE
-// the test is executed. This way when a test crashes
-// we can tell if it was during a test, or between tests.
-void testlib_test_perform(bool success)
-{
- if (success) {
- tests_passed++;
- vcl_cout << " PASSED\n" << vcl_flush;
- } else {
- tests_failed++;
- vcl_cout << "**FAILED**\n" << vcl_flush;
- }
-}
-
-int testlib_test_summary()
-{
- vcl_cout << "-----------------------------------------------------------------------------\n";
- if (test_name) vcl_cout << test_name << ' ';
- vcl_cout << "Test Summary: ";
- if (tests_failed > 0)
- {
- if (tests_passed == 0)
- vcl_cout << "No tests succeeded";
- else if (tests_passed == 1)
- vcl_cout << "1 test succeeded";
- else
- vcl_cout << tests_passed <<" tests succeeded";
- if (tests_failed == 1)
- vcl_cout <<", 1 test failed";
- else
- vcl_cout <<", "<< tests_failed <<" tests failed";
- vcl_cout<<"\t\t*****";
- }
- else
- {
- if (tests_passed > 1)
- vcl_cout << "All "<< tests_passed <<" tests succeeded";
- else if (tests_passed == 1)
- vcl_cout << "1 test succeeded";
- else
- vcl_cout << "Test succeeded";
- }
- vcl_cout << "\n-----------------------------------------------------------------------------\n" << vcl_flush;
- return tests_failed;
-}
-
-void testlib_test_assert(const vcl_string& msg, bool expr)
-{
- vcl_cout << msg << " - " << vcl_flush;
- testlib_test_perform(expr);
-}
-
-void testlib_test_assert_near(const vcl_string& msg, double expr, double target, double tol)
-{
- vcl_cout << msg << " should be " << target << ", is " << expr << ", " << vcl_flush;
- double diff = vcl_abs(expr - target);
- if (target != 0.0 && diff != 0.0)
- vcl_cout << "difference " << diff << ", " << vcl_flush;
- testlib_test_perform(diff <= tol);
-}
-
-void testlib_test_assert_near(const vcl_string& msg, vcl_complex<double> expr, vcl_complex<double> target, double tol)
-{
- vcl_cout << msg << " should be " << target << ", is " << expr << ", " << vcl_flush;
- double diff = vcl_abs(expr - target);
- if (target != vcl_complex<double>(0,0) && diff != 0.0)
- vcl_cout << "difference " << diff << ", " << vcl_flush;
- testlib_test_perform(diff <= tol);
-}
-
-void testlib_test_assert_near_relative(const vcl_string& msg, double expr, double target, double tol)
-{
- vcl_cout << msg << " should be " << target << ", is " << expr << ", " << vcl_flush;
- double max = vcl_abs(target); if (vcl_abs(expr) > max) max = vcl_abs(expr);
- if (max==0.0 || target==0.0) max=1.0;
- double diff = vcl_abs(expr - target) / max;
- if (target != 0.0 && diff != 0.0)
- vcl_cout << "relative difference " << diff << ", " << vcl_flush;
- testlib_test_perform(diff <= tol);
-}
-
-void testlib_test_assert_near_relative(const vcl_string& msg, vcl_complex<double> expr, vcl_complex<double> target, double tol)
-{
- vcl_cout << msg << " should be " << target << ", is " << expr << ", " << vcl_flush;
- double max = vcl_abs(target); if (vcl_abs(expr) > max) max = vcl_abs(expr);
- if (max==0.0 || target==vcl_complex<double>(0,0)) max=1.0;
- double diff = vcl_abs(expr - target) / max;
- if (target != vcl_complex<double>(0,0) && diff != 0.0)
- vcl_cout << "relative difference " << diff << ", " << vcl_flush;
- testlib_test_perform(diff <= tol);
-}
-
-void testlib_test_assert_far(const vcl_string& msg, double expr, double target, double tol)
-{
- vcl_cout << msg << " should not be " << target << ", is " << expr << ", " << vcl_flush;
- double diff = vcl_abs(expr - target);
- if (target != 0.0 && diff != 0.0)
- vcl_cout << "difference " << diff << ", " << vcl_flush;
- testlib_test_perform(diff > tol);
-}
-
-void testlib_test_assert_far(const vcl_string& msg, vcl_complex<double> expr, vcl_complex<double> target, double tol)
-{
- vcl_cout << msg << " should not be " << target << ", is " << expr << ", " << vcl_flush;
- double diff = vcl_abs(expr - target);
- if (target != vcl_complex<double>(0,0) && diff != 0.0)
- vcl_cout << "difference " << diff << ", " << vcl_flush;
- testlib_test_perform(diff > tol);
-}
-
-void testlib_test_assert_equal(const vcl_string& msg, long expr, long target)
-{
- vcl_cout << msg << " should be " << target << ", is " << expr << ", " << vcl_flush;
- long diff = vcl_abs(expr - target);
- if (target != 0 && diff != 0)
- vcl_cout << "difference " << diff << ", " << vcl_flush;
- testlib_test_perform(diff == 0);
-}
-
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_test.h b/Utilities/ITK/Utilities/vxl/core/testlib/testlib_test.h
deleted file mode 100644
index 7ba2760761ad0810ab2b2584054ed9b9e5036289..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/testlib_test.h
+++ /dev/null
@@ -1,137 +0,0 @@
-// This is core/testlib/testlib_test.h
-#ifndef testlib_test_h_
-#define testlib_test_h_
-//:
-// \file
-// \brief Testing software
-// \author Tim Cootes
-// \verbatim
-// Modifications
-// Apr 2002, Amitha Perera: Copied from vil_test and moved into testlib in an
-// attempt to consolidate all the repeated test functionality.
-// Sep.2004, Peter Vanroose: added testlib_test_assert_near_relative().
-// \endverbatim
-
-#include <vcl_string.h>
-#include <vcl_complex.h>
-
-//: initialise test counters, check test name 'name' exists
-void testlib_test_start(const char* name = 0);
-//: increment number of tests, then output msg
-void testlib_test_begin(const char* msg);
-//: increment success/failure counters
-void testlib_test_perform(bool success);
-//: output summary of tests performed
-int testlib_test_summary();
-
-//: output msg, then perform test in expr
-void testlib_test_assert(const vcl_string& msg, bool expr);
-//: output msg, then perform test to see if expr is within tol of target
-void testlib_test_assert_near(const vcl_string& msg, double expr,
- double target = 0, double tol = 1e-12);
-//: output msg, then perform test to see if expr is within tol of target
-void testlib_test_assert_near(const vcl_string& msg, vcl_complex<double> expr,
- vcl_complex<double> target, double tol = 1e-12);
-//: output msg, then test to see if expr is within relative tol of target
-void testlib_test_assert_near_relative(const vcl_string& msg, double expr,
- double target = 0, double tol = 1e-12);
-//: output msg, then test to see if expr is within relative tol of target
-void testlib_test_assert_near_relative(const vcl_string& msg,
- vcl_complex<double> expr,
- vcl_complex<double> target,
- double tol = 1e-12);
-//: output msg, then perform test to see if expr is not within tol of target
-void testlib_test_assert_far(const vcl_string& msg, double expr,
- double target = 0, double tol = 1e-12);
-//: output msg, then perform test to see if expr is not within tol of target
-void testlib_test_assert_far(const vcl_string& msg, vcl_complex<double> expr,
- vcl_complex<double> target, double tol = 1e-12);
-//: output msg, then perform test to see if expr is equal to target
-void testlib_test_assert_equal(const vcl_string& msg, long expr, long target);
-
-#define Assert testlib_test_assert
-#define AssertNear testlib_test_assert_near
-#define AssertFar testlib_test_assert_far
-
-//: initialise test
-#define START(s) testlib_test_start(s)
-
-//: TEST function, s is message, test to see if p==v
-#define TEST(s,p,v) \
-do { \
- testlib_test_begin(s); \
- testlib_test_perform((p)==(v)); \
-} while (false)
-
-//: TEST function, s is message, test to see if p==v for integral values
-#define TEST_EQUAL(s,p,v) \
-do { \
- testlib_test_begin(s); \
- testlib_test_assert_equal("",p,v); \
-} while (false)
-
-//: TEST function, s is message, test to see if p is close to v, tolerance t
-#define TEST_NEAR(s,p,v,t) \
-do { \
- testlib_test_begin(s); \
- testlib_test_assert_near("",p,v,t); \
-} while (false)
-
-//: TEST function, message s, test to see if (p-v)/p is small compared to t
-#define TEST_NEAR_REL(s,p,v,t) \
-do { \
- testlib_test_begin(s); \
- testlib_test_assert_near_relative("",p,v,t); \
-} while (false)
-
-//: TEST function, s is message, test to see if p is far from v, tolerance t
-#define TEST_FAR(s,p,v,t) \
-do { \
- testlib_test_begin(s); \
- testlib_test_assert_far("",p,v,t); \
-} while (false)
-
-//: run x, s is message, then test to see if p==v
-#define TEST_RUN(s,x,p,v) \
-do { \
- testlib_test_begin(s); \
- x; \
- testlib_test_perform((p)==(v)); \
-} while (false)
-
-//: Summarise test
-#define SUMMARY() return testlib_test_summary()
-
-//: Run a singleton test function
-#define RUN_TEST_FUNC(x) \
- testlib_test_start(#x); x(); return testlib_test_summary()
-
-//: Declare the main function.
-#define MAIN( testname ) \
- int testname ## _main(int,char*[])
-
-//: Declare the main function with parameter passing.
-#define MAIN_ARGS( testname ) \
- int testname ## _main(int argc, char* argv[])
-
-//: A simplified version of the main test, just in one line.
-// Avoids compiler warnings about "unused argc and argv".
-#define TESTMAIN( testname ) \
- int testname ## _main(int,char*[]) { START(#testname); testname(); SUMMARY(); }
-
-//: A simplified version of the main test, with parameter passing.
-#undef TESTMAIN_ARGS
-#define TESTMAIN_ARGS( x ) \
- int x ## _main(int argc, char*argv[]) { START(#x); x(argc,argv); SUMMARY(); }
-
-//: Another simplified main test. To be used in a standalone executable.
-#undef TESTLIB_DEFINE_MAIN
-#define TESTLIB_DEFINE_MAIN(x) \
- int main() { START(#x); x(); return testlib_test_summary(); }
-
-//: A simplified main test with parameter passing. To be used in a standalone executable.
-#undef TESTLIB_DEFINE_MAIN_ARGS
-#define TESTLIB_DEFINE_MAIN_ARGS(x) \
- int main(int argc, char * argv[]) { START(#x); x(argc,argv); SUMMARY(); }
-
-#endif // testlib_test_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/tests/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/core/testlib/tests/CMakeLists.txt
deleted file mode 100644
index e18423fcda10fe90b942b25d048c86e9eb23e490..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/tests/CMakeLists.txt
+++ /dev/null
@@ -1,26 +0,0 @@
-# This is core/testlib/tests/CMakeLists.txt
-
-ADD_EXECUTABLE( testlib_test_all
- test_driver.cxx
-
- test_assert.cxx
- test_macros.cxx
- test_args.cxx
- test_root_dir.cxx
-)
-TARGET_LINK_LIBRARIES( testlib_test_all itktestlib )
-
-ADD_EXECUTABLE( testlib_test_link
- test_link.cxx
-)
-TARGET_LINK_LIBRARIES( testlib_test_link itktestlib )
-
-ADD_TEST( testlib_assert ${EXECUTABLE_OUTPUT_PATH}/testlib_test_all test_assert )
-ADD_TEST( testlib_macros ${EXECUTABLE_OUTPUT_PATH}/testlib_test_all test_macros )
-ADD_TEST( testlib_args ${EXECUTABLE_OUTPUT_PATH}/testlib_test_all test_args one two )
-ADD_TEST( testlib_root_dir ${EXECUTABLE_OUTPUT_PATH}/testlib_test_all test_root_dir )
-ADD_TEST( testlib_test_link ${EXECUTABLE_OUTPUT_PATH}/testlib_test_link )
-ADD_TEST( testlib_all ${EXECUTABLE_OUTPUT_PATH}/testlib_test_all all one two )
-
-ADD_EXECUTABLE( testlib_test_include test_include.cxx )
-TARGET_LINK_LIBRARIES( testlib_test_include itktestlib )
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_args.cxx b/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_args.cxx
deleted file mode 100644
index 98b272b97eb1a4f99c335467653a1d98b0e6fc36..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_args.cxx
+++ /dev/null
@@ -1,24 +0,0 @@
-#include <testlib/testlib_test.h>
-
-#include <vcl_string.h>
-
-MAIN_ARGS( test_args )
-{
- START( "argument passing" );
- TEST( "argument count (should be 3)", argc, 3 );
- if ( argc >= 1 )
- {
- testlib_test_begin( "argv[0] should be the test name, or \"all\"" );
- testlib_test_perform( vcl_string("test_args") == argv[0] ||
- vcl_string("all") == argv[0]);
- }
- if ( argc >= 2 )
- {
- TEST( "argv[1] should be \"one\"", vcl_string("one"), argv[1] );
- }
- if ( argc >= 3 )
- {
- TEST( "argv[2] should be \"two\"", vcl_string("two"), argv[2] );
- }
- SUMMARY();
-}
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_assert.cxx b/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_assert.cxx
deleted file mode 100644
index 34d0b1de11f7379e819402bdf4b02203c3f75f05..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_assert.cxx
+++ /dev/null
@@ -1,11 +0,0 @@
-#include <testlib/testlib_test.h>
-
-static void test_assert()
-{
- testlib_test_assert( "Assert:", true );
- testlib_test_assert_near( "Assert near:", 1.2345, 1.2346, 0.001 );
- testlib_test_assert_near_relative("Assert near:", 1.235e20, 1.236e20, 0.001);
- testlib_test_assert_far( "Assert far: ", 1.235, 1.237, 0.001 );
-}
-
-TESTMAIN(test_assert);
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_driver.cxx b/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_driver.cxx
deleted file mode 100644
index cff6fb1ec758c0d5740593106482be6ca9821c06..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_driver.cxx
+++ /dev/null
@@ -1,17 +0,0 @@
-#include <testlib/testlib_register.h>
-
-DECLARE( test_assert );
-DECLARE( test_macros );
-DECLARE( test_args );
-DECLARE( test_root_dir );
-
-void
-register_tests()
-{
- REGISTER( test_assert );
- REGISTER( test_macros );
- REGISTER( test_args );
- REGISTER( test_root_dir );
-}
-
-DEFINE_MAIN;
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_include.cxx b/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_include.cxx
deleted file mode 100644
index 88595cd2b43d09d71a60c2eab70399458d6e1879..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_include.cxx
+++ /dev/null
@@ -1,5 +0,0 @@
-#include <testlib/testlib_register.h>
-#include <testlib/testlib_root_dir.h>
-#include <testlib/testlib_test.h>
-
-int main() { return 0; }
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_link.cxx b/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_link.cxx
deleted file mode 100644
index 46e431fe88d9f4c82db94101e2f91470bf558476..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_link.cxx
+++ /dev/null
@@ -1,9 +0,0 @@
-// This is to make sure that the testlib functionality can be used
-// even if it is not used to create a test driver. That is, we should
-// be able to link against testlib even if we don't register tests or
-// we have a different main() than typical test drivers.
-
-int main()
-{
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_macros.cxx b/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_macros.cxx
deleted file mode 100644
index aff14ee3d036fe3ce1697f825210a65ef6f3f818..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_macros.cxx
+++ /dev/null
@@ -1,18 +0,0 @@
-#include <testlib/testlib_test.h>
-
-static int val = 0;
-
-void
-my_function()
-{
- val = 1;
-}
-
-int
-test_macros_main( int, char*[] )
-{
- START( "macros" );
- TEST( "TEST macro", 5, 5 );
- TEST_RUN( "TEST_RUN macro", my_function(), val, 1 );
- SUMMARY();
-}
diff --git a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_root_dir.cxx b/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_root_dir.cxx
deleted file mode 100644
index 66b012afbe547808f9ad5d108514a03e04e6d5ef..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/testlib/tests/test_root_dir.cxx
+++ /dev/null
@@ -1,27 +0,0 @@
-#include <vcl_iostream.h>
-#include <vcl_fstream.h>
-#include <testlib/testlib_test.h>
-#include <testlib/testlib_root_dir.h>
-
-static void test_root_dir()
-{
- // Check that a file exists
- vcl_string path = testlib_root_dir() + "/core/testlib/testlib_root_dir.h";
-
- vcl_fstream is(path.c_str(),vcl_ios_in);
-
- TEST ("Opening file using testlib_root_dir", !is, false);
-
- if (!is)
- {
- vcl_cerr<<"Unable to open "<<path<<"\ntestlib_root_dir() is probably wrong.\n"
- "Try setting $VXLSRC to the source root directory.\n";
- }
- else
- {
- is.close();
- vcl_cout<<"Root Dir: "<<testlib_root_dir()<<" appears to be correct.\n";
- }
-}
-
-TESTMAIN(test_root_dir);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/core/vnl/CMakeLists.txt
index 7d336d426b67bbcd5bbc6f3ebb1863fbc3f53fef..deb1c8b5d1af293433040bcbf4fecce16191cbe0 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/CMakeLists.txt
@@ -60,7 +60,7 @@ IF(VNL_CONFIG_THREAD_SAFE)
ELSE(VNL_CONFIG_THREAD_SAFE)
SET(VNL_CONFIG_THREAD_SAFE 0)
ENDIF(VNL_CONFIG_THREAD_SAFE)
-IF(VNL_CONFIG_ENABLE_SSE2)
+IF(VNL_CONFIG_ENABLE_SSE2)
SET(VNL_CONFIG_ENABLE_SSE2 1)
ELSE(VNL_CONFIG_ENABLE_SSE2)
SET(VNL_CONFIG_ENABLE_SSE2 0)
@@ -92,6 +92,7 @@ SET( vnl_sources
vnl_matrix_fixed.txx vnl_matrix_fixed.h
vnl_matrix_fixed_ref.txx vnl_matrix_fixed_ref.h
vnl_diag_matrix.txx vnl_diag_matrix.h
+ vnl_diag_matrix_fixed.txx vnl_diag_matrix_fixed.h
vnl_sparse_matrix.txx vnl_sparse_matrix.h
vnl_matrix_exp.txx vnl_matrix_exp.h
vnl_file_matrix.txx vnl_file_matrix.h
@@ -102,6 +103,7 @@ SET( vnl_sources
vnl_det.txx vnl_det.h
vnl_transpose.h
vnl_inverse.h
+ vnl_power.h
vnl_trace.h
vnl_rank.txx vnl_rank.h
vnl_scalar_join_iterator.txx vnl_scalar_join_iterator.h
@@ -110,6 +112,8 @@ SET( vnl_sources
vnl_alloc.cxx vnl_alloc.h
vnl_block.cxx vnl_block.h
vnl_math.cxx vnl_math.h
+ vnl_na.cxx vnl_na.h
+ vnl_c_na_vector.txx vnl_c_na_vector.h
vnl_copy.cxx vnl_copy.h
vnl_complex.h
vnl_error.cxx vnl_error.h
@@ -190,6 +194,7 @@ SET( vnl_sources
vnl_cost_function.cxx vnl_cost_function.h
vnl_least_squares_function.cxx vnl_least_squares_function.h
vnl_least_squares_cost_function.cxx vnl_least_squares_cost_function.h
+ vnl_sparse_lst_sqr_function.cxx vnl_sparse_lst_sqr_function.h
vnl_nonlinear_minimizer.cxx vnl_nonlinear_minimizer.h
vnl_hungarian_algorithm.cxx vnl_hungarian_algorithm.h
@@ -203,10 +208,14 @@ SET( vnl_sources
vnl_cross_product_matrix.h
vnl_identity_3x3.h
+ # indexing of sparse structures
+ vnl_crs_index.cxx vnl_crs_index.h
+
# Special functions
vnl_bessel.cxx vnl_bessel.h
vnl_cross.h
vnl_gamma.cxx vnl_gamma.h
+ vnl_beta.h
vnl_erf.cxx vnl_erf.h
vnl_sample.cxx vnl_sample.h
vnl_unary_function.txx vnl_unary_function.h
@@ -236,13 +245,22 @@ IF(CMAKE_COMPILER_IS_GNUCXX)
SET_SOURCE_FILES_PROPERTIES(Templates/vnl_matrix_fixed+vnl_bignum.3.3-.cxx PROPERTIES COMPILE_FLAGS -O0)
SET_SOURCE_FILES_PROPERTIES(Templates/vnl_vector+vnl_rational-.cxx PROPERTIES COMPILE_FLAGS -O0)
SET_SOURCE_FILES_PROPERTIES(Templates/vnl_vector_fixed+vnl_rational.3-.cxx PROPERTIES COMPILE_FLAGS -O0)
+ # with optimisation, the vnl_na etc functions fail on x86_64:
+ SET_SOURCE_FILES_PROPERTIES(vnl_na.cxx PROPERTIES COMPILE_FLAGS -O1)
+ # gcc must have -msse2 option to enable sse2 support
+ IF(VNL_CONFIG_ENABLE_SSE2)
+ ADD_DEFINITIONS( -msse2 )
+ ENDIF(VNL_CONFIG_ENABLE_SSE2)
+ IF(VNL_CONFIG_ENABLE_SSE2_ROUNDING)
+ ADD_DEFINITIONS( -msse2 )
+ ENDIF(VNL_CONFIG_ENABLE_SSE2_ROUNDING)
ENDIF(CMAKE_COMPILER_IS_GNUCXX)
ADD_LIBRARY(itkvnl ${vnl_sources})
TARGET_LINK_LIBRARIES( itkvnl itkvcl )
IF(NOT VXL_INSTALL_NO_DEVELOPMENT)
- INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_ROOT}/core/vnl ${vnl_sources})
+ INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_INCLUDE_DIR}/vnl ${vnl_sources})
ENDIF(NOT VXL_INSTALL_NO_DEVELOPMENT)
IF(ITK_LIBRARY_PROPERTIES)
@@ -251,13 +269,14 @@ ENDIF(ITK_LIBRARY_PROPERTIES)
IF(NOT VXL_INSTALL_NO_LIBRARIES)
INSTALL(TARGETS itkvnl
- RUNTIME DESTINATION ${VXL_INSTALL_BIN_DIR_CM24} COMPONENT RuntimeLibraries
- LIBRARY DESTINATION ${VXL_INSTALL_LIB_DIR_CM24} COMPONENT RuntimeLibraries
- ARCHIVE DESTINATION ${VXL_INSTALL_LIB_DIR_CM24} COMPONENT Development)
+ EXPORT ${VXL_INSTALL_EXPORT_NAME}
+ RUNTIME DESTINATION ${VXL_INSTALL_RUNTIME_DIR} COMPONENT RuntimeLibraries
+ LIBRARY DESTINATION ${VXL_INSTALL_LIBRARY_DIR} COMPONENT RuntimeLibraries
+ ARCHIVE DESTINATION ${VXL_INSTALL_ARCHIVE_DIR} COMPONENT Development)
ENDIF(NOT VXL_INSTALL_NO_LIBRARIES)
SUBDIRS(algo)
IF( BUILD_TESTING )
- SUBDIRS(tests)
+# SUBDIRS(tests)
ENDIF( BUILD_TESTING )
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_c_na_vector+double-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_c_na_vector+double-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..b8177e5ca2984bde2a3aa9916cbd99480fcbe0b2
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_c_na_vector+double-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/vnl_c_na_vector.txx>
+
+VNL_C_NA_VECTOR_INSTANTIATE_ordered(double);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_c_na_vector+float-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_c_na_vector+float-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..5f66c08fd96bd9a2d8798c6c633cc8caf7de62dd
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_c_na_vector+float-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/vnl_c_na_vector.txx>
+
+VNL_C_NA_VECTOR_INSTANTIATE_ordered(float);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_c_vector+ushort-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_c_vector+ushort-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..c83e8e1c17e35950e742f19ac7b132bf80df5971
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_c_vector+ushort-.cxx
@@ -0,0 +1,4 @@
+#include <vnl/vnl_c_vector.h>
+#include <vnl/vnl_c_vector.txx>
+
+VNL_C_VECTOR_INSTANTIATE_ordered(unsigned short);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+double.3-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+double.3-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..296a7e0a39c12c0317c6e91843bfe2ce28013195
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+double.3-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/vnl_diag_matrix_fixed.txx>
+VNL_DIAG_MATRIX_FIXED_INSTANTIATE(double, 3 );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+double.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+double.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..8638996efb1442dcf48712d38b1ca78093390352
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+double.4-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/vnl_diag_matrix_fixed.txx>
+VNL_DIAG_MATRIX_FIXED_INSTANTIATE(double, 4 );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+float.3-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+float.3-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..bed49fb6d9f38e2720d574afca57a2d8a217730a
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+float.3-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/vnl_diag_matrix_fixed.txx>
+VNL_DIAG_MATRIX_FIXED_INSTANTIATE(float, 3);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+float.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+float.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..f213a514fdc9175d8fa6f2fdf04cece67745ba4e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_diag_matrix_fixed+float.4-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/vnl_diag_matrix_fixed.txx>
+VNL_DIAG_MATRIX_FIXED_INSTANTIATE(float, 4);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_file_matrix+vnl_rational-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_file_matrix+vnl_rational-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..9de2a95465c9ad9226b95005fbb33e37e059feaa
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_file_matrix+vnl_rational-.cxx
@@ -0,0 +1,5 @@
+#include <vnl/vnl_file_matrix.txx>
+#include <vnl/vnl_rational.h>
+#include <vnl/vnl_rational_traits.h>
+
+VNL_FILE_MATRIX_INSTANTIATE(vnl_rational);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+double.3.3-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+double.3.3-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..6a84c2e8cf1bfeed732908993ba87716e69890b1
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+double.3.3-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/vnl_fortran_copy_fixed.txx>
+
+VNL_FORTRAN_COPY_FIXED_INSTANTIATE(double , 3 , 3 );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+double.3.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+double.3.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..902633e3b1d359b452206c7430d45297187b015e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+double.3.4-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/vnl_fortran_copy_fixed.txx>
+
+VNL_FORTRAN_COPY_FIXED_INSTANTIATE(double , 3 , 4 );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+float.3.3-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+float.3.3-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..02c2f2fcb80992925a7f27552fc26e06aef708d2
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+float.3.3-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/vnl_fortran_copy_fixed.txx>
+VNL_FORTRAN_COPY_FIXED_INSTANTIATE(float, 3, 3);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+float.3.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+float.3.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..bab3e92dc93cd3f32e3844bd4a0ee60211b5202b
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_fortran_copy_fixed+float.3.4-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/vnl_fortran_copy_fixed.txx>
+VNL_FORTRAN_COPY_FIXED_INSTANTIATE(float, 3, 4);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix+ushort-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix+ushort-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..26798fd5f1f182ad69b36cc03511f763d296def9
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix+ushort-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/vnl_matrix.txx>
+
+VNL_MATRIX_INSTANTIATE(unsigned short);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+double-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+double-.cxx
deleted file mode 100644
index dab528f5d2a35f504b65f944ea2ce6a2521044f2..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+double-.cxx
+++ /dev/null
@@ -1,4 +0,0 @@
-#include <vnl/vnl_matrix_exp.txx>
-
-VNL_MATRIX_EXP_INSTANTIATE(double);
-
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix+double--.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix+double--.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..f8f46c6fb1f81530e31b580106ac57771c9fa831
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix+double--.cxx
@@ -0,0 +1,6 @@
+#include <vnl/vnl_matrix_exp.txx>
+#include <vnl/vnl_matrix.h>
+
+typedef vnl_matrix<double> T;
+VNL_MATRIX_EXP_INSTANTIATE( T );
+
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.1.1--.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.1.1--.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..7981bb8e4be0137617d908e2b7af0ecd74c1fdca
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.1.1--.cxx
@@ -0,0 +1,5 @@
+#include <vnl/vnl_matrix_exp.txx>
+#include <vnl/vnl_matrix_fixed.h>
+
+typedef vnl_matrix_fixed<double,1,1> T;
+VNL_MATRIX_EXP_INSTANTIATE( T );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.2.2--.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.2.2--.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..a1ac03e9c19737ad4b10891c13686f44325023d5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.2.2--.cxx
@@ -0,0 +1,5 @@
+#include <vnl/vnl_matrix_exp.txx>
+#include <vnl/vnl_matrix_fixed.h>
+
+typedef vnl_matrix_fixed<double,2,2> T;
+VNL_MATRIX_EXP_INSTANTIATE( T );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.3.3--.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.3.3--.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..3f805392984204a20c14aed6b5c30405736c0a15
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.3.3--.cxx
@@ -0,0 +1,5 @@
+#include <vnl/vnl_matrix_exp.txx>
+#include <vnl/vnl_matrix_fixed.h>
+
+typedef vnl_matrix_fixed<double,3,3> T;
+VNL_MATRIX_EXP_INSTANTIATE( T );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.4.4--.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.4.4--.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..fe9d18c094c8014b5c1f410967f18f191005c200
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_exp+vnl_matrix_fixed+double.4.4--.cxx
@@ -0,0 +1,5 @@
+#include <vnl/vnl_matrix_exp.txx>
+#include <vnl/vnl_matrix_fixed.h>
+
+typedef vnl_matrix_fixed<double,4,4> T;
+VNL_MATRIX_EXP_INSTANTIATE( T );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_fixed+float.4.20-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_fixed+float.4.20-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..8853dbcbbe6390ddf41ca5749df848aa0ca36a9d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_fixed+float.4.20-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/vnl_matrix_fixed.txx>
+VNL_MATRIX_FIXED_INSTANTIATE(float,4,20);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_fixed+vnl_rational.4.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_fixed+vnl_rational.4.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..a10956e05d3700d01466d4316567aae67d671ee3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_matrix_fixed+vnl_rational.4.4-.cxx
@@ -0,0 +1,4 @@
+#include <vnl/vnl_matrix_fixed.txx>
+#include <vnl/vnl_rational.h>
+#include <vnl/vnl_rational_traits.h>
+VNL_MATRIX_FIXED_INSTANTIATE(vnl_rational,4,4);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_quaternion+vnl_rational-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_quaternion+vnl_rational-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..ff1359f05ab09b6d7fca94926d78dd0ddbb9d168
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_quaternion+vnl_rational-.cxx
@@ -0,0 +1,5 @@
+#include <vnl/vnl_quaternion.txx>
+#include <vnl/vnl_rational.h>
+#include <vnl/vnl_rational_traits.h>
+
+VNL_QUATERNION_INSTANTIATE(vnl_rational);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+double-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+double-.cxx
index e5882ef177c5a6e4ca9eaac5c1ed56ee8658556f..6c701eed750f5852cc17357583bc8078bbccec70 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+double-.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+double-.cxx
@@ -2,9 +2,14 @@
template class vnl_sparse_matrix<double>;
+#if 0 // Clang compiler give a warning about unused variable.
+// I'm not sure if the tickler is needed any more?
+// This seems to ba a trade off between warning messages
+// of different compilers.
static double vnl_sparse_matrix_double_tickler()
{
vnl_sparse_matrix<double> md(3, 5);
vnl_sparse_matrix_double_tickler(); // to avoid compiler warning
return md(0,0);
}
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+int-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+int-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..e089465db15fe77b97d1d704e682bda07604d749
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+int-.cxx
@@ -0,0 +1,10 @@
+#include <vnl/vnl_sparse_matrix.txx>
+
+template class vnl_sparse_matrix<int>;
+
+static int vnl_sparse_matrix_float_tickler()
+{
+ vnl_sparse_matrix<int> md(3, 5);
+ vnl_sparse_matrix_float_tickler(); // to avoid compiler warning
+ return md(0,0);
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+vcl_complex+double--.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+vcl_complex+double--.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..66b4d90d88b18e040c9f26d1d5e4f5314ecba6ab
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+vcl_complex+double--.cxx
@@ -0,0 +1,10 @@
+#if (defined _MSC_VER) && _MSC_VER == 1200
+// disable warning buried deep in the standard library
+// warning C4018: '<' : signed/unsigned mismatch: vector(159)
+# pragma warning(disable: 4018)
+#endif
+
+#include <vnl/vnl_complex.h>
+#include <vnl/vnl_sparse_matrix.txx>
+
+VNL_SPARSE_MATRIX_INSTANTIATE(vcl_complex<double>);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+vcl_complex+float--.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+vcl_complex+float--.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..0f80fc8d81530e00bcf7cfa855bffbfb1c0ee3ae
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+vcl_complex+float--.cxx
@@ -0,0 +1,10 @@
+#if (defined _MSC_VER) && _MSC_VER == 1200
+// disable warning buried deep in the standard library
+// warning C4018: '<' : signed/unsigned mismatch: vector(159)
+# pragma warning(disable: 4018)
+#endif
+
+#include <vnl/vnl_complex.h>
+#include <vnl/vnl_sparse_matrix.txx>
+
+VNL_SPARSE_MATRIX_INSTANTIATE(vcl_complex<float>);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+vnl_rational-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+vnl_rational-.cxx
index dfb41ec517f006be4d973deef8339f95eacb98b6..b910c6529239ef9ff67fc838c7a0b641be874324 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+vnl_rational-.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sparse_matrix+vnl_rational-.cxx
@@ -4,9 +4,14 @@
template class vnl_sparse_matrix<vnl_rational>;
+#if 0 // Clang compiler give a warning about unused variable.
+// I'm not sure if the tickler is needed any more?
+// This seems to ba a trade off between warning messages
+// of different compilers.
static vnl_rational vnl_sparse_matrix_vnl_rational_tickler()
{
vnl_sparse_matrix<vnl_rational> md(3, 5);
vnl_sparse_matrix_vnl_rational_tickler(); // to avoid compiler warning
return md(0,0);
}
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sym_matrix+float-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sym_matrix+float-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..cf2ee7eeb32ad6463730fee46605062919685ad5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_sym_matrix+float-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/vnl_sym_matrix.txx>
+VNL_SYM_MATRIX_INSTANTIATE(float);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector+ushort-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector+ushort-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..368a96b5f82175e3547976badc41e6cebe7b0725
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector+ushort-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/vnl_vector.txx>
+
+VNL_VECTOR_INSTANTIATE(unsigned short);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+double.10-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+double.10-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..748d2d8e8f33dea383dc7342e297d4a4d69b0750
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+double.10-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/vnl_vector_fixed.txx>
+
+VNL_VECTOR_FIXED_INSTANTIATE(double,10);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+float.16-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+float.16-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..c35dd4ef62177e3483bbe6c5f0f59ed0dfd003ab
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+float.16-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/vnl_vector_fixed.txx>
+VNL_VECTOR_FIXED_INSTANTIATE(float,16);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+uchar.16-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+uchar.16-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..be98d67742a5acabe9d65aff81f0fabf16b7ecb3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+uchar.16-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/vnl_vector_fixed.txx>
+
+VNL_VECTOR_FIXED_INSTANTIATE(unsigned char,16);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+ushort.2-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+ushort.2-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..fe00f6b38d8ff20e02083016dc930f6bdffc2331
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+ushort.2-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/vnl_vector_fixed.txx>
+
+VNL_VECTOR_FIXED_INSTANTIATE(unsigned short,2);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+vnl_rational.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+vnl_rational.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..751c4bef4dd19a39e81eae4c7cbd2f4b2d12903f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/Templates/vnl_vector_fixed+vnl_rational.4-.cxx
@@ -0,0 +1,5 @@
+#include <vnl/vnl_rational.h>
+#include <vnl/vnl_rational_traits.h>
+#include <vnl/vnl_vector_fixed.txx>
+VNL_VECTOR_FIXED_INSTANTIATE(vnl_rational,4);
+
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/core/vnl/algo/CMakeLists.txt
index 329f3cdc90f027f6a3e8b22e75ed0e6834180047..26575173baae42969da795e7a7d303a535caaf8d 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/CMakeLists.txt
@@ -1,5 +1,8 @@
# vxl/vnl/algo/CMakeLists.txt
+PROJECT(vnl_algo)
+
+
INCLUDE( ${MODULE_PATH}/FindNetlib.cmake )
# most of vnl_algo is simply a wrapper around netlib, so we must have netlib.
@@ -10,6 +13,7 @@ IF(NETLIB_FOUND)
# vnl_cholesky dpoco_ dpodi_ dpofa_ dposl_
# vnl_ldl_cholesky dpoco_ dpodi_ dpofa_ dposl_
# vnl_complex_eigensystem zgeev_
+# vnl_complex_generalized_schur zgges_
# vnl_conjugate_gradient cg_
# vnl_fft dgpfa_ dsetgpfa_ gpfa_ setgpfa_
# vnl_generalized_eigensystem rsg_
@@ -24,6 +28,7 @@ IF(NETLIB_FOUND)
# vnl_sparse_symmetric_eigensystem dnlaso_
# vnl_svd csvdc_ dsvdc_ ssvdc_ zsvdc_
# vnl_svd_economy csvdc_ dsvdc_ ssvdc_ zsvdc_
+# vnl_svd_fixed csvdc_ dsvdc_ ssvdc_ zsvdc_
# vnl_symmetric_eigensystem rs_
INCLUDE_DIRECTORIES(
@@ -32,12 +37,15 @@ IF(NETLIB_FOUND)
)
SET( vnl_algo_sources
+ dll.h
+
vnl_algo_fwd.h
vnl_netlib.h
# matrix decompositions
vnl_svd.txx vnl_svd.h
vnl_svd_economy.txx vnl_svd_economy.h
+ vnl_svd_fixed.txx vnl_svd_fixed.h
vnl_matrix_inverse.txx vnl_matrix_inverse.h
vnl_qr.txx vnl_qr.h
vnl_scatter_3x3.txx vnl_scatter_3x3.h
@@ -46,14 +54,16 @@ IF(NETLIB_FOUND)
vnl_sparse_lu.cxx vnl_sparse_lu.h
vnl_real_eigensystem.cxx vnl_real_eigensystem.h
vnl_complex_eigensystem.cxx vnl_complex_eigensystem.h
- vnl_symmetric_eigensystem.cxx vnl_symmetric_eigensystem.h
+ vnl_symmetric_eigensystem.txx vnl_symmetric_eigensystem.h
vnl_generalized_eigensystem.cxx vnl_generalized_eigensystem.h
vnl_sparse_symmetric_eigensystem.cxx vnl_sparse_symmetric_eigensystem.h
vnl_generalized_schur.cxx vnl_generalized_schur.h
+ vnl_complex_generalized_schur.cxx vnl_complex_generalized_schur.h
# optimisation
vnl_discrete_diff.cxx vnl_discrete_diff.h
vnl_levenberg_marquardt.cxx vnl_levenberg_marquardt.h
+ vnl_sparse_lm.cxx vnl_sparse_lm.h
vnl_conjugate_gradient.cxx vnl_conjugate_gradient.h
vnl_lbfgs.cxx vnl_lbfgs.h
vnl_lbfgsb.cxx vnl_lbfgsb.h
@@ -80,7 +90,7 @@ IF(NETLIB_FOUND)
# stuff
vnl_convolve.txx vnl_convolve.h
vnl_determinant.cxx vnl_determinant.txx vnl_determinant.h
- vnl_chi_squared.cxx vnl_chi_squared.h
+ vnl_chi_squared.txx vnl_chi_squared.h
vnl_gaussian_kernel_1d.cxx vnl_gaussian_kernel_1d.h
vnl_adjugate.txx vnl_adjugate.h
vnl_orthogonal_complement.txx vnl_orthogonal_complement.h
@@ -101,16 +111,17 @@ IF(NETLIB_FOUND)
IF(NOT VXL_INSTALL_NO_LIBRARIES)
INSTALL(TARGETS itkvnl_algo
- RUNTIME DESTINATION ${VXL_INSTALL_BIN_DIR_CM24} COMPONENT RuntimeLibraries
- LIBRARY DESTINATION ${VXL_INSTALL_LIB_DIR_CM24} COMPONENT RuntimeLibraries
- ARCHIVE DESTINATION ${VXL_INSTALL_LIB_DIR_CM24} COMPONENT Development)
+ EXPORT ${VXL_INSTALL_EXPORT_NAME}
+ RUNTIME DESTINATION ${VXL_INSTALL_RUNTIME_DIR} COMPONENT RuntimeLibraries
+ LIBRARY DESTINATION ${VXL_INSTALL_LIBRARY_DIR} COMPONENT RuntimeLibraries
+ ARCHIVE DESTINATION ${VXL_INSTALL_ARCHIVE_DIR} COMPONENT Development)
ENDIF(NOT VXL_INSTALL_NO_LIBRARIES)
IF(NOT VXL_INSTALL_NO_DEVELOPMENT)
- INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_ROOT}/core/vnl/algo ${vnl_algo_sources})
+ INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_INCLUDE_DIR}/vnl/algo ${vnl_algo_sources})
ENDIF(NOT VXL_INSTALL_NO_DEVELOPMENT)
IF( BUILD_TESTING )
- SUBDIRS(tests)
+# SUBDIRS(tests)
ENDIF( BUILD_TESTING )
ENDIF(NETLIB_FOUND)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_adjugate+float-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_adjugate+float-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..335fdeb1dd86f971afae6ebf62944206aeeb1586
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_adjugate+float-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_adjugate.txx>
+VNL_ADJUGATE_INSTANTIATE(float);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_chi_squared+double-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_chi_squared+double-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..f0182f931214ff9406d31c47ddb57fa41f22927a
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_chi_squared+double-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_chi_squared.txx>
+VNL_CHI_SQUARED_INSTANTIATE(double);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_chi_squared+float-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_chi_squared+float-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..570fcacab104311732071412b84215225afb1b77
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_chi_squared+float-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_chi_squared.txx>
+VNL_CHI_SQUARED_INSTANTIATE(float);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_chi_squared+int-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_chi_squared+int-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..d850408a6876a17b3c97e0059b2bf0f8e52f0abb
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_chi_squared+int-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_chi_squared.txx>
+VNL_CHI_SQUARED_INSTANTIATE(int);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_convolve+float.float-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_convolve+float.float-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..df823d4d55d94fbb20f69235c2ff238f9acd5a56
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_convolve+float.float-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_convolve.txx>
+VNL_CONVOLVE_INSTANTIATE(float, float);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_convolve+int.float-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_convolve+int.float-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..95398ff25daf8d1b2f19a42a1572c0c48ae5389f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_convolve+int.float-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_convolve.txx>
+VNL_CONVOLVE_INSTANTIATE_2(int, float);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_matrix_inverse+float-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_matrix_inverse+float-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..0e721d592ae69fde613b62e7692f4dd7b2514bde
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_matrix_inverse+float-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/algo/vnl_matrix_inverse.h>
+#include <vnl/algo/vnl_matrix_inverse.txx>
+VNL_MATRIX_INVERSE_INSTANTIATE(float);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_orthogonal_complement+float-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_orthogonal_complement+float-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..688f5116c1ab52dd97043ee7a7ccec2ddcfe5972
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_orthogonal_complement+float-.cxx
@@ -0,0 +1,3 @@
+#include <vnl/algo/vnl_orthogonal_complement.txx>
+VNL_ORTHOGONAL_COMPLEMENT_INSTANTIATE(float);
+
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+double.3.3-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+double.3.3-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..7914e58d61c376ee180933d8f181dc23d54a94e5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+double.3.3-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_svd_fixed.txx>
+VNL_SVD_FIXED_INSTANTIATE(double, 3, 3);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+double.3.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+double.3.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..dab8d741c147c96899c2b6625e8d5cb21820f4cd
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+double.3.4-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_svd_fixed.txx>
+VNL_SVD_FIXED_INSTANTIATE(double, 3, 4);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+float.3.3-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+float.3.3-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..6fa986d72058b31c38516f309813eb15eeb350b3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+float.3.3-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_svd_fixed.txx>
+VNL_SVD_FIXED_INSTANTIATE(float, 3, 3);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+float.3.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+float.3.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..eed5b7217dc74ecad5f70a58e04bfa0a6b70d45d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_svd_fixed+float.3.4-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_svd_fixed.txx>
+VNL_SVD_FIXED_INSTANTIATE(float, 3, 4);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_symmetric_eigensystem+double-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_symmetric_eigensystem+double-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..a6d3126d172e6a088280918b0f48bac8de2c2c30
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_symmetric_eigensystem+double-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_symmetric_eigensystem.txx>
+VNL_SYMMETRIC_EIGENSYSTEM_INSTANTIATE(double);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_symmetric_eigensystem+float-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_symmetric_eigensystem+float-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..abe6657e7b0106719ca100cfb60cfd96914c1e6e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/Templates/vnl_symmetric_eigensystem+float-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/algo/vnl_symmetric_eigensystem.txx>
+VNL_SYMMETRIC_EIGENSYSTEM_INSTANTIATE(float);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/dll.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/dll.h
index de13b4e65838895762513c6ec32c14cd15cc0efa..ab3c4bf218e450a2c1c8df7dfa2cfed7d294b601 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/dll.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/dll.h
@@ -6,7 +6,7 @@
#define VNL_ALGO_DLL_DATA
#if defined(VCL_WIN32) && !defined(BUILDING_VNL_ALGO_DLL)
-// if win32 and not buiding the DLL then you need a dllimport
+// if win32 and not building the DLL then you need a dllimport
// Only if you are building a DLL linked application.
# ifdef BUILD_DLL
# undef VNL_ALGO_DLL_DATA
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/CMakeLists.txt
deleted file mode 100644
index 2c04f00201f2724595f59ea82543f742fa0eb9b2..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/CMakeLists.txt
+++ /dev/null
@@ -1,113 +0,0 @@
-# This is core/vnl/algo/tests/CMakeLists.txt
-
-INCLUDE( ${MODULE_PATH}/FindNetlib.cmake )
-
-# MESSAGE( NETLIB_FOUND " is " ${NETLIB_FOUND} )
-IF(NETLIB_FOUND)
-
- INCLUDE_DIRECTORIES( ${NETLIB_INCLUDE_DIR} )
-
- ADD_EXECUTABLE( vnl_algo_test_all
- # Driver source and utilities
- test_driver.cxx
- test_util.cxx test_util.h
-
- # The tests
- test_algo.cxx
- test_amoeba.cxx
- test_cholesky.cxx
- test_complex_eigensystem.cxx
- #test_convolve.cxx # Removing for ITK: needs vul
- test_cpoly_roots.cxx
- test_determinant.cxx
- test_fft.cxx
- test_fft1d.cxx
- test_fft2d.cxx
- test_functions.cxx
- test_generalized_eigensystem.cxx
- test_ldl_cholesky.cxx
- test_levenberg_marquardt.cxx
- test_matrix_update.cxx
- test_minimizers.cxx
- test_powell.cxx
- test_qr.cxx
- test_qsvd.cxx
- test_rank.cxx
- test_real_eigensystem.cxx
- test_rnpoly_roots.cxx
- test_sparse_matrix.cxx
- test_svd.cxx
- #test_symmetric_eigensystem.cxx # Removing for ITK: needs vul
- test_integral.cxx
- test_solve_qp.cxx
- test_sparse_lu.cxx
- test_bracket_minimum.cxx
- test_brent_minimizer.cxx
- )
-
-
- TARGET_LINK_LIBRARIES( vnl_algo_test_all itkvnl_algo itktestlib ${CMAKE_THREAD_LIBS} )
-
-
- ADD_TEST( vnl_test_algo ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_algo )
- ADD_TEST( vnl_test_amoeba ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_amoeba )
- ADD_TEST( vnl_test_cholesky ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_cholesky )
- ADD_TEST( vnl_test_complex_eigensystem ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_complex_eigensystem )
- #ADD_TEST( vnl_test_convolve ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_convolve )
- ADD_TEST( vnl_test_cpoly_roots ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_cpoly_roots )
- ADD_TEST( vnl_test_determinant ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_determinant )
- ADD_TEST( vnl_test_fft ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_fft )
- ADD_TEST( vnl_test_fft1d ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_fft1d )
- ADD_TEST( vnl_test_fft2d ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_fft2d )
- ADD_TEST( vnl_test_functions ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_functions )
- ADD_TEST( vnl_test_generalized_eigensystem ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_generalized_eigensystem )
- ADD_TEST( vnl_test_ldl_cholesky ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_ldl_cholesky )
- ADD_TEST( vnl_test_levenberg_marquardt ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_levenberg_marquardt )
- ADD_TEST( vnl_test_matrix_update ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_matrix_update )
- ADD_TEST( vnl_test_minimizers ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_minimizers )
- ADD_TEST( vnl_test_powell ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_powell )
- ADD_TEST( vnl_test_qr ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_qr )
- ADD_TEST( vnl_test_qsvd ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_qsvd )
- ADD_TEST( vnl_test_rank ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_rank )
- ADD_TEST( vnl_test_real_eigensystem ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_real_eigensystem )
- ADD_TEST( vnl_test_rnpoly_roots ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_rnpoly_roots )
- ADD_TEST( vnl_test_integral ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_integral )
- ADD_TEST( vnl_test_solve_qp ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_solve_qp )
- ADD_TEST( vnl_test_sparse_lu ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_sparse_lu )
- ADD_TEST( vnl_test_bracket_minimum ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_bracket_minimum )
- ADD_TEST( vnl_test_brent_minimizer ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_brent_minimizer )
-
- IF ( SITE MATCHES "isbe.man.ac.uk" )
- # For some reason my box (linux-gcc-3.2) has a problem with the optimisation
- # settings for dnlaso.c in netlib. It cannot be fixed until > CMAKE 1.8.3
- ELSE ( SITE MATCHES "isbe.man.ac.uk" )
- ADD_TEST( vnl_test_sparse_matrix ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_sparse_matrix )
- ENDIF ( SITE MATCHES "isbe.man.ac.uk" )
- ADD_TEST( vnl_test_svd ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_svd )
- #ADD_TEST( vnl_test_symmetric_eigensystem ${EXECUTABLE_OUTPUT_PATH}/vnl_algo_test_all test_symmetric_eigensystem )
-ENDIF(NETLIB_FOUND)
-
-# GCC 2.95 has problems when compiling test_algo.cxx with "-O2" flag.
-# The solution is to turn off optimization for GCC < 3.0
-IF(CMAKE_COMPILER_IS_GNUCXX)
- IF ( VNL_COMPILER_IS_GNUCXX_2XX MATCHES "VNL_COMPILER_IS_GNUCXX_2XX")
- EXEC_PROGRAM(${CMAKE_CXX_COMPILER} ARGS --version OUTPUT_VARIABLE CMAKE_CXX_COMPILER_VERSION)
- IF(CMAKE_CXX_COMPILER_VERSION MATCHES ".*2\\.9[0-9]\\.[0-9].*")
- SET ( VNL_COMPILER_IS_GNUCXX_2XX 1 CACHE INTERNAL "Are we using an version of gcc < 3.0")
- ELSE(CMAKE_CXX_COMPILER_VERSION MATCHES ".*2\\.9[0-9]\\.[0-9].*")
- SET ( VNL_COMPILER_IS_GNUCXX_2XX 0 CACHE INTERNAL "Are we using an version of gcc < 3.0")
- ENDIF(CMAKE_CXX_COMPILER_VERSION MATCHES ".*2\\.9[0-9]\\.[0-9].*")
- ENDIF ( VNL_COMPILER_IS_GNUCXX_2XX MATCHES "VNL_COMPILER_IS_GNUCXX_2XX")
-
- IF(VNL_COMPILER_IS_GNUCXX_2XX)
- # We only need to remove "-O2" flag from test_algo.cxx.
- # But it is much easier to do it for all
- FOREACH(var CMAKE_CXX_FLAGS CMAKE_CXX_FLAGS_RELEASE CMAKE_CXX_FLAGS_DEBUG
- CMAKE_CXX_FLAGS_RELWITHDEBINFO CMAKE_CXX_FLAGS_MINSIZEREL)
- STRING(REGEX REPLACE "-O2" "" "${var}" "${${var}}")
- ENDFOREACH(var)
- ENDIF(VNL_COMPILER_IS_GNUCXX_2XX)
-ENDIF ( CMAKE_COMPILER_IS_GNUCXX )
-
-ADD_EXECUTABLE( vnl_algo_test_include test_include.cxx )
-TARGET_LINK_LIBRARIES( vnl_algo_test_include itkvnl_algo )
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_algo.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_algo.cxx
deleted file mode 100644
index f26fc5ec75c62f9ad31f0ab3eb8dff533a951b8e..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_algo.cxx
+++ /dev/null
@@ -1,180 +0,0 @@
-// This is core/vnl/algo/tests/test_algo.cxx
-
-//:
-// \file
-// \brief test miscellaneous classes and functions in vnl/algo.
-// This file contains short tests for several algorithms in vnl/algo
-// that are not tested more extensively in separate test files.
-// Currently, the following classes or functions are tested here:
-// - vnl_adjugate
-// - vnl_svd_economy
-// - vnl_matrix_inverse
-// - vnl_fft_1d
-// - vnl_fft_2d
-// - vnl_orthogonal_complement
-// - vnl_conjugate_gradient
-// - vnl_lbfgs
-// - vnl_powell
-// - vnl_lsqr
-// - vnl_discrete_diff_fwd
-// - vnl_discrete_diff_sym
-// - vnl_generalized_schur
-//
-// \author Peter Vanroose, KULeuven/ESAT.
-// \date 20 September 2003
-
-#include <vcl_complex.h>
-#include <vcl_iostream.h>
-#include <testlib/testlib_test.h>
-
-#include <vnl/algo/vnl_adjugate.h>
-#include <vnl/algo/vnl_conjugate_gradient.h>
-#include <vnl/algo/vnl_discrete_diff.h>
-#include <vnl/algo/vnl_fft_1d.h>
-#include <vnl/algo/vnl_fft_2d.h>
-#include <vnl/algo/vnl_generalized_schur.h>
-#include <vnl/algo/vnl_lbfgs.h>
-#include <vnl/algo/vnl_lbfgsb.h>
-#include <vnl/algo/vnl_lsqr.h>
-#include <vnl/algo/vnl_matrix_inverse.h>
-#include <vnl/algo/vnl_orthogonal_complement.h>
-#include <vnl/algo/vnl_powell.h>
-#include <vnl/algo/vnl_svd_economy.h>
-#include <vnl/algo/vnl_svd.h>
-#include <vnl/vnl_sparse_matrix_linear_system.h>
-#include <vnl/vnl_least_squares_function.h>
-
-static void test_adjugate()
-{
- int data[] = { 1, -1, 1, -1, 1, 1, -1, -1, 1, 1, 1, 1, 1, -1, -1, 1 };
- vnl_matrix<int> m(data,4,4);
- vnl_matrix<int> m_adj = vnl_adjugate(m);
- vnl_matrix<int> identity(4,4); identity.set_identity();
- TEST("vnl_adjugate", (m*m_adj-16*identity).array_inf_norm(), 0);
-}
-
-static void test_matrix_inverse()
-{
- double data[] = {1.,-1.,1.,-1., 1.,1.,-1.,-1., 1.,1.,1.,1., 1.,-1.,-1.,1.};
- vnl_matrix<double> m(data,4,4);
- vnl_svd_economy<double> svde(m); vnl_matrix<double> V = svde.V();
- vnl_svd<double> svd(m); vnl_matrix<double> V0 = svd.V();
- TEST_NEAR("vnl_svd_economy", V[0][1], V0[0][1], 1e-6);
-
- vnl_matrix<double> inv = vnl_matrix_inverse<double>(m);
- vnl_matrix<double> identity(4,4); identity.set_identity();
- TEST_NEAR("vnl_matrix_inverse", (m*inv-identity).array_inf_norm(), 0, 1e-6);
-}
-
-static void test_fft()
-{
- vcl_vector<vcl_complex<double> > v(256); for (int i=0; i<256; ++i) v[i]=0.5+i;
- vnl_fft_1d<double> fft1d(256); fft1d.fwd_transform(v); fft1d.bwd_transform(v);
- TEST_NEAR("vnl_fft_1d", v[10], 256*10.5, 1e-6);
- vnl_matrix<vcl_complex<double> > m(10,9);
- for (int i=0; i<10; ++i) for (int j=0; j<9; ++j) m[i][j]=0.5+i+j;
- vnl_fft_2d<double> fft2d(10,9); fft2d.fwd_transform(m); fft2d.bwd_transform(m);
- TEST_NEAR("vnl_fft_2d", m[5][5], 10*9*10.5, 1e-6);
-}
-
-static void test_orthogonal_complement()
-{
- vnl_vector<double> v(20); for (int i=0; i<20; ++i) v[i]=0.5+i;
- vnl_matrix<double> oc = vnl_orthogonal_complement(v);
- TEST("vnl_orthogonal_complement", oc[0][0]<0 && oc[0][1]==0 && oc[1][0]>0, true);
-}
-
-class F_test_powell : public vnl_cost_function
-{
-public:
- // Local min near (0,0) is at (1,1) and has value 1.
- F_test_powell() : vnl_cost_function(2) {}
- double f(vnl_vector<double> const& x)
- { double u=x[0]-x[1]*x[1], v=x[1]-1; return u*u+v*v+1; }
- void gradf(vnl_vector<double> const& x, vnl_vector<double>& g)
- { g[0]=2*x[0]-2*x[1]*x[1]; g[1]=4*x[1]*x[1]*x[1]-4*x[0]*x[1]+2*x[1]-2; }
-};
-
-static void test_powell()
-{
- F_test_powell f; // local minimum is 1 in (1,1).
- vnl_vector<double> x(2); x[0]=x[1]=0.0;
- vnl_conjugate_gradient cg(f); cg.minimize(x);
- TEST_NEAR("vnl_conjugate_gradient", x[0], 1.0, 1e-5);
-
- vnl_lbfgs lbfgs(f); x[0]=x[1]=0.0; lbfgs.minimize(x);
- TEST_NEAR("vnl_lbfgs", x[1], 1.0, 1e-6);
-
- {
- // Local min near (0,0) with (x,y) bounded to [-0.5,+0.5] is
- // at (0.25, 0.5) with value 1.25.
- vnl_lbfgsb lbfgsb(f); x[0]=x[1]=0.0;
- vnl_vector<double> l(2); l[0] = -0.5; l[1] = -0.5;
- vnl_vector<double> u(2); u[0] = +0.5; u[1] = +0.5;
- vnl_vector<long> nbd(2); nbd[0] = 3; nbd[1] = 3;
- lbfgsb.set_lower_bound(l);
- lbfgsb.set_upper_bound(u);
- lbfgsb.set_bound_selection(nbd);
- lbfgsb.minimize(x);
- TEST_NEAR("vnl_lbfgsb", x[0], 0.25, 1e-6);
- }
-
- vnl_powell powell(&f); x[0]=x[1]=0.0; powell.minimize(x);
- TEST_NEAR("vnl_powell", f.f(x), 1.0, 1e-6);
-}
-
-static void test_lsqr()
-{
- vnl_sparse_matrix<double> A(2,2); vnl_vector<double> b(2);
- A(0,0)=2; A(0,1)=3; A(1,0)=4; A(1,1)=5; b[0]=5; b[1]=9;
- vnl_sparse_matrix_linear_system<double> ls(A,b);
- vnl_vector<double> x(2); x[0]=x[1]=0.0;
- vnl_lsqr lsqr(ls); lsqr.minimize(x);
- TEST_NEAR("vnl_lsqr", x[1], 1.0, 1e-6);
-}
-
-class F_test_discrete_diff : public vnl_least_squares_function
- {
- public:
- F_test_discrete_diff(): vnl_least_squares_function(2, 2, no_gradient) {}
- void f(vnl_vector<double> const& x, vnl_vector<double>& fx) { fx[0]=x[0]-x[1]*x[1]; fx[1]=x[1]-1; }
- };
-
-
-static void test_discrete_diff()
-{
- F_test_discrete_diff f;
- double h = 0.1;
- vnl_vector<double> x(2); x[0]=5.0; x[1]=9.0;
- vnl_matrix<double> J(2,2);
- vnl_discrete_diff_fwd(&f, h, x, J);
- TEST_NEAR("vnl_discrete_diff_fwd", J(0,1), -18.1, 1e-6);
- vnl_discrete_diff_sym(&f, h, x, J);
- TEST_NEAR("vnl_discrete_diff_sym", J(0,1), -18, 1e-6);
-}
-
-static void test_generalized_schur()
-{
- vnl_matrix<float> A(4,4,0.0), B(4,4,0.0), L(4,4,1.0), R(4,4,1.0);
- vnl_vector<float> ar(4,0.0), ai(4,0.0), b(4,0.0);
- vnl_generalized_schur(&A, &B, &ar, &ai, &b, &L, &R);
- TEST("vnl_generalized_schur", true, true);
-}
-
-void test_algo()
-{
- test_adjugate();
- test_matrix_inverse();
- test_fft();
- test_orthogonal_complement();
-#if NUMERICAL_RECIPES_CODE_HAS_BEEN_REMOVED
- test_powell();
-#else
- vcl_cout<<"test_powell has been removed until Numerical Recipes code is removed."<<vcl_endl;
-#endif
- test_lsqr();
- test_discrete_diff();
- test_generalized_schur();
-}
-
-TESTMAIN(test_algo);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_amoeba.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_amoeba.cxx
deleted file mode 100644
index 4f68a085af1899ce552235881faea37a1be5b0d3..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_amoeba.cxx
+++ /dev/null
@@ -1,85 +0,0 @@
-#include <vcl_iostream.h>
-#include <vcl_cassert.h>
-#include <vcl_cmath.h>
-
-#include <vnl/vnl_vector.h>
-#include <vnl/algo/vnl_amoeba.h>
-#include <vnl/vnl_cost_function.h>
-
-#include <testlib/testlib_test.h>
-
-struct testlib_test_amoeba_cubic : public vnl_cost_function {
- testlib_test_amoeba_cubic() : vnl_cost_function(1) {}
-
- double f(const vnl_vector<double>& x) {
- return (2 - x[0]) * (2 - x[0]) + 10;
- }
-};
-
-struct testlib_test_amoeba_cost1 : public vnl_cost_function {
- testlib_test_amoeba_cost1(int n) : vnl_cost_function(n) {}
-
- double f(const vnl_vector<double>& x) {
- assert((int)x.size()==dim);
- double sum=0;
- for (unsigned int i=0;i<x.size();++i) sum+=(x[i]-i)*(x[i]-i);
- return sum;
- }
-};
-
-void test_amoeba()
-{
- vcl_cout<<" ================== test_amoeba ===============\n"
-
- <<"Testing on 1D cubic\n";
- testlib_test_amoeba_cubic c;
- vnl_amoeba amoeba1(c);
- vnl_vector<double> x(1);
- x[0]=77;
- vcl_cout << "amoeba1: ";
- amoeba1.minimize(x);
- TEST_NEAR("amoeba1", x[0], 2, 1e-5);
-
- // Test a quadratic cost function for a varying number of dimensions
- for (unsigned n=1; n<=4; ++n)
- {
- vcl_cout << "-------------------------------\n"
- << "Testing on "<<n<<"-D quadratic\n";
- x.set_size(n);
- x.fill(1);
- testlib_test_amoeba_cost1 cost1(n);
- vnl_amoeba amoeba2(cost1);
- amoeba2.minimize(x);
-
- double err=0;
- for (unsigned int i=0; i<n; ++i) err+=vcl_fabs(x[i]-i);
- TEST_NEAR("Quadratic, starting at (1,1,1...)", err, 0.0, 1e-5); // fails from n=6 onwards: result is 0.379827 for n=6, 0.0812755 for n=7, 7.01668 for n=8.
- vcl_cout<<"Number of evaluations: "<<amoeba2.get_num_evaluations()<<vcl_endl;
-
- x.fill(0);
- amoeba2.set_max_iterations(10000);
- amoeba2.minimize(x);
- err=0;
- for (unsigned int i=0; i<n; ++i) err+=vcl_fabs(x[i]-i);
- TEST_NEAR("Quadratic, starting at (0,0,0...)", err, 0.0, 1e-5); // fails from n=5 onwards, "random" results
- vcl_cout<<"Number of evaluations: "<<amoeba2.get_num_evaluations()<<vcl_endl;
-
- vnl_vector<double> dx(n);
- dx.fill(0.1);
- x.fill(0);
- amoeba2.minimize(x,dx);
- err=0;
- for (unsigned int i=0; i<n; ++i) err+=vcl_fabs(x[i]-i);
- TEST_NEAR("Quadratic, starting at (0,0,0...) using minimise(x,dx)",err,0,1e-5); // fails from n=7 onwards, value approx. 5.0074 for n=7, between 5.95 and 6.05 for n=8
- vcl_cout<<"Number of evaluations: "<<amoeba2.get_num_evaluations()<<vcl_endl
-
- <<"Test static functions\n";
- x.fill(0);
- vnl_amoeba::minimize(cost1,x,dx);
- err=0;
- for (unsigned int i=0; i<n; ++i) err+=vcl_fabs(x[i]-i);
- TEST_NEAR("Quadratic, starting at (0,0,0...) using minimise(x,dx)",err,0,1e-5); // fails from n=6 onwards: result is 0.0000167217 for n=6, 4.80315 for n=7, 6.64319 for n=8.
- }
-}
-
-TESTMAIN(test_amoeba);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_bracket_minimum.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_bracket_minimum.cxx
deleted file mode 100644
index 659ad7928e987373202dc09d19245d5f5f1809d2..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_bracket_minimum.cxx
+++ /dev/null
@@ -1,73 +0,0 @@
-#include <vcl_iostream.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/algo/vnl_bracket_minimum.h>
-
-#include <testlib/testlib_test.h>
-
-struct bm_square1 : public vnl_cost_function {
- bm_square1() : vnl_cost_function(1) {}
-
- double f(const vnl_vector<double>& x) {
- return (2 - x[0]) * (2 - x[0]) + 10;
- }
-};
-
-struct bm_quartic1 : public vnl_cost_function {
- bm_quartic1() : vnl_cost_function(1) {}
-
- double f(const vnl_vector<double>& x) {
- double y = (2 - x[0]) * (2 - x[0]);
- return y*y + 10;
- }
-};
-
-void test_bracket_minimum()
-{
- bm_square1 f1;
- double a=5,b=6,c;
- double fa,fb,fc;
-
- vnl_bracket_minimum(f1,a,b,c,fa,fb,fc);
-
- vcl_cout<<"Bracket: ("<<a<<','<<b<<','<<c<<')'<<vcl_endl
- <<"fn: ("<<fa<<','<<fb<<','<<fc<<')'<<vcl_endl;
-
- TEST("a<b",a<b,true);
- TEST("a<c",a<c,true);
- TEST("fa>fb",fa>fb,true);
- TEST("fb<fc",fb<fc,true);
-
- a = -10; b=-9;
- vnl_bracket_minimum(f1,a,b,c,fa,fb,fc);
- vcl_cout<<"Bracket: ("<<a<<','<<b<<','<<c<<')'<<vcl_endl
- <<"fn: ("<<fa<<','<<fb<<','<<fc<<')'<<vcl_endl;
-
- TEST("a<b",a<b,true);
- TEST("a<c",a<c,true);
- TEST("fa>fb",fa>fb,true);
- TEST("fb<fc",fb<fc,true);
-
- bm_quartic1 f2;
- a=5; b=6;
- vnl_bracket_minimum(f2,a,b,c,fa,fb,fc);
-
- vcl_cout<<"Bracket: ("<<a<<','<<b<<','<<c<<')'<<vcl_endl
- <<"fn: ("<<fa<<','<<fb<<','<<fc<<')'<<vcl_endl;
-
- TEST("a<b",a<b,true);
- TEST("a<c",a<c,true);
- TEST("fa>fb",fa>fb,true);
- TEST("fb<fc",fb<fc,true);
-
- a = -10; b=-9;
- vnl_bracket_minimum(f2,a,b,c,fa,fb,fc);
- vcl_cout<<"Bracket: ("<<a<<','<<b<<','<<c<<')'<<vcl_endl
- <<"fn: ("<<fa<<','<<fb<<','<<fc<<')'<<vcl_endl;
-
- TEST("a<b",a<b,true);
- TEST("a<c",a<c,true);
- TEST("fa>fb",fa>fb,true);
- TEST("fb<fc",fb<fc,true);
-}
-
-TESTMAIN(test_bracket_minimum);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_brent_minimizer.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_brent_minimizer.cxx
deleted file mode 100644
index bb4ea214bccce0871fd09829b0988806e2d0e04a..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_brent_minimizer.cxx
+++ /dev/null
@@ -1,62 +0,0 @@
-#include <vcl_iostream.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/algo/vnl_brent_minimizer.h>
-
-#include <testlib/testlib_test.h>
-
-struct brent_f1 : public vnl_cost_function {
- unsigned n_evals;
- brent_f1() : vnl_cost_function(1),n_evals(0) {}
-
- double f(const vnl_vector<double>& x) { n_evals++;
- return (2 - x[0]) * (2 - x[0]) + 10;
- }
-};
-
-struct brent_f2 : public vnl_cost_function {
- unsigned n_evals;
- brent_f2() : vnl_cost_function(1),n_evals(0) {}
-
- double f(const vnl_vector<double>& x) { n_evals++;
- double y = (2 - x[0]) * (2 - x[0]);
- return y*y + 10;
- }
-};
-
-void test_brent_minimizer()
-{
- brent_f1 f1;
- vnl_brent_minimizer brent1(f1);
-
- double x = brent1.minimize(77);
- TEST_NEAR("f1 minimize(77)",x,2,1e-6);
- vcl_cout<<"Number of evaluations: "<<f1.n_evals<<vcl_endl;
-
- f1.n_evals=0;
- x = brent1.minimize(13);
- TEST_NEAR("f1 minimize(13)",x,2,1e-6);
- vcl_cout<<"Number of evaluations: "<<f1.n_evals<<vcl_endl;
-
- brent_f2 f2;
- vnl_brent_minimizer brent2(f2);
-
- f2.n_evals=0;
- x = brent2.minimize(77);
- TEST_NEAR("f2 minimize(77)",x,2,1e-3);
- vcl_cout<<"Number of evaluations: "<<f2.n_evals<<vcl_endl;
-
- f2.n_evals=0;
- x = brent2.minimize(13);
- TEST_NEAR("f2 minimize(13)",x,2,1e-3);
- vcl_cout<<"Number of evaluations: "<<f2.n_evals<<vcl_endl;
-
- vnl_vector<double> v(1);
- v[0]=2;
- double f2_a = f2.f(v);
- v[0]=x;
- double f2_b = f2.f(v);
- vcl_cout<<"f2(2)-f2(x)="<<f2_a-f2_b<<vcl_endl;
-
-}
-
-TESTMAIN(test_brent_minimizer);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_cholesky.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_cholesky.cxx
deleted file mode 100644
index b21062dbcba3c2da0105bdb4188d54e1d300a5fb..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_cholesky.cxx
+++ /dev/null
@@ -1,51 +0,0 @@
-// This is core/vnl/algo/tests/test_cholesky.cxx
-#include <testlib/testlib_test.h>
-#include <vcl_iostream.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/algo/vnl_cholesky.h>
-#include <vnl/algo/vnl_svd.h>
-#include <vnl/vnl_random.h>
-
-#include "test_util.h"
-
-void test_cholesky()
-{
- vnl_random rng(1000);
- vnl_matrix<double> A(3,3);
- test_util_fill_random(A.begin(), A.end(), rng);
- A = A * A.transpose();
-
- vnl_matrix<double> I(3,3);
- I.set_identity();
-
- {
- vnl_cholesky chol(A);
- vnl_svd<double> svd(A);
- vcl_cout << "cholesky inverse:\n" << chol.inverse() << '\n'
- << "svd inverse:\n" << svd.inverse() << '\n';
- testlib_test_assert_near("svd.inverse() ~= cholesky.inverse()",
- (chol.inverse() - svd.inverse()).fro_norm());
- }
- {
- vnl_cholesky chol(A);
- testlib_test_assert_near("Ai * A - I", (chol.inverse() * A - I).fro_norm());
- testlib_test_assert_near("Ai * A - I", (A * chol.inverse() - I).fro_norm());
- }
- {
- vnl_cholesky chol(A, vnl_cholesky::estimate_condition);
- testlib_test_assert_near("Ai * A - I", (chol.inverse() * A - I).fro_norm());
- testlib_test_assert_near("Ai * A - I", (A * chol.inverse() - I).fro_norm());
- }
-
- {
- vnl_vector<double> b(3),x0(3),x;
- test_util_fill_random(x0.begin(), x0.end(), rng);
- b=A*x0;
- vnl_cholesky chol(A);
- x=chol.solve(b);
- testlib_test_assert_near("Solve Ax=b",(x-x0).one_norm(),0,1e-6);
- }
-
-}
-
-TESTMAIN(test_cholesky);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_complex_eigensystem.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_complex_eigensystem.cxx
deleted file mode 100644
index 4150db0150c0020cbf0e5031832b79735f762df8..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_complex_eigensystem.cxx
+++ /dev/null
@@ -1,92 +0,0 @@
-//:
-// \file
-// \author fsm, Oxford RRG
-// \date 7 September 1999
-#include <vcl_complex.h>
-#include <vcl_iostream.h>
-#include <vnl/algo/vnl_complex_eigensystem.h>
-
-#include <testlib/testlib_test.h>
-
-void test_complex_eigensystem1()
-{
- const unsigned N=6;
- double a_real[N*N] = {
- 0.5965, -0.7781, -1.6925, 9.8017, -3.5993, -1.2015,
- 2.8105, 1.3566, -3.9000, 5.7772, 9.2020, 8.6676,
- -5.8186, 5.8842, 7.4873, -1.2268, 4.5326, 3.6666,
- -2.4036, -8.8163, -9.6998, -0.0338, -1.7609, -5.7488,
- 5.6666, 2.0574, 5.3590, -5.7207, 4.8913, 6.7848,
- 3.6169, -8.9946, 9.4169, 2.8698, -4.6411, 2.5757
- };
- vnl_matrix<double> A_real(a_real,N,N);
-
- double a_imag[N*N] = {
- 6.9244, 3.6255, -3.9077, -6.9825, -0.0690, -3.1606,
- 0.5030, -2.4104, -6.2069, 3.9580, 7.9954, -4.2055,
- -5.9471, 6.6359, -6.1314, -2.4325, 6.4326, -3.1761,
- 3.4427, 0.0563, 3.6445, 7.2002, 2.8982, 0.6816,
- 6.7624, 4.1894, -3.9447, 7.0731, 6.3595, 4.5423,
- -9.6072, -1.4222, 0.8335, 1.8713, 3.2046, -3.8142
- };
- vnl_matrix<double> A_imag(a_imag,N,N);
-
- vnl_matrix<vcl_complex<double> > A(N,N);
- for (unsigned i=0;i<N;i++)
- for (unsigned j=0;j<N;j++)
- A(i,j) = vcl_complex<double>(A_real(i,j), A_imag(i,j));
-
- vnl_complex_eigensystem eig(A, // compute both
- true, // left and right
- true); // eigenvectors
- TEST("vnl_complex_eigensystem constructor", eig.N, N);
-#if 0
- vcl_cout << "A = " << A << '\n'
- << "eigenvalues = " << eig.W << '\n'
- << "L = " << eig.L << '\n'
- << "R = " << eig.R << '\n';
-#endif
- for (unsigned i=0;i<N;i++) {
- vcl_complex<double> w = eig.W[i];
- vcl_cout << " W[" << i << "] = " << w << '\n';
- //
- vnl_vector<vcl_complex<double> > l = eig.left_eigen_vector(i);
- vnl_vector<vcl_complex<double> > err = l*A - l*w;
- testlib_test_assert_near(" Left eigenvalue residue", err.magnitude());
- //
- vnl_vector<vcl_complex<double> > r = eig.right_eigen_vector(i);
- err = A*r - w*r;
- testlib_test_assert_near(" Right eigenvalue residue", err.magnitude());
- }
-}
-
-void test_complex_eigensystem2()
-{
- // The standard version of ZLAHQR fails to converge on this 6x6 matrix
- // because the maximum number of iterations is reached. Removing the
- // upper limit makes it work, though.
- double Adata[6][6] = {
- { 6.811898476755, -0.750947244402, 0.029620459055, 0.082784816274, -0.003265374870, 0.000128799864},
- {-0.302642078990, 7.243967032503, -0.238733709072, -1.593479414193, 0.057672293761, -0.002070468886},
- {-0.224780478514, 1.663978565954, 6.516036730518, -0.364143980645, -0.711203495953, 0.056672152613},
- { 0.003361479487, -0.160548535977, 0.005288667260, 7.668002291196, -0.252593475373, 0.008320741358},
- { 0.004993323929, -0.155932510596, -0.140831520110, 3.504603640364, 6.856177569090, -0.455504863942},
- { 0.001854338541, -0.027249736525, -0.107516848058, 0.400438282672, 1.579973514772, 6.233960176641}
- };
- vnl_matrix<vcl_complex<double> > A(6, 6);
- for (int i=0; i<6; ++i)
- for (int j=0; j<6; ++j)
- A[i][j] = Adata[i][j]; //(0.77+i) + (0.1+j)*(0.33+j);
- vnl_complex_eigensystem eig(A);
- TEST("vnl_complex_eigensystem constructor", eig.N, 6);
- for (int i=0; i<6; ++i)
- vcl_cout << " W[" << i << "] = " << eig.eigen_value(i) << '\n';
-}
-
-void test_complex_eigensystem()
-{
- test_complex_eigensystem1();
- test_complex_eigensystem2();
-}
-
-TESTMAIN(test_complex_eigensystem);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_convolve.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_convolve.cxx
deleted file mode 100644
index 0e72e6ae8b36e3406b0782ed9d4ed4730b6f942c..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_convolve.cxx
+++ /dev/null
@@ -1,95 +0,0 @@
-#include <vcl_iostream.h>
-#include <vnl/algo/vnl_convolve.h>
-#include <vnl/vnl_double_2.h>
-#include <vnl/vnl_random.h>
-#include <vnl/vnl_int_2.h>
-#include <vul/vul_timer.h>
-
-#include <testlib/testlib_test.h>
-
-#include "test_util.h"
-
-void test_convolve()
-{
- int b_data[] = { -2, 0, 4, 6, 2, 0 };
- vnl_vector<int> b(6, 6, b_data);
- vnl_vector<double> k1 = vnl_double_2(0.5,-0.5).as_vector();
-
- vnl_vector<double> r1 = vnl_convolve(b, k1, (double*)0);
- TEST("vnl_convolve() simple length", r1.size(), 7);
- vcl_cout << r1 << vcl_endl;
- TEST("vnl_convolve() simple values", true,
- r1[0]==-1 && r1[1]==1 && r1[2]==2 && r1[3]==1 && r1[4]==-2 && r1[5]==-1 && r1[6]==0);
-
- vnl_vector<int> k2 = vnl_int_2(1,-1).as_vector();
- vnl_vector<int> r2 = vnl_convolve(b, k2);
- TEST("vnl_convolve() simple length", r2.size(), 7);
- vcl_cout << r2 << vcl_endl;
- TEST("vnl_convolve() simple values", true,
- r2[0]==-2 && r2[1]==2 && r2[2]==4 && r2[3]==2 && r2[4]==-4 && r2[5]==-2 && r2[6]==0);
- vnl_vector<int> r3 = vnl_convolve(b, k2, (int*)0);
- TEST("vnl_convolve() 2nd form", r3, r2);
- vnl_vector<int> r4 = vnl_convolve(k2, b);
- TEST("vnl_convolve() commutativity", r4, r2);
- vnl_vector<double> r7 = vnl_convolve(b, k1, (double*)0, 1);
- vcl_cout << r7 << vcl_endl;
- TEST_NEAR("vnl_convolve() with_fft(7)", (r7-r1).two_norm(), 0.0, 1e-6);
- vnl_vector<double> r8 = vnl_convolve(b, k1, (double*)0, 8);
- vcl_cout << r8 << vcl_endl;
- TEST_NEAR("vnl_convolve() with_fft(8)", (r8-r1).two_norm(), 0.0, 1e-6);
-
- // TIMING TEST on a very long convolution:
- vnl_vector<double> l(10000), k3(2000);
- vnl_random rng;
- test_util_fill_random(l.begin(), l.end(), rng);
- test_util_fill_random(k3.begin(), k3.end(), rng);
- const unsigned ntimes = 10; // repeat some expts to get more accurate timings.
- vnl_vector<double> r9;
- vul_timer timer;
- for (unsigned i=0; i < ntimes; ++i)
- r9 = vnl_convolve(l, k3);
- int ms1 = timer.user();
- vcl_cout << "Done straightforward 10000x2000 convolution in " << ms1/double(ntimes) << " milliseconds\n";
-
- vnl_vector<double> r10;
- timer.mark();
- for (unsigned i=0; i < ntimes; ++i)
- r10 = vnl_convolve(l, k3, 16384);
- int ms2 = timer.user();
- TEST_NEAR("vnl_convolve() with_fft(16384)", (r9-r10).two_norm(), 0.0, 1e-6);
- vcl_cout << "Done FFT-2-based 10000x2000 convolution in " << ms2/double(ntimes) << " milliseconds\n";
- TEST("vnl_convolve() timing: should be at least 2.5x faster", 5*ms2 < 2*ms1, true);
-
- vnl_vector<double> r11;
- timer.mark();
- for (unsigned i=0; i < ntimes; ++i)
- r11 = vnl_convolve(l, k3, 12800);
- int ms3 = timer.user();
- TEST_NEAR("vnl_convolve() with_fft(12800)", (r9-r11).two_norm(), 0.0, 1e-6);
- vcl_cout << "Done FFT-2,5-based 10000x2000 convolution in " << ms3/double(ntimes) << " milliseconds\n";
- TEST("vnl_convolve() timing: should even be faster", ms3 < ms2, true);
-
- vnl_vector<double> r12;
- timer.mark();
- for (unsigned i=0; i < ntimes; ++i)
- r12 = vnl_convolve(l, k3, 27648);
- int ms4 = timer.user();
- TEST_NEAR("vnl_convolve() with_fft(27648)", (r9-r12).two_norm(), 0.0, 1e-6);
- vcl_cout << "Done FFT-2,3-based 10000x2000 convolution in " << ms4/double(ntimes) << " milliseconds\n";
- TEST("vnl_convolve() timing: should be slower", 5*ms4 > 3*ms2, true);
-
- double c1_data[] = { -1, 0, 1, 2, 3, 4 };
- vnl_vector<double> c1(6, 6, c1_data);
- double c2_data[] = { 5, 3, 1, -1, -3, -5 };
- vnl_vector<double> c2(6, 6, c2_data);
- vnl_vector<double> r5 = vnl_convolve_cyclic(c1, c2, (double*)0);
- TEST("vnl_convolve_cyclic() length", r5.size(), 6);
- vcl_cout << r5 << vcl_endl;
- TEST("vnl_convolve_cyclic() values", true,
- r5[0]==5 && r5[1]==-13 && r5[2]==-19 && r5[3]==-13 && r5[4]==5 && r5[5]==35);
- vnl_vector<double> r6 = vnl_convolve_cyclic(c1, c2, (double*)0, true);
- vcl_cout << r6 << vcl_endl;
- TEST_NEAR("vnl_convolve_cyclic() with_fft", (r6-r5).two_norm(), 0.0, 1e-6);
-}
-
-TESTMAIN(test_convolve);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_cpoly_roots.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_cpoly_roots.cxx
deleted file mode 100644
index a5735d8877358634191f217eed8a7da0e7bedc8e..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_cpoly_roots.cxx
+++ /dev/null
@@ -1,22 +0,0 @@
-#include <vnl/vnl_real_polynomial.h>
-#include <vnl/algo/vnl_cpoly_roots.h>
-
-#include <testlib/testlib_test.h>
-
-void test_cpoly_roots()
-{
- const double coeffs[] = {6, 5, 4, 3, 2, 1};
- vnl_vector<double> a(coeffs, 6);
-
- vnl_vector<double> monic( (a/a[0]).extract(a.size()-1,1) );
- vnl_cpoly_roots roots( monic, 0.0*monic );
-
- testlib_test_assert( "Number of solutions", roots.solns.size() == monic.size() );
-
- // Evaluate results
- vnl_real_polynomial f(a);
- for (int i = 0; i < f.degree(); ++i)
- testlib_test_assert("Root residual", vcl_abs(f.evaluate(roots.solns[i])) < 1e-12);
-}
-
-TESTMAIN(test_cpoly_roots);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_determinant.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_determinant.cxx
deleted file mode 100644
index 0ea5a67809e1642bc3f1c00519cf10a0caa9af22..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_determinant.cxx
+++ /dev/null
@@ -1,162 +0,0 @@
-#include <vnl/vnl_matrix.h>
-#include <vnl/algo/vnl_qr.h>
-#include <vnl/algo/vnl_determinant.h>
-#include <vnl/vnl_det.h>
-
-#include <testlib/testlib_test.h>
-
-double qr_det(vnl_matrix<double> const &M)
-{ return vnl_qr<double>(M).determinant(); }
-
-void test_determinant()
-{
- double eps = 1e-14;
-
-#if 0 // commented out
- {
- double M1[1][1] = {
- { 0.95012928514718 }
- };
- vnl_matrix<double> m1(&M1[0][0],1,1);
- double d1 = M1[0][0];
- testlib_test_assert_near("1x1 vnl_determinant(vnl_matrix<double>)", vnl_determinant(m1), d1, eps);
- testlib_test_assert_near("1x1 qr_det(vnl_matrix<double>)", qr_det(m1), d1, eps);
- testlib_test_assert_near("1x1 vnl_determinant(double, ...)", vnl_determinant(M1[0]), d1, eps);
- vnl_matrix_fixed<double,1,1> m_1 = m1;
- testlib_test_assert_near("vnl_det(vnl_matrix_fixed<double,1,1>)", vnl_det(m_1), d1, eps);
- }
-
- {
- double N1[1][1] = {
- { -0.95012928514718 }
- };
- vnl_matrix<double> n1(&N1[0][0],1,1);
- double d1 = N1[0][0];
- testlib_test_assert_near("1x1 vnl_determinant(vnl_matix<double>)", vnl_determinant(n1), d1, eps);
- testlib_test_assert_near("1x1 qr_det(vnl_matrix<double>)", qr_det(n1), d1, eps);
- testlib_test_assert_near("1x1 vnl_determinant(double, ...)", vnl_determinant(N1[0]), d1, eps);
- vnl_matrix_fixed<double,1,1> n_1 = n1;
- testlib_test_assert_near("vnl_det(vnl_matrix_fixed<double,1,1>)", vnl_det(n_1), d1, eps);
- }
-#endif
- {
- double M2[2][2] = {
- { 0.60684258354179, 0.89129896614890 },
- { 0.48598246870930, 0.76209683302739 }
- };
- vnl_matrix<double> m2(&M2[0][0],2,2);
- double d2 = qr_det(m2);
- testlib_test_assert_near("2x2 vnl_determinant(vnl_matix<double>)", vnl_determinant(m2), d2, eps);
- testlib_test_assert_near("2x2 vnl_determinant(double, ...)", vnl_determinant(M2[0], M2[1]), d2, eps);
- vnl_matrix_fixed<double,2,2> m_2 = m2;
- testlib_test_assert_near("vnl_det(vnl_matrix_fixed<double,2,2>)", vnl_det(m_2), d2, eps);
- }
-
- {
- double N2[2][2] = {
- { 0.60684258354179, 0.89129896614890 },
- { 0.48598246870930, -0.76209683302739 }
- };
- vnl_matrix<double> n2(&N2[0][0],2,2);
- double d2 = qr_det(n2);
- testlib_test_assert_near("2x2 vnl_determinant(vnl_matix<double>)", vnl_determinant(n2), d2, eps);
- testlib_test_assert_near("2x2 vnl_determinant(double, ...)", vnl_determinant(N2[0], N2[1]), d2, eps);
- vnl_matrix_fixed<double,2,2> n_2 = n2;
- testlib_test_assert_near("vnl_det(vnl_matrix_fixed<double,2,2>)", vnl_det(n_2), d2, eps);
- }
-
- {
- double M3[3][3] = {
- { 0.45646766516834, 0.44470336435319, 0.92181297074480 },
- { 0.01850364324822, 0.61543234810009, 0.73820724581067 },
- { 0.82140716429525, 0.79193703742704, 0.17626614449462 }
- };
- vnl_matrix<double> m3(&M3[0][0],3,3);
- double d3 = qr_det(m3);
- testlib_test_assert_near("3x3 vnl_determinant(vnl_matix<double>)", vnl_determinant(m3), d3, eps);
- testlib_test_assert_near("3x3 vnl_determinant(double, ...)", vnl_determinant(M3[0], M3[1], M3[2]), d3, eps);
- vnl_matrix_fixed<double,3,3> m_3 = m3;
- testlib_test_assert_near("vnl_det(vnl_matrix_fixed<double,3,3>)", vnl_det(m_3), d3, eps);
- }
-
- {
- double N3[3][3] = {
- { 0.45646766516834, 0.44470336435319, -0.92181297074480 },
- { 0.01850364324822, 0.61543234810009, -0.73820724581067 },
- { 0.82140716429525, 0.79193703742704, 0.17626614449462 }
- };
- vnl_matrix<double> n3(&N3[0][0],3,3);
- double d3 = qr_det(n3);
- testlib_test_assert_near("3x3 vnl_determinant(vnl_matix<double>)", vnl_determinant(n3), d3, eps);
- testlib_test_assert_near("3x3 vnl_determinant(double, ...)", vnl_determinant(N3[0], N3[1], N3[2]), d3, eps);
- vnl_matrix_fixed<double,3,3> n_3 = n3;
- testlib_test_assert_near("vnl_det(vnl_matrix_fixed<double,3,3>)", vnl_det(n_3), d3, eps);
- }
-
- {
- double M4[4][4] = {
- { 0.40570621306210, 0.89364953091353, 0.00986130066092, 0.60379247919382 },
- { 0.93546969910761, 0.05789130478427, 0.13889088195695, 0.27218792496996 },
- { 0.91690443991341, 0.35286813221700, 0.20276521856027, 0.19881426776106 },
- { 0.41027020699095, 0.81316649730376, 0.19872174266149, 0.01527392702904 }
- };
- vnl_matrix<double> m4(&M4[0][0],4,4);
- double d4 = qr_det(m4);
- testlib_test_assert_near("4x4 vnl_determinant(vnl_matix<double>)", vnl_determinant(m4), d4, eps);
- testlib_test_assert_near("4x4 vnl_determinant(double, ...)", vnl_determinant(M4[0],M4[1],M4[2],M4[3]), d4, eps);
- vnl_matrix_fixed<double,4,4> m_4 = m4;
- testlib_test_assert_near("vnl_det(vnl_matrix_fixed<double,4,4>)", vnl_det(m_4), d4, eps);
- }
-
- {
- double N4[4][4] = {
- { 0.40570621306210, -0.89364953091353, 0.00986130066092, -0.60379247919382 },
- { 0.93546969910761, 0.05789130478427, 0.13889088195695, 0.27218792496996 },
- { 0.91690443991341, -0.35286813221700, 0.20276521856027, -0.19881426776106 },
- { 0.41027020699095, 0.81316649730376, 0.19872174266149, 0.01527392702904 }
- };
- vnl_matrix<double> n4(&N4[0][0],4,4);
- double d4 = qr_det(n4);
- testlib_test_assert_near("4x4 vnl_determinant(vnl_matix<double>)", vnl_determinant(n4), d4, eps);
- testlib_test_assert_near("4x4 vnl_determinant(double, ...)", vnl_determinant(N4[0],N4[1],N4[2],N4[3]), d4, eps);
- vnl_matrix_fixed<double,4,4> n_4 = n4;
- testlib_test_assert_near("vnl_det(vnl_matrix_fixed<double,4,4>)", vnl_det(n_4), d4, eps);
-
- double N5[5][5] = {
- { 1, 0, 0, 0, 0 },
- { 0, N4[0][0], N4[0][1], N4[0][2], N4[0][3] },
- { 0, N4[1][0], N4[1][1], N4[1][2], N4[1][3] },
- { 0, N4[2][0], N4[2][1], N4[2][2], N4[2][3] },
- { 0, N4[3][0], N4[3][1], N4[3][2], N4[3][3] }
- };
- vnl_matrix<double> n5(&N5[0][0],5,5);
- double d5 = qr_det(n5);
- testlib_test_assert_near("5x5 qr_det equals 4x4 one", d5, d4, eps);
- testlib_test_assert_near("5x5 vnl_determinant(vnl_matix<double>)", vnl_determinant(n5), d5, eps);
- vnl_matrix_fixed<double,5,5> n_5 = n5;
- testlib_test_assert_near("vnl_determinant(vnl_matrix_fixed<double,5,5>)", vnl_determinant(n_5), d5, eps);
- }
-
- {
- int M6[3][3] = {
- { 2, 0, 0 },
- { 0, 1, 0 },
- { 0, 0, 5 } };
- vnl_matrix<int> m6(&M6[0][0],3,3);
- testlib_test_assert_near("3x3 vnl_determinant(vnl_matix<int>)", vnl_determinant(m6), 10, eps);
- }
-
- {
- int M7[6][6] = {
- { 2, 0, 0, 0, 0, 0 },
- { 0, 1, 0, 0, 0, 0 },
- { 0, 0, 5, 0, 0, 0 },
- { 0, 0, 0, 4, 0, 0 },
- { 0, 0, 0, 0, 2, 0 },
- { 0, 0, 0, 0, 0, 6 } };
- vnl_matrix<int> m7(&M7[0][0],6,6);
- testlib_test_assert_near("6x6 vnl_determinant(vnl_matix<int>)", vnl_determinant(m7), 2*1*5*4*2*6, eps);
- }
-}
-
-TESTMAIN(test_determinant);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_driver.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_driver.cxx
deleted file mode 100644
index afdd4b7f2c1f3637fd6e7d9a94e244a338e6fd0b..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_driver.cxx
+++ /dev/null
@@ -1,70 +0,0 @@
-#include <testlib/testlib_register.h>
-
-DECLARE( test_amoeba );
-DECLARE( test_cholesky );
-DECLARE( test_complex_eigensystem );
-//DECLARE( test_convolve );
-DECLARE( test_cpoly_roots );
-DECLARE( test_determinant );
-DECLARE( test_rank );
-DECLARE( test_fft );
-DECLARE( test_fft1d );
-DECLARE( test_fft2d );
-DECLARE( test_functions );
-DECLARE( test_generalized_eigensystem );
-DECLARE( test_ldl_cholesky );
-DECLARE( test_levenberg_marquardt );
-DECLARE( test_matrix_update );
-DECLARE( test_minimizers );
-DECLARE( test_powell );
-DECLARE( test_qr );
-DECLARE( test_qsvd );
-DECLARE( test_rational );
-DECLARE( test_real_eigensystem );
-DECLARE( test_rnpoly_roots );
-DECLARE( test_sparse_matrix );
-DECLARE( test_integral );
-DECLARE( test_svd );
-//DECLARE( test_symmetric_eigensystem );
-DECLARE( test_algo );
-DECLARE( test_solve_qp );
-DECLARE( test_sparse_lu );
-DECLARE( test_bracket_minimum );
-DECLARE( test_brent_minimizer );
-
-void
-register_tests()
-{
- REGISTER( test_amoeba );
- REGISTER( test_cholesky );
- REGISTER( test_complex_eigensystem );
- //REGISTER( test_convolve );
- REGISTER( test_cpoly_roots );
- REGISTER( test_determinant );
- REGISTER( test_rank );
- REGISTER( test_fft );
- REGISTER( test_fft1d );
- REGISTER( test_fft2d );
- REGISTER( test_functions );
- REGISTER( test_generalized_eigensystem );
- REGISTER( test_ldl_cholesky );
- REGISTER( test_levenberg_marquardt );
- REGISTER( test_matrix_update );
- REGISTER( test_minimizers );
- REGISTER( test_powell );
- REGISTER( test_qr );
- REGISTER( test_qsvd );
- REGISTER( test_real_eigensystem );
- REGISTER( test_integral );
- REGISTER( test_rnpoly_roots );
- REGISTER( test_sparse_matrix );
- REGISTER( test_svd );
- //REGISTER( test_symmetric_eigensystem );
- REGISTER( test_algo );
- REGISTER( test_solve_qp );
- REGISTER( test_sparse_lu );
- REGISTER( test_bracket_minimum );
- REGISTER( test_brent_minimizer );
-}
-
-DEFINE_MAIN;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_fft.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_fft.cxx
deleted file mode 100644
index 2e9d6c72f9924b386b0043af9c4b52c6d08aae7a..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_fft.cxx
+++ /dev/null
@@ -1,69 +0,0 @@
-// This is core/vnl/algo/tests/test_fft.cxx
-/*
- fsm
-*/
-#include <vcl_iostream.h>
-
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_matlab_print.h>
-#include <vnl/vnl_random.h>
-
-#include <vnl/algo/vnl_fft_1d.h>
-#include <vnl/algo/vnl_fft_2d.h>
-
-#include <testlib/testlib_test.h>
-
-#include "test_util.h"
-
-void test_fft_1d(unsigned int N)
-{
- vnl_random rng;
- vnl_vector<vcl_complex<double> > signal(N);
- test_util_fill_random(signal.begin(), signal.end(), rng);
-
- vnl_fft_1d<double> fft(N);
-
- vnl_vector<vcl_complex<double> > tmp = signal;
- vnl_matlab_print(vcl_cout, tmp, "tmp");
-
- fft.fwd_transform(tmp);
- vnl_matlab_print(vcl_cout, tmp, "tmp");
-
- fft.bwd_transform(tmp); tmp /= N;
- vnl_matlab_print(vcl_cout, tmp, "tmp");
-
- double err = (tmp - signal).two_norm();
- vcl_cout << "err = " << err << vcl_endl;
- testlib_test_assert_near("test fwd-bwd", err, 0.0, 1e-10);
-}
-
-void test_fft_2d(unsigned int M, unsigned int N)
-{
- vnl_random rng;
- vnl_matrix<vcl_complex<double> > signal(M, N);
- test_util_fill_random(signal.begin(), signal.end(), rng);
-
- vnl_fft_2d<double> fft(M, N);
-
- vnl_matrix<vcl_complex<double> > tmp = signal;
- vnl_matlab_print(vcl_cout, tmp, "tmp");
-
- fft.fwd_transform(tmp);
- vnl_matlab_print(vcl_cout, tmp, "tmp");
-
- fft.bwd_transform(tmp); tmp /= (M*N);
- vnl_matlab_print(vcl_cout, tmp, "tmp");
-
- double err = (tmp - signal).fro_norm();
- vcl_cout << "err = " << err << vcl_endl;
- testlib_test_assert_near("test fwd-bwd", err, 0.0, 1e-10);
-}
-
-void test_fft()
-{
- test_fft_1d(24);
- test_fft_2d(25, 30);
-}
-
-TESTMAIN (test_fft);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_fft1d.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_fft1d.cxx
deleted file mode 100644
index 357a82071381783bde777d317d184e33e9a64688..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_fft1d.cxx
+++ /dev/null
@@ -1,161 +0,0 @@
-// This is core/vnl/algo/tests/test_fft1d.cxx
-#include <testlib/testlib_test.h>
-//:
-// \file
-// \brief test program for 1D FFT routines.
-// \author Veit U.B. Schenk, Oxford RRG.
-// \date 20 Mar 1998
-//
-// Creates 1D arrays and vectors, computes forward fft, then backward fft
-// for all (where applicable) constructors of the class
-// and computes differences between input and output.
-//
-// \verbatim
-// Modifications
-// Jan. 2002 - Peter Vanroose - adapted from vnl_fft1d to vnl_fft_1d
-// June 2003 - Peter Vanroose - added tests for the vcl_vector interface
-// \endverbatim
-
-//-----------------------------------------------------------------------------
-#include <vcl_cstdlib.h> // for vcl_abort
-#include <vcl_cmath.h> // for vcl_fabs
-#include <vcl_iostream.h>
-#include <vcl_complex.h>
-#include <vcl_vector.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/algo/vnl_fft_1d.h>
-
-void test_fft_1d(int n)
-{
- vcl_cout << "=================================\n"
- << "Testing vnl_fft_1d for length " << n << '\n'
- << "=================================\n";
-
- // calculate prime factors for this size array
- //============================================
- vnl_fft_prime_factors<double> oPFx(n);
- if (!oPFx) {
- vcl_cerr << "cannot decompose X-size " << n << ")into the form (2^P)(3^Q)(5^R)\n";
- vcl_abort();
- }
-
- // create a number of arrays for testing the transform
- //====================================================
- vnl_vector<vcl_complex<double> > fTestArrayConvert(n);
- vnl_vector<vcl_complex<double> > fTestArrayFwd(n);
- vcl_vector<vcl_complex<double> > fTestVecConvert(n);
- vcl_vector<vcl_complex<double> > fTestVecFwd(n);
- vcl_complex<double>* fTestPtrConvert = new vcl_complex<double>[n];
- vcl_complex<double>* fTestPtrFwd = new vcl_complex<double>[n];
-
- //fill with data
- for (int iC = 0;iC < n;iC ++)
- fTestArrayConvert(iC) = fTestArrayFwd(iC) =
- fTestVecConvert[iC] = fTestVecFwd[iC] =
- fTestPtrConvert[iC] = fTestPtrFwd[iC] =
- vcl_complex<double>(iC-3.5,0.0);
-
- //============================= super-easy transform =====================
- vnl_fft_1d<double> oFFTSimple(n);
- oFFTSimple.transform(fTestArrayConvert, +1);
- oFFTSimple.fwd_transform(fTestArrayFwd);
- oFFTSimple.transform(fTestVecConvert, +1);
- oFFTSimple.fwd_transform(fTestVecFwd);
- oFFTSimple.transform(fTestPtrConvert, +1);
- oFFTSimple.fwd_transform(fTestPtrFwd);
-
- // now compare the results
- TEST("test forward vnl_vector", fTestArrayConvert, fTestArrayFwd);
- TEST("test forward vcl_vector", fTestVecConvert, fTestVecFwd);
- bool test_Ptr=true;
- for (int iC = 0;iC < n;iC ++)
- if (fTestPtrConvert[iC]!=fTestVecFwd[iC] ||
- fTestPtrFwd[iC]!=fTestVecConvert[iC]) { test_Ptr = false; break; }
- TEST("test forward C-array", test_Ptr, true);
-
- // the whole thing backwards
- //==========================
- oFFTSimple.transform(fTestArrayConvert, -1);
- oFFTSimple.bwd_transform(fTestArrayFwd);
- oFFTSimple.transform(fTestVecConvert, -1);
- oFFTSimple.bwd_transform(fTestVecFwd);
- oFFTSimple.transform(fTestPtrConvert, -1);
- oFFTSimple.bwd_transform(fTestPtrFwd);
-
- TEST("test backward vnl_vector", fTestArrayConvert, fTestArrayFwd);
- TEST("test backward vcl_vector", fTestVecConvert, fTestVecFwd);
- test_Ptr=true;
- for (int iC = 0;iC < n;iC ++)
- if (fTestPtrConvert[iC]!=fTestVecFwd[iC] ||
- fTestPtrFwd[iC]!=fTestVecConvert[iC]) {
- vcl_cout<<"C-array_fwd_bwd["<<iC<<"]="<<fTestPtrFwd[iC]
- <<", C-array_convert["<<iC<<"]="<<fTestPtrConvert[iC]
- <<", vcl_vector["<<iC<<"]="<<fTestVecFwd[iC]<<'\n';
- test_Ptr = false; break;
- }
- TEST("test backward C-array", test_Ptr, true);
-
- double fArrayRealError = 0.0, fArrayImagError = 0.0,
- fVecRealError = 0.0, fVecImagError = 0.0,
- fPtrRealError = 0.0, fPtrImagError = 0.0,
- fFwdRealError = 0.0, fFwdImagError = 0.0;
-
- for (int iC = 0;iC < n;iC ++)
- {
- // divide by n (since by definition fft_bwd(a) == n*....)
- fArrayRealError += vcl_fabs(vcl_real(fTestArrayConvert(iC))/n - (iC-3.5));
- fArrayImagError += vcl_fabs(vcl_imag(fTestArrayConvert(iC))/n);
- fVecRealError += vcl_fabs(vcl_real(fTestVecConvert[iC])/n - (iC-3.5));
- fVecImagError += vcl_fabs(vcl_imag(fTestVecConvert[iC])/n);
- fPtrRealError += vcl_fabs(vcl_real(fTestPtrConvert[iC])/n - (iC-3.5));
- fPtrImagError += vcl_fabs(vcl_imag(fTestPtrConvert[iC])/n);
- fFwdRealError += vcl_fabs(vcl_real(fTestPtrFwd[iC])/n - (iC-3.5));
- fFwdImagError += vcl_fabs(vcl_imag(fTestPtrFwd[iC])/n);
- }
-
- TEST_NEAR("vnl_vector absolute error, real part (per element)", fArrayRealError/n, 0.0, 1e-9);
- TEST_NEAR("vnl_vector absolute error, imag part (per element)", fArrayImagError/n, 0.0, 1e-9);
- TEST_NEAR("vcl_vector absolute error, real part (per element)", fVecRealError/n, 0.0, 1e-9);
- TEST_NEAR("vcl_vector absolute error, imag part (per element)", fVecImagError/n, 0.0, 1e-9);
- TEST_NEAR("C-array absolute error, real part (per element)", fPtrRealError/n, 0.0, 1e-9);
- TEST_NEAR("C-array absolute error, imag part (per element)", fPtrImagError/n, 0.0, 1e-9);
- TEST_NEAR("C-array fwd absolute error, real part (per element)", fFwdRealError/n, 0.0, 1e-9);
- TEST_NEAR("C-array fwd absolute error, imag part (per element)", fFwdImagError/n, 0.0, 1e-9);
-
- delete[] fTestPtrConvert;
- delete[] fTestPtrFwd;
-}
-
-void test_fft1d()
-{
- test_fft_1d(256);
- test_fft_1d(243);
- test_fft_1d(625);
-
- test_fft_1d(1);
- test_fft_1d(2);
- test_fft_1d(3);
- test_fft_1d(4);
- test_fft_1d(5);
- test_fft_1d(6);
- test_fft_1d(8);
- test_fft_1d(9);
- test_fft_1d(10);
- test_fft_1d(16);
- test_fft_1d(32);
- test_fft_1d(64);
- test_fft_1d(128);
-
- test_fft_1d(200);
- test_fft_1d(216);
- test_fft_1d(225);
- test_fft_1d(240);
- test_fft_1d(250);
- test_fft_1d(270);
- test_fft_1d(288);
-
- test_fft_1d(10000);
- test_fft_1d(65536);
-}
-
-TESTMAIN(test_fft1d);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_fft2d.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_fft2d.cxx
deleted file mode 100644
index 9fd07c58337ea47e21b1bd51dc2326dcda3a21a2..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_fft2d.cxx
+++ /dev/null
@@ -1,99 +0,0 @@
-// This is core/vnl/algo/tests/test_fft2d.cxx
-#include <testlib/testlib_test.h>
-//:
-// \file
-// \brief test program for 2D FFT routines.
-// \author Veit U.B. Schenk, Oxford RRG.
-// \date 20 Mar 1998
-//
-// Creates 2D arrays and matrices, computes forward fft, then backward fft
-// for all (where applicable) constructors of the class
-// and computes differences between input and output.
-//
-// \verbatim
-// Modifications
-// Jan. 2002 - Peter Vanroose - adapted from vnl_fft2d to vnl_fft_2d
-// \endverbatim
-
-//-----------------------------------------------------------------------------
-#include <vcl_cstdlib.h>
-#include <vcl_iostream.h>
-#include <vcl_complex.h>
-
-#include <vnl/vnl_complexify.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/algo/vnl_fft_2d.h>
-
-inline static double function(unsigned i, unsigned j) { return i * j; }
-
-void test_cplx(vnl_fft_prime_factors<double> const &/*prx*/,
- vnl_fft_prime_factors<double> const &/*pry*/,
- vnl_matrix<vcl_complex<double> > const &M,
- int dir)
-{
- vnl_matrix<vcl_complex<double> > fft_matrix = M;
- vnl_fft_2d<double> fft(M.rows(), M.cols()); fft.transform(fft_matrix, dir);
- testlib_test_assert ("test rows", fft.rows() == M.rows());
- testlib_test_assert ("test cols", fft.cols() == M.cols());
- testlib_test_assert ("test transform", fft_matrix != M);
-}
-
-void test_fft2d ()
-{
- const unsigned int rows = 64;
- const unsigned int cols = 64;
-
- // calculate prime factors for this size array
- vnl_fft_prime_factors<double> prx (rows);
- vnl_fft_prime_factors<double> pry (cols);
-
- if (!prx) {
- vcl_cerr << "cannot decompose X-size " << rows << ") into the form (2^P)(3^Q)(5^R)\n";
- vcl_abort();
- }
- if (!pry) {
- vcl_cerr << "cannot decompose Y-size (" << cols << ") into the form (2^P)(3^Q)(5^R)\n";
- vcl_abort();
- }
-
- // create arrays for testing the transform
-
- // data as arrays :
- double real_array[cols*rows];
- double imag_array[cols*rows];
-
- // fill with stuff :
- for (unsigned i=0; i<rows; ++i) {
- for (unsigned j=0; j<cols; ++j) {
- real_array[i*cols + j] = function(i, j);
- imag_array[i*cols + j] = 0.0;
- }
- }
-
- // complexify :
- vcl_complex<double> cplx_array[rows*cols];
- vnl_complexify(real_array, imag_array, cplx_array, rows*cols);
-
- // data as matrices :
- vnl_matrix<vcl_complex<double> > cplx_matrix(cplx_array, rows,cols);
-
- //--------------------------------------------------------------------------------
-
- test_cplx(prx, pry, cplx_matrix, +1);
- test_cplx(prx, pry, cplx_matrix, -1);
-
- //--------------------------------------------------------------------------------
-
- // verify that backwards * forwards is multiplication by .size().
-
- vnl_matrix<vcl_complex<double> > fft_matrix = cplx_matrix;
- vnl_fft_2d<double> fft(cplx_matrix.rows(), cplx_matrix.cols());
- fft.fwd_transform(fft_matrix);
- fft.bwd_transform(fft_matrix);
-
- double error = (fft_matrix - vcl_complex<double>(cplx_matrix.size())*cplx_matrix).fro_norm();
- vcl_cout << "error = " << error << vcl_endl;
- testlib_test_assert ("fwd-bwd error", error < 1e-7); // increase for float
-}
-
-TESTMAIN (test_fft2d);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_functions.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_functions.cxx
deleted file mode 100644
index 9e14bb08ba711aea9bb642f826260c172f8c2375..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_functions.cxx
+++ /dev/null
@@ -1,124 +0,0 @@
-// This is core/vnl/algo/tests/test_functions.cxx
-#include <testlib/testlib_test.h>
-//:
-// \file
-//
-// Test function results for chi-squared cumulative density function.
-// The values are those calculated from this function on solaris, and
-// agree (to 3sf) with those from a mathematical table.
-//
-// Each row is for a different dof, from 1 through 96 in increments of
-// 5 (20 rows).
-//
-// Each column is for a different chi-squared, from 0 though 180 in
-// increments of 20 (10 columns).
-//
-// For readability reasons, the rows are split in 2x 5 rows, with an extra
-// indentation for the second half of each row.
-
-#include <vcl_iostream.h>
-#include <vcl_iomanip.h>
-#include <vcl_cmath.h>
-#include <vcl_ctime.h>
-
-#include <vnl/algo/vnl_chi_squared.h>
-
-double cdf_baseline[] =
-{
- 0.0, 0.9999922488859869, 0.9999999997449120, 0.9999999999999905, 1.0,
- 1.0, 1.0, 1.0, 1.0, 1.0,
- 0.0, 0.9972306042844884, 0.9999995444850495, 0.9999999999549898, 0.9999999999999964,
- 1.0, 1.0, 1.0, 1.0, 1.0,
- 0.0, 0.9546593186683575, 0.9999642248743472, 0.9999999907278384, 0.9999999999985243,
- 0.9999999999999998, 1.0, 1.0, 1.0, 1.0,
- 0.0, 0.7797793533983011, 0.9992214099174926, 0.9999994766265833, 0.9999999998335990,
- 0.9999999999999654, 1.0, 1.0, 1.0, 1.0,
- 0.0, 0.4787387426184652, 0.9925632227010702, 0.9999872283117348, 0.9999999919251898,
- 0.9999999999971140, 0.9999999999999993, 1.0, 1.0, 1.0,
- 0.0, 0.2084435236051257, 0.9609880071450072, 0.9998323023504486, 0.9999997903577246,
- 0.9999999998716507, 0.9999999999999505, 1.0, 1.0, 1.0,
- 0.0, 0.0641963723612628, 0.8709596508694845, 0.9986502140214748, 0.9999966874714471,
- 0.9999999965356298, 0.9999999999979206, 0.9999999999999991, 1.0, 1.0,
- 0.0, 0.0142776135970496, 0.7029716020753263, 0.9927297837948102, 0.9999652953758086,
- 0.9999999382046935, 0.9999999999423534, 0.9999999999999658, 1.0, 1.0,
- 0.0, 0.0023551011658856, 0.4850483796984979, 0.9720590475678458, 0.9997436372936986,
- 0.9999992259610407, 0.9999999988798406, 0.9999999999990349, 0.9999999999999994, 1.0,
- 0.0, 0.0002957368080061, 0.2793886568739744, 0.9194309789050203, 0.9986010626587202,
- 0.9999928735024521, 0.9999999840351245, 0.9999999999800138, 0.9999999999999838, 1.0,
- 0.0, 0.0000289361257476, 0.1331225579748673, 0.8182400707526587, 0.9941486753062340,
- 0.9999500186862800, 0.9999998271108139, 0.9999999996858998, 0.9999999999996467, 0.9999999999999998,
- 0.0, 0.0000022535340508, 0.0524807132282665, 0.6671309159544766, 0.9806610209037141,
- 0.9997251552759223, 0.9999985364764852, 0.9999999961469799, 0.9999999999940054, 0.9999999999999938,
- 0.0, 0.0000001352148233, 0.0172069984403675, 0.4878147556882595, 0.9481646213453065,
- 0.9987862811130113, 0.9999900872908165, 0.9999999622464486, 0.9999999999188310, 0.9999999999998879,
- 0.0, 0.0000000073722077, 0.0047274255385307, 0.3154587502878544, 0.8846964150660444,
- 0.9956070677677689, 0.9999452153818948, 0.9999996987525844, 0.999999999105923, 0.9999999999983556,
- 0.0, 0.0, 0.0010974342908522, 0.1790828046260967, 0.7825800096649158,
- 0.9867347062121498, 0.9997487615314837, 0.9999980101056154, 0.9999999918570519, 0.9999999999800666,
- 0.0, 0.0000000000116404, 0.0002170786956947, 0.0890129923177431, 0.6453492639226499,
- 0.9660451059031501, 0.9990298866149123, 0.9999889634183597, 0.9999999378147725, 0.9999999997975395,
- 0.0, 0.0, 0.0000368857904673, 0.0387583535447800, 0.4894571445703249,
- 0.9252463664134718, 0.9968048573119753, 0.9999479616312844, 0.9999995969280049, 0.9999999982561550,
- 0.0, 0.0000000000000097, 0.0000054252284960, 0.0148195154453572, 0.3381826989258588,
- 0.8564977678812210, 0.9909185509763581, 0.9997891030141784, 0.9999977585673097, 0.9999999871266845,
- 0.0, 0.0, 0.0000006956282422, 0.0049930250351178, 0.2116235676678424,
- 0.7565873548899793, 0.9774854404134016, 0.9992580809522048, 0.9999892041010620, 0.9999999177818010,
- 0.0, 0.0000000000000002, 0.0000000782693028, 0.0014883025723802, 0.1195827092276646,
- 0.6303318279959211, 0.9508233262755118, 0.9977140253664275, 0.9999545743054137, 0.9999995418724694
-};
-
-int test_functions()
-{
- int n;
- double chisq;
- int idx = 0;
- for (n=1; n<100; n+=5)
- {
- for (chisq = 0; chisq < 200; chisq+=20)
- {
- double cdf = vnl_chi_squared_cumulative(chisq,n);
- double err = vcl_fabs(cdf - cdf_baseline[idx++]);
- vcl_cout << "vnl_chi_squared_cumulative(" << chisq << ',' << n << ')';
- testlib_test_assert(" CDF", err < 2e-15);
- if (err >= 2e-15)
- vcl_cout << "Error = " << vcl_setprecision(16) << err << vcl_endl;
- }
- }
-
- vcl_cout << "cdf(7.88,1) = " << vnl_chi_squared_cumulative(7.88,1)
- << " should be about 0.995\n"
- << "cdf(14.8,12) = " << vnl_chi_squared_cumulative(14.8,12)
- << " should be about 0.75\n"
- << "cdf(10.1,19) = " << vnl_chi_squared_cumulative(10.1,19)
- << " should be about 0.05\n"
- << "cdf(39.3,40) = " << vnl_chi_squared_cumulative(39.3,40)
- << " should be about 0.50\n"
- << "cdf(109.1,100) = " << vnl_chi_squared_cumulative(109.1,100)
- << " should be about 0.75\n";
-
- // rand() is not always a good random number generator,
- // so use the following congruential random number generator - PVr
- static unsigned long sample_seed = (unsigned long)vcl_time(0);
-
- double hist1[20];
- for (int i=0; i<20; i++)
- {
- sample_seed = (sample_seed*16807)%2147483647L;
- double u = double(sample_seed)/0x7fffffff; // 0x7fffffff == 2147483711L
- hist1[i] = 10.0+20.0*(u-0.5); // uniform in the interval 0 - 20
- }
- chisq = 0;
- for (int i=0; i<20; i++)
- {
- vcl_cout << i << ' ' << hist1[i] << vcl_endl;
- double delta = hist1[i] - 10.0;
- chisq += delta*delta/(hist1[i] + 10.0);
- }
- vcl_cout << "cdf(" << chisq << ",20) = "
- << vnl_chi_squared_cumulative(chisq,20)
- << " so P(same dist) = " << (1.0 - vnl_chi_squared_cumulative(chisq,20))
- << vcl_endl;
- return 0;
-}
-
-TESTMAIN(test_functions);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_generalized_eigensystem.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_generalized_eigensystem.cxx
deleted file mode 100644
index b4f9c73887a675a5d6b732bedcdfac0527dad9bf..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_generalized_eigensystem.cxx
+++ /dev/null
@@ -1,47 +0,0 @@
-// This is core/vnl/algo/tests/test_generalized_eigensystem.cxx
-#include <testlib/testlib_test.h>
-//:
-// \file
-// \brief test program for generalized eigensystem routines.
-// \author Andrew W. Fitzgibbon, Oxford RRG.
-// \date 29 Aug 96
-
-//-----------------------------------------------------------------------------
-
-#include <vcl_iostream.h>
-#include <vnl/algo/vnl_generalized_eigensystem.h>
-
-void test_generalized_eigensystem()
-{
- double Sdata[36] = {
- 30.0000, -3.4273, 13.9254, 13.7049, -2.4446, 20.2380,
- -3.4273, 13.7049, -2.4446, 1.3659, 3.6702, -0.2282,
- 13.9254, -2.4446, 20.2380, 3.6702, -0.2282, 28.6779,
- 13.7049, 1.3659, 3.6702, 12.5273, -1.6045, 3.9419,
- -2.4446, 3.6702, -0.2282, -1.6045, 3.9419, 2.5821,
- 20.2380, -0.2282, 28.6779, 3.9419, 2.5821, 44.0636,
- };
- double Cdata[36] = {
- 0, 0, 0, 0, 0, 0,
- 0, 0, 0, 0, 0, 0,
- 0, 0, 0, 0, 0, 0,
- 0, 0, 0, 0, 0, 2,
- 0, 0, 0, 0, -1, 0,
- 0, 0, 0, 2, 0, 0,
- };
-
- vnl_matrix<double> S(Sdata, 6,6);
- vnl_matrix<double> C(Cdata, 6,6);
-
- vnl_generalized_eigensystem gev(C, S);
-
- vcl_cout << "V = " << gev.V << vcl_endl
- << "D = " << gev.D << vcl_endl
- << "residual = " << C * gev.V - S * gev.V * gev.D << vcl_endl;
- double err = (C * gev.V - S * gev.V * gev.D).fro_norm();
- vcl_cout << "Recomposition residual = " << err << vcl_endl;
-
- testlib_test_assert("Recomposition residual < 1e-12", err < 1e-12);
-}
-
-TESTMAIN(test_generalized_eigensystem);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_include.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_include.cxx
deleted file mode 100644
index a332486b278b1dc5b2a0098f22e24c4d7d7fb78e..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_include.cxx
+++ /dev/null
@@ -1,48 +0,0 @@
-#include <vnl/algo/vnl_algo_fwd.h>
-
-#include <vnl/algo/vnl_adaptsimpson_integral.h>
-#include <vnl/algo/vnl_adjugate.h>
-#include <vnl/algo/vnl_amoeba.h>
-#include <vnl/algo/vnl_bracket_minimum.h>
-#include <vnl/algo/vnl_brent.h>
-#include <vnl/algo/vnl_brent_minimizer.h>
-#include <vnl/algo/vnl_chi_squared.h>
-#include <vnl/algo/vnl_cholesky.h>
-#include <vnl/algo/vnl_complex_eigensystem.h>
-#include <vnl/algo/vnl_conjugate_gradient.h>
-#include <vnl/algo/vnl_convolve.h>
-#include <vnl/algo/vnl_cpoly_roots.h>
-#include <vnl/algo/vnl_determinant.h>
-#include <vnl/algo/vnl_discrete_diff.h>
-#include <vnl/algo/vnl_fft_1d.h>
-#include <vnl/algo/vnl_fft_2d.h>
-#include <vnl/algo/vnl_fft.h>
-#include <vnl/algo/vnl_fit_parabola.h>
-#include <vnl/algo/vnl_gaussian_kernel_1d.h>
-#include <vnl/algo/vnl_generalized_eigensystem.h>
-#include <vnl/algo/vnl_generalized_schur.h>
-#include <vnl/algo/vnl_lbfgs.h>
-#include <vnl/algo/vnl_ldl_cholesky.h>
-#include <vnl/algo/vnl_levenberg_marquardt.h>
-#include <vnl/algo/vnl_lsqr.h>
-#include <vnl/algo/vnl_matrix_inverse.h>
-#include <vnl/algo/vnl_matrix_update.h>
-#include <vnl/algo/vnl_netlib.h>
-#include <vnl/algo/vnl_orthogonal_complement.h>
-#include <vnl/algo/vnl_powell.h>
-#include <vnl/algo/vnl_qr.h>
-#include <vnl/algo/vnl_real_eigensystem.h>
-#include <vnl/algo/vnl_rnpoly_solve.h>
-#include <vnl/algo/vnl_scatter_3x3.h>
-#include <vnl/algo/vnl_simpson_integral.h>
-#include <vnl/algo/vnl_solve_qp.h>
-#include <vnl/algo/vnl_sparse_lu.h>
-#include <vnl/algo/vnl_sparse_symmetric_eigensystem.h>
-#include <vnl/algo/vnl_svd.h>
-#include <vnl/algo/vnl_svd_economy.h>
-#include <vnl/algo/vnl_symmetric_eigensystem.h>
-
-#include <vnl/algo/vnl_fft_base.h>
-#include <vnl/algo/vnl_fft_prime_factors.h>
-
-int main() { return 0; }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_integral.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_integral.cxx
deleted file mode 100644
index 62c957a4152301e377ec645ba122a081014bd3d1..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_integral.cxx
+++ /dev/null
@@ -1,85 +0,0 @@
-// not used? #include <vcl_iostream.h>
-#include <vcl_cmath.h>
-#include <vnl/vnl_double_3.h>
-#include <vnl/vnl_math.h>
-#include <vnl/vnl_analytic_integrant.h>
-#include <vnl/algo/vnl_simpson_integral.h>
-#include <vnl/algo/vnl_adaptsimpson_integral.h>
-#include <testlib/testlib_test.h>
-
-class my_test_integrant : public vnl_analytic_integrant
-{
- public:
- double f_(double x) { return x/(1+x*x); }
-};
-
-class gaussian_integrant : public vnl_analytic_integrant
-{
- public:
- gaussian_integrant(double sr, double sz, vnl_double_3 p0) : sr_(sr), sz_(sz), p0_(p0)
- {
- oneoversr2_ = 1 / vcl_pow(sr_, 2);
- oneoversz2_ = 1 / vcl_pow(sz_, 2);
- normalizer_ = -vcl_pow(sr_,2) / (sz_ * 2 * vcl_sqrt(2*vnl_math::pi));
- }
-
- void set_varying_params(double theta, double phi)
- {
- theta_ = theta;
- phi_ = phi;
- }
-
- double f_(double rho)
- {
- double x2 = vcl_pow( p0_.get(0) + rho * vcl_sin(theta_) * vcl_cos(phi_), 2 );
- double y2 = vcl_pow( p0_.get(1) + rho * vcl_sin(theta_) * vcl_sin(phi_), 2 );
- double z2 = vcl_pow( p0_.get(2) + rho * vcl_cos(theta_), 2 );
- double term1 = oneoversr2_ * ((x2 + y2) * oneoversr2_ - 2);
- double term2 = vcl_exp(-(x2+y2)*oneoversr2_/2) * vcl_exp(-z2*oneoversz2_/2);
- return normalizer_ * term1 * term2;
- }
-
- protected:
- // fixed parameters
- double sr_;
- double sz_;
- vnl_double_3 p0_;
-
- // varying parameters
- double theta_;
- double phi_;
-
- // pre-calculated values to save computing time
- double oneoversr2_;
- double oneoversz2_;
- double normalizer_;
-};
-
-
-void test_integral()
-{
- my_test_integrant f;
- vnl_simpson_integral simpson_integral;
-
- double a = 0;
- double b = 1;
-
- TEST_NEAR("simpson integral of x/(1+x^2) from 0 to 1 is: ",
- simpson_integral.integral(&f, a, b, 100), 0.5*vcl_log(2.0), 1e-6);
-
- vnl_adaptsimpson_integral adaptsimpson_integral;
-
- TEST_NEAR("adaptive simpson integral of x/(1+x^2) from 0 to 1 is: ",
- adaptsimpson_integral.integral(&f, a, b, 1e-11f), 0.5*vcl_log(2.0), 1e-6);
-
- gaussian_integrant filter_fnct(0.04, 0.1, vnl_double_3(0,0,0));
- filter_fnct.set_varying_params(0, 0);
-
- TEST_NEAR("simpson integral of a filter function from -10 to 10 is: ",
- simpson_integral.integral(&filter_fnct, -10, 10, 1000), 1, 1e-6);
-
- TEST_NEAR("adaptive simpson integral of a filter function from -10 to 10 is: ",
- adaptsimpson_integral.integral(&filter_fnct, -10, 10, 1e-6), 1, 1e-6);
-}
-
-TESTMAIN( test_integral );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_ldl_cholesky.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_ldl_cholesky.cxx
deleted file mode 100644
index 5ba15fa7679a94b6fac8055968cbc91afe01085b..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_ldl_cholesky.cxx
+++ /dev/null
@@ -1,120 +0,0 @@
-// This is core/vnl/algo/tests/test_ldl_cholesky.cxx
-#include <testlib/testlib_test.h>
-#include <vcl_iostream.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_diag_matrix.h>
-#include <vnl/algo/vnl_ldl_cholesky.h>
-#include <vnl/algo/vnl_svd.h>
-#include <vnl/vnl_random.h>
-
-#include "test_util.h"
-
-void test_ldl_cholesky()
-{
- vnl_random rng(1000);
- vnl_matrix<double> A(3,3);
- test_util_fill_random(A.begin(), A.end(), rng);
- A = A * A.transpose();
-
- vnl_matrix<double> I(3,3);
- I.set_identity();
-
- {
- vnl_ldl_cholesky chol(A);
- vnl_matrix<double> A2 = chol.lower_triangle() * vnl_diag_matrix<double>(chol.diagonal()) * chol.upper_triangle();
- testlib_test_assert_near("LDL'=A",(A-A2).fro_norm());
- }
- {
- // Test the rank-1 update
- vnl_vector<double> v(3);
- vnl_matrix<double> Mv(3,1);
- test_util_fill_random(v.begin(), v.end(), rng);
- Mv.set_column(0,v);
- vnl_ldl_cholesky chol(A);
- chol.rank1_update(v);
- vnl_matrix<double> A2 = A + Mv*Mv.transpose();
- vnl_matrix<double> A3 = chol.lower_triangle() * vnl_diag_matrix<double>(chol.diagonal()) * chol.upper_triangle();
- testlib_test_assert_near("Rank 1 update",(A2-A3).fro_norm());
- }
- {
- // Test the rank 2 update
- vnl_matrix<double> W(3,2);
- test_util_fill_random(W.begin(), W.end(), rng);
- vnl_ldl_cholesky chol(A);
- chol.update(W);
- vnl_matrix<double> A2 = A + W*W.transpose();
- vnl_matrix<double> A3 = chol.lower_triangle() * vnl_diag_matrix<double>(chol.diagonal()) * chol.upper_triangle();
- testlib_test_assert_near("Rank 2 update",(A2-A3).fro_norm());
- }
- {
- // Test the rank 4 update
- vnl_matrix<double> W(3,4);
- test_util_fill_random(W.begin(), W.end(), rng);
- vnl_ldl_cholesky chol(A);
- chol.update(W);
- vcl_cout<<"Adding: "<<W*W.transpose()<<vcl_endl;
- vnl_matrix<double> A2 = A + W*W.transpose();
- vnl_matrix<double> A3 = chol.lower_triangle() * vnl_diag_matrix<double>(chol.diagonal()) * chol.upper_triangle();
- testlib_test_assert_near("Rank 2 update",(A2-A3).fro_norm());
- }
-
- {
- vnl_ldl_cholesky chol(A);
- vnl_svd<double> svd(A);
- vcl_cout << "cholesky inverse:\n" << chol.inverse() << '\n'
- << "svd inverse:\n" << svd.inverse() << '\n';
- testlib_test_assert_near("svd.inverse() ~= cholesky.inverse()",
- (chol.inverse() - svd.inverse()).fro_norm());
- }
- {
- vnl_ldl_cholesky chol(A);
- testlib_test_assert_near("Ai * A - I", (chol.inverse() * A - I).fro_norm());
- testlib_test_assert_near("Ai * A - I", (A * chol.inverse() - I).fro_norm());
- }
- {
- vnl_ldl_cholesky chol(A, vnl_ldl_cholesky::estimate_condition);
- testlib_test_assert_near("Ai * A - I", (chol.inverse() * A - I).fro_norm());
- testlib_test_assert_near("Ai * A - I", (A * chol.inverse() - I).fro_norm());
- }
-
- {
- vnl_vector<double> b(3),x0(3),x;
- test_util_fill_random(x0.begin(), x0.end(), rng);
- b=A*x0;
- vnl_ldl_cholesky chol(A);
- x=chol.solve(b);
- testlib_test_assert_near("Solve Ax=b",(x-x0).one_norm(),0,1e-6);
- }
- {
- vnl_vector<double> b(3),x0(3),x;
- test_util_fill_random(x0.begin(), x0.end(), rng);
- vnl_ldl_cholesky chol(A);
- b=chol.lower_triangle()*x0;
- x=b;
- chol.solve_lx(x);
- testlib_test_assert_near("Solve Lx=b",(x-x0).one_norm(),0,1e-6);
- }
- {
- vnl_ldl_cholesky chol(A);
- vnl_vector<double> v(3);
- test_util_fill_random(v.begin(), v.end(), rng);
-
- double res1 = chol.xt_m_inv_x(v);
- double res2 = dot_product(v,chol.inverse()*v);
-
- testlib_test_assert_near("x' * inv(M) * x",res1,res2);
- }
- {
- vnl_ldl_cholesky chol(A);
- vnl_vector<double> v(3);
- test_util_fill_random(v.begin(), v.end(), rng);
-
- double res1 = chol.xt_m_x(v);
- double res2 = dot_product(v,A*v);
-
- testlib_test_assert_near("x' * M * x",res1,res2);
- }
-
-}
-
-TESTMAIN(test_ldl_cholesky);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_levenberg_marquardt.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_levenberg_marquardt.cxx
deleted file mode 100644
index fb5e84d5db96e4874ed3114494ae88a38f3c6ecc..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_levenberg_marquardt.cxx
+++ /dev/null
@@ -1,136 +0,0 @@
-// @author fsm
-#include <vnl/vnl_double_2.h>
-#include <vcl_cmath.h>
-#include <vcl_iostream.h>
-
-#include <testlib/testlib_test.h>
-#include <vnl/vnl_least_squares_function.h>
-#include <vnl/algo/vnl_levenberg_marquardt.h>
-
-struct vnl_rosenbrock : public vnl_least_squares_function
-{
- vnl_rosenbrock(bool with_grad): vnl_least_squares_function(2, 2, with_grad ? use_gradient : no_gradient) {}
-
- void f(vnl_vector<double> const& x, vnl_vector<double>& y) {
- //testlib_test_assert("size of x", x.size() == 2);
- //testlib_test_assert("size of y", y.size() == 2);
- y[0] = 10*(x[1] - x[0]*x[0]);
- y[1] = 1 - x[0];
- }
-
- void gradf(vnl_vector<double> const& x, vnl_matrix<double> &J) {
- //testlib_test_assert("size of x", x.size() == 2);
- //testlib_test_assert("size of J", J.rows() == 2 && J.cols() == 2);
- J[0][0] = -20 * x[0]; J[0][1] = 10;
- J[1][0] = -1; J[1][1] = 0;
- }
-};
-
-struct linear_est : public vnl_least_squares_function
-{
- linear_est(vnl_matrix<double> const& A, vnl_vector<double> const& b, bool with_grad)
- : vnl_least_squares_function(A.cols(), A.rows(), with_grad ? use_gradient : no_gradient),
- A_(A), b_(b)
- { assert(A.rows() == b.size()); }
-
- void f(vnl_vector<double> const& x, vnl_vector<double>& y) {
- y = A_*x -b_;
- }
-
- void gradf(vnl_vector<double> const& /*x*/, vnl_matrix<double> &J) {
- J=A_;
- }
-
- vnl_matrix<double> A_;
- vnl_vector<double> b_;
-};
-
-static
-void do_rosenbrock_test(bool with_grad)
-{
- vnl_rosenbrock f(with_grad);
-
- vnl_double_2 x0(2.7,-1.3);
- vcl_cout << "x0 = " << x0 << vcl_endl;
-
- vnl_levenberg_marquardt lm(f);
-
- vnl_vector<double> x1 = x0.as_vector();
- if (f.has_gradient())
- lm.minimize_using_gradient(x1);
- else
- lm.minimize_without_gradient(x1);
- lm.diagnose_outcome(vcl_cout);
- vcl_cout << "x1 = " << x1 << vcl_endl;
-
- double err = vcl_abs(x1[0] - 1) + vcl_abs(x1[1] - 1);
- vcl_cout << "err = " << err << vcl_endl;
- testlib_test_assert("converged to (1, 1)", err <= 1e-10);
-}
-
-static
-void do_linear_test( bool with_grad )
-{
- vnl_matrix<double> A(6,2,1.0);
- vnl_vector<double> b(6);
-
- A(0,1) = 10;
- A(1,1) = 15;
- A(2,1) = 5.1;
- A(3,1) = 20.2;
- A(4,1) = -0.3;
- A(5,1) = 25;
-
- b(0) = 10;
- b(1) = 15.5;
- b(2) = 4.5;
- b(3) = 21;
- b(4) = 1;
- b(5) = 24.3;
-
- linear_est f(A, b, with_grad);
- vnl_levenberg_marquardt lm(f);
- vnl_vector<double> x(2,-1000.0); // init can be far off
- // since obj function is linear
- // high precision can be achieved
- lm.set_x_tolerance(1e-12);
- lm.set_f_tolerance(1e-12);
- lm.set_g_tolerance(1e-12);
-
- if (f.has_gradient())
- lm.minimize_using_gradient(x);
- else
- lm.minimize_without_gradient(x);
- lm.diagnose_outcome(vcl_cout);
- vcl_cout << "x = " << x << vcl_endl;
-
- vnl_vector<double> true_x(2);
- true_x[1]=0.969684757298943;
- true_x[0]=0.595607200429874;
-
- TEST_NEAR( "converged to true estimate", (true_x-x).two_norm(), 0, 1e-6 );
-
- // now check (inverse of) covariance approximation
- vnl_matrix<double> true_cov(2,2);
- true_cov(0,0)=6;
- true_cov(1,0)=75;
- true_cov(0,1)=75;
- true_cov(1,1)=1384.14;
-
- vnl_matrix<double> covar = lm.get_JtJ();
- vcl_cout << "Cov(x) =\n" << covar << vcl_endl;
- TEST_NEAR( "covariance approximation", (true_cov-covar).array_two_norm(), 0, 1e-5 );
-}
-
-static
-void test_levenberg_marquardt()
-{
- do_rosenbrock_test(true);
- do_rosenbrock_test(false);
-
- do_linear_test(true);
- do_linear_test(false);
-}
-
-TESTMAIN(test_levenberg_marquardt);
-
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_matrix_update.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_matrix_update.cxx
deleted file mode 100644
index cc6fd31c0b18fd514f5a10a9492bcdbafb728d83..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_matrix_update.cxx
+++ /dev/null
@@ -1,32 +0,0 @@
-// This is core/vnl/algo/tests/test_matrix_update.cxx
-#include "test_util.h"
-// not used? #include <vcl_iostream.h>
-#include <testlib/testlib_test.h>
-#include <vnl/algo/vnl_matrix_update.h>
-
-//--------------------------------------------------------------------------------
-
-extern "C" void test_matrix_update()
-{
- unsigned nr=5,nc=7;
- vnl_matrix<double> M(nr,nc), true_M(nr,nc);
- vnl_matrix<double> Ma(nr,1),Mb(1,nc);
- vnl_vector<double> a(nr),b(nc);
-
- for (unsigned i=0;i<nr;++i) { a[i]=1+i; Ma(i,0)=a[i]; }
- for (unsigned i=0;i<nc;++i) { b[i]=i*i-1; Mb(0,i)=b[i]; }
-
- M.fill(0.0);
- vnl_matrix_update(M,a,b);
- true_M = Ma*Mb;
-
- testlib_test_assert_near("M = a*b'",
- (M-true_M).absolute_value_max(),0.0,1e-6);
-
- vnl_matrix_update(M,a,b);
- testlib_test_assert_near("M2 = 2a*b'",
- (M-(true_M*2)).absolute_value_max(),0.0,1e-6);
-}
-
-TESTMAIN(test_matrix_update);
-
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_minimizers.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_minimizers.cxx
deleted file mode 100644
index 37e80bfb4b5a1b2435aefb3c62ca28c8cb068209..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_minimizers.cxx
+++ /dev/null
@@ -1,37 +0,0 @@
-#include <vcl_iostream.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/algo/vnl_brent.h>
-
-#include <testlib/testlib_test.h>
-
-struct cubic : public vnl_cost_function {
- cubic() : vnl_cost_function(1) {}
-
- double f(const vnl_vector<double>& x) {
- vcl_cout << ' ' << x[0];
- return (2 - x[0]) * (2 - x[0]) + 10;
- }
-};
-
-void test_minimizers()
-{
-#if NUMERICAL_RECIPES_CODE_HAS_BEEN_REMOVED
- cubic c;
- vnl_brent b(&c);
- double x = 77;
- vcl_cout << "brent1: ";
- b.minimize_given_bounds(-100, x, 100, 1e-6, &x);
- vcl_cout << vcl_endl;
- TEST_NEAR("brent1", x, 2, 1e-5);
- vcl_cout << "brent2: ";
- x = 77;
- x = b.minimize(x);
- vcl_cout << vcl_endl;
- TEST_NEAR("brent2", x, 2, 1e-5);
-#else
- vcl_cout<<"test_minimizers has been removed until Numerical Recipes code is removed."<<vcl_endl;
-#endif
-
-}
-
-TESTMAIN(test_minimizers);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_powell.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_powell.cxx
deleted file mode 100644
index affbdac7963051055b3d4b4e0a8a2171e5c95abb..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_powell.cxx
+++ /dev/null
@@ -1,172 +0,0 @@
-//: \file
-// \author Kevin de Souza
-// \brief Program to test operation of vnl_powell minimizer.
-// \note Adapted from test_amoeba.cxx
-
-#include <vcl_iostream.h>
-#include <vcl_cassert.h>
-#include <vcl_cmath.h>
-
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_double_2.h>
-#include <vnl/algo/vnl_powell.h>
-#include <vnl/vnl_cost_function.h>
-
-#include <testlib/testlib_test.h>
-
-
-//-------------------------------------------------------------------------
-// nD quadratic function with minimum at min{x[i]} = i;
-//-------------------------------------------------------------------------
-class vnl_test_powell_quadratic : public vnl_cost_function
-{
- public:
- vnl_test_powell_quadratic(int n) : vnl_cost_function(n) {}
-
- double f(const vnl_vector<double>& x)
- {
- assert((int)x.size()==dim);
- double sum = 0;
- for (unsigned int i=0; i<x.size(); ++i)
- sum += (x[i]-i)*(x[i]-i);
- return sum;
- }
-};
-
-
-//-------------------------------------------------------------------------
-// Function f(x,y) = (10*(y - x^2))^2 + (1-x)^2.
-// Minimum at (1,1).
-//-------------------------------------------------------------------------
-class vnl_test_powell_rosenbrock : public vnl_cost_function
-{
- public:
- vnl_test_powell_rosenbrock() : vnl_cost_function(2) {}
-
- double f(const vnl_vector<double>& x)
- {
- double a = 10*(x[1] - x[0]*x[0]);
- double b = 1 - x[0];
- return a*a + b*b;
- }
-
- void gradf(const vnl_vector<double>& x, vnl_vector<double>& g)
- {
- double a = 10*(x[1] - x[0]*x[0]);
- double b = 1 - x[0];
- g[0] = 2 * a * (-20*x[0]) - 2 * b;
- g[1] = 20 * a;
- }
-};
-
-
-//-------------------------------------------------------------------------
-// Test 2D quadratic function
-//-------------------------------------------------------------------------
-static void test_quadratic_2d()
-{
- vcl_cout << "---------------------\n"
- << " test_quadratic_2d()\n"
- << "---------------------\n";
-
- // No. of dimensions
- const unsigned n = 2;
-
- // Start at (1,...,1)
- {
- vnl_vector<double> x(n);
- x.fill(1);
- vnl_test_powell_quadratic cost1(n);
- vnl_powell powell(&cost1);
- powell.minimize(x);
-
- double err=0;
- for (unsigned i=0; i<n; ++i) err += vcl_fabs(x[i]-i);
- TEST_NEAR("Starting at (1,1,1...)", err, 0.0, 1e-5);
- vcl_cout<<"Number of evaluations: "<<powell.get_num_evaluations()<<vcl_endl;
- }
-
- // Start at x[i]=n-i
- {
- vnl_vector<double> x(n);
- for (unsigned i=0; i<n; ++i) x[i] = static_cast<int>(n) - static_cast<int>(i);
- vnl_test_powell_quadratic cost1(n);
- vnl_powell powell(&cost1);
- powell.minimize(x);
-
- double err=0;
- for (unsigned i=0; i<n; ++i) err += vcl_fabs(x[i]-i);
- TEST_NEAR("Starting at (1,1,1...)", err, 0.0, 1e-5);
- vcl_cout<<"Number of evaluations: "<<powell.get_num_evaluations()<<vcl_endl;
- }
- vcl_cout << vcl_endl;
-}
-
-
-//-------------------------------------------------------------------------
-// Test quadratic functions with various numbers of dimensions
-//-------------------------------------------------------------------------
-static void test_quadratic_nd()
-{
- // Max. no. of dimensions
- const unsigned max_n = 16;
- for (unsigned n=1; n<max_n; ++n)
- {
- vcl_cout << "-------------------\n"
- << " test_quadratic_" << n << "d\n"
- << "-------------------\n";
-
- // Start at (1,1,...,1)
- vnl_vector<double> x(n);
- x.fill(1);
- vnl_test_powell_quadratic cost1(n);
- vnl_powell powell(&cost1);
- powell.minimize(x);
-
- double err=0;
- for (unsigned i=0; i<n; ++i) err+=vcl_fabs(x[i]-i);
- TEST_NEAR("Starting at (1,1,1...)", err, 0.0, 1e-5);
- vcl_cout << "Number of evaluations: " << powell.get_num_evaluations()
- << vcl_endl << vcl_endl;
- }
-}
-
-
-//-------------------------------------------------------------------------
-// Test rosenbrock 2d function
-//-------------------------------------------------------------------------
-static void test_rosenbrock_2d()
-{
- vcl_cout << "----------------------\n"
- << " test_rosenbrock_2d()\n"
- << "----------------------\n";
- vnl_test_powell_rosenbrock c;
- vnl_double_2 xmin(1.0, 1.0); // true minimum
- vnl_powell powell(&c);
- vnl_double_2 x0(-2, 2); // initial x
- vnl_vector<double> x = x0.as_vector();
-
- powell.minimize(x);
- double r = (x-xmin).magnitude();
- TEST_NEAR("test_rosenbrock_2d", r, 0, 1e-6);
- vcl_cout << "Number of evaluations: " << powell.get_num_evaluations()
- << vcl_endl << vcl_endl;
-}
-
-
-//-------------------------------------------------------------------------
-// Main test function
-//-------------------------------------------------------------------------
-void test_powell()
-{
-#if NUMERICAL_RECIPES_CODE_HAS_BEEN_REMOVED
- test_quadratic_2d();
- test_quadratic_nd();
- test_rosenbrock_2d();
-#else
- vcl_cout<<"test_powell has been removed until Numerical Recipes code is removed."<<vcl_endl;
-#endif
-}
-
-
-TESTMAIN(test_powell);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_qr.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_qr.cxx
deleted file mode 100644
index e4f4e569449f3fd9b488b61954d88f86ebdcdcfa..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_qr.cxx
+++ /dev/null
@@ -1,180 +0,0 @@
-// This is core/vnl/algo/tests/test_qr.cxx
-#include "test_util.h"
-#include <vcl_iostream.h>
-#include <vcl_complex.h>
-#include <testlib/testlib_test.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_random.h>
-#include <vnl/vnl_matlab_print.h>
-#include <vnl/algo/vnl_qr.h>
-
-//--------------------------------------------------------------------------------
-
-void test_matrix(char const* name, const vnl_matrix<double>& A, double det = 0)
-{
- vnl_qr<double> qr(A);
-
- vcl_string n(name); n+= ": ";
- testlib_test_assert_near(n+"Q * R residual", (qr.Q() * qr.R() - A).fro_norm());
- testlib_test_assert(n+"Q * Q = I", (qr.Q().transpose() * qr.Q()).is_identity(1e-12));
-
- if (det)
- testlib_test_assert_near(n+ "Determinant", qr.determinant(), det, 1e-9);
-}
-
-void double_test()
-{
- double A_data[] = {
- 89, 21, 27,
- 62, 71, 0,
- 84, 13, 41,
- 16, 9, 3,
- };
- vnl_matrix<double> A(A_data, 4,3);
-
- test_matrix("A", A);
- test_matrix("AT", A.transpose());
-
- test_matrix("A-102", A-102);
- test_matrix("AT-12", A.transpose() - 12);
-
- test_matrix("AA'*1e-3 - 1", A*A.transpose()*1e-3 - 1, -2.77433958399998);
-
- double b_data[] = {
- 68, 39, 39, 50
- };
-
- vnl_vector<double> b(b_data, 4);
- vnl_qr<double> qr(A);
-
- vnl_matlab_print(vcl_cout, qr.Q(), "Q");
- vnl_matlab_print(vcl_cout, qr.R(), "R");
-
- vnl_vector<double> x = qr.solve(b);
-
- double res = (A * x - b).magnitude();
-
- testlib_test_assert_near("Solve residual", res, 37.8841, 1e-3);
-
- {
- double S_data[] = {
- 89, 21, 27,
- 62, 71, 0,
- 84, 13, 41,
- };
- vnl_matrix<double> S(S_data, 3,3);
- test_matrix("S", S, 66431);
- test_matrix("S-100", S-100, -79869);
- }
-}
-
-//--------------------------------------------------------------------------------
-
-inline float eps(float *) { return 1e-5f; }
-inline double eps(double *) { return 1e-12; }
-inline float eps(vcl_complex<float> *) { return 1e-5f; }
-inline double eps(vcl_complex<double> *) { return 1e-12; }
-#define rounding_epsilon(T) ::eps((T*)0)
-
-template <class T>
-void new_test(T *)
-{
- vnl_random rng(1000);
- unsigned m = 5; // m must be >= n when using the netlib QR algorithms,
- unsigned n = 5; // but n >= m for a random A and b to have exact solution.
-
- vnl_matrix<T> A(m, n);
- test_util_fill_random(A.begin(), A.end(), rng);
- vnl_matlab_print(vcl_cout, A, "A");
-
- vnl_vector<T> b(m);
- test_util_fill_random(b.begin(), b.end(), rng);
- vnl_matlab_print(vcl_cout, b, "b");
-
- vnl_qr<T> qr(A);
- vnl_matrix<T> const &Q = qr.Q();
- vnl_matrix<T> const &R = qr.R();
- vnl_vector<T> x = qr.solve(b);
-
- vnl_matlab_print(vcl_cout, Q, "Q");
- vnl_matlab_print(vcl_cout, R, "R");
- vnl_matlab_print(vcl_cout, x, "x");
-
- vnl_matrix<T> QR(Q * R);
- vnl_matlab_print(vcl_cout, QR, "QR");
-
- vnl_matrix<T> I(m, m); I.set_identity();
- testlib_test_assert_near("||Q'Q - 1||", (Q.conjugate_transpose()*Q - I).fro_norm(), 0, rounding_epsilon(T));
- testlib_test_assert_near("||A - QR||", (A - QR).fro_norm(), 0, rounding_epsilon(T));
- testlib_test_assert_near("||Ax - b||", (A*x - b).two_norm(), 0, rounding_epsilon(T));
-}
-
-#define inst(T) \
-template void new_test(T *);
-inst(float);
-inst(double);
-inst(vcl_complex<float>);
-inst(vcl_complex<double>);
-#undef inst
-
-void complex_test()
-{
- typedef vcl_complex<double> ct;
-
- vnl_matrix<ct> A(5,4); // #rows must be >= #cols when using netlib QR decomposition
- vnl_vector<ct> b(5);
-
- A(0,0)=ct( -0.1370,0.5573);
- A(1,0)=ct( 0.6187,0.3482);
- A(2,0)=ct( -0.4402,0.6825);
- A(3,0)=ct( 0.7284,0.7294);
- A(4,0)=ct( -0.5840,0.5004);
- A(0,1)=ct( -0.4108,0.7201);
- A(1,1)=ct( -0.5621,0.6056);
- A(2,1)=ct( 0.4312,0.1262);
- A(3,1)=ct( 0.9796,0.6049);
- A(4,1)=ct( -0.1388,0.4999);
- A(0,2)=ct( 0.7219,0.5105);
- A(1,2)=ct( 0.9562,0.7896);
- A(2,2)=ct( -0.1356,0.2092);
- A(3,2)=ct( -0.0847,0.7457);
- A(4,2)=ct( 0.9721,0.5243);
- A(0,3)=ct( 0.2085,0.3057);
- A(1,3)=ct( -0.0903,0.5162);
- A(2,3)=ct( -0.8424,0.5799);
- A(3,3)=ct( -0.6948,0.0472);
- A(4,3)=ct( 0.8900,0.5085);
-
- b(0)=ct( 0.9764,0.2280);
- b(1)=ct( 0.5994,0.0454);
- b(2)=ct(-0.2385,0.4884);
- b(3)=ct( 0.0538,0.0402);
- b(4)=ct( 1.8634,.64558);
- vnl_matlab_print(vcl_cout, b, "b");
- vnl_qr<ct> qr(A); vnl_matlab_print(vcl_cout, A, "A");
- const vnl_matrix<ct>& Q = qr.Q(); vnl_matlab_print(vcl_cout, Q, "Q");
- const vnl_matrix<ct>& R = qr.R(); vnl_matlab_print(vcl_cout, R, "R");
- vnl_vector<ct> x = qr.solve(b); vnl_matlab_print(vcl_cout, x, "solve");
- testlib_test_assert_near("||Ax - b||", (A*x - b).two_norm(), 0, 1e-5);
-}
-
-//--------------------------------------------------------------------------------
-
-extern "C" void test_qr()
-{
- vcl_cout << "-------------------- double_complex\n";
- complex_test();
- vcl_cout << "-------------------- double\n";
- double_test();
-
- vcl_cout << "-------------------- float\n";
- new_test((float*)0);
- vcl_cout << "-------------------- double\n";
- new_test((double*)0);
- vcl_cout << "-------------------- float_complex\n";
- new_test((vcl_complex<float>*)0);
- vcl_cout << "-------------------- double_complex\n";
- new_test((vcl_complex<double>*)0);
-}
-
-TESTMAIN(test_qr);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_qsvd.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_qsvd.cxx
deleted file mode 100644
index cdcad98753c516efa1750a2a97d6111b166756a4..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_qsvd.cxx
+++ /dev/null
@@ -1,48 +0,0 @@
-#include <vnl/vnl_math.h> // vnl_math_abs()
-#include <testlib/testlib_test.h>
-#undef printf // to work around a bug in libintl.h
-#include <vcl_cstdio.h>
-
-#include "v3p_netlib.h"
-
-static
-void test_qsvd()
-{
- float AA[9]={2.f/3, -1.36f/3, .2f/3, 2.8f/3, .4f/3, 1.f/3, 1, .16f, -.2f};
- float BB[9]={.16f, -.224f, -.768f, .8f, .36f, -.48f, 1.12f, -.168f, -.576f};
- float U[9], V[9], Q[9], Alpha[3], Beta[3], Work[12];
- long m=3, n=3, p=3, k, l, Iwork[3], info;
-
- vcl_printf("m = 3, n = 3, p = 3\n");
- v3p_netlib_sggsvd_(
- "U", "V", "Q", &m, &n, &p, &k, &l, AA, &n, BB, &n, Alpha, Beta,
- U, &n, V, &n, Q, &n, Work, Iwork, &info, 1, 1, 1
- );
-
- vcl_printf("k = %ld, l = %ld, return = %ld\n", k, l, info);
- testlib_test_assert("(k,l) must be (0,3)", k==0 && l==3);
- testlib_test_assert("sggsvd should return 0", info==0);
-
- vcl_printf("U = %12.7f %12.7f %12.7f\n %12.7f %12.7f %12.7f\n %12.7f %12.7f %12.7f\n",
- U[0], U[3], U[6], U[1], U[4], U[7], U[2], U[5], U[8]);
- vcl_printf("V = %12.7f %12.7f %12.7f\n %12.7f %12.7f %12.7f\n %12.7f %12.7f %12.7f\n",
- V[0], V[3], V[6], V[1], V[4], V[7], V[2], V[5], V[8]);
- vcl_printf("Q = %12.7f %12.7f %12.7f\n %12.7f %12.7f %12.7f\n %12.7f %12.7f %12.7f\n",
- Q[0], Q[3], Q[6], Q[1], Q[4], Q[7], Q[2], Q[5], Q[8]);
- vcl_printf("D1 = diag(%12g %12g %12g)\n", Alpha[0], Alpha[1], Alpha[2]);
- vcl_printf("D2 = diag(%12g %12g %12g)\n", Beta[0], Beta[1], Beta[2]);
- vcl_printf("R = %12.7f %12.7f %12.7f\n %12.7f %12.7f %12.7f\n %12.7f %12.7f %12.7f\n",
- AA[0], AA[3], AA[6], AA[1], AA[4], AA[7], AA[2], AA[5], AA[8]);
-
- testlib_test_assert("D1 must be (0.6,0.8,0.6)",
- vnl_math_abs(Alpha[0]-0.6)<1e-6 &&
- vnl_math_abs(Alpha[1]-0.8)<1e-6 &&
- vnl_math_abs(Alpha[2]-0.6)<1e-6);
-
- testlib_test_assert("D2 must be (0.8,0.6,0.8)",
- vnl_math_abs(Beta[0]-0.8)<1e-6 &&
- vnl_math_abs(Beta[1]-0.6)<1e-6 &&
- vnl_math_abs(Beta[2]-0.8)<1e-6);
-}
-
-TESTMAIN(test_qsvd);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_rank.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_rank.cxx
deleted file mode 100644
index d192c49115d8df9dad4b8209f06b0102c150ad65..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_rank.cxx
+++ /dev/null
@@ -1,227 +0,0 @@
-#include <vnl/vnl_matrix.h>
-#include <vnl/algo/vnl_svd.h>
-#include <vnl/vnl_rank.h>
-
-#include <testlib/testlib_test.h>
-
-inline int svd_rank(vnl_matrix<double> const& M) { return vnl_svd<double>(M, 1e-8).rank(); }
-
-void test_rank()
-{
- // 1x1 double
- vnl_matrix<double> m11(1,1, 0.0); // all zero matrix
- TEST("zero_1x1.vnl_svd().rank()", svd_rank(m11), 0);
- TEST("vnl_rank(zero_1x1)", vnl_rank(m11), 0);
- m11[0][0] = -3.0;
- TEST("-3_1x1.vnl_svd().rank()", svd_rank(m11), 1);
- TEST("vnl_rank(-3_1x1)", vnl_rank(m11), 1);
- TEST("vnl_rank(-3_1x1, vnl_rank_row)", vnl_rank(m11, vnl_rank_row), 1);
- TEST("vnl_rank(-3_1x1, vnl_rank_column)", vnl_rank(m11, vnl_rank_column), 1);
-
- // 1x1 int
- vnl_matrix<int> i11(1,1, 0); // all zero matrix
- TEST("vnl_rank(int_zero_1x1)", vnl_rank(i11), 0);
- i11[0][0] = -3;
- TEST("vnl_rank(int_-3_1x1)", vnl_rank(i11), 1);
- TEST("vnl_rank(int_-3_1x1, vnl_rank_row)", vnl_rank(i11, vnl_rank_row), 1);
- TEST("vnl_rank(int_-3_1x1, vnl_rank_column)", vnl_rank(i11, vnl_rank_column), 1);
-
- // 1x2 double
- vnl_matrix<double> m12(1,2, 0.0); // all zero matrix
- TEST("zero_1x2.vnl_svd().rank()", svd_rank(m12), 0);
- TEST("vnl_rank(zero_1x2)", vnl_rank(m12), 0);
- TEST("vnl_rank(zero_1x2, vnl_rank_row)", vnl_rank(m12, vnl_rank_row), 0);
- TEST("vnl_rank(zero_1x2, vnl_rank_column)", vnl_rank(m12, vnl_rank_column), 0);
- m12[0][1] = -2.0;
- TEST("0-2_1x2.vnl_svd().rank()", svd_rank(m12), 1);
- TEST("vnl_rank(0-2_1x2)", vnl_rank(m12), 1);
- TEST("vnl_rank(0-2_1x2, vnl_rank_row)", vnl_rank(m12, vnl_rank_row), 1);
- TEST("vnl_rank(0-2_1x2, vnl_rank_column)", vnl_rank(m12, vnl_rank_column), 1);
- m12[0][0] = 1.0;
- TEST("1-2_1x2.vnl_svd().rank()", svd_rank(m12), 1);
- TEST("vnl_rank(1-2_1x2)", vnl_rank(m12), 1);
- TEST("vnl_rank(1-2_1x2, vnl_rank_row)", vnl_rank(m12, vnl_rank_row), 1);
- TEST("vnl_rank(1-2_1x2, vnl_rank_column)", vnl_rank(m12, vnl_rank_column), 1);
-
- // 1x2 int
- vnl_matrix<int> i12(1,2, 0); // all zero matrix
- TEST("vnl_rank(int_zero_1x2)", vnl_rank(i12), 0);
- TEST("vnl_rank(int_zero_1x2, vnl_rank_row)", vnl_rank(i12, vnl_rank_row), 0);
- TEST("vnl_rank(int_zero_1x2, vnl_rank_column)", vnl_rank(i12, vnl_rank_column), 0);
- i12[0][1] = -2;
- TEST("vnl_rank(int_0-2_1x2)", vnl_rank(i12), 1);
- TEST("vnl_rank(int_0-2_1x2, vnl_rank_row)", vnl_rank(i12, vnl_rank_row), 1);
- TEST("vnl_rank(int_0-2_1x2, vnl_rank_column)", vnl_rank(i12, vnl_rank_column), 1);
- i12[0][0] = 1;
- TEST("vnl_rank(int_1-2_1x2)", vnl_rank(i12), 1);
- TEST("vnl_rank(int_1-2_1x2, vnl_rank_row)", vnl_rank(i12, vnl_rank_row), 1);
- TEST("vnl_rank(int_1-2_1x2, vnl_rank_column)", vnl_rank(i12, vnl_rank_column), 1);
-
- // 2x2 double
- vnl_matrix<double> m22(2,2, 0.0); // all zero matrix
- TEST("zero_2x2.vnl_svd().rank()", svd_rank(m22), 0);
- TEST("vnl_rank(zero_2x2)", vnl_rank(m22), 0);
- TEST("vnl_rank(zero_2x2, vnl_rank_row)", vnl_rank(m22, vnl_rank_row), 0);
- TEST("vnl_rank(zero_2x2, vnl_rank_column)", vnl_rank(m22, vnl_rank_column), 0);
- m22[0][1] = 6.0;
- TEST("0300_2x2.vnl_svd().rank()", svd_rank(m22), 1);
- TEST("vnl_rank(0600_2x2)", vnl_rank(m22), 1);
- TEST("vnl_rank(0600_2x2, vnl_rank_row)", vnl_rank(m22, vnl_rank_row), 1);
- TEST("vnl_rank(0600_2x2, vnl_rank_column)", vnl_rank(m22, vnl_rank_column), 1);
- m22[1][0] = -1.0;
- TEST("06-10_2x2.vnl_svd().rank()", svd_rank(m22), 2);
- TEST("vnl_rank(06-10_2x2)", vnl_rank(m22), 2);
- TEST("vnl_rank(06-10_2x2, vnl_rank_row)", vnl_rank(m22, vnl_rank_row), 2);
- TEST("vnl_rank(06-10_2x2, vnl_rank_column)", vnl_rank(m22, vnl_rank_column), 2);
- m22[0][0] = -2.0; m22[1][1] = 3.0;
- TEST("-26-13_2x2.vnl_svd().rank()", svd_rank(m22), 1);
- TEST("vnl_rank(-26-13_2x2)", vnl_rank(m22), 1);
- TEST("vnl_rank(-26-13_2x2, vnl_rank_row)", vnl_rank(m22, vnl_rank_row), 1);
- TEST("vnl_rank(-26-13_2x2, vnl_rank_column)", vnl_rank(m22, vnl_rank_column), 1);
- m22[1][0] = -3.0; m22[1][1] = 9.0;
- TEST("-26-39_2x2.vnl_svd().rank()", svd_rank(m22), 1);
- TEST("vnl_rank(-26-39_2x2)", vnl_rank(m22), 1);
- TEST("vnl_rank(-26-39_2x2, vnl_rank_row)", vnl_rank(m22, vnl_rank_row), 1);
- TEST("vnl_rank(-26-39_2x2, vnl_rank_column)", vnl_rank(m22, vnl_rank_column), 1);
- m22 *= 2.0; // now the pivot element will never be 1
- TEST("-4_12_-6_18_2x2.vnl_svd().rank()", svd_rank(m22), 1);
- TEST("vnl_rank(-4_12_-6_18_2x2)", vnl_rank(m22), 1);
- TEST("vnl_rank(-4_12_-6_18_2x2, vnl_rank_row)", vnl_rank(m22, vnl_rank_row), 1);
- TEST("vnl_rank(-4_12_-6_18_2x2, vnl_rank_column)", vnl_rank(m22, vnl_rank_column), 1);
-
- // 2x2 int
- vnl_matrix<int> i22(2,2, 0); // all zero matrix
- TEST("vnl_rank(int_zero_2x2)", vnl_rank(i22), 0);
- TEST("vnl_rank(int_zero_2x2, vnl_rank_row)", vnl_rank(i22, vnl_rank_row), 0);
- TEST("vnl_rank(int_zero_2x2, vnl_rank_column)", vnl_rank(i22, vnl_rank_column), 0);
- i22[0][1] = 6;
- TEST("vnl_rank(int_0600_2x2)", vnl_rank(i22), 1);
- TEST("vnl_rank(int_0600_2x2, vnl_rank_row)", vnl_rank(i22, vnl_rank_row), 1);
- TEST("vnl_rank(int_0600_2x2, vnl_rank_column)", vnl_rank(i22, vnl_rank_column), 1);
- i22[1][0] = -1;
- TEST("vnl_rank(int_06-10_2x2)", vnl_rank(i22), 2);
- TEST("vnl_rank(int_06-10_2x2, vnl_rank_row)", vnl_rank(i22, vnl_rank_row), 2);
- TEST("vnl_rank(int_06-10_2x2, vnl_rank_column)", vnl_rank(i22, vnl_rank_column), 2);
- i22[0][0] = -2; i22[1][1] = 3;
- TEST("vnl_rank(int_-26-13_2x2)", vnl_rank(i22), 1);
- TEST("vnl_rank(int_-26-13_2x2, vnl_rank_row)", vnl_rank(i22, vnl_rank_row), 1);
- TEST("vnl_rank(int_-26-13_2x2, vnl_rank_column)", vnl_rank(i22, vnl_rank_column), 1);
- i22[1][0] = -3; i22[1][1] = 9;
- TEST("vnl_rank(int_-26-39_2x2)", vnl_rank(i22), 1);
- TEST("vnl_rank(int_-26-39_2x2, vnl_rank_row)", vnl_rank(i22, vnl_rank_row), 1);
- TEST("vnl_rank(int_-26-39_2x2, vnl_rank_column)", vnl_rank(i22, vnl_rank_column), 1);
- i22 *= 2; // now the pivot element will never be 1
- TEST("vnl_rank(-4_12_-6_18_2x2)", vnl_rank(i22), 1);
- TEST("vnl_rank(-4_12_-6_18_2x2, vnl_rank_row)", vnl_rank(i22, vnl_rank_row), 1);
- TEST("vnl_rank(-4_12_-6_18_2x2, vnl_rank_column)", vnl_rank(i22, vnl_rank_column), 1);
-
- // 3x2 double
- vnl_matrix<double> m32(3,2, 0.0); // all zero matrix
- TEST("zero_3x2.vnl_svd().rank()", svd_rank(m32), 0);
- TEST("vnl_rank(zero_3x2)", vnl_rank(m32), 0);
- TEST("vnl_rank(zero_3x2, vnl_rank_row)", vnl_rank(m32, vnl_rank_row), 0);
- TEST("vnl_rank(zero_3x2, vnl_rank_column)", vnl_rank(m32, vnl_rank_column), 0);
- m32[0][1] = 6.0;
- TEST("3x2.vnl_svd().rank()", svd_rank(m32), 1);
- TEST("vnl_rank(3x2)", vnl_rank(m32), 1);
- TEST("vnl_rank(3x2, vnl_rank_row)", vnl_rank(m32, vnl_rank_row), 1);
- TEST("vnl_rank(3x2, vnl_rank_column)", vnl_rank(m32, vnl_rank_column), 1);
- m32[2][0] = -1.0;
- TEST("3x2.vnl_svd().rank()", svd_rank(m32), 2);
- TEST("vnl_rank(3x2)", vnl_rank(m32), 2);
- TEST("vnl_rank(3x2, vnl_rank_row)", vnl_rank(m32, vnl_rank_row), 2);
- TEST("vnl_rank(3x2, vnl_rank_column)", vnl_rank(m32, vnl_rank_column), 2);
- m32[1][0] = 3.0; m32[2][1] = 1.0;
- TEST("3x2.vnl_svd().rank()", svd_rank(m32), 2);
- TEST("vnl_rank(3x2)", vnl_rank(m32), 2);
- TEST("vnl_rank(3x2, vnl_rank_row)", vnl_rank(m32, vnl_rank_row), 2);
- TEST("vnl_rank(3x2, vnl_rank_column)", vnl_rank(m32, vnl_rank_column), 2);
- m32[0][0] = -6.0; m32[1][1] = -3.0;
- TEST("3x2.vnl_svd().rank()", svd_rank(m32), 1);
- TEST("vnl_rank(3x2)", vnl_rank(m32), 1);
- TEST("vnl_rank(3x2, vnl_rank_row)", vnl_rank(m32, vnl_rank_row), 1);
- TEST("vnl_rank(3x2, vnl_rank_column)", vnl_rank(m32, vnl_rank_column), 1);
- m32 *= 2.0;
- TEST("3x2.vnl_svd().rank()", svd_rank(m32), 1);
- TEST("vnl_rank(3x2)", vnl_rank(m32), 1);
-
- // 3x2 int
- vnl_matrix<int> i32(3,2, 0); // all zero matrix
- TEST("vnl_rank(zero_3x2)", vnl_rank(i32), 0);
- TEST("vnl_rank(zero_3x2, vnl_rank_row)", vnl_rank(i32, vnl_rank_row), 0);
- TEST("vnl_rank(zero_3x2, vnl_rank_column)", vnl_rank(i32, vnl_rank_column), 0);
- i32[0][1] = 6;
- TEST("vnl_rank(3x2)", vnl_rank(i32), 1);
- TEST("vnl_rank(3x2, vnl_rank_row)", vnl_rank(i32, vnl_rank_row), 1);
- TEST("vnl_rank(3x2, vnl_rank_column)", vnl_rank(i32, vnl_rank_column), 1);
- i32[2][0] = -1;
- TEST("vnl_rank(3x2)", vnl_rank(i32), 2);
- TEST("vnl_rank(3x2, vnl_rank_row)", vnl_rank(i32, vnl_rank_row), 2);
- TEST("vnl_rank(3x2, vnl_rank_column)", vnl_rank(i32, vnl_rank_column), 2);
- i32[1][0] = 3; i32[2][1] = 1;
- TEST("vnl_rank(3x2)", vnl_rank(i32), 2);
- TEST("vnl_rank(3x2, vnl_rank_row)", vnl_rank(i32, vnl_rank_row), 2);
- TEST("vnl_rank(3x2, vnl_rank_column)", vnl_rank(i32, vnl_rank_column), 2);
- i32[0][0] = -6; i32[1][1] = -3;
- TEST("vnl_rank(3x2)", vnl_rank(i32), 1);
- TEST("vnl_rank(3x2, vnl_rank_row)", vnl_rank(i32, vnl_rank_row), 1);
- TEST("vnl_rank(3x2, vnl_rank_column)", vnl_rank(i32, vnl_rank_column), 1);
- i32 *= 2;
- TEST("vnl_rank(3x2)", vnl_rank(i32), 1);
-
- // 3x3 double
- vnl_matrix<double> m33(3,3, 0.0); // all zero matrix
- TEST("zero_3x3.vnl_svd().rank()", svd_rank(m33), 0);
- TEST("vnl_rank(zero_3x3)", vnl_rank(m33), 0);
- TEST("vnl_rank(zero_3x3, vnl_rank_row)", vnl_rank(m33, vnl_rank_row), 0);
- TEST("vnl_rank(zero_3x3, vnl_rank_column)", vnl_rank(m33, vnl_rank_column), 0);
- m33[0][1] = 6.0; m33[0][2] = -2.0;
- TEST("3x3.vnl_svd().rank()", svd_rank(m33), 1);
- TEST("vnl_rank(3x3)", vnl_rank(m33), 1);
- TEST("vnl_rank(3x3, vnl_rank_row)", vnl_rank(m33, vnl_rank_row), 1);
- TEST("vnl_rank(3x3, vnl_rank_column)", vnl_rank(m33, vnl_rank_column), 1);
- m33[1][2] = -1.0; m33[1][0] = 7.0;
- TEST("3x3.vnl_svd().rank()", svd_rank(m33), 2);
- TEST("vnl_rank(3x3)", vnl_rank(m33), 2);
- TEST("vnl_rank(3x3, vnl_rank_row)", vnl_rank(m33, vnl_rank_row), 2);
- TEST("vnl_rank(3x3, vnl_rank_column)", vnl_rank(m33, vnl_rank_column), 2);
- m33[2][0] = 7.0;
- TEST("3x3.vnl_svd().rank()", svd_rank(m33), 3);
- TEST("vnl_rank(3x3)", vnl_rank(m33), 3);
- TEST("vnl_rank(3x3, vnl_rank_row)", vnl_rank(m33, vnl_rank_row), 3);
- TEST("vnl_rank(3x3, vnl_rank_column)", vnl_rank(m33, vnl_rank_column), 3);
- m33[2][1] = 6.0; m33[2][2] = -3.0;
- TEST("3x3.vnl_svd().rank()", svd_rank(m33), 2);
- TEST("vnl_rank(3x3)", vnl_rank(m33), 2);
- m33 *= 2.0;
- TEST("3x3.vnl_svd().rank()", svd_rank(m33), 2);
- TEST("vnl_rank(3x3)", vnl_rank(m33), 2);
-
- // 3x3 int
- vnl_matrix<int> i33(3,3, 0); // all zero matrix
- TEST("vnl_rank(int_3x3)", vnl_rank(i33), 0);
- TEST("vnl_rank(int_3x3, vnl_rank_row)", vnl_rank(i33, vnl_rank_row), 0);
- TEST("vnl_rank(int_3x3, vnl_rank_column)", vnl_rank(i33, vnl_rank_column), 0);
- i33[0][1] = 6; i33[0][2] = -2;
- TEST("vnl_rank(int_3x3)", vnl_rank(i33), 1);
- TEST("vnl_rank(int_3x3, vnl_rank_row)", vnl_rank(i33, vnl_rank_row), 1);
- TEST("vnl_rank(int_3x3, vnl_rank_column)", vnl_rank(i33, vnl_rank_column), 1);
- i33[1][2] = -1; i33[1][0] = 7;
- TEST("vnl_rank(int_3x3)", vnl_rank(i33), 2);
- TEST("vnl_rank(int_3x3, vnl_rank_row)", vnl_rank(i33, vnl_rank_row), 2);
- TEST("vnl_rank(int_3x3, vnl_rank_column)", vnl_rank(i33, vnl_rank_column), 2);
- i33[2][0] = 7;
- TEST("vnl_rank(int_3x3)", vnl_rank(i33), 3);
- TEST("vnl_rank(int_3x3, vnl_rank_row)", vnl_rank(i33, vnl_rank_row), 3);
- TEST("vnl_rank(int_3x3, vnl_rank_column)", vnl_rank(i33, vnl_rank_column), 3);
- i33[2][1] = 6; i33[2][2] = -3;
- TEST("vnl_rank(int_3x3)", vnl_rank(i33), 2);
- TEST("vnl_rank(int_3x3, vnl_rank_row)", vnl_rank(i33, vnl_rank_row), 2);
- TEST("vnl_rank(int_3x3, vnl_rank_column)", vnl_rank(i33, vnl_rank_column), 2);
- i33 *= 2;
- TEST("vnl_rank(int_3x3)", vnl_rank(i33), 2);
- TEST("vnl_rank(int_3x3, vnl_rank_row)", vnl_rank(i33, vnl_rank_row), 2);
- TEST("vnl_rank(int_3x3, vnl_rank_column)", vnl_rank(i33, vnl_rank_column), 2);
-}
-
-TESTMAIN(test_rank);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_real_eigensystem.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_real_eigensystem.cxx
deleted file mode 100644
index 0d83684841779e420c6b6bf1984c338038e73a6c..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_real_eigensystem.cxx
+++ /dev/null
@@ -1,73 +0,0 @@
-// This is core/vnl/algo/tests/test_real_eigensystem.cxx
-#include <testlib/testlib_test.h>
-//:
-// \file
-// \author Andrew W. Fitzgibbon, Oxford RRG
-// \date 23 Jan 96
-//
-//-----------------------------------------------------------------------------
-#include <vcl_iostream.h>
-#include <vcl_complex.h>
-#include <vnl/vnl_complexify.h>
-#include <vnl/algo/vnl_real_eigensystem.h>
-
-static void test_6x6()
-{
- double Sdata[36] = {
- 30.0000, -3.4273, 13.9254, 13.7049, -2.4446, 20.2380,
- -3.4273, 13.7049, -2.4446, 1.3659, 3.6702, -0.2282,
- 13.9254, -2.4446, 20.2380, 3.6702, -0.2282, 28.6779,
- 13.7049, 1.3659, 3.6702, 12.5273, -1.6045, 3.9419,
- -2.4446, 3.6702, -0.2282, -1.6045, 3.9419, 2.5821,
- 20.2380, -0.2282, 28.6779, 3.9419, 2.5821, 44.0636,
- };
- vnl_matrix<double> S(Sdata, 6,6);
-
- vnl_real_eigensystem eig(S);
- vnl_diag_matrix<vcl_complex<double> > D(eig.D.rows());
- for (unsigned i = 0; i < eig.D.rows(); ++i)
- {
- testlib_test_assert("All real", vcl_imag(eig.D(i,i)) < 1e-15);
- D(i,i) = vcl_real(eig.D(i,i));
- }
-
- vcl_cout << "D = " << eig.D << vcl_endl
- << "V = " << eig.V << vcl_endl;
-
- vnl_matrix<vcl_complex<double> > diff = vnl_complexify(S*eig.Vreal) - vnl_complexify(eig.Vreal)*D;
- vcl_cout << "X*V - V*D = " << diff << vcl_endl
- << "residual = " << diff.fro_norm() << vcl_endl;
- testlib_test_assert("recompose residual", diff.fro_norm() < 1e-12);
-}
-
-static void test_4x4()
-{
- // unsympathetic
- double Xdata[] = {
- 686, 526, 701, 47,
- 588, 91, 910, 736,
- 930, 653, 762, 328,
- 846, 415, 262, 632
- };
- vnl_matrix<double> X(Xdata, 4, 4);
-
- vnl_real_eigensystem eig(X);
-
- vcl_cout << "D = " << eig.D << vcl_endl
- << "V = " << eig.V << vcl_endl;
-
- vnl_matrix<vcl_complex<double> > XC = vnl_complexify(X);
-
- vnl_matrix<vcl_complex<double> > diff = XC*eig.V - eig.V*eig.D;
- vcl_cout << "X*V - V*D = " << diff << vcl_endl
- << "residual = " << diff.fro_norm() << vcl_endl;
- testlib_test_assert("recompose residual", diff.fro_norm() < 1e-11);
-}
-
-static void test_real_eigensystem()
-{
- test_6x6();
- test_4x4();
-}
-
-TESTMAIN(test_real_eigensystem)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_rnpoly_roots.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_rnpoly_roots.cxx
deleted file mode 100644
index 2a5d6cbe074d70851c4dcf43180770aa5232242d..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_rnpoly_roots.cxx
+++ /dev/null
@@ -1,92 +0,0 @@
-#include <vcl_iostream.h>
-#include <vnl/vnl_real_npolynomial.h>
-#include <vnl/vnl_double_2.h>
-#include <vnl/vnl_double_3.h>
-#include <vnl/algo/vnl_rnpoly_solve.h>
-#include <testlib/testlib_test.h>
-
-static void test_rnpoly_roots()
-{
- // Intersection of two unit circles, centered in (0,0) and in (1,0):
-
- vnl_double_3 f1(1.0,1.0,-1.0);
- vnl_matrix<unsigned int> p1(3,2, 0); p1(0,0) = 2; p1(1,1) = 2;
- vnl_real_npolynomial poly1(f1,p1); vcl_cout << poly1; // X^2 +Y^2 -1
-
- vnl_double_2 f2(1.0,-1.0);
- vnl_matrix<unsigned int> p2(2,2, 0); p2(0,0) = 1;
- vnl_real_npolynomial monom1(f2,p2); vcl_cout << monom1; // X-1
-
- vnl_real_npolynomial poly2 = monom1 * monom1; // (X-1)^2
- poly2 = poly2 - 1;
-
- vnl_vector<double> f3(1, 1.0);
- vnl_matrix<unsigned int> p3(1,2, 0); p3(0,1) = 2;
- vnl_real_npolynomial monom3(f3,p3); // Y^2
-
- poly2 = poly2 + monom3; vcl_cout << poly2; // (X-1)^2 +Y^2 -1 = X^2 -2X +Y^2
-
- vcl_vector<vnl_vector<double>*>::iterator rp, ip;
-
- vcl_vector<vnl_real_npolynomial*> l(1, &poly1); l.push_back(&poly2);
- vnl_rnpoly_solve solver(l);
-
- vcl_vector<vnl_vector<double>*> r = solver.realroots();
- TEST("There should be two real roots", r.size(), 2);
- for (rp = r.begin(); rp != r.end(); ++rp) {
- vnl_vector<double>& root = *(*rp);
- vcl_cout << root << vcl_endl;
- TEST_NEAR("x==0.5", root[0], 0.5, 1e-9);
- TEST_NEAR("y==sqrt(0.75)", root[1]*root[1], 0.75, 1e-9);
- }
- vcl_vector<vnl_vector<double>*> roots_r = solver.real();
- vcl_vector<vnl_vector<double>*> roots_i = solver.imag();
- TEST("and no more finite imaginary roots", roots_r.size(), 2);
- TEST("and equally many imaginary parts", roots_i.size(), 2);
- for (rp=roots_r.begin(),ip=roots_i.begin(); rp!=roots_r.end(); ++rp,++ip)
- vcl_cout << " REAL " << *((*rp)) << " IMAG " << *((*ip)) << vcl_endl;
-
- // Real intersection of two ellipses, both centered in (0,0):
-
- f1(0) = 1; f1(1) = 2;
- vnl_real_npolynomial poly3(f1,p1); vcl_cout << poly3; // X^2 +2 Y^2 -1
-
- f1(0) = 2; f1(1) = 1;
- vnl_real_npolynomial poly4(f1,p1); vcl_cout << poly4; // 2 X^2 +Y^2 -1
-
- l.clear(); l.push_back(&poly3); l.push_back(&poly4);
- vnl_rnpoly_solve solver2(l);
-
- r = solver2.realroots();
- TEST("There should be four real roots", r.size(), 4);
- for (rp = r.begin(); rp != r.end(); ++rp)
- {
- vnl_vector<double>& root = *(*rp);
- vcl_cout << root << vcl_endl;
- TEST_NEAR("x==sqrt(1/3)", 3*root[0]*root[0], 1.0, 1e-9);
- TEST_NEAR("y==sqrt(1/3)", 3*root[1]*root[1], 1.0, 1e-9);
- }
- roots_r = solver2.real(); roots_i = solver2.imag();
- TEST("and no more imaginary roots", roots_r.size(), 4);
- TEST("and equally many imaginary parts", roots_i.size(), 4);
- for (rp=roots_r.begin(),ip=roots_i.begin(); rp!=roots_r.end(); ++rp,++ip)
- vcl_cout << " REAL " << *((*rp)) << " IMAG " << *((*ip)) << vcl_endl;
-
- // Imaginary intersection of two ellipses, both centered in (0,0):
-
- f1(0) = 2; f1(1) = 3;
- vnl_real_npolynomial poly5(f1,p1); vcl_cout << poly5; // 2 X^2 +3 Y^2 -1
-
- l.clear(); l.push_back(&poly3); l.push_back(&poly5);
- vnl_rnpoly_solve solver3(l);
-
- r = solver3.realroots();
- TEST("There should be no real roots", r.size(), 0);
- TEST("and four imaginary roots", solver3.real().size(), 4);
- TEST("and equally many imaginary parts", solver3.imag().size(), 4);
- roots_r = solver3.real(); roots_i = solver3.imag();
- for (rp=roots_r.begin(),ip=roots_i.begin(); rp!=roots_r.end(); ++rp,++ip)
- vcl_cout << " REAL " << *((*rp)) << " IMAG " << *((*ip)) << vcl_endl;
-}
-
-TESTMAIN(test_rnpoly_roots);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_solve_qp.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_solve_qp.cxx
deleted file mode 100644
index 7d67faf7abc50dd903950dd60b2ad8295e2cb504..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_solve_qp.cxx
+++ /dev/null
@@ -1,108 +0,0 @@
-// This is core/vnl/algo/tests/test_solve_qp.cxx
-#include "test_util.h"
-#include <vcl_iostream.h>
-#include <testlib/testlib_test.h>
-#include <vnl/algo/vnl_solve_qp.h>
-
-//--------------------------------------------------------------------------------
-
-void test_solve_qp_with_non_neg_constraints1()
-{
- // Minimise |x|^2 subject to 1.x=1 and x(i)>=0
- // x(i)>=0 not relevant for this solution
-
- unsigned n=4;
- vnl_matrix<double> H(n,n,0.0);
- for (unsigned i=0;i<n;++i) H(i,i)=1.0;
- vnl_matrix<double> A(1,n,1.0);
- vnl_vector<double> g(n,0.0), b(1,1.0),x(n,0.0);
-
- // Initialise to satisfy Ax=b
- x[0]=1.0;
-
- vnl_solve_qp_with_non_neg_constraints(H,g,A,b,x);
-
- vnl_vector<double> sol(n,1.0/n);
-
- vcl_cout<<"Solution: "<<x<<vcl_endl;
- testlib_test_assert_near("|x-x_true|^2", vnl_vector_ssd(x,sol), 0, 1e-5);
-}
-
-void test_solve_qp_with_non_neg_constraints2()
-{
- // Minimise 0.5|x|^2 -x.(1 -1 1 1) subject to 1.x=1 and x(i)>=0
- // x(i)>=0 not relevant for this solution
-
- unsigned n=4;
- vnl_matrix<double> H(n,n,0.0);
- for (unsigned i=0;i<n;++i) H(i,i)=1.0;
- vnl_matrix<double> A(1,n,1.0);
- vnl_vector<double> g(n,-1.0), b(1,1.0),x(n,0.0);
- g[1]=1.0;
-
- // Initialise to satisfy Ax=b
- x[0]=1.0;
-
- vnl_solve_qp_with_non_neg_constraints(H,g,A,b,x);
-
- vnl_vector<double> sol(n,1.0/3);
- sol[1]=0.0;
-
- vcl_cout<<"Solution: "<<x<<vcl_endl;
- testlib_test_assert_near("|x-x_true|^2", vnl_vector_ssd(x,sol), 0, 1e-5);
-}
-
-void test_solve_qp_non_neg_sum_one1()
-{
- // Minimise |x|^2 subject to 1.x=1 and x(i)>=0
- // x(i)>=0 not relevant for this solution
-
- unsigned n=4;
- vnl_matrix<double> H(n,n,0.0);
- for (unsigned i=0;i<n;++i) H(i,i)=1.0;
- vnl_vector<double> g(n,0.0), x(n,0.0);
-
- // Initialise to satisfy sum(x)=1
- x[0]=1.0;
-
- vnl_solve_qp_non_neg_sum_one(H,g,x);
-
- vnl_vector<double> sol(n,1.0/n);
-
- vcl_cout<<"Solution: "<<x<<vcl_endl;
- testlib_test_assert_near("|x-x_true|^2", vnl_vector_ssd(x,sol), 0, 1e-5);
-}
-
-void test_solve_qp_non_neg_sum_one2()
-{
- // Minimise 0.5|x|^2 -x.(1 -1 1 1) subject to 1.x=1 and x(i)>=0
- // x(i)>=0 not relevant for this solution
-
- unsigned n=4;
- vnl_matrix<double> H(n,n,0.0);
- for (unsigned i=0;i<n;++i) H(i,i)=1.0;
- vnl_vector<double> g(n,-1.0), x(n,0.0);
- g[1]=1.0;
-
- // Initialise to satisfy sum(x)=1
- x[0]=1.0;
-
- vnl_solve_qp_non_neg_sum_one(H,g,x);
-
- vnl_vector<double> sol(n,1.0/3);
- sol[1]=0.0;
-
- vcl_cout<<"Solution: "<<x<<vcl_endl;
- testlib_test_assert_near("|x-x_true|^2", vnl_vector_ssd(x,sol), 0, 1e-5);
-}
-
-extern "C" void test_solve_qp()
-{
- test_solve_qp_with_non_neg_constraints1();
- test_solve_qp_with_non_neg_constraints2();
- test_solve_qp_non_neg_sum_one1();
- test_solve_qp_non_neg_sum_one2();
-}
-
-TESTMAIN(test_solve_qp);
-
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_sparse_lu.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_sparse_lu.cxx
deleted file mode 100644
index f3a9b28cfd5be51bd78a56508462ea75c964ed42..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_sparse_lu.cxx
+++ /dev/null
@@ -1,141 +0,0 @@
-// This is core/vnl/algo/tests/test_sparse_lu.cxx
-#include <testlib/testlib_test.h>
-#include <vcl_iostream.h>
-#include <vnl/vnl_sparse_matrix.h>
-#include <vnl/algo/vnl_sparse_lu.h>
-#include "test_util.h"
-
-//for debugging purposes
-#if 0
-static void print_sparse(vnl_sparse_matrix<double>& M)
-{
- typedef vnl_sparse_matrix_pair<double> pair_t;
- unsigned n = M.rows();
- for (unsigned r = 0; r<n; r++)
- {
- vcl_vector < pair_t > rr = M.get_row(r);
- for (vcl_vector<pair_t>::const_iterator cit = rr.begin();
- cit != rr.end(); cit++)
- vcl_cout << "M[" << r << "][" << (*cit).first << "]= "
- << (*cit).second << '\n';
- }
-}
-#endif
-
-void test_sparse_lu()
-{
- //mat0 of Kenneth S. Kunder's Sparse 1.3a release
- vnl_sparse_matrix<double> A(4,4);
- vcl_vector<int> cols0(2), cols1(3), cols2(3), cols3(2);
- vcl_vector<double> vals0(2), vals1(3), vals2(3), vals3(2);
- cols0[0]=0; cols0[1]=1;
- vals0[0]=2.0; vals0[1]=-1.0;
- A.set_row(0, cols0, vals0);
- cols1[0]=0; cols1[1]=1; cols1[2]=2;
- vals1[0]=-1.0; vals1[1]=3.0; vals1[2]=-1;
- A.set_row(1, cols1, vals1);
- cols2[0]=1; cols2[1]= 2; cols2[2]= 3;
- vals2[0]=-1.0; vals2[1]=3.0; vals2[2]=-1.0;
- A.set_row(2, cols2, vals2);
- cols3[0]=2; cols3[1]=3;
- vals3[0]=-1.0; vals3[1]=3.0;
- A.set_row(3, cols3, vals3);
- for (A.reset(); A.next();)
- vcl_cout << "A[" << A.getrow() << "][" << A.getcolumn()
- << "]= " << A.value() << '\n';
- vnl_vector<double> b(4, 0.0), x(4);
- b[0]=34.0;
- vnl_sparse_lu lu(A,vnl_sparse_lu::verbose);
- lu.solve(b, &x);
- for (unsigned i = 0; i<4; ++i)
- vcl_cout << "x[" << i << "]= " << x[i] << '\n';
- TEST_NEAR("solution of mat0 example", x[0], 21, 1.e-03);
- double det = lu.determinant();
- vcl_cout << "determinant = " << det << '\n';
- TEST_NEAR("determinant of mat0 example", det, 34, 1.e-03);
- lu.solve_transpose(b,&x);
- vcl_cout << "transpose solution\n";
- for (unsigned i = 0; i<4; ++i)
- vcl_cout << "x[" << i << "]= " << x[i] << '\n';
- TEST_NEAR("transpose solution of mat0 example", x[2], 3, 1.e-03);
- //mat5 of sparse test data
- vnl_sparse_matrix<double> Ap(3,3);
- Ap(0,1)=1; Ap(1,2)=1; Ap(2,0)=1;
- vnl_vector<double> bp(3), xp(3);
- bp[0]=2.0; bp[1]=3.0; bp[2]=1.0;
- vnl_sparse_lu lup(Ap,vnl_sparse_lu::verbose);
- lup.solve(bp, &xp);
- for (unsigned i = 0; i<3; ++i)
- vcl_cout << "xp[" << i << "]= " << xp[i] << '\n';
- TEST_NEAR("solution of mat5 example", xp[2], 3, 1.e-03);
-
- //test matrix derived from Poisson birth-death queue
- double s = -0.01, l = 0.5, m = 0.5;
- vnl_sparse_matrix<double> S(6,6);
- S(0,0)=s+l; S(0,1)=-l;
- S(1,0)=-m; S(1,1)=s+l+m; S(1,2)=-l;
- S(2,1)=-m; S(2,2)=s+l+m;
- S(3,3)=s+l+m; S(3,4)=-l;
- S(4,3)=-m; S(4,4)=s+l+m; S(4,5)=-l;
- S(5,4)=-m; S(5,5)=m+s;
- vnl_vector<double> bbd(6),xbd(6);
- bbd[0]=0; bbd[1]=0; bbd[2]=l; bbd[3]=m; bbd[4]=0; bbd[5]=0;
- vnl_sparse_lu lubd(S,vnl_sparse_lu::estimate_condition_verbose);
- lubd.solve(bbd, &xbd);
- for (unsigned i = 0; i<6; ++i)
- vcl_cout << "xbd[" << i << "]= " << xbd[i] << '\n';
- TEST_NEAR("test solution of birth-death matrix", xbd[2], 1.06622, 1.e-04);
- det = lubd.determinant();
- vcl_cout << "birth-death determinant = " << det << '\n';
- double cond = lubd.rcond();
- vcl_cout << "birth-death condition number = " << cond << '\n';
- TEST_NEAR("birth-death matrix condition number", cond, 0.03756, 1.e-04);
- double upbnd = lubd.max_error_bound();
- vcl_cout << "birth-death upper error bound = " << upbnd << '\n';
- TEST_NEAR("birth-death upper error", upbnd, 5.923e-015, 1.e-016);
-#if 0
- //Test a large matrix
- unsigned n = 10000;
- s = -0.001;
- vcl_cout << '\n' << '\n';
- for (unsigned k = 0; k<10; ++k)
- {
- s *= 0.1;
- vcl_cout << "s = " << s << '\n'<< '\n';
- vnl_sparse_matrix<double> SL(n,n);
- for (unsigned i = 1; i<(n/2-1); i++)
- {
- SL(i,i-1)=-m;
- SL(i,i)=s+l+m;
- SL(i,i+1)=-l;
- }
- for (unsigned i = (n/2+1); i<(n-1); i++)
- {
- SL(i,i-1)=-m;
- SL(i,i)=s+l+m;
- SL(i,i+1)=-l;
- }
- SL(0,0)=s+l; SL(0,1)=-l;
- SL((n/2-1),(n/2-2))=-m; SL((n/2-1),(n/2-1))= s+l+m;
- SL(n/2,n/2)= s+l+m; SL(n/2,(n/2+1))=-l;
- SL(n-1,n-2)=-m; SL(n-1,n-1)= s+m;
- vnl_sparse_lu lubdl(SL,vnl_sparse_lu::estimate_condition);
- vnl_vector<double> blarge(n,0.0), xlarge(n);
- blarge[n/2-1]=l; blarge[n/2]=m;
-
- lubdl.set_pivot_thresh(0);
- lubdl.solve(blarge, &xlarge);
-
- vcl_cout << "xlarge[0] = " << xlarge[0] << " xlarge[n/2-1] = " << xlarge[n/2-1] << '\n';
- upbnd = lubdl.max_error_bound();
- vcl_cout << "birth-death upper error bound = " << upbnd << '\n'
- << "mean passage time from adjacent state = " << -(xlarge[n/2-1]-1)/s << '\n'
- << "mean passage time from S0 = " << -(xlarge[0]-1)/s << '\n'
- << "ratio =" << (1.0-xlarge[0])/(1-xlarge[n/2-1])<< '\n';
- cond = lubdl.rcond();
- vcl_cout << "large matrix birth-death condition number = " << cond << '\n';
- }
-#endif
-}
-
-TESTMAIN(test_sparse_lu);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_sparse_matrix.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_sparse_matrix.cxx
deleted file mode 100644
index ad76660be3d34c400843626f9e0b601486165917..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_sparse_matrix.cxx
+++ /dev/null
@@ -1,175 +0,0 @@
-// This is core/vnl/algo/tests/test_sparse_matrix.cxx
-#include <vcl_ctime.h>
-#include <vcl_iostream.h>
-#include <vnl/vnl_sparse_matrix.h>
-#include <vnl/algo/vnl_sparse_symmetric_eigensystem.h>
-#include <vnl/algo/vnl_symmetric_eigensystem.h>
-
-#include <testlib/testlib_test.h>
-
-// Test the sparse matrix operations.
-void doTest1()
-{
- const unsigned int n = 20;
-
- vnl_sparse_matrix<double> m1(n,n);
- for (unsigned i=0; i<n; i++) {
- m1(i,i) = 2.0;
- m1(i,(i+3)%n) = 1.0;
- }
-
- vcl_cout << "m1:\n";
- for (unsigned i=0; i<n; i++) {
- for (unsigned j=0; j<n; j++)
- vcl_cout << m1(i,j) << ' ';
- vcl_cout << vcl_endl;
- }
-
- vnl_sparse_matrix<double> m2(n,n);
- for (unsigned i=0; i<n; i++) {
- m2(i,i) = 2.0;
- m2(i,(i+n-3)%n) = 1.0;
- }
-
- vcl_cout << "m2:\n";
- for (unsigned i=0; i<n; i++) {
- for (unsigned j=0; j<n; j++)
- vcl_cout << m2(i,j) << ' ';
- vcl_cout << vcl_endl;
- }
-
- vnl_sparse_matrix<double> prod;
- m1.mult(m2,prod);
-
- vcl_cout << "prod:\n";
- for (unsigned i=0; i<n; i++) {
- for (unsigned j=0; j<n; j++)
- vcl_cout << prod(i,j) << ' ';
- vcl_cout << vcl_endl;
- }
-
- vnl_sparse_matrix<double> sum;
- m1.add(m2,sum);
-
- vcl_cout << "sum:\n";
- for (unsigned i=0; i<n; i++) {
- for (unsigned j=0; j<n; j++)
- vcl_cout << sum(i,j) << ' ';
- vcl_cout << vcl_endl;
- }
-
- vnl_sparse_matrix<double> diff;
- m1.subtract(m2,diff);
-
- vcl_cout << "diff:\n";
- for (unsigned i=0; i<n; i++) {
- for (unsigned j=0; j<n; j++)
- vcl_cout << diff(i,j) << ' ';
- vcl_cout << vcl_endl;
- }
-}
-
-void doTest2()
-{
- vcl_clock_t t = vcl_clock();
- for (unsigned int n = 1000; n<4000; n+=1000)
- {
- vnl_sparse_matrix<double> m1(n,n);
- for (unsigned i=0; i<n; i++) {
- m1(i,i) = 2.0;
- m1(i,(i+3)%n) = 1.0;
- }
-
- vnl_sparse_matrix<double> m2(n,n);
- for (unsigned i=0; i<n; i++) {
- m2(i,i) = 2.0;
- m2(i,(i+n-3)%n) = 1.0;
- }
-
- vnl_sparse_matrix<double> prod;
- m1.mult(m2,prod);
-
- vcl_clock_t tn = vcl_clock();
- vcl_cout << n << ' ' << tn - t << vcl_endl;
- t = tn;
- }
-}
-
-void doTest3()
-{
- const unsigned int n = 20;
-
- vnl_sparse_matrix<double> ms(n,n);
- vnl_matrix<double> md(n,n); md = 0.0; // Initialise to all zeros
- // The matrix must be symmetric
- for (unsigned i=0; i<n; i++) {
- ms(i,i) = md(i,i) = i+1.0;
- ms(i,(i+3)%n) = md(i,(i+3)%n) = 1.0;
- ms(i,(i+n-3)%n) = md(i,(i+n-3)%n) = 1.0;
- // ms(i,i) = md(i,i) = 1.0*(i+1)*(i+1);
- }
-
- vcl_cout << "ms:\n";
- for (unsigned i=0; i<n; i++) {
- for (unsigned j=0; j<n; j++)
- vcl_cout << ms(i,j) << ' ';
- vcl_cout << vcl_endl;
- }
- vcl_cout << "md:\n" << md << vcl_endl;
-
- const unsigned int nvals = 2;
- vnl_symmetric_eigensystem<double> ed(md);
- vnl_sparse_symmetric_eigensystem es;
- TEST ("vnl_sparse_symmetric_eigensystem::CalculateNPairs()",
- es.CalculateNPairs(ms,nvals,true,20), 0);
-
- // Report 'em.
- for (unsigned i=0; i<nvals; i++) {
- vcl_cout << "Dense[" << i << "] : " << ed.D(i,i) << " -> "
- << ed.get_eigenvector(i) << vcl_endl
- << "Sparse[" << i << "]: " << es.get_eigenvalue(i) << " -> "
- << es.get_eigenvector(i) << vcl_endl;
- }
-}
-
-void doTest4()
-{
- const unsigned int n = 20;
-
- vnl_sparse_matrix<double> ms(n,n);
- vnl_matrix<double> md(n,n); md = 0.0; // Initialise to all zeros
- // The matrix must be symmetric
- for (unsigned i=0; i<n; i++) {
- ms(i,i) = md(i,i) = i+1.0;
- ms(i,(i+3)%n) = md(i,(i+3)%n) = 1.0;
- ms(i,(i+n-3)%n) = md(i,(i+n-3)%n) = 1.0;
- // ms(i,i) = md(i,i) = 1.0*(i+1)*(i+1);
- }
-
- const unsigned int nvals = 3;
- vnl_symmetric_eigensystem<double> ed(md);
- vnl_sparse_symmetric_eigensystem es;
- TEST("vnl_sparse_symmetric_eigensystem::CalculateNPairs() succeeded",
- es.CalculateNPairs(ms,nvals), 0);
-
- // Report 'em.
- for (unsigned i=0; i<nvals; i++)
- {
- double dense = ed.D(i,i);
- double sparse = es.get_eigenvalue(i);
- vcl_cout << "Dense[" << i << "] : " << dense << vcl_endl
- << "Sparse[" << i << "]: " << sparse << vcl_endl;
- double err = sparse - dense;
- TEST_NEAR("vnl_sparse_symmetric_eigensystem eigenvalue difference", err, 0.0, 1e-10);
- }
-}
-
-static void test_sparse_matrix()
-{
- vcl_cout << "Starting test 1\n"; doTest1();
- vcl_cout << "Starting test 2\n"; doTest2();
- vcl_cout << "Starting test 3\n"; doTest3();
- vcl_cout << "Starting test 4\n"; doTest4();
-}
-
-TESTMAIN(test_sparse_matrix);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_svd.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_svd.cxx
deleted file mode 100644
index f95841c82d73735cd11feda23998218b5eef6949..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_svd.cxx
+++ /dev/null
@@ -1,233 +0,0 @@
-// This is core/vnl/algo/tests/test_svd.cxx
-#include "test_util.h"
-//:
-// \file
-#include <testlib/testlib_test.h>
-#include <vcl_iostream.h>
-#include <vcl_complex.h>
-
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_double_3.h>
-#include <vnl/vnl_random.h>
-#include <vnl/algo/vnl_svd.h>
-
-//: Solve LS problem M x = B, warning if M is nearly singular.
-vnl_matrix<double> solve_with_warning(const vnl_matrix<double>& M,
- const vnl_matrix<double>& B)
-{
- // Take svd of vnl_matrix<double> M, trim the singular values at 1e-8,
- // and hold the result.
- vnl_svd<double> svd(M, 1e-8);
- // Check for rank-deficiency
- if (svd.singularities() > 1)
- vcl_cout << "Warning: Singular matrix, condition = " << svd.well_condition() << vcl_endl;
- return svd.solve(B);
-}
-
-template <class T, class S>
-void test_hilbert(T /*dummy*/, char const* type, S residual)
-{
- typedef typename vnl_numeric_traits<T>::abs_t abs_t;
- // Test inversion and recomposition of 5x5 hilbert matrix
- vnl_matrix<T> H(5,5);
- for (int i = 0; i < 5; ++i)
- for (int j = 0; j < 5; ++j)
- H(i,j) = T(1) / T(abs_t(i+j+1)); // sic, because i,j are zero based
-
- vcl_cout << "H = <"<<type<<">[ " << H << "]\n";
-
- vnl_svd<T> svd(H);
-
- vcl_cout << "rcond(H) = " << svd.well_condition() << vcl_endl;
-
- vnl_matrix<T> Hinv = svd.inverse();
-
- vnl_matrix<T> X = Hinv * H;
-
- vcl_cout << "H*inv(H) = " << X << vcl_endl;
-
- vnl_matrix<T> I(5,5);
- I = 0.0;
- I.fill_diagonal(1.0);
-
- vnl_matrix<T> res = X - I;
- vcl_cout << "Hilbert recomposition residual = " << res.fro_norm() << vcl_endl;
- testlib_test_assert("Hilbert recomposition residual", res.fro_norm() < residual);
-}
-
-//: Test recovery of parameters of least-squares parabola fit.
-void test_ls()
-{
- double a = 0.15;
- double b = 1.2;
- double c = 3.1;
-
- // Generate parabola design matrix
- vnl_matrix<double> D(100, 3);
- for (int n = 0; n < 100; ++n)
- {
- double x = n;
- D(n, 0) = x*x;
- D(n, 1) = x;
- D(n, 2) = 1.0;
- }
-
- // Generate Y vector
- vnl_vector<double> y(100);
- for (int n = 0; n < 100; ++n)
- {
- double x = n;
- double fx = a * x * x + b * x + c;
- // Add sawtooth "noise"
- y(n) = fx + (n%4 - 2) / 10.0;
- }
- vcl_cout << "y = [" << y << "]\n";
-
- // Extract vnl_svd<double>
- vnl_svd<double> svd(D);
-
- // Solve for parameters
- vnl_double_3 A = svd.solve(y);
- vcl_cout << "A = " << A << '\n';
-
- vnl_double_3 T(a,b,c);
- vcl_cout << "residual = " << (A - T).squared_magnitude() << vcl_endl;
- testlib_test_assert("Least squares residual", (A - T).squared_magnitude() < 0.005);
-}
-
-// temporarily unused
-double test_fmatrix()
-{
- double pdata[] = {
- 2, 0, 0, 0,
- 3, 10, 5, 5,
- 5, 12, 6, 6,
- };
- vnl_matrix<double> P(pdata, 3,4);
- vnl_svd<double> svd(P);
- vnl_matrix<double> N = svd.nullspace();
- vcl_cout << "null(P) = " << N << vcl_endl
- << "P * null(P) = " << P*N << vcl_endl;
-
- return dot_product(P*N, P*N);
-}
-
-//: Test nullspace extraction of rank=2 3x4 matrix.
-void test_pmatrix()
-{
- double pdata[] = {
- 2, 0, 0, 0,
- 3, 10, 5, 5,
- 5, 12, 6, 6,
- };
- vnl_matrix<double> P(pdata, 3,4);
- vnl_svd<double> svd(P, 1e-8);
-
- vnl_matrix<double> res = svd.recompose() - P;
- vcl_cout << "Recomposition residual = " << res.fro_norm() << vcl_endl;
- testlib_test_assert("PMatrix recomposition residual", res.fro_norm() < 1e-12);
- vcl_cout << " Inv = " << svd.inverse() << vcl_endl;
-
- testlib_test_assert("singularities = 2", svd.singularities() == 2);
- testlib_test_assert("rank = 2", svd.rank() == 2);
-
- vnl_matrix<double> N = svd.nullspace();
- testlib_test_assert("nullspace dimension", N.columns() == 2);
- vcl_cout << "null(P) =\n" << N << vcl_endl;
-
- vnl_matrix<double> PN = P*N;
- vcl_cout << "P * null(P) =\n" << PN << vcl_endl
- << "nullspace residual = " << PN.fro_norm() << vcl_endl;
- testlib_test_assert("P nullspace residual", PN.fro_norm() < 1e-12);
-
- vnl_vector<double> n = svd.nullvector();
- vcl_cout << "nullvector residual = " << (P*n).magnitude() << vcl_endl;
- testlib_test_assert("P nullvector residual", (P*n).magnitude() < 1e-12);
-
- vnl_vector<double> l = svd.left_nullvector();
- vcl_cout << "left_nullvector(P) = " << l << vcl_endl
- << "left_nullvector residual = " << (l*P).magnitude() << vcl_endl;
- testlib_test_assert("P left nullvector residual", (l*P).magnitude() < 1e-12);
-}
-
-void test_I()
-{
- double Idata[] = {
- 1, 0, 0, 0,
- 0, 1, 0, 0,
- 0, 0, 1, 0,
- };
- vnl_matrix<double> P(3, 4, 12, Idata);
- vnl_svd<double> svd(P);
- vcl_cout << svd;
-}
-
-template <class T>
-void test_svd_recomposition(char const *type, double maxres, T* /* tag */, vnl_random &rng)
-{
- // Test inversion of 5x5 matrix of T :
- vcl_cout << "----- testing vnl_svd<" << type << "> recomposition -----\n";
-
- vnl_matrix<T> A(5,5);
- test_util_fill_random(A.begin(), A.end(), rng);
-
- vcl_cout << "A = [\n" << A << "]\n";
- vnl_svd<T> svd(A);
-
- vnl_matrix<T> B=svd.recompose();
- vcl_cout << "B = [\n" << B << "]\n";
-
- double residual=(A - B).fro_norm();
- vcl_cout << "residual=" << residual << vcl_endl;
- testlib_test_assert("vnl_svd<float> recomposition residual", residual < maxres);
-}
-
-template void test_svd_recomposition(char const *, double, float *, vnl_random &rng);
-template void test_svd_recomposition(char const *, double, double *, vnl_random &rng);
-template void test_svd_recomposition(char const *, double, vcl_complex<float> *, vnl_random &rng);
-template void test_svd_recomposition(char const *, double, vcl_complex<double> *, vnl_random &rng);
-
-#include <vnl/vnl_matlab_print.h>
-template <class T>
-void test_nullvector(char const *type, T *, vnl_random &rng)
-{
- int n = 5;
- vnl_matrix<T> A(n, n+1);
- test_util_fill_random(A.begin(), A.end(), rng);
- vnl_svd<T> svd(A);
- vnl_vector<T> x = svd.nullvector();
- vnl_vector<T> Ax = A*x;
- vcl_cout << __FILE__ ": type = " << type << vcl_endl;
- vnl_matlab_print(vcl_cout, A, "A", vnl_matlab_print_format_long);
- vcl_cout << __FILE__ ": || x|| = " << x.two_norm() << vcl_endl
- << __FILE__ ": ||Ax|| = " << Ax.two_norm() << vcl_endl;
-}
-
-template void test_nullvector(char const *, float *, vnl_random &rng);
-template void test_nullvector(char const *, double *, vnl_random &rng);
-template void test_nullvector(char const *, vcl_complex<float> *, vnl_random &rng);
-template void test_nullvector(char const *, vcl_complex<double> *, vnl_random &rng);
-
-// Driver
-void test_svd()
-{
- vnl_random rng;
- test_hilbert(double(), "double", 1.1e-10);
- test_hilbert(float(), "float", float(0.025));
- test_hilbert(vcl_complex<double>(), "vcl_complex<double>", double(4.4e-10));
- test_hilbert(vcl_complex<float>(), "vcl_complex<float>", float(0.04));
- test_ls();
- test_pmatrix();
- test_I();
- test_svd_recomposition("float", 1e-5 , (float*)0, rng);
- test_svd_recomposition("double", 1e-10, (double*)0, rng);
- test_svd_recomposition("vcl_complex<float>", 1e-5 , (vcl_complex<float>*)0, rng);
- test_svd_recomposition("vcl_complex<double>", 1e-10, (vcl_complex<double>*)0, rng);
-
- test_nullvector("float", (float*)0, rng);
- test_nullvector("double", (double*)0, rng);
- test_nullvector("vcl_complex<float>", (vcl_complex<float>*)0, rng);
- test_nullvector("vcl_complex<double>", (vcl_complex<double>*)0, rng);
-}
-
-TESTMAIN(test_svd);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_symmetric_eigensystem.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_symmetric_eigensystem.cxx
deleted file mode 100644
index 0d998c045d33330f8c5b482dbbd0580c105364a2..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_symmetric_eigensystem.cxx
+++ /dev/null
@@ -1,171 +0,0 @@
-// This is core/vnl/algo/tests/test_symmetric_eigensystem.cxx
-#include <testlib/testlib_test.h>
-//:
-// \file
-// \brief test program for symmetric eigensystem routines.
-// \author Andrew W. Fitzgibbon, Oxford RRG.
-// \date 29 Aug 96
-
-//-----------------------------------------------------------------------------
-
-
-#include <vcl_iostream.h>
-#include <vcl_algorithm.h>
-#include <vnl/vnl_double_3x3.h>
-#include <vnl/vnl_double_3.h>
-#include <vnl/vnl_random.h>
-#include <vul/vul_timer.h>
-#include <vnl/vnl_c_vector.h>
-#include <vnl/algo/vnl_symmetric_eigensystem.h>
-
-//extern "C"
-void test_symmetric_eigensystem()
-{
- double Sdata[36] = {
- 30.0000, -3.4273, 13.9254, 13.7049, -2.4446, 20.2380,
- -3.4273, 13.7049, -2.4446, 1.3659, 3.6702, -0.2282,
- 13.9254, -2.4446, 20.2380, 3.6702, -0.2282, 28.6779,
- 13.7049, 1.3659, 3.6702, 12.5273, -1.6045, 3.9419,
- -2.4446, 3.6702, -0.2282, -1.6045, 3.9419, 2.5821,
- 20.2380, -0.2282, 28.6779, 3.9419, 2.5821, 44.0636,
- };
- vnl_matrix<double> S(Sdata, 6,6);
-
- {
- vnl_symmetric_eigensystem<double> eig(S);
- vnl_matrix<double> res = eig.recompose() - S;
- vcl_cout << "V'*D*V - S = " << res << vcl_endl
- << "residual = " << res.fro_norm() << vcl_endl;
- testlib_test_assert("recompose residual", res.fro_norm() < 1e-12);
-
- vcl_cout<<"Eigenvalues: ";
- for (int i=0;i<6;++i)
- vcl_cout << eig.get_eigenvalue(i) << ' ';
- vcl_cout << vcl_endl;
- }
-
- double Cdata[36] = {
- 0, 0, 0, 0, 0, 0,
- 0, 0, 0, 0, 0, 0,
- 0, 0, 0, 0, 0, 0,
- 0, 0, 0, 0, 0, 2,
- 0, 0, 0, 0, -1, 0,
- 0, 0, 0, 2, 0, 0,
- };
-
- vnl_matrix<double> C(Cdata, 6,6);
-
- {
- vnl_symmetric_eigensystem<double> eig(C);
- vnl_matrix<double> res = eig.recompose() - C;
- vcl_cout << "V'*D*V - C = " << res << vcl_endl
- << "residual = " << res.fro_norm() << vcl_endl;
- testlib_test_assert("recompose residual", res.fro_norm() < 1e-12);
-
- vcl_cout<<"Eigenvalues: ";
- for (int i=0;i<6;++i)
- vcl_cout << eig.get_eigenvalue(i) << ' ';
- vcl_cout << vcl_endl;
- }
-
- {
- // Generate a random system
- vnl_random rng;
- int n = 6;
- int s = 10;
- vnl_matrix<double> D_rand(s,n);
- for (int i=0;i<s;++i)
- for (int j=0;j<n;++j)
- D_rand(i,j) = 1.0 + 2.0*rng.normal64();
-
- vnl_matrix<double> S = D_rand.transpose() * D_rand;
- vnl_matrix<double> evecs(n,n);
- vnl_vector<double> evals(n);
- vnl_symmetric_eigensystem_compute(S,evecs,evals);
- vcl_cout << "Testing random system:\n"
- << "evals: "<<evals<<vcl_endl;
- for (int i=1;i<n;++i)
- {
- TEST("Eigenvalue increases", evals(i) >= evals(i-1), true);
- }
- }
-
- { // test I with specialised 3x3 version
- double l1, l2, l3;
- vnl_symmetric_eigensystem_compute_eigenvals(1.0, 0.0, 0.0, 1.0, 0.0, 1.0,
- l1, l2, l3);
- vcl_cout << "Eigenvals: " << l1 << ' ' << l2 << ' ' << l3 << vcl_endl;
- TEST("Correct eigenvalues for I", l1==1.0 && l2==1.0 && l3 ==1.0, true);
- }
-
- { // compare speed and values of specialised 3x3 version with nxn version
- vul_timer timer;
- int netlib_time, fixed_time;
- const unsigned n = 20000;
- double fixed_data[n][3];
- double netlib_data[n][3];
-
- {
- double M11, M12, M13, M22, M23, M33;
- // Generate a random system
- vnl_random rng(5);
-
- timer.mark();
- for (unsigned c = 0; c < n; ++c)
- {
- M11 = rng.drand64()*10.0-5.0; M12 = rng.drand64()*10.0-5.0; M13 = rng.drand64()*10.0-5.0;
- M22 = rng.drand64()*10.0-5.0; M23 = rng.drand64()*10.0-5.0;
- M33 = rng.drand64()*10.0-5.0;
- vnl_symmetric_eigensystem_compute_eigenvals(M11, M12, M13, M22, M23, M33,
- fixed_data[c][0], fixed_data[c][1], fixed_data[c][2]);
- }
- fixed_time = timer.user();
- }
-
- {
- // Generate same random system
- vnl_random rng(5);
- vnl_double_3x3 M, evecs;
- vnl_double_3 evals;
-
- timer.mark();
- for (unsigned c = 0; c < n; ++c)
- {
- M(0,0)=rng.drand64()*10.0-5.0; M(1,0)=M(0,1)=rng.drand64()*10.0-5.0; M(2,0)=M(0,2)= rng.drand64()*10.0-5.0;
- M(1,1)=rng.drand64()*10.0-5.0; M(2,1)=M(1,2)=rng.drand64()*10.0-5.0;
- M(2,2) = rng.drand64()*10.0-5.0;
-
- vnl_symmetric_eigensystem_compute(M.as_ref(), evecs.as_ref().non_const(), evals.as_ref().non_const());
- netlib_data[c][0] = evals[0];
- netlib_data[c][1] = evals[1];
- netlib_data[c][2] = evals[2];
- }
- netlib_time = timer.user();
- }
-
- vcl_cout << "Fixed Time: " << fixed_time << " netlib time: " <<netlib_time<<vcl_endl;
- TEST("Specialised version is faster", fixed_time < netlib_time, true);
-
- double sum_dsq=0.0;
- double max_dsq=0.0;
- for (unsigned c = 0; c < n; ++c)
- {
- const double dsq = vnl_c_vector<double>::euclid_dist_sq(netlib_data[c], fixed_data[c],3);
- max_dsq = vcl_max(dsq,max_dsq);
- sum_dsq += dsq;
- }
- vcl_cout << "max_dsq: " <<max_dsq<<" mean_dsq: "<<sum_dsq/static_cast<double>(n)<<vcl_endl;
- TEST("Specialised version gives similar results", max_dsq < 1e-8, true);
- }
-
- {
- double v1, v2, v3;
- vnl_symmetric_eigensystem_compute_eigenvals(
- 4199.0, 0.0, 0.0, 4199.0, 0.0, 4801.0, v1, v2, v3);
- TEST_NEAR("Numerically difficult values are ok v1", v1, 4199, 1e-3);
- TEST_NEAR("Numerically difficult values are ok v2", v2, 4199, 1e-3);
- TEST_NEAR("Numerically difficult values are ok v3", v3, 4801, 1e-7);
- }
-}
-
-TESTMAIN(test_symmetric_eigensystem);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_util.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_util.cxx
deleted file mode 100644
index cfddd781c2b578dc110ce395e50cc937c3b4f254..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_util.cxx
+++ /dev/null
@@ -1,20 +0,0 @@
-// This is core/vnl/algo/tests/test_util.cxx
-#include <vcl_complex.h>
-#include <vnl/vnl_random.h>
-
-#define macro(T) \
-void test_util_fill_random(T *b, T *e, vnl_random &rng) \
-{ \
- for (T *p=b; p<e; ++p) \
- *p = (T)rng.drand64(-1.0, +1.0); \
-} \
-void test_util_fill_random(vcl_complex<T> *b, vcl_complex<T> *e, vnl_random &rng) \
-{ \
- for (vcl_complex<T> *p=b; p<e; ++p) \
- *p = vcl_complex<T>((T)rng.drand64(-1.0, +1.0), (T)rng.drand64(-1.0, +1.0)); \
-}
-
-macro(float);
-macro(double);
-macro(long double);
-#undef macro
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_util.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_util.h
deleted file mode 100644
index d817091c4eade6dcb75b31b9a3460d9a73b3a86a..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/tests/test_util.h
+++ /dev/null
@@ -1,15 +0,0 @@
-#ifndef test_util_h_
-#define test_util_h_
-
-class vnl_random;
-#include <vcl_complex.h>
-#define macro(T) void test_util_fill_random(T *begin, T *end, vnl_random &rng)
-macro(float);
-macro(double);
-macro(long double);
-macro(vcl_complex<float>);
-macro(vcl_complex<double>);
-macro(vcl_complex<long double>);
-#undef macro
-
-#endif
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_adaptsimpson_integral.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_adaptsimpson_integral.cxx
index d513888e8920fb222e3e03bb2cf12bd39d19082e..3f72f85b02b0ab115f9b5be38389a009955075f3 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_adaptsimpson_integral.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_adaptsimpson_integral.cxx
@@ -13,11 +13,12 @@ double vnl_adaptsimpson_integral::integral(vnl_integrant_fnct* f, double a,
//set the function
pfnct_ = f;
- return adaptivesimpson(&vnl_adaptsimpson_integral::int_fnct_, a, b, acury, 0, deepth_);
+ return adaptivesimpson(&vnl_adaptsimpson_integral::int_fnct_, a, b, acury, 0, depth_);
}
double vnl_adaptsimpson_integral::adaptivesimpson(double(*f)(double*),
- double a, double b, double eps, int level, int level_max)
+ double a, double b, double eps,
+ int level, int level_max)
{
double c, d, e, h, result;
double one_simpson, two_simpson;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_adaptsimpson_integral.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_adaptsimpson_integral.h
index 5395b65e80de8b560fd93e6e547a3dfbf9cd366e..4059950a3d683974daf76b7acb35e012d59227a2 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_adaptsimpson_integral.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_adaptsimpson_integral.h
@@ -15,18 +15,18 @@ class vnl_adaptsimpson_integral : public vnl_definite_integral
protected:
- //: maximum recursion deepth
- int deepth_;
+ //: maximum recursion depth
+ int depth_;
//: real computation
double adaptivesimpson(double(*f)(double*), double a, double b, double eps, int level, int level_max);
-
+
public:
- vnl_adaptsimpson_integral(int deepth = 32) : deepth_(deepth) {}
+ vnl_adaptsimpson_integral(int depth = 32) : depth_(depth) {}
//: a and b are integral limits respectively.
// n is the number of intervals used in integral.
- // accuracy is the accuracy you want to achieve. Norally accuracy > 1e-11)
+ // accuracy is the accuracy you want to achieve. Normally accuracy > 1e-11)
double integral(vnl_integrant_fnct *f, double a, double b, double accuracy);
};
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_bracket_minimum.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_bracket_minimum.cxx
index e38dc861a4958f904160684e7eba1b57ca988876..f2c49a307ed383e62853629b45431a3b50fec148 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_bracket_minimum.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_bracket_minimum.cxx
@@ -36,8 +36,8 @@ class vnl_bm_func
//: Given initial values a and b, find bracket a<b<c s.t. f(a)>f(b)<f(c)
// Final function values at a,b,c stored in fa,fb,fc
void vnl_bracket_minimum(vnl_cost_function& fn,
- double& a, double& b, double& c,
- double& fa, double& fb, double& fc)
+ double& a, double& b, double& c,
+ double& fa, double& fb, double& fc)
{
// Set up object to evaluate function
// Note that fn takes a vector input - f converts a scalar to a vector
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_bracket_minimum.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_bracket_minimum.h
index 768fe24aac1ebe57afc44f0aad26aacd8f83e47a..c43016ecefeb93d415b215c668e3e1a5a872e22b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_bracket_minimum.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_bracket_minimum.h
@@ -29,7 +29,7 @@
// to stop it if it is supplied with a monotonic function - it will just continue
// forever.
void vnl_bracket_minimum(vnl_cost_function& f,
- double& a, double& b, double& c,
- double& fa, double& fb, double& fc);
+ double& a, double& b, double& c,
+ double& fa, double& fb, double& fc);
#endif // vnl_bracket_minimum_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent.cxx
index 0613432fa55d1447ab14ed2490765f984431e6e9..065b240d5450d4cb5376797cfbd6f4110e78f642 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent.cxx
@@ -6,12 +6,6 @@
#include "vnl_brent.h"
#include <vcl_cassert.h>
-#include <vcl_cmath.h>
-#include <vcl_iostream.h>
-#include <vcl_algorithm.h>
-
-#include <vnl/vnl_math.h>
-#include <vnl/vnl_vector.h>
#include <vnl/algo/vnl_bracket_minimum.h>
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent.h
index d48b1cca274ad7da6ab4eeec5c07454553ad21d8..558e6f6f50965ca509e154846d9f862005fef771 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent.h
@@ -10,13 +10,12 @@
// \date 07 Dec 00
//
// \verbatim
-// Modifications
-// 31 May 2001 Ian Scott (Manchester). Added some documentation
-// 31 May 2001 Ian Scott (Manchester). Added minimize_given_bounds_and_1st_f
+// Modifications
+// 31 May 2001 Ian Scott (Manchester). Added some documentation
+// 31 May 2001 Ian Scott (Manchester). Added minimize_given_bounds_and_1st_f
// \endverbatim
#include <vnl/vnl_cost_function.h>
-#include <vnl/vnl_nonlinear_minimizer.h>
#include <vnl/algo/vnl_brent_minimizer.h>
//: Brent 1D minimizer (deprecated)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent_minimizer.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent_minimizer.cxx
index a88197bf58c8856764b817ab7f8fc6e37e4dfa73..0aa29b695aae2e5a1d41f815067c8256681f6f5b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent_minimizer.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent_minimizer.cxx
@@ -46,7 +46,7 @@ vnl_brent_minimizer::~vnl_brent_minimizer()
// The tolerance can be set using prior call to set_x_tolerance(tol).
// Use f_at_last_minimum() to get function evaluation at the returned minima.
double vnl_brent_minimizer::minimize_golden(double a, double b, double c,
- double fa, double fb, double fc)
+ double fa, double fb, double fc)
{
// Set up object to evaluate function as f(x)
// Note that *f_ takes a vector input - f converts a scalar to a vector
@@ -253,7 +253,7 @@ double vnl_brent_minimizer::minimize_given_bounds_and_one_f(double ax, double bx
// The tolerance can be set using prior call to set_x_tolerance(tol).
// Use f_at_last_minimum() to get function evaluation at the returned minima.
double vnl_brent_minimizer::minimize_given_bounds_and_all_f(double ax, double bx, double cx,
- double fa, double fb, double fc)
+ double fa, double fb, double fc)
{
// Check that the bracket is valid
assert(ax<bx);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent_minimizer.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent_minimizer.h
index fb1178e7f268c3d0b37efb4189d40f01fe140a5e..fdfdad9b78c9a336e7fa618d63133ba00072f3c7 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent_minimizer.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_brent_minimizer.h
@@ -71,7 +71,7 @@ class vnl_brent_minimizer : public vnl_nonlinear_minimizer
// The tolerance can be set using prior call to set_x_tolerance(tol).
// Use f_at_last_minimum() to get function evaluation at the returned minima.
double minimize_golden(double ax, double bx, double cx,
- double fa, double fb, double fc);
+ double fa, double fb, double fc);
//: Find the minimum value of f(x) within a<= x <= c.
// \retval The position,x, of the minimum x.
@@ -87,7 +87,7 @@ class vnl_brent_minimizer : public vnl_nonlinear_minimizer
// The tolerance can be set using prior call to set_x_tolerance(tol).
// Use f_at_last_minimum() to get function evaluation at the returned minima.
double minimize_given_bounds_and_one_f(double ax, double bx, double cx,
- double fb);
+ double fb);
//: Find the minimum value of f(x) within a<= x <= c.
// \retval The position,x, of the minimum x.
@@ -99,8 +99,7 @@ class vnl_brent_minimizer : public vnl_nonlinear_minimizer
// The tolerance can be set using prior call to set_x_tolerance(tol).
// Use f_at_last_minimum() to get function evaluation at the returned minima.
double minimize_given_bounds_and_all_f(double ax, double bx, double cx,
- double fa, double fb, double fc);
-
+ double fa, double fb, double fc);
};
#endif // vnl_brent_minimizer_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_chi_squared.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_chi_squared.h
index 3b30770a384b57cb29ac7f00eb2790f5fbc8d4c5..84383c6e36db1cf311d64767b1b96591e17377cd 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_chi_squared.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_chi_squared.h
@@ -6,18 +6,26 @@
#endif
//:
// \file
-// \brief Name space for various chi-squared distribution functions.
+// \brief Name space for various (mostly templated) chi-squared distribution functions.
// \author Rupert Curwen, GE CRD
// \date August 18th, 1998
//
// \verbatim
-// Modifications
-// dac (Manchester) 26/03/2001: tidied up documentation
+// Modifications
+// 26/03/2001 dac (Manchester) tidied up documentation
+// 24 Mar 2010 Peter Vanroose made vnl_chi_squared_cumulative() templated
// \endverbatim
-
-//: Compute cumulative distribution function value for chi-squared distribution
-extern double vnl_chi_squared_cumulative(double chisq, long dof);
+//: Compute cumulative distribution function value for chi-squared distribution.
+// This subroutine computes the cumulative distribution function
+// value for the chi-squared distribution with integer degrees of
+// freedom parameter = dof. This distribution is defined for all
+// non-negative chisq. Thus if a random variable x is drawn from a
+// chi-squared distribution with d degrees of freedom, then
+// $P(x < X) =$ vnl_chi_squared_cumulative(X,d).
+// Internally, T=double is used.
+template <class T>
+double vnl_chi_squared_cumulative(T chisq, long dof);
//------------------------------------------------------------
@@ -54,4 +62,7 @@ template <class T>
double vnl_chi_squared_statistic_12(T const *A, T const *B,
int n, bool normalize);
+#define VNL_CHI_SQUARED_INSTANTIATE(T) \
+extern "please include vnl/algo/vnl_chi_squared.txx first"
+
#endif // vnl_chi_squared_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_chi_squared.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_chi_squared.txx
similarity index 69%
rename from Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_chi_squared.cxx
rename to Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_chi_squared.txx
index a3a9fe8560e3622b11d7432575d1d7dcf8c74ab1..1b20adbad5e27fe6dbb9e103955736e360545a1e 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_chi_squared.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_chi_squared.txx
@@ -1,26 +1,25 @@
-// This is core/vnl/algo/vnl_chi_squared.cxx
-#ifdef VCL_NEEDS_PRAGMA_INTERFACE
-#pragma implementation
-#endif
+// This is core/vnl/algo/vnl_chi_squared.txx
+#ifndef vnl_chi_squared_txx_
+#define vnl_chi_squared_txx_
//:
// \file
+// \verbatim
+// Modifications
+// 24 Mar 2010 Peter Vanroose renamed from .cxx to .txx and moved out template instantiations
+// \endverbatim
#include "vnl_chi_squared.h"
+//------------------------------------------------------------
+
// FORTRAN routine
-#include <vnl/algo/vnl_netlib.h> // dchscdf_()
-
-//: Compute cumulative distribution function for chi-squared distribution.
-// This subroutine computes the cumulative distribution function
-// value for the chi-squared distribution with integer degrees of
-// freedom parameter = dof. This distribution is defined for all
-// non-negative chisq. Thus if a random variable x is drawn from a
-// chi-squared distribution with d degrees of freedom, then P(x < X) =
-// vnl_chi_squared::vnl_chi_squaredCumulative(X,d).
-double vnl_chi_squared_cumulative(double chisq, long dof)
+#include <vnl/algo/vnl_netlib.h> // for dchscdf_()
+
+template <class T>
+double vnl_chi_squared_cumulative(T chisq, long dof)
{
- double cdf;
- v3p_netlib_dchscdf_(&chisq,&dof,&cdf);
+ double cdf, chisqr = chisq;
+ v3p_netlib_dchscdf_(&chisqr,&dof,&cdf);
return cdf;
}
@@ -100,10 +99,11 @@ double vnl_chi_squared_statistic_12(T const *A, T const *B, int n, bool normaliz
return sum;
}
-#define inst(T) \
+#undef VNL_CHI_SQUARED_INSTANTIATE
+#define VNL_CHI_SQUARED_INSTANTIATE(T) \
+template double vnl_chi_squared_cumulative (T chisq, long dof); \
template double vnl_chi_squared_statistic_1 (T const *, T const *, int, bool); \
template double vnl_chi_squared_statistic_2 (T const *, T const *, int, bool); \
template double vnl_chi_squared_statistic_12(T const *, T const *, int, bool)
-inst(int);
-inst(double);
+#endif // vnl_chi_squared_txx_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_cholesky.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_cholesky.cxx
index 4e2de3f4c3055d2e85e23b38e09c76d32aff40a4..7647af9881fc0858c1af220bfbfe242d65705322 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_cholesky.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_cholesky.cxx
@@ -33,7 +33,7 @@ vnl_cholesky::vnl_cholesky(vnl_matrix<double> const & M, Operation mode):
assert(n == (int)(M.rows()));
num_dims_rank_def_ = -1;
if (vcl_fabs(M(0,n-1) - M(n-1,0)) > 1e-8) {
- vcl_cerr << "vnl_cholesky: WARNING: unsymmetric: " << M << vcl_endl;
+ vcl_cerr << "vnl_cholesky: WARNING: non-symmetric: " << M << vcl_endl;
}
if (mode != estimate_condition) {
@@ -41,9 +41,10 @@ vnl_cholesky::vnl_cholesky(vnl_matrix<double> const & M, Operation mode):
v3p_netlib_dpofa_(A_.data_block(), &n, &n, &num_dims_rank_def_);
if (mode == verbose && num_dims_rank_def_ != 0)
vcl_cerr << "vnl_cholesky: " << num_dims_rank_def_ << " dimensions of non-posdeffness\n";
- } else {
- vnl_vector<double> nullvector(n);
- v3p_netlib_dpoco_(A_.data_block(), &n, &n, &rcond_, nullvector.data_block(), &num_dims_rank_def_);
+ }
+ else {
+ vnl_vector<double> nullvec(n);
+ v3p_netlib_dpoco_(A_.data_block(), &n, &n, &rcond_, nullvec.data_block(), &num_dims_rank_def_);
if (num_dims_rank_def_ != 0)
vcl_cerr << "vnl_cholesky: rcond=" << rcond_ << " so " << num_dims_rank_def_ << " dimensions of non-posdeffness\n";
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_complex_generalized_schur.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_complex_generalized_schur.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..6e48f7c83b7456c88811eefe2b7faf693fb5cdba
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_complex_generalized_schur.cxx
@@ -0,0 +1,108 @@
+// This is core/vnl/algo/vnl_complex_generalized_schur.cxx
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma implementation
+#endif
+//:
+// \file
+// \author fsm
+
+#include "vnl_complex_generalized_schur.h"
+
+#include <vcl_iostream.h>
+#include <vcl_cassert.h>
+
+#include <vnl/vnl_vector.h>
+
+#include <vnl/algo/vnl_netlib.h> // zgges_()
+
+VCL_DEFINE_SPECIALIZATION
+bool vnl_generalized_schur(vnl_matrix<vcl_complex<double> > *A,
+ vnl_matrix<vcl_complex<double> > *B,
+ vnl_vector<vcl_complex<double> > *alpha,
+ vnl_vector<vcl_complex<double> > *beta,
+ vnl_matrix<vcl_complex<double> > *L,
+ vnl_matrix<vcl_complex<double> > *R)
+{
+ // Both input matrices should be square and of the same size:
+ assert(A->rows() == A->cols());
+ assert(A->cols() == B->rows());
+ assert(B->rows() == B->cols());
+
+ long n = A->rows();
+ assert(alpha!=0); alpha->set_size(n); alpha->fill(0);
+ assert(beta!=0); beta ->set_size(n); beta ->fill(0);
+ assert(L!=0); L ->set_size(n, n); L ->fill(0);
+ assert(R!=0); R ->set_size(n, n); R ->fill(0);
+
+ long sdim = 0;
+ long lwork = 1000 + (8*n + 16);
+ vcl_complex<double> *work = new vcl_complex<double>[lwork];
+ double *rwork = new double[2*n + 1];
+ v3p_netlib_logical *bwork = new v3p_netlib_logical[n + 1];
+ long info = 0;
+ A->inplace_transpose();
+ B->inplace_transpose();
+ v3p_netlib_zgges_ ("V", "V",
+ "N",
+ 0,
+ &n,
+ A->data_block(), &n,
+ B->data_block(), &n,
+ &sdim,
+ alpha->data_block(),
+ beta->data_block(),
+ L->data_block(), &n,
+ R->data_block(), &n,
+ &work[0], &lwork,
+ &rwork[0], &bwork[0],
+ &info, 1, 1, 1);
+ A->inplace_transpose();
+ B->inplace_transpose();
+ L->inplace_transpose();
+ R->inplace_transpose();
+ delete [] work;
+ delete [] bwork;
+ delete [] rwork;
+
+ if (info == 0) {
+ // ok
+ return true;
+ }
+ else
+ {
+ // These return codes are taken from zgges.f:
+ //* = 0: successful exit
+ //* < 0: if INFO = -i, the i-th argument had an illegal value.
+ //* =1,...,N:
+ //* The QZ iteration failed. (A,B) are not in Schur
+ //* form, but ALPHA(j) and BETA(j) should be correct for
+ //* j=INFO+1,...,N.
+ //* > N: =N+1: other than QZ iteration failed in ZHGEQZ
+ //* =N+2: after reordering, roundoff changed values of
+ //* some complex eigenvalues so that leading
+ //* eigenvalues in the Generalized Schur form no
+ //* longer satisfy SELCTG=.TRUE. This could also
+ //* be caused due to scaling.
+ //* =N+3: reordering falied in ZTGSEN.
+ vcl_cerr << __FILE__ ": info = " << info << ", something went wrong:\n";
+ if (info < 0) {
+ vcl_cerr << __FILE__ ": (internal error) the " << (-info) << "th argument had an illegal value\n";
+ }
+ else if (1 <= info && info <= n) {
+ vcl_cerr << __FILE__ ": the QZ iteration failed, but the last " << (n - info) << " eigenvalues may be correct\n";
+ }
+ else if (info == n+1) {
+ vcl_cerr << __FILE__ ": something went wrong in ZHGEQZ\n";
+ }
+ else if (info == n+2) {
+ vcl_cerr << __FILE__ ": roundoff error -- maybe due to poor scaling\n";
+ }
+ else if (info == n+3) {
+ vcl_cerr << __FILE__ ": reordering failed in ZTGSEN\n";
+ }
+ else {
+ vcl_cerr << __FILE__ ": unknown error\n";
+ }
+ return false;
+ }
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_complex_generalized_schur.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_complex_generalized_schur.h
new file mode 100644
index 0000000000000000000000000000000000000000..19d378cad83f28fd8873c674ce17023f7ef2a01f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_complex_generalized_schur.h
@@ -0,0 +1,92 @@
+// This is core/vnl/algo/vnl_complex_generalized_schur.h
+#ifndef vnl_complex_generalized_schur_h_
+#define vnl_complex_generalized_schur_h_
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma interface
+#endif
+//:
+// \file
+// \brief Solves the generalized eigenproblem det(t A - s B) = 0.
+// \author Peter Vanroose, ABIS Leuven
+// \date 9 Jan 2011
+// Adapted from vnl_generalized_schur.h/.cxx
+
+#include <vnl/vnl_matrix.h>
+#include <vnl/vnl_vector.h>
+
+#include <vcl_complex.h>
+
+//:
+// For a scalar type T, this function uses orthogonal matrices L, R
+// over complex<T> to reduce the (square) matrices A, B to generalized
+// (complex) Schur form. This means that A and B become upper triangular,
+// A <-- L^* A R, and B <-- L^* B R.
+// Of course, A and B should be of the same size.
+//
+// In addition, the function computes the (complex) generalized eigenvalues
+// alpha(k) : beta(k) for k = 0, 1, 2,...
+//
+// To pass in scalar type T matrices A and B, you'll have to first convert them
+// to complex matrices since they will be overwritten by they (complex) upper
+// triangular decomposition.
+template <class T>
+bool vnl_generalized_schur(vnl_matrix<vcl_complex<T> > *A,
+ vnl_matrix<vcl_complex<T> > *B,
+ vnl_vector<vcl_complex<T> > *alpha,
+ vnl_vector<vcl_complex<T> > *beta,
+ vnl_matrix<vcl_complex<T> > *L,
+ vnl_matrix<vcl_complex<T> > *R);
+
+VCL_DEFINE_SPECIALIZATION
+bool vnl_generalized_schur(vnl_matrix<vcl_complex<double> > *A,
+ vnl_matrix<vcl_complex<double> > *B,
+ vnl_vector<vcl_complex<double> > *alpha,
+ vnl_vector<vcl_complex<double> > *beta,
+ vnl_matrix<vcl_complex<double> > *L,
+ vnl_matrix<vcl_complex<double> > *R);
+
+#include <vcl_algorithm.h>
+
+template <class T>
+vcl_complex<T> vnl_complex_generalized_schur_convert_cast(vcl_complex<double> a) { return static_cast<vcl_complex<T> >(a); }
+
+template <class T>
+inline bool vnl_generalized_schur(vnl_matrix<vcl_complex<T> > *A,
+ vnl_matrix<vcl_complex<T> > *B,
+ vnl_vector<vcl_complex<T> > *alpha,
+ vnl_vector<vcl_complex<T> > *beta,
+ vnl_matrix<vcl_complex<T> > *L,
+ vnl_matrix<vcl_complex<T> > *R)
+{
+ vnl_matrix<vcl_complex<double> > A_(A->rows(), A->cols());
+ vnl_matrix<vcl_complex<double> > B_(B->rows(), B->cols());
+ vcl_copy(A->begin(), A->end(), A_.begin());
+ vcl_copy(B->begin(), B->end(), B_.begin());
+
+ vnl_vector<vcl_complex<double> > alpha_;
+ vnl_vector<vcl_complex<double> > beta_;
+ vnl_matrix<vcl_complex<double> > L_;
+ vnl_matrix<vcl_complex<double> > R_;
+
+ if (! vnl_generalized_schur/*<vcl_complex<double> >*/(&A_, &B_, &alpha_, &beta_, &L_, &R_))
+ return false;
+
+ vcl_transform(A_.begin(), A_.end(), A->begin(), vnl_complex_generalized_schur_convert_cast<T>);
+ vcl_transform(B_.begin(), B_.end(), B->begin(), vnl_complex_generalized_schur_convert_cast<T>);
+
+ alpha->set_size(alpha_.size());
+ vcl_transform(alpha_.begin(), alpha_.end(), alpha->begin(), vnl_complex_generalized_schur_convert_cast<T>);
+
+ beta->set_size(beta_.size());
+ vcl_transform(beta_.begin(), beta_.end(), beta->begin(), vnl_complex_generalized_schur_convert_cast<T>);
+
+ L->set_size(L_.rows(), L_.cols());
+ vcl_transform(L_.begin(), L_.end(), L->begin(), vnl_complex_generalized_schur_convert_cast<T>);
+
+ R->set_size(R_.rows(), R_.cols());
+ vcl_transform(R_.begin(), R_.end(), R->begin(), vnl_complex_generalized_schur_convert_cast<T>);
+
+ return true;
+}
+
+#endif // vnl_complex_generalized_schur_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_conjugate_gradient.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_conjugate_gradient.cxx
index 8c1f2ac873508e23be5ec9364824a79f5f3c0055..00a2210e7e4d9601f5ddcb1ff5493fb762f2f990 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_conjugate_gradient.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_conjugate_gradient.cxx
@@ -178,9 +178,11 @@ bool vnl_conjugate_gradient::minimize( vnl_vector<double> &x)
{
switch (error_code)
{
- case 1: vcl_cout << "UNABLE TO OBTAIN DESCENT DIRECTION\n"; break;
- case 2: vcl_cout << "THE FUNCTION DECREASES WITH NO MINIMUM\n"; break;
- case 3: vcl_cout << "PRECONDITIONER NOT POSITIVE DEFINITE\n"; break;
+ case 1: vcl_cout << "UNABLE TO OBTAIN DESCENT DIRECTION\n"; break;
+ case 2: vcl_cout << "THE FUNCTION DECREASES WITH NO MINIMUM\n"; break;
+ case 3: vcl_cout << "PRECONDITIONER NOT POSITIVE DEFINITE\n"; break;
+ case 4: vcl_cout << "UNABLE TO SATISFY ARMIJO CONDITION\n"; break;
+ default: vcl_cout << "UNKNOWN ERROR CODE\n"; break;
}
}
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_convolve.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_convolve.h
index bb117f5f4a43593d7f715ed558910b19018deef1..81bf48beb0aff27d6b536f803d2edf79f1768cb0 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_convolve.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_convolve.h
@@ -45,6 +45,7 @@ vnl_convolve(vnl_vector<T1> const& v1, vnl_vector<T2> const& v2,
// The returned vnl_vector has the same base type T, and is identical to
// the return value of the previous function when T1 = T2 = U.
//
+// \relatesalso vnl_vector
template <class T>
vnl_vector<T>
vnl_convolve(vnl_vector<T> const& v1, vnl_vector<T> const& v2,
@@ -67,6 +68,7 @@ vnl_convolve(vnl_vector<T> const& v1, vnl_vector<T> const& v2,
// This will generally be faster for large n, especially if the vectors are
// not sparse, and/or if n is a power of 2.
//
+// \relatesalso vnl_vector
template <class T1, class T2, class U>
vnl_vector<U>
vnl_convolve_cyclic(vnl_vector<T1> const& v1, vnl_vector<T2> const& v2,
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_convolve.txx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_convolve.txx
index 6321e199d15838798a7d3264cd1239660492a96f..83b4e94152202834ea9a1956b1e9b849b91a4e49 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_convolve.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_convolve.txx
@@ -79,8 +79,8 @@ vnl_vector<U> vnl_convolve_using_fft(vnl_vector<T1> const& v1, vnl_vector<T2> co
while (!has_only_primefactors_2_3_5(n)) ++n;
// pad with zeros, so the cyclic convolution is a convolution:
- vnl_vector<U> w1(n, U(0)); for (unsigned i=0; i<v1.size(); ++i) w1[i]=v1[i];
- vnl_vector<U> w2(n, U(0)); for (unsigned i=0; i<v2.size(); ++i) w2[i]=v2[i];
+ vnl_vector<U> w1(n, U(0)); for (unsigned i=0; i<v1.size(); ++i) w1[i]=U(v1[i]);
+ vnl_vector<U> w2(n, U(0)); for (unsigned i=0; i<v2.size(); ++i) w2[i]=U(v2[i]);
// convolve, using n-points FFT:
w1 = vnl_convolve_cyclic_using_fft(w1, w2, (U*)0);
// return w1, but possibly drop the last few (zero) entries:
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_determinant.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_determinant.h
index 50d9cff7bcaee1b49f42b68fa47ec337f2b9061e..c2e8407465ef6fbd93845c49bc231c8b9b998660 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_determinant.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_determinant.h
@@ -43,11 +43,13 @@ template <class T> T vnl_determinant(T const *row0,
int vnl_determinant(vnl_matrix<int> const &M, bool balance = false);
//: evaluation using direct methods for sizes of 2x2, 3x3, and 4x4 or qr decomposition for other matrices.
+// \relatesalso vnl_matrix
template <class T>
T vnl_determinant(vnl_matrix<T> const &M, bool balance = false);
-//: convenience overload
-// See other vnl_determinant.
+//: evaluation using direct methods for sizes of 2x2, 3x3, and 4x4 or qr decomposition for other matrices.
+// convenience overload from vnl_matrix<T> variant
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned m, unsigned n>
inline T vnl_determinant(vnl_matrix_fixed<T,m,n> const &M, bool balance = false)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_discrete_diff.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_discrete_diff.h
index 2ffa13f36fa46e9c2afec95fa97a0b018d7b9dea..37d0bd3507c2d06366e9fa1fff1a948c05f933ea 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_discrete_diff.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_discrete_diff.h
@@ -1,9 +1,8 @@
#ifndef vnl_discrete_diff_h_
#define vnl_discrete_diff_h_
-
//:
-// \file
-// \brief Functions to compute jacobians of vnl_least_squares_functions
+// \file
+// \brief Functions to compute jacobians of vnl_least_squares_functions
//
// Functions to compute jacobians of vnl_least_squares_functions
// by discrete differences. They return false on failure and
@@ -19,12 +18,12 @@
// J mxn jacobian of the function at x.
// \endverbatim
//
-// \author fsm
+// \author fsm
//
// \verbatim
-// Modifications
-// dac (Manchester) 28/03/2001: tidied up documentation
-// Peter Vanroose 27/05/2001: Corrected documentation
+// Modifications
+// dac (Manchester) 28/03/2001: tidied up documentation
+// Peter Vanroose 27/05/2001: Corrected documentation
// \endverbatim
#include <vnl/vnl_vector.h>
@@ -32,18 +31,21 @@
class vnl_least_squares_function;
//: forward differences
+// \relatesalso vnl_least_squares_function
bool vnl_discrete_diff_fwd(vnl_least_squares_function *lsf,
double h,
vnl_vector<double> const &x,
vnl_matrix<double> &J);
//: forward differences
+// \relatesalso vnl_least_squares_function
bool vnl_discrete_diff_fwd(vnl_least_squares_function *lsf,
vnl_vector<double> const &h,
vnl_vector<double> const &x,
vnl_matrix<double> &J);
//: forward differences
+// \relatesalso vnl_least_squares_function
bool vnl_discrete_diff_fwd(vnl_least_squares_function *lsf,
vnl_vector<double> const &h,
vnl_vector<double> const &x,
@@ -51,12 +53,14 @@ bool vnl_discrete_diff_fwd(vnl_least_squares_function *lsf,
vnl_matrix<double> &J);
//: symmetric differences
+// \relatesalso vnl_least_squares_function
bool vnl_discrete_diff_sym(vnl_least_squares_function *lsf,
double h,
vnl_vector<double> const &x,
vnl_matrix<double> &J);
//: symmetric differences
+// \relatesalso vnl_least_squares_function
bool vnl_discrete_diff_sym(vnl_least_squares_function *lsf,
vnl_vector<double> const &h,
vnl_vector<double> const &x,
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_fft_prime_factors.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_fft_prime_factors.h
index 46c22cb2e829f771ab79e4c6376247e012ba3c14..aeea7aaef310eed8f8c79819da53aea49eb2b26b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_fft_prime_factors.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_fft_prime_factors.h
@@ -64,7 +64,7 @@ public:
// disallow copying
vnl_fft_prime_factors (vnl_fft_prime_factors<T> const &) { }
- void operator= (vnl_fft_prime_factors<T> const &) { }
+ vnl_fft_prime_factors<T>& operator= (vnl_fft_prime_factors<T> const &) { return *this; }
};
#endif // vnl_fft_prime_factors_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_fit_parabola.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_fit_parabola.h
index 816943155c715e5501dd46784ed5a6510b93f8e0..7263fce5bd03594070aa70de62f3ad0ac785300d 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_fit_parabola.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_fit_parabola.h
@@ -16,8 +16,8 @@
// The centre (maxima or minima) lies at xb + p/q.
// If q is near zero, then the parabola is nearly flat
inline void vnl_fit_parabola(double xa, double xb, double xc,
- double fa, double fb, double fc,
- double& p, double& q)
+ double fa, double fb, double fc,
+ double& p, double& q)
{
// Effectively shift origin to (xb,fb)
// Parabola is then y=a*x*x+b*x
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_gaussian_kernel_1d.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_gaussian_kernel_1d.cxx
index 7fe2cc79771ee1f296df26fc242d2e437d15ef51..e799dc71e5e3b443936255eb4a471a43cb206c54 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_gaussian_kernel_1d.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_gaussian_kernel_1d.cxx
@@ -5,7 +5,7 @@
//:
// \file
// \author Andrew W. Fitzgibbon, Oxford RRG
-// \date 07 Aug 97
+// \date 07 Aug 1997
//
//-----------------------------------------------------------------------------
@@ -28,10 +28,10 @@ double compute_width(double sigma, double cutoff)
vnl_gaussian_kernel_1d::vnl_gaussian_kernel_1d(double sigma, double cutoff):
vec_((int)vcl_ceil(compute_width(sigma, cutoff)))
{
- int width = vec_.size();
+ int wid = vec_.size();
inscale_ = 0.5/(sigma * sigma);
double area = 0;
- for (int i = 0; i < width; ++i) {
+ for (int i = 0; i < wid; ++i) {
double v = G(i);
area += v;
vec_[i] = v;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_gaussian_kernel_1d.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_gaussian_kernel_1d.h
index 57ac6d76a7d909973313c4df16930616c28bc45e..793bb8bac678a650df77e2beef30cb663f9f57ff 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_gaussian_kernel_1d.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_gaussian_kernel_1d.h
@@ -19,9 +19,6 @@
#include <vnl/vnl_vector.h>
//: Holds one half of a discretely sampled 1D gaussian distribution
-// vnl_gaussian_kernel_1d is a class that holds one half of a discretely
-// sampled 1D gaussian distribution.
-
class vnl_gaussian_kernel_1d
{
public:
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_eigensystem.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_eigensystem.cxx
index 4fa2ed1d59919a7aada3c8ac63a73cf2f30c72c5..a1782c45e0dad71830ea495edc8da1f4139c0944 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_eigensystem.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_eigensystem.cxx
@@ -40,10 +40,10 @@ vnl_generalized_eigensystem::vnl_generalized_eigensystem(const vnl_matrix<double
// Call EISPACK rsg.
v3p_netlib_rsg_ (&n, &n, a, b, D.data_block(),
- &want_eigenvectors,
- V1.begin(),
- work1.begin(),
- work2.begin(), &ierr);
+ &want_eigenvectors,
+ V1.begin(),
+ work1.begin(),
+ work2.begin(), &ierr);
// If b was not pos-def, retry with projection onto nullspace
if (ierr == 7*n+1) {
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_schur.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_schur.cxx
index 1198a41d25868b0a2181480a638d6c7746a5b2ee..a5349afd9abed62fa61aaade4fad46389714933f 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_schur.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_schur.cxx
@@ -42,20 +42,20 @@ bool vnl_generalized_schur(vnl_matrix<double> *A,
A->inplace_transpose();
B->inplace_transpose();
v3p_netlib_dgges_ ("V", "V",
- "N",
- 0,
- &n,
- A->data_block(), &n,
- B->data_block(), &n,
- &sdim,
- alphar->data_block(),
- alphai->data_block(),
- beta->data_block(),
- L->data_block(), &n,
- R->data_block(), &n,
- &work[0], &lwork,
- 0,
- &info, 1, 1, 1);
+ "N",
+ 0,
+ &n,
+ A->data_block(), &n,
+ B->data_block(), &n,
+ &sdim,
+ alphar->data_block(),
+ alphai->data_block(),
+ beta->data_block(),
+ L->data_block(), &n,
+ R->data_block(), &n,
+ &work[0], &lwork,
+ 0,
+ &info, 1, 1, 1);
A->inplace_transpose();
B->inplace_transpose();
L->inplace_transpose();
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_schur.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_schur.h
index cf11a03fe7061e584f3ffe139b143029348728d0..0e637fe44da0a47a1003cbf90ea7d6662fc1cd1e 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_schur.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_generalized_schur.h
@@ -56,6 +56,9 @@ bool vnl_generalized_schur(vnl_matrix<double> *A,
#include <vcl_algorithm.h>
+template <class T>
+T vnl_generalized_schur_convert_cast(double a) { return static_cast<T>(a); }
+
template <class T>
inline bool vnl_generalized_schur(vnl_matrix<T> *A,
vnl_matrix<T> *B,
@@ -79,14 +82,23 @@ inline bool vnl_generalized_schur(vnl_matrix<T> *A,
if (! vnl_generalized_schur/*<double>*/(&A_, &B_, &alphar_, &alphai_, &beta_, &L_, &R_))
return false;
- vcl_copy(A_.begin(), A_.end(), A->begin());
- vcl_copy(B_.begin(), B_.end(), B->begin());
+ vcl_transform(A_.begin(), A_.end(), A->begin(), vnl_generalized_schur_convert_cast<T>);
+ vcl_transform(B_.begin(), B_.end(), B->begin(), vnl_generalized_schur_convert_cast<T>);
+
+ alphar->set_size(alphar_.size());
+ vcl_transform(alphar_.begin(), alphar_.end(), alphar->begin(), vnl_generalized_schur_convert_cast<T>);
+
+ alphai->set_size(alphai_.size());
+ vcl_transform(alphai_.begin(), alphai_.end(), alphai->begin(), vnl_generalized_schur_convert_cast<T>);
+
+ beta ->set_size(beta_ .size());
+ vcl_transform(beta_ .begin(), beta_ .end(), beta ->begin(), vnl_generalized_schur_convert_cast<T>);
+
+ L->set_size(L_.rows(), L_.cols());
+ vcl_transform(L_.begin(), L_.end(), L->begin(), vnl_generalized_schur_convert_cast<T>);
- alphar->set_size(alphar_.size()); vcl_copy(alphar_.begin(), alphar_.end(), alphar->begin());
- alphai->set_size(alphai_.size()); vcl_copy(alphai_.begin(), alphai_.end(), alphai->begin());
- beta ->set_size(beta_ .size()); vcl_copy(beta_ .begin(), beta_ .end(), beta ->begin());
- L->set_size(L_.rows(), L_.cols()); vcl_copy(L_.begin(), L_.end(), L->begin());
- R->set_size(R_.rows(), R_.cols()); vcl_copy(R_.begin(), R_.end(), R->begin());
+ R->set_size(R_.rows(), R_.cols());
+ vcl_transform(R_.begin(), R_.end(), R->begin(), vnl_generalized_schur_convert_cast<T>);
return true;
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgs.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgs.cxx
index b661cd18bd9ce9eaa6ed225e5d4f7b95b0253f6a..f7c588ba15f051ea491909f61d68904247b99a24 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgs.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgs.cxx
@@ -167,7 +167,7 @@ bool vnl_lbfgs::minimize(vnl_vector<double>& x)
}
if (this->num_evaluations_ > get_max_function_evals()) {
- failure_code_ = FAILED_TOO_MANY_ITERATIONS;
+ failure_code_ = TOO_MANY_ITERATIONS;
ok = false;
x = best_x;
break;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgsb.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgsb.cxx
index 602a3a42a3e48d3e3eb8c5690076531180b98461..879dd2f925def90856f68ed8b6e59990e8f13f4b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgsb.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgsb.cxx
@@ -59,8 +59,7 @@ bool vnl_lbfgsb::minimize(vnl_vector<double>& x)
double dsave[29];
// Task communication.
- char task[61] =
- "START ";
+ char task[61]="START ";
// Verbosity level inside lbfgs implementation.
// (-1 no o/p, 0 start and end, 1 every iter)
@@ -77,8 +76,8 @@ bool vnl_lbfgsb::minimize(vnl_vector<double>& x)
vnl_vector<double> x_best(x);
bool ok = true;
- for(;;)
- {
+ for (;;)
+ {
// Call the L-BFGS-B code.
v3p_netlib_setulb_(
&n,
@@ -98,94 +97,94 @@ bool vnl_lbfgsb::minimize(vnl_vector<double>& x)
);
// Check the current task.
- if(vcl_strncmp("FG", task, 2) == 0)
- {
+ if (vcl_strncmp("FG", task, 2) == 0)
+ {
// Evaluate the function and gradient.
this->f_->compute(x, &f, &gradient);
- if(this->num_evaluations_ == 0)
- {
+ if (this->num_evaluations_ == 0)
+ {
x_best = x;
this->start_error_ = f;
this->end_error_ = f;
- }
- else if(f < this->end_error_)
- {
+ }
+ else if (f < this->end_error_)
+ {
x_best = x;
this->end_error_ = f;
- }
- this->report_eval(f);
}
- else if(vcl_strncmp("NEW_X", task, 5) == 0)
- {
+ this->report_eval(f);
+ }
+ else if (vcl_strncmp("NEW_X", task, 5) == 0)
+ {
// dsave[12] = the infinity norm of the projected gradient
this->inf_norm_projected_gradient_ = dsave[12];
// Iteration.a
- if(this->report_iter())
- {
+ if (this->report_iter())
+ {
this->failure_code_ = FAILED_USER_REQUEST;
ok = false;
break;
- }
}
- else if(vcl_strncmp("ERROR", task, 5) == 0)
- {
+ }
+ else if (vcl_strncmp("ERROR", task, 5) == 0)
+ {
// some error
this->failure_code_ = ERROR_FAILURE;
ok = false;
break;
- }
- else if(vcl_strncmp("CONVERGENCE", task, 11) == 0)
- {
+ }
+ else if (vcl_strncmp("CONVERGENCE", task, 11) == 0)
+ {
// convergence has been reached
- if(f < this->end_error_)
- {
+ if (f < this->end_error_)
+ {
x_best = x;
this->end_error_ = f;
- }
+ }
- if(vcl_strncmp("CONVERGENCE: REL_REDUCTION_OF_F <= FACTR*EPSMCH",
- task, 47) == 0)
- {
+ if (vcl_strncmp("CONVERGENCE: REL_REDUCTION_OF_F <= FACTR*EPSMCH",
+ task, 47) == 0)
+ {
// function tolerance reached
this->failure_code_ = CONVERGED_FTOL;
- }
- else if(vcl_strncmp("CONVERGENCE: NORM OF PROJECTED GRADIENT <= PGTOL",
- task, 48) == 0)
- {
+ }
+ else if (vcl_strncmp("CONVERGENCE: NORM OF PROJECTED GRADIENT <= PGTOL",
+ task, 48) == 0)
+ {
// gradient tolerance reached
this->failure_code_ = CONVERGED_GTOL;
- }
+ }
else
- {
+ {
this->failure_code_ = ERROR_FAILURE;
- if(trace)
- {
- vcl_cerr << "Unknown convergence type: " << task << std::endl;
- }
+ if (trace)
+ {
+ vcl_cerr << "Unknown convergence type: " << task << vcl_endl;
}
- break;
}
+ break;
+ }
else
- {
+ {
// unknown task
this->failure_code_ = ERROR_FAILURE;
- if(trace)
- {
- vcl_cerr << "Unknown failure with task: " << task << std::endl;
- }
+ if (trace)
+ {
+ vcl_cerr << "Unknown failure with task: " << task << vcl_endl;
+ }
ok = false;
break;
- }
+ }
- if(this->num_evaluations_ > this->get_max_function_evals())
- {
- this->failure_code_ = FAILED_TOO_MANY_ITERATIONS;
+ if (this->num_evaluations_ > this->get_max_function_evals())
+ {
+ this->failure_code_ = TOO_MANY_ITERATIONS;
ok = false;
break;
- }
}
+ }
// Store the best known position no matter the outcome.
x = x_best;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgsb.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgsb.h
index 066b9d8afa92bc7b42621b3789db5fc6d11832d3..4904c0802329edf663fa65546331006b6f4f450a 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgsb.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_lbfgsb.h
@@ -22,7 +22,7 @@
//: Limited memory Broyden Fletcher Goldfarb Shannon minimization with constraints.
// Lower and upper bounds may be specified for the variables to be optimized.
-// The algorithm miminizes a nonlinear function f(x) of n variables
+// The algorithm minimizes a nonlinear function f(x) of n variables
// subject to simple bound constraints of l <= x <= u.
class vnl_lbfgsb : public vnl_nonlinear_minimizer
@@ -38,7 +38,7 @@ class vnl_lbfgsb : public vnl_nonlinear_minimizer
//: Set the bounds to be enforced on each variable.
// The argument should have one entry per unknown.
// Each entry may have one of these values:
- // 0 - variable is not constrainted
+ // 0 - variable is not constrained
// 1 - variable has only a lower bound
// 2 - variable has both lower and upper bounds
// 3 - variable has only an upper bound
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_ldl_cholesky.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_ldl_cholesky.cxx
index 2e591e0e4ed8ad19f64bcb905f7c59eb6cdddb07..aab5b5197025418b4906d8c3c2d95c0b19283187 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_ldl_cholesky.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_ldl_cholesky.cxx
@@ -33,7 +33,7 @@ vnl_ldl_cholesky::vnl_ldl_cholesky(vnl_matrix<double> const & M, Operation mode)
assert(n == (int)(M.rows()));
num_dims_rank_def_ = -1;
if (vcl_fabs(M(0,n-1) - M(n-1,0)) > 1e-8) {
- vcl_cerr << "vnl_ldl_cholesky: WARNING: unsymmetric: " << M << vcl_endl;
+ vcl_cerr << "vnl_ldl_cholesky: WARNING: non-symmetric: " << M << vcl_endl;
}
if (mode != estimate_condition) {
@@ -41,9 +41,10 @@ vnl_ldl_cholesky::vnl_ldl_cholesky(vnl_matrix<double> const & M, Operation mode)
v3p_netlib_dpofa_(L_.data_block(), &n, &n, &num_dims_rank_def_);
if (mode == verbose && num_dims_rank_def_ != 0)
vcl_cerr << "vnl_ldl_cholesky: " << num_dims_rank_def_ << " dimensions of non-posdeffness\n";
- } else {
- vnl_vector<double> nullvector(n);
- v3p_netlib_dpoco_(L_.data_block(), &n, &n, &rcond_, nullvector.data_block(), &num_dims_rank_def_);
+ }
+ else {
+ vnl_vector<double> nullvec(n);
+ v3p_netlib_dpoco_(L_.data_block(), &n, &n, &rcond_, nullvec.data_block(), &num_dims_rank_def_);
if (num_dims_rank_def_ != 0)
vcl_cerr << "vnl_ldl_cholesky: rcond=" << rcond_ << " so " << num_dims_rank_def_ << " dimensions of non-posdeffness\n";
}
@@ -161,11 +162,8 @@ double vnl_ldl_cholesky::xt_m_x(const vnl_vector<double>& x) const
void vnl_ldl_cholesky::solve(vnl_vector<double> const& b,
vnl_vector<double>* xp) const
{
- unsigned n = d_.size();
- assert(b.size() == n);
-
+ assert(b.size() == d_.size());
*xp = b;
-
inplace_solve(xp->data_block());
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_ldl_cholesky.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_ldl_cholesky.h
index 7d9708fafcf8a9d634d88481d52c173cc8e6bf58..121dc374985625228eb32ad6abea58459ad400c9 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_ldl_cholesky.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_ldl_cholesky.h
@@ -66,8 +66,8 @@ class vnl_ldl_cholesky
void update(const vnl_matrix<double>& W);
//: Compute inverse. Not efficient.
- // Note that you rarely need the inverse - backsubtitution
- // is faster and less prone to rounding error.
+ // Note that you rarely need the inverse - backsubstitution
+ // is faster and less prone to rounding errors.
vnl_matrix<double> inverse() const;
//: Return lower-triangular factor.
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_levenberg_marquardt.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_levenberg_marquardt.cxx
index ecdd5b84fe6b9232df1b8b2b5db1e077e121fa4e..f2ee0dac22e01e7f020d362ed5e3da0e16f4b0b9 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_levenberg_marquardt.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_levenberg_marquardt.cxx
@@ -150,16 +150,16 @@ bool vnl_levenberg_marquardt::minimize_without_gradient(vnl_vector<double>& x)
}
vnl_vector<double> fx(m, 0.0); // W m Storage for target vector
- vnl_vector<double> diag(n); // I Multiplicative scale factors for variables
+ vnl_vector<double> diag(n, 0); // I Multiplicative scale factors for variables
long user_provided_scale_factors = 1; // 1 is no, 2 is yes
double factor = 100;
long nprint = 1;
- vnl_vector<double> qtf(n);
- vnl_vector<double> wa1(n);
- vnl_vector<double> wa2(n);
- vnl_vector<double> wa3(n);
- vnl_vector<double> wa4(m);
+ vnl_vector<double> qtf(n, 0);
+ vnl_vector<double> wa1(n, 0);
+ vnl_vector<double> wa2(n, 0);
+ vnl_vector<double> wa3(n, 0);
+ vnl_vector<double> wa4(m, 0);
#ifdef DEBUG
vcl_cerr << "STATUS: " << failure_code_ << '\n';
@@ -206,7 +206,6 @@ bool vnl_levenberg_marquardt::minimize_without_gradient(vnl_vector<double>& x)
case 4: // gtol
return true;
default:
- if (verbose_) diagnose_outcome();
return false;
}
}
@@ -312,23 +311,51 @@ bool vnl_levenberg_marquardt::minimize_using_gradient(vnl_vector<double>& x)
}
vnl_vector<double> fx(m, 0.0); // W m Explicitly set target to 0.0
- vnl_vector<double> wa1(5*n + m);
num_iterations_ = 0;
set_covariance_ = false;
long info;
- long size = wa1.size();
start_error_ = 0; // Set to 0 so first call to lmder_lsqfun will know to set it.
- v3p_netlib_lmder1_(
+
+
+ double factor = 100;
+ long nprint = 1;
+ long mode=1, nfev, njev;
+
+ vnl_vector<double> diag(n, 0);
+ vnl_vector<double> qtf(n, 0);
+ vnl_vector<double> wa1(n, 0);
+ vnl_vector<double> wa2(n, 0);
+ vnl_vector<double> wa3(n, 0);
+ vnl_vector<double> wa4(m, 0);
+
+
+ v3p_netlib_lmder_(
lmder_lsqfun, &m, &n,
x.data_block(),
fx.data_block(),
fdjac_.data_block(), &m,
&ftol,
+ &xtol,
+ >ol,
+ &maxfev,
+ diag.data_block(),
+ &mode,
+ &factor,
+ &nprint,
&info,
+ &nfev, &njev,
ipvt_.data_block(),
+ qtf.data_block(),
wa1.data_block(),
- &size, this);
+ wa2.data_block(),
+ wa3.data_block(),
+ wa4.data_block(),
+ this);
+
+
+
+
num_evaluations_ = num_iterations_; // for lmder, these are the same.
if (info<0)
info = ERROR_FAILURE;
@@ -343,7 +370,6 @@ bool vnl_levenberg_marquardt::minimize_using_gradient(vnl_vector<double>& x)
case 4: // gtol
return true;
default:
- if (verbose_) diagnose_outcome();
return false;
}
}
@@ -383,7 +409,7 @@ void vnl_levenberg_marquardt::diagnose_outcome(vcl_ostream& s) const
case CONVERGED_GTOL:
s << (whoami ": converged via gtol\n");
break;
- case FAILED_TOO_MANY_ITERATIONS:
+ case TOO_MANY_ITERATIONS:
s << (whoami ": too many iterations\n");
break;
case FAILED_FTOL_TOO_SMALL:
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_levenberg_marquardt.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_levenberg_marquardt.h
index 35db8bfeed3fa758941e3deb7cd5631f5bad30d4..c908743adf0665c197230cb34f4682937593f83a 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_levenberg_marquardt.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_levenberg_marquardt.h
@@ -88,9 +88,10 @@ class vnl_levenberg_marquardt : public vnl_nonlinear_minimizer
// The cost function must provide a gradient.
bool minimize_using_gradient (vnl_vector<double>& x);
- //: Calls minimize_using_gradient() or minimize_without_gradient()
- // , depending on whether the cost function provides a gradient.
+ //: Calls minimize_using_gradient() or minimize_without_gradient(),
+ // depending on whether the cost function provides a gradient.
bool minimize(vnl_vector<double>& x);
+ bool minimize(vnl_vector_fixed<double,1>& x) { vnl_vector<double> y=x.extract(1); bool b=minimize(y); x=y; return b; }
bool minimize(vnl_vector_fixed<double,2>& x) { vnl_vector<double> y=x.extract(2); bool b=minimize(y); x=y; return b; }
bool minimize(vnl_vector_fixed<double,3>& x) { vnl_vector<double> y=x.extract(3); bool b=minimize(y); x=y; return b; }
bool minimize(vnl_vector_fixed<double,4>& x) { vnl_vector<double> y=x.extract(4); bool b=minimize(y); x=y; return b; }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_matrix_inverse.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_matrix_inverse.h
index 6e6e17e7fffe88d527a49e9bd0aebf781894f613..cb2a533c902903657fc3145d2d0a414b3b407db4 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_matrix_inverse.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_matrix_inverse.h
@@ -34,7 +34,7 @@ template <class T>
struct vnl_matrix_inverse : public vnl_svd<T>
{
vnl_matrix_inverse(vnl_matrix<T> const & M): vnl_svd<T>(M) { }
- ~vnl_matrix_inverse() {};
+ ~vnl_matrix_inverse() {}
operator vnl_matrix<T> () const { return this->inverse(); }
};
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_matrix_update.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_matrix_update.h
index a32fe28be10aa611a4d6b00e364801a05a3433bc..58c81ef844abee0c3bfd135bd6a2f3e82f352962 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_matrix_update.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_matrix_update.h
@@ -1,7 +1,6 @@
// This is core/vnl/algo/vnl_matrix_update.h
#ifndef vnl_matrix_update_h_
#define vnl_matrix_update_h_
-
//:
// \file
// \brief Function to compute M=M+a*b'
@@ -13,6 +12,7 @@
//: Perform rank 1 update of M: M+=(a*b')
// Requires a.size()==M.rows(), b.size()==M.columns()
+// \relatesalso vnl_matrix
template<class T>
inline void vnl_matrix_update(vnl_matrix<T>& M,
const vnl_vector<T>& a,
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_orthogonal_complement.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_orthogonal_complement.h
index f43b53c992f0f92767317c37d8fbeb0cfb5f329f..98cd714c4a5ff8cf1b6f1201b3aaf274679b5e50 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_orthogonal_complement.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_orthogonal_complement.h
@@ -16,11 +16,13 @@
#include <vnl/vnl_matrix.h>
//: Return a matrix whose columns span is the orthogonal complement of v.
+// \relatesalso vnl_matrix
template <class T>
vnl_matrix<T> vnl_orthogonal_complement(vnl_vector<T> const &v);
#if 0
//: Return a matrix whose column span is the orthogonal complement of the column span of M.
+// \relatesalso vnl_matrix
template <class T>
vnl_matrix<T> vnl_orthogonal_complement(vnl_matrix<T> const &M);
#endif
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_powell.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_powell.cxx
index eb249052c3a9eb287f2eb3ef43bf53953c05c030..650b8e1f4b618160ae1ccd3d25e79f044d7d765e 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_powell.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_powell.cxx
@@ -8,8 +8,9 @@
#include <vcl_cassert.h>
#include <vnl/vnl_math.h>
-// #define __USE_OLD_BRENT_MINIZER__ /* This version was deprecated, and the refactoring to the new minimizer was not done correctly with respect to initizliaztion. */
-#ifdef __USE_OLD_BRENT_MINIZER__
+#undef VNL_USE_OLD_BRENT_MINIMIZER // #define VNL_USE_OLD_BRENT_MINIMIZER
+// This version was deprecated, and the refactoring to the new minimizer was not done correctly with respect to initialisation.
+#ifdef VNL_USE_OLD_BRENT_MINIMIZER
#include <vnl/algo/vnl_brent.h>
#else
#include <vnl/algo/vnl_brent_minimizer.h>
@@ -29,8 +30,8 @@ class vnl_powell_1dfun : public vnl_cost_function
vnl_vector<double> x0_;
vnl_vector<double> dx_;
vnl_vector<double> tmpx_;
- vnl_powell_1dfun(int n, vnl_cost_function* f, vnl_powell* p)
- : vnl_cost_function(1), powell_(p), f_(f), n_(n), x0_(n), dx_(n), tmpx_(n) {}
+ vnl_powell_1dfun(int n, vnl_cost_function* func, vnl_powell* p)
+ : vnl_cost_function(1), powell_(p), f_(func), n_(n), x0_(n), dx_(n), tmpx_(n) {}
void init(vnl_vector<double> const& x0, vnl_vector<double> const& dx)
{
@@ -57,7 +58,6 @@ class vnl_powell_1dfun : public vnl_cost_function
vnl_nonlinear_minimizer::ReturnCodes
vnl_powell::minimize(vnl_vector<double>& p)
- //double p[], double **xi, int n
{
// verbose_ = true;
int n = p.size();
@@ -84,7 +84,7 @@ vnl_powell::minimize(vnl_vector<double>& p)
// 1D minimization along xi
f1d.init(p, xit);
-#ifdef __USE_OLD_BRENT_MINIZER__
+#ifdef VNL_USE_OLD_BRENT_MINIMIZER
vnl_brent brent(&f1d);
double ax;
double xx = initial_step_;
@@ -96,10 +96,10 @@ vnl_powell::minimize(vnl_vector<double>& p)
double ax = 0.0;
double xx = initial_step_;
double bx;
- {
+ {
double fa, fxx, fb;
vnl_bracket_minimum(f1d,ax,xx,bx,fa,fxx,fb);
- }
+ }
brent.set_x_tolerance (linmin_xtol_);
xx=brent.minimize_given_bounds(ax,xx,bx);
fret=brent.f_at_last_minimum();
@@ -123,7 +123,7 @@ vnl_powell::minimize(vnl_vector<double>& p)
}
if (num_iterations_ == unsigned(maxfev))
- return FAILED_TOO_MANY_ITERATIONS;
+ return TOO_MANY_ITERATIONS;
for (int j=0;j<n;++j)
{
@@ -140,7 +140,7 @@ vnl_powell::minimize(vnl_vector<double>& p)
if (t < 0.0)
{
f1d.init(p, xit);
-#ifdef __USE_OLD_BRENT_MINIZER__
+#ifdef VNL_USE_OLD_BRENT_MINIMIZER
vnl_brent brent(&f1d);
double ax;
double xx = 1.0;
@@ -153,12 +153,12 @@ vnl_powell::minimize(vnl_vector<double>& p)
double xx = 1.0;
double bx;
{
- double fa, fxx, fb;
- vnl_bracket_minimum(f1d,ax,xx,bx,fa,fxx,fb);
+ double fa, fxx, fb;
+ vnl_bracket_minimum(f1d,ax,xx,bx,fa,fxx,fb);
}
- brent.set_x_tolerance (linmin_xtol_);
- xx=brent.minimize_given_bounds(ax,xx,bx);
- fret=brent.f_at_last_minimum();
+ brent.set_x_tolerance (linmin_xtol_);
+ xx=brent.minimize_given_bounds(ax,xx,bx);
+ fret=brent.f_at_last_minimum();
#endif
f1d.uninit(xx, p);
@@ -168,7 +168,8 @@ vnl_powell::minimize(vnl_vector<double>& p)
}
}
}
- report_iter();
+ if (report_iter())
+ return FAILED_USER_REQUEST;
}
- return FAILED_TOO_MANY_ITERATIONS;
+ return TOO_MANY_ITERATIONS;
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_powell.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_powell.h
index 5bca58b9664eb645007818b628a119b93d619552..7a46494a8ee197b9c4db2df16b522c1e7833414e 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_powell.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_powell.h
@@ -9,6 +9,12 @@
// \brief Powell minimizer.
// \author awf@robots.ox.ac.uk
// \date 05 Dec 00
+//
+// \verbatim
+// Modifications
+// 31 Oct 2008 - Hans Johnson - fixed errors caused by uninitialized var bx;
+// (U. Iowa) use vnl_brent_minimizer instead of vnl_brent
+// \endverbatim
#include <vnl/vnl_cost_function.h>
#include <vnl/vnl_nonlinear_minimizer.h>
@@ -32,7 +38,7 @@ class vnl_powell : public vnl_nonlinear_minimizer
// Default value is 0.0001
void set_linmin_xtol(double tol) { linmin_xtol_ = tol; }
- //: Set initial step when bracketting minima along a line
+ //: Set initial step when bracketing minima along a line
// Default value is 1.0
void set_initial_step(double step) { initial_step_ = step; }
@@ -45,7 +51,7 @@ class vnl_powell : public vnl_nonlinear_minimizer
//: Tolerance on line search parameter step
double linmin_xtol_;
- //: Initial step when bracketting minima along a line
+ //: Initial step when bracketing minima along a line
double initial_step_;
};
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_qr.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_qr.h
index 50aca502c13c7287b9c36dfb29f8e4e599e52eca..a2cf3b1613232a238cde9714de8e647ad7a6115e 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_qr.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_qr.h
@@ -8,7 +8,7 @@
// \file
// \brief Calculate inverse of a matrix using QR
// \author Andrew W. Fitzgibbon, Oxford RRG
-// \date 08 Dec 96
+// \date 08 Dec 1996
//
// \verbatim
// Modifications
@@ -70,12 +70,12 @@ class vnl_qr
vnl_matrix<T> qrdc_out_;
vnl_vector<T> qraux_;
vnl_vector<long> jpvt_;
- vnl_matrix<T>* Q_;
- vnl_matrix<T>* R_;
+ mutable vnl_matrix<T>* Q_;
+ mutable vnl_matrix<T>* R_;
// Disallow assignment.
vnl_qr(const vnl_qr<T> &) { }
- void operator=(const vnl_qr<T> &) { }
+ vnl_qr<T>& operator=(const vnl_qr<T> &) { return *this; }
};
//: Compute determinant of matrix "M" using QR.
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_qr.txx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_qr.txx
index 2f553bb15e61ebf77fde432461815adf032a2b3e..5877f51e451351690d90222bd3d7861eee08c908 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_qr.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_qr.txx
@@ -4,7 +4,7 @@
//:
// \file
// \author Andrew W. Fitzgibbon, Oxford RRG
-// \date 08 Dec 96
+// \date 08 Dec 1996
#include "vnl_qr.h"
#include <vcl_cassert.h>
@@ -16,7 +16,7 @@
#include <vnl/vnl_complex_traits.h>
#include <vnl/algo/vnl_netlib.h> // dqrdc_(), dqrsl_()
-// use C++ overloading to call the right linpack routine from the template code :
+// use C++ overloading to call the right linpack routine from the template code:
#ifndef DOXYGEN_SHOULD_SKIP_THIS
#define macro(p, T) \
inline void vnl_linpack_qrdc(vnl_netlib_qrdc_proto(T)) \
@@ -93,7 +93,7 @@ vnl_matrix<T> const& vnl_qr<T>::Q() const
bool verbose = false;
if (!Q_) {
- ((vnl_matrix<T>*&)Q_) = new vnl_matrix<T>(m,m);
+ Q_ = new vnl_matrix<T>(m,m);
// extract Q.
if (verbose) {
vcl_cerr << __FILE__ ": vnl_qr<T>::Q()\n"
@@ -103,7 +103,7 @@ vnl_matrix<T> const& vnl_qr<T>::Q() const
}
Q_->set_identity();
- vnl_matrix<T>& Q = *Q_;
+ vnl_matrix<T>& matrQ = *Q_;
vnl_vector<T> v(m, T(0));
vnl_vector<T> w(m, T(0));
@@ -133,14 +133,14 @@ vnl_matrix<T> const& vnl_qr<T>::Q() const
for (int i = k; i < m; ++i) {
w[i] = T(0);
for (int j = k; j < m; ++j)
- w[i] += scale * c(v[j]) * Q(j, i);
+ w[i] += scale * c(v[j]) * matrQ(j, i);
}
if (verbose) vnl_matlab_print(vcl_cerr, w, "w");
// Q -= v w
for (int i = k; i < m; ++i)
for (int j = k; j < m; ++j)
- Q(i,j) -= (v[i]) * (w[j]);
+ matrQ(i,j) -= (v[i]) * (w[j]);
}
#undef c
}
@@ -155,15 +155,15 @@ vnl_matrix<T> const& vnl_qr<T>::R() const
if (!R_) {
int m = qrdc_out_.columns(); // column-major storage
int n = qrdc_out_.rows();
- ((vnl_matrix<T>*&)R_) = new vnl_matrix<T>(m,n);
- vnl_matrix<T> & R = *R_;
+ R_ = new vnl_matrix<T>(m,n);
+ vnl_matrix<T> & Rmatr = *R_;
for (int i = 0; i < m; ++i)
for (int j = 0; j < n; ++j)
if (i > j)
- R(i, j) = T(0);
+ Rmatr(i, j) = T(0);
else
- R(i, j) = qrdc_out_(j,i);
+ Rmatr(i, j) = qrdc_out_(j,i);
}
return *R_;
@@ -188,7 +188,7 @@ vnl_vector<T> vnl_qr<T>::solve(const vnl_vector<T>& b) const
long n = qrdc_out_.columns();
long p = qrdc_out_.rows();
const T* b_data = b.data_block();
- vnl_vector<T> QtB(n);
+ vnl_vector<T> Qt_B(n);
vnl_vector<T> x(p);
// see comment above
@@ -198,7 +198,7 @@ vnl_vector<T> vnl_qr<T>::solve(const vnl_vector<T>& b) const
vnl_linpack_qrsl(qrdc_out_.data_block(),
&n, &n, &p,
qraux_.data_block(),
- b_data, (T*)0, QtB.data_block(),
+ b_data, (T*)0, Qt_B.data_block(),
x.data_block(),
(T*)0/*residual*/,
(T*)0/*Ax*/,
@@ -219,7 +219,7 @@ vnl_vector<T> vnl_qr<T>::QtB(const vnl_vector<T>& b) const
long n = qrdc_out_.columns();
long p = qrdc_out_.rows();
const T* b_data = b.data_block();
- vnl_vector<T> QtB(n);
+ vnl_vector<T> Qt_B(n);
// see comment above
long JOB = 1000;
@@ -230,7 +230,7 @@ vnl_vector<T> vnl_qr<T>::QtB(const vnl_vector<T>& b) const
qraux_.data_block(),
b_data,
(T*)0, // A: Qb
- QtB.data_block(), // B: Q'b
+ Qt_B.data_block(), // B: Q'b
(T*)0, // C: x
(T*)0, // D: residual
(T*)0, // E: Ax
@@ -241,19 +241,19 @@ vnl_vector<T> vnl_qr<T>::QtB(const vnl_vector<T>& b) const
vcl_cerr << __FILE__ ": vnl_qr<T>::QtB() -- matrix is rank-deficient by "
<< info << '\n';
- return QtB;
+ return Qt_B;
}
template <class T>
-vnl_matrix<T> vnl_qr<T>::inverse () const
+vnl_matrix<T> vnl_qr<T>::inverse() const
{
- int r = qrdc_out_.columns(), c = qrdc_out_.rows();
- assert(r == c && r > 0);
+ unsigned int r = qrdc_out_.columns();
+ assert(r > 0 && r == qrdc_out_.rows());
vnl_matrix<T> inv(r,r);
// Use solve() to compute the inverse matrix, using (00..010..00) as rhs
vnl_vector<T> rhs(r,T(0));
- for (int i=0; i<r; ++i)
+ for (unsigned int i=0; i<r; ++i)
{
rhs(i) = T(1);
vnl_vector<T> col = this->solve(rhs); // returns i-th column of inverse
@@ -264,15 +264,15 @@ vnl_matrix<T> vnl_qr<T>::inverse () const
}
template <class T>
-vnl_matrix<T> vnl_qr<T>::tinverse () const
+vnl_matrix<T> vnl_qr<T>::tinverse() const
{
- int r = qrdc_out_.columns(), c = qrdc_out_.rows();
- assert(r == c && r > 0);
+ unsigned int r = qrdc_out_.columns();
+ assert(r > 0 && r == qrdc_out_.rows());
vnl_matrix<T> tinv(r,r);
// Use solve() to compute the inverse matrix, using (00..010..00) as rhs
vnl_vector<T> rhs(r,T(0));
- for (int i=0; i<r; ++i)
+ for (unsigned int i=0; i<r; ++i)
{
rhs(i) = T(1);
vnl_vector<T> col = this->solve(rhs); // returns i-th column of inverse
@@ -285,9 +285,9 @@ vnl_matrix<T> vnl_qr<T>::tinverse () const
template <class T>
vnl_matrix<T> vnl_qr<T>::solve(vnl_matrix<T> const& rhs) const
{
- int r = qrdc_out_.columns(), c = qrdc_out_.rows(); // column-major storage
- int m = rhs.rows(), n = rhs.columns();
- assert(m==r);
+ assert(rhs.rows() == qrdc_out_.columns()); // column-major storage
+ int c = qrdc_out_.rows();
+ int n = rhs.columns();
vnl_matrix<T> result(c,n);
for (int i=0; i<n; ++i)
@@ -299,7 +299,7 @@ vnl_matrix<T> vnl_qr<T>::solve(vnl_matrix<T> const& rhs) const
return result;
}
-//--------------------------------------------------------------------------------
+//------------------------------------------------------------------------------
#define VNL_QR_INSTANTIATE(T) \
template class vnl_qr<T >; \
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_real_eigensystem.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_real_eigensystem.cxx
index 05841b83e4dcee6550f526a7b7c8f99e700d79be..f534299552c97920086af6b3b8539aebe3df7292 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_real_eigensystem.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_real_eigensystem.cxx
@@ -16,7 +16,7 @@
#include <vnl/vnl_fortran_copy.h>
#include <vnl/algo/vnl_netlib.h> // rg_()
-//: Extract eigensystem of unsymmetric matrix M, using the EISPACK routine rg.
+//: Extract eigensystem of non-symmetric matrix M, using the EISPACK routine rg.
// Should probably switch to using LAPACK's dgeev to avoid transposing.
vnl_real_eigensystem::vnl_real_eigensystem(vnl_matrix<double> const & M):
Vreal(M.rows(), M.columns()),
@@ -59,7 +59,8 @@ vnl_real_eigensystem::vnl_real_eigensystem(vnl_matrix<double> const & M):
}
++c;
- } else
+ }
+ else
for (int r = 0; r < n; ++r) {
V(r, c) = vcl_complex<double>(devout(c,r), 0);
Vreal(r,c) = devout(c,r);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_real_eigensystem.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_real_eigensystem.h
index 6ca803c33ad9c5bf5cbc75a98b734ea062c9dc89..3412aede829869a674c6feb8b7f7c006e35c6a84 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_real_eigensystem.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_real_eigensystem.h
@@ -6,13 +6,13 @@
#endif
//:
// \file
-// \brief Extract eigensystem of unsymmetric matrix M, using EISPACK
+// \brief Extract eigensystem of non-symmetric matrix M, using EISPACK
// \author Andrew W. Fitzgibbon, Oxford RRG
// \date 23 Jan 97
//
// \verbatim
-// Modifications
-// dac (Manchester) 28/03/2001: tidied up documentation
+// Modifications
+// dac (Manchester) 28/03/2001: tidied up documentation
// \endverbatim
//
@@ -20,7 +20,7 @@
#include <vnl/vnl_matrix.h>
#include <vnl/vnl_diag_matrix.h>
-//: Extract eigensystem of unsymmetric matrix M, using the EISPACK routine
+//: Extract eigensystem of asymmetric matrix M, using the EISPACK routine
// vnl_eigensystem is a full-bore real eigensystem. If your matrix
// is symmetric, it is *much* better to use vnl_symmetric_eigensystem.
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_rnpoly_solve.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_rnpoly_solve.cxx
index 1ff0b67c7af17ea32fd7939e9a706fdd30d6171a..101fbabefba87d6f03816a87d22a3ac7891d6d51 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_rnpoly_solve.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_rnpoly_solve.cxx
@@ -6,6 +6,7 @@
// \file
#include "vnl_rnpoly_solve.h"
+#include <vnl/vnl_math.h> // for vnl_math::pi
#include <vcl_cmath.h>
#include <vcl_cassert.h>
#ifdef DEBUG
@@ -49,7 +50,7 @@ class vnl_rnpoly_solve_cmplx
{ return *this = operator/(Y); }
};
-static const double twopi = 6.2831853071795864769;
+static const double twopi = 2.0*vnl_math::pi;
static const double epsilonB = 2.e-03;
static const vnl_rnpoly_solve_cmplx epsilonZ = vnl_rnpoly_solve_cmplx(1.e-04,1.e-04);
@@ -73,7 +74,7 @@ vcl_vector<vnl_vector<double>*> vnl_rnpoly_solve::realroots(double tol)
//------------------------- INPTBR ---------------------------
//: Initialize random variables
// This will initialize the random variables which are used
-// to preturb the starting point so as to have measure zero
+// to perturb the starting point so as to have measure zero
// probability that we will start at a singular point.
static void inptbr(vcl_vector<vnl_rnpoly_solve_cmplx>& p, vcl_vector<vnl_rnpoly_solve_cmplx>& q)
{
@@ -576,7 +577,8 @@ static int trace(vcl_vector<vnl_rnpoly_solve_cmplx>& x,
{
if (eps != epsilonS) step = step/4.0;
eps = epsilonS;
- }else
+ }
+ else
eps = epsilonB;
#ifdef DEBUG
vcl_cout << "t=" << t << vcl_endl;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_rnpoly_solve.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_rnpoly_solve.h
index 4fa5af3e2dce5ccc8c271d99a8394759e1520c93..0836e51e83e098778a33f78132cb5b2b57dce2b9 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_rnpoly_solve.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_rnpoly_solve.h
@@ -8,7 +8,7 @@
// \file
// \brief Solves for roots of system of real polynomials
// \author Marc Pollefeys, ESAT-VISICS, K.U.Leuven
-// \date 12-08-97
+// \date 12-Aug-1997
//
// \verbatim
// Modifications
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_scatter_3x3.txx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_scatter_3x3.txx
index 52c8aa7f4acb5ecb605771eb5ef21c1f43a351b7..1f0511d72f2c6a7100b44cc0e25030baf5058b73 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_scatter_3x3.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_scatter_3x3.txx
@@ -87,9 +87,11 @@ template <class T>
void vnl_scatter_3x3<T>::compute_eigensystem()
{
vnl_scatter_3x3<T> &S = *this;
+ vnl_matrix<T> M = S.as_matrix();
if (symmetricp) {
- vnl_symmetric_eigensystem_compute(S, V_.as_ref().non_const(), D.as_ref().non_const());
- } else {
+ vnl_symmetric_eigensystem_compute(M, V_.as_ref().non_const(), D.as_ref().non_const());
+ }
+ else {
vcl_cerr << "Unsymmetric scatter not handled now\n";
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_simpson_integral.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_simpson_integral.h
index 30bb65324c5d896ecf492395021bf0c4ff6c1eb9..8a310ba21c73098bcfffd71e06e5e4580835b6bd 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_simpson_integral.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_simpson_integral.h
@@ -10,7 +10,7 @@
class vnl_simpson_integral : public vnl_definite_integral
{
private:
- //: used to extract integrant functions of the vnl_integrant_fnct.
+ //: used to extract integrand functions of the vnl_integrant_fnct.
static double int_fnct_(double* x);
public:
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_solve_qp.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_solve_qp.cxx
index 07d07839f8b1acda0d156bf52d708f9013698d40..91769888ed1396bf1b1560f35f993060ecf50046 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_solve_qp.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_solve_qp.cxx
@@ -1,9 +1,9 @@
+#include "vnl_solve_qp.h"
//:
// \file
// \brief Functions to solve various forms of constrained quadratic programming
// \author Tim Cootes
-#include <vnl/algo/vnl_solve_qp.h>
#include <vnl/algo/vnl_svd.h>
#include <vnl/algo/vnl_cholesky.h>
#include <vcl_vector.h>
@@ -29,17 +29,17 @@ static void vnl_solve_symmetric_le(const vnl_matrix<double>& S,
// \param H Hessian of F(x) - must be symmetric
// \retval True if successful
bool vnl_solve_qp_with_equality_constraints(const vnl_matrix<double>& H,
- const vnl_vector<double>& g,
- const vnl_matrix<double>& A,
- const vnl_vector<double>& b,
- vnl_vector<double>& x)
+ const vnl_vector<double>& g,
+ const vnl_matrix<double>& A,
+ const vnl_vector<double>& b,
+ vnl_vector<double>& x)
{
// Test inputs
- unsigned n=H.rows(); // Number of unknowns
+ // unsigned n=H.rows(); // Number of unknowns
unsigned nc=A.rows(); // Number of equality constraints
- assert(H.cols()==n);
- assert(g.size()==n);
- assert(A.cols()==n);
+ assert(H.cols()==H.rows());
+ assert(g.size()==H.rows());
+ assert(A.cols()==H.rows());
assert(b.size()==nc);
vnl_matrix<double> H_inv;
@@ -79,9 +79,9 @@ bool vnl_solve_qp_zero_sum(const vnl_matrix<double>& H,
vnl_vector<double>& x)
{
// Test inputs
- unsigned n=H.rows(); // Number of unknowns
- assert(H.cols()==n);
- assert(g.size()==n);
+ // unsigned n=H.rows(); // Number of unknowns
+ assert(H.cols()==H.rows());
+ assert(g.size()==H.rows());
vnl_matrix<double> H_inv;
vnl_cholesky Hchol(H,vnl_cholesky::estimate_condition);
@@ -118,10 +118,10 @@ bool vnl_solve_qp_zero_sum(const vnl_matrix<double>& H,
//: Update x, checking inequality constraints and modifying valid where necessary
static bool vnl_solve_qp_update_x(vnl_vector<double>& x,
- const vnl_vector<double>& x1,
- vnl_vector<double>& dx,
- vcl_vector<bool>& valid,
- unsigned& n_valid)
+ const vnl_vector<double>& x1,
+ vnl_vector<double>& dx,
+ vcl_vector<bool>& valid,
+ unsigned& n_valid)
{
unsigned n=x.size();
// Check non-negativity constraints
@@ -164,12 +164,12 @@ static bool vnl_solve_qp_update_x(vnl_vector<double>& x,
// Used by vnl_non_neg_constrained_qp
// Returns true if valid minimum found
bool vnl_solve_qp_non_neg_step(const vnl_matrix<double>& H,
- const vnl_vector<double>& g,
- const vnl_matrix<double>& A,
- const vnl_vector<double>& b,
- vnl_vector<double>& x,
- vcl_vector<bool>& valid,
- unsigned& n_valid)
+ const vnl_vector<double>& g,
+ const vnl_matrix<double>& A,
+ const vnl_vector<double>& b,
+ vnl_vector<double>& x,
+ vcl_vector<bool>& valid,
+ unsigned& n_valid)
{
// Find solution to H1(x+dx)+g1=0, subject to A1(x1+dx)=b
// H1,A1,g1,x1 contain subsets defined by valid array
@@ -224,10 +224,10 @@ bool vnl_solve_qp_non_neg_step(const vnl_matrix<double>& H,
//: Solve unconstrained problem and apply one extra constraint if necessary
// Returns true if valid minimum found
bool vnl_solve_qp_non_neg_sum_one_step(const vnl_matrix<double>& H,
- const vnl_vector<double>& g,
- vnl_vector<double>& x,
- vcl_vector<bool>& valid,
- unsigned& n_valid)
+ const vnl_vector<double>& g,
+ vnl_vector<double>& x,
+ vcl_vector<bool>& valid,
+ unsigned& n_valid)
{
// Find solution to H1(x+dx)+g1=0, subject to sum(dx)=0.0
// H1,g1,x1 contain subsets defined by valid array
@@ -283,20 +283,20 @@ bool vnl_solve_qp_non_neg_sum_one_step(const vnl_matrix<double>& H,
// \param verbose When true, output error messages to cerr if failed
// \retval True if successful
bool vnl_solve_qp_with_non_neg_constraints(const vnl_matrix<double>& H,
- const vnl_vector<double>& g,
- const vnl_matrix<double>& A,
- const vnl_vector<double>& b,
- vnl_vector<double>& x,
- double con_tol,
- bool verbose)
+ const vnl_vector<double>& g,
+ const vnl_matrix<double>& A,
+ const vnl_vector<double>& b,
+ vnl_vector<double>& x,
+ double con_tol,
+ bool verbose)
{
// Test inputs
unsigned n=H.rows(); // Number of unknowns
- unsigned nc=A.rows(); // Number of equality constraints
+ //unsigned nc=A.rows(); // Number of equality constraints
assert(H.cols()==n);
assert(g.size()==n);
assert(A.cols()==n);
- assert(b.size()==nc);
+ assert(b.size()==A.rows());
if (vnl_vector_ssd(A*x,b)>con_tol)
{
@@ -326,7 +326,8 @@ bool vnl_solve_qp_with_non_neg_constraints(const vnl_matrix<double>& H,
vcl_cerr<<"Oops: Final x does not satisfy equality constraints\n";
return false;
}
- return true;
+ else
+ return true;
}
//: Find non-negative solution to a constrained quadratic programming problem
@@ -341,9 +342,9 @@ bool vnl_solve_qp_with_non_neg_constraints(const vnl_matrix<double>& H,
// \param verbose When true, output error messages to cerr if failed
// \retval True if successful
bool vnl_solve_qp_non_neg_sum_one(const vnl_matrix<double>& H,
- const vnl_vector<double>& g,
- vnl_vector<double>& x,
- bool verbose)
+ const vnl_vector<double>& g,
+ vnl_vector<double>& x,
+ bool verbose)
{
// Test inputs
unsigned n=H.rows(); // Number of unknowns
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_solve_qp.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_solve_qp.h
index 4f799ee01dd9ffb71476f0f6a603c940e746d861..13d0a25d816d6c2c142053bb7f2e5e39e7fffdab 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_solve_qp.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_solve_qp.h
@@ -15,10 +15,10 @@
// \param H Hessian of F(x) - must be symmetric
// \retval True if successful
bool vnl_solve_qp_with_equality_constraints(const vnl_matrix<double>& H,
- const vnl_vector<double>& g,
- const vnl_matrix<double>& A,
- const vnl_vector<double>& b,
- vnl_vector<double>& x);
+ const vnl_vector<double>& g,
+ const vnl_matrix<double>& A,
+ const vnl_vector<double>& b,
+ vnl_vector<double>& x);
//: Solve quadratic programming problem with constraint sum(x)=0
// Minimise F(x)=0.5x'Hx + g'x subject to sum(x)=0
@@ -26,8 +26,8 @@ bool vnl_solve_qp_with_equality_constraints(const vnl_matrix<double>& H,
// \param H Hessian of F(x) - must be symmetric
// \retval True if successful
bool vnl_solve_qp_zero_sum(const vnl_matrix<double>& H,
- const vnl_vector<double>& g,
- vnl_vector<double>& x);
+ const vnl_vector<double>& g,
+ vnl_vector<double>& x);
//: Find non-negative solution to a constrained quadratic programming problem
// Minimise F(x)=0.5x'Hx + g'x subject to Ax=b and x(i)>=0 for all i
@@ -42,12 +42,12 @@ bool vnl_solve_qp_zero_sum(const vnl_matrix<double>& H,
// \param verbose When true, output error messages to cerr if failed
// \retval True if successful
bool vnl_solve_qp_with_non_neg_constraints(const vnl_matrix<double>& H,
- const vnl_vector<double>& g,
- const vnl_matrix<double>& A,
- const vnl_vector<double>& b,
- vnl_vector<double>& x,
- double con_tol = 1e-8,
- bool verbose=true);
+ const vnl_vector<double>& g,
+ const vnl_matrix<double>& A,
+ const vnl_vector<double>& b,
+ vnl_vector<double>& x,
+ double con_tol = 1e-8,
+ bool verbose=true);
//: Find non-negative solution to a constrained quadratic programming problem
// Minimise F(x)=0.5x'Hx + g'x subject to sum(x)=1 and x(i)>=0 for all i
@@ -61,9 +61,9 @@ bool vnl_solve_qp_with_non_neg_constraints(const vnl_matrix<double>& H,
// \param verbose When true, output error messages to cerr if failed
// \retval True if successful
bool vnl_solve_qp_non_neg_sum_one(const vnl_matrix<double>& H,
- const vnl_vector<double>& g,
- vnl_vector<double>& x,
- bool verbose=true);
+ const vnl_vector<double>& g,
+ vnl_vector<double>& x,
+ bool verbose=true);
#endif // vnl_solve_qp_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lm.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lm.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..ea369bca9d493979d8489bf41b8fc593e2590578
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lm.cxx
@@ -0,0 +1,868 @@
+// This is core/vnl/algo/vnl_sparse_lm.cxx
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma implementation
+#endif
+//:
+// \file
+// \author Matt Leotta (Brown)
+// \date April 14, 2005
+//
+//-----------------------------------------------------------------------------
+
+#include "vnl_sparse_lm.h"
+
+#include <vcl_iostream.h>
+#include <vcl_iomanip.h>
+#include <vcl_algorithm.h>
+
+#include <vnl/vnl_vector.h>
+#include <vnl/vnl_matrix.h>
+#include <vnl/vnl_fastops.h>
+#include <vnl/vnl_vector_ref.h>
+#include <vnl/vnl_crs_index.h>
+#include <vnl/vnl_sparse_lst_sqr_function.h>
+
+#include <vnl/algo/vnl_cholesky.h>
+#include <vnl/algo/vnl_svd.h>
+
+
+//: Initialize with the function object that is to be minimized.
+vnl_sparse_lm::vnl_sparse_lm(vnl_sparse_lst_sqr_function& f)
+ : num_a_(f.number_of_a()),
+ num_b_(f.number_of_b()),
+ num_e_(f.number_of_e()),
+ num_nz_(f.residual_indices().num_non_zero()),
+ size_a_(f.index_a(num_a_)),
+ size_b_(f.index_b(num_b_)),
+ size_c_(f.number_of_params_c()),
+ size_e_(f.index_e(num_e_)),
+ A_(num_nz_),
+ B_(num_nz_),
+ C_(num_nz_),
+ U_(num_a_),
+ V_(num_b_),
+ T_(size_c_, size_c_),
+ W_(num_nz_),
+ R_(num_b_),
+ Q_(num_a_),
+ ea_(size_a_),
+ eb_(size_b_),
+ ec_(size_c_),
+ e_(size_e_),
+ weights_(f.has_weights() ? num_e_ : 0, 1.0),
+ inv_V_(num_b_),
+ Y_(num_nz_),
+ Z_(num_a_),
+ Ma_(num_a_),
+ Mb_(num_b_)
+{
+ init(&f);
+}
+
+
+// ctor
+void vnl_sparse_lm::init(vnl_sparse_lst_sqr_function* f)
+{
+ f_ = f;
+
+ // If changing these defaults, check the help comments in vnl_sparse_lm.h,
+ // and MAKE SURE they're consistent.
+ xtol = 1e-15; // Termination tolerance on X (solution vector)
+ maxfev = 1000; // Termination maximum number of iterations.
+ ftol = 1e-15; // Termination tolerance on F (sum of squared residuals)
+ gtol = 1e-15; // Termination tolerance on Grad(F)' * F = 0
+ epsfcn = 0.001; // Step length for FD Jacobian
+
+ tau_ = 0.001;
+
+ allocate_matrices();
+}
+
+vnl_sparse_lm::~vnl_sparse_lm()
+{
+}
+
+
+//: Minimize the function supplied in the constructor until convergence or failure.
+// On return, a, b, and c are such that f(a,b,c) is the lowest value achieved.
+// Returns true for convergence, false for failure.
+// If use_gradient is set to false, a finite difference approximation will be used,
+// even if the Jacobian functions have been provided.
+// If use_weights is set to false, weights will not be computed even if a
+// weighting function has been provided.
+bool vnl_sparse_lm::minimize(vnl_vector<double>& a,
+ vnl_vector<double>& b,
+ vnl_vector<double>& c,
+ bool use_gradient,
+ bool use_weights)
+{
+ // verify that the vectors are of the correct size
+ if (!check_vector_sizes(a,b,c))
+ return false;
+
+ //: Systems to solve will be Sc*dc=sec and Sa*da=sea
+ vnl_matrix<double> Sc(size_c_,size_c_), Sa(size_a_, size_a_);
+ vnl_vector<double> sec(size_c_), sea(size_a_);
+ // update vectors
+ vnl_vector<double> da(size_a_), db(size_b_), dc(size_c_);
+
+
+ // mu is initialized now because the compiler produces warnings -MM
+ double mu=0; // damping term (initialized later)
+ double nu=2.0;
+ bool stop = false;
+ // compute the initial residual
+ f_->f(a,b,c,e_);
+ num_evaluations_ = 1;
+
+ // Compute and apply the weights if applicable
+ if (use_weights && f_->has_weights())
+ {
+ f_->compute_weights(a,b,c,e_,weights_);
+ f_->apply_weights(weights_, e_);
+ }
+
+ double sqr_error = e_.squared_magnitude();
+ start_error_ = vcl_sqrt(sqr_error/e_.size()); // RMS error
+
+ for (num_iterations_=0; num_iterations_<(unsigned int)maxfev && !stop; ++num_iterations_)
+ {
+ if (verbose_)
+ vcl_cout << "iteration "<<vcl_setw(4)<<num_iterations_
+ << " RMS error = "<< vcl_setprecision(6)<< vcl_setw(12)<<vcl_sqrt(sqr_error/e_.size())
+ << " mu = "<<vcl_setprecision(6)<< vcl_setw(12) <<mu<< " nu = "<< nu << vcl_endl;
+ if (trace)
+ f_->trace(num_iterations_,a,b,c,e_);
+
+ // Compute the Jacobian in block form J = [A|B|C]
+ // where A, B, and C are sparse and contain subblocks Aij, Bij, and Cij
+ if (use_gradient && f_->has_gradient())
+ f_->jac_blocks(a,b,c,A_,B_,C_);
+ else
+ f_->fd_jac_blocks(a,b,c,A_,B_,C_,epsfcn); // use finite differences
+
+ // Apply the weights if applicable
+ if (use_weights && f_->has_weights())
+ {
+ f_->apply_weights(weights_, A_,B_,C_);
+ }
+
+ compute_normal_equations();
+
+ // check for convergence in gradient
+ if (vcl_max(vcl_max(ea_.inf_norm(),eb_.inf_norm()),ec_.inf_norm()) <= gtol)
+ {
+ failure_code_ = CONVERGED_GTOL;
+ stop = true;
+ break;
+ }
+
+
+ double sqr_params = a.squared_magnitude();
+ sqr_params += b.squared_magnitude();
+ sqr_params += c.squared_magnitude();
+
+ // Extract the diagonal of J^T*J as a vector
+ vnl_vector<double> diag_UVT = extract_diagonal();
+
+ // initialize mu if this is the first iteration
+ // proportional to the diagonal entry with the largest magnitude
+ if (num_iterations_==0)
+ mu = tau_*diag_UVT.inf_norm();
+
+ // Re-solve the system while adapting mu until we decrease error or converge
+ while (true)
+ {
+ // augment the diagonals with damping term mu
+ set_diagonal(diag_UVT + mu);
+
+ // compute inv(Vj) and Yij
+ compute_invV_Y();
+
+ if ( size_c_ > 0 )
+ {
+ // compute Z = RYt-Q and Sa
+ compute_Z_Sa(Sa);
+
+ // this large inverse is the bottle neck of this algorithm
+ vnl_matrix<double> H;
+ vnl_cholesky Sa_cholesky(Sa,vnl_cholesky::quiet);
+ vnl_svd<double> *Sa_svd = 0;
+ // use SVD as a backup if Cholesky is deficient
+ if ( Sa_cholesky.rank_deficiency() > 0 )
+ {
+ Sa_svd = new vnl_svd<double>(Sa);
+ H = Sa_svd->inverse();
+ }
+ else
+ H = Sa_cholesky.inverse();
+
+ // construct the Ma = ZH
+ compute_Ma(H);
+ // construct Mb = (R+MaW)inv(V)
+ compute_Mb();
+
+ // use Ma and Mb to solve for dc
+ solve_dc(dc);
+
+ // compute sea from ea, Z, dc, Y, and eb
+ compute_sea(dc,sea);
+
+
+ if ( Sa_svd )
+ da = Sa_svd->solve(sea);
+ else
+ da = Sa_cholesky.solve(sea);
+ delete Sa_svd;
+ }
+ else // size_c_ == 0
+ {
+ // |I -W*inv(V)| * |U W| * |da| = |I -W*inv(V)| * |ea|
+ // |0 I | |Wt V| |db| |0 I | |eb|
+ //
+ // premultiplying as shown above gives:
+ // |Sa 0| * |da| = |sea|
+ // |Wt V| |db| |eb |
+ //
+ // so we can first solve Sa*da = sea and then substitute to find db
+
+ // compute Sa and sea
+ compute_Sa_sea(Sa,sea);
+
+#ifdef DEBUG
+ vcl_cout << "singular values = "<< vnl_svd<double>(Sa).W() <<vcl_endl;
+#endif
+ // We could use a faster solver here, maybe conjugate gradients?
+ // Solve the system Sa*da = sea for da
+
+ vnl_cholesky Sa_cholesky(Sa,vnl_cholesky::quiet);
+ // use SVD as a backup if Cholesky is deficient
+ if ( Sa_cholesky.rank_deficiency() > 0 )
+ {
+ vnl_svd<double> Sa_svd(Sa);
+ da = Sa_svd.solve(sea);
+ }
+ else
+ da = Sa_cholesky.solve(sea);
+ }
+
+ // substitute da and dc to compute db
+ backsolve_db(da, dc, db);
+
+ // check for convergence in parameters
+ // (change in parameters is below a tolerance)
+ double sqr_delta = da.squared_magnitude();
+ sqr_delta += db.squared_magnitude();
+ sqr_delta += dc.squared_magnitude();
+ if (sqr_delta < xtol*xtol*sqr_params) {
+ failure_code_ = CONVERGED_XTOL;
+ stop = true;
+ break;
+ }
+
+ // compute updated parameters and residuals of the new parameters
+ vnl_vector<double> new_a(a-da), new_b(b-db), new_c(c-dc);
+ vnl_vector<double> new_e(e_.size()), new_weights(weights_.size());
+ f_->f(new_a,new_b,new_c,new_e); // compute the new residual vector
+ ++num_evaluations_;
+
+ // Compute and apply the weights if applicable
+ if (use_weights && f_->has_weights())
+ {
+ f_->compute_weights(new_a,new_b,new_c,new_e,new_weights);
+ f_->apply_weights(new_weights, new_e);
+ }
+
+ double new_sqr_error = new_e.squared_magnitude();
+
+ double dF = sqr_error - new_sqr_error;
+ double dL = dot_product(da,(mu*da+ea_))
+ +dot_product(db,(mu*db+eb_))
+ +dot_product(dc,(mu*dc+ec_));
+ if (dF>0.0 && dL>0.0) {
+ double tmp = 2.0*dF/dL-1.0;
+ mu *= vcl_max(1.0/3.0, 1.0 - tmp*tmp*tmp);
+ nu = 2.0;
+ a.swap(new_a);
+ b.swap(new_b);
+ c.swap(new_c);
+ e_.swap(new_e);
+ weights_.swap(new_weights);
+ sqr_error = new_sqr_error;
+ break;
+ }
+
+ mu *= nu;
+ nu *= 2.0;
+
+ if (verbose_)
+ vcl_cout <<" RMS error = "<< vcl_setprecision(6)
+ << vcl_setw(12) << vcl_sqrt(sqr_error/e_.size())
+ << " mu = " << vcl_setprecision(6) << vcl_setw(12) << mu
+ << " nu = " << nu << vcl_endl;
+ }
+ }
+
+
+ end_error_ = vcl_sqrt(sqr_error/e_.size()); // RMS error
+
+ if ((int)num_iterations_ >= maxfev) {
+ failure_code_ = TOO_MANY_ITERATIONS;
+ }
+
+ // Translate status code
+ switch (failure_code_) {
+ case CONVERGED_FTOL:
+ case CONVERGED_XTOL:
+ case CONVERGED_XFTOL:
+ case CONVERGED_GTOL:
+ return true;
+ default:
+ diagnose_outcome();
+ return false;
+ }
+}
+
+
+//: check vector sizes and verify that they match the problem size
+bool vnl_sparse_lm::check_vector_sizes(vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c)
+{
+ if (size_a_+size_b_ > size_e_) {
+ vcl_cerr << "vnl_sparse_lm: Number of unknowns("<<size_a_+size_b_<<')'
+ << " greater than number of data ("<<size_e_<<")\n";
+ failure_code_ = ERROR_DODGY_INPUT;
+ return false;
+ }
+
+ if (int(a.size()) != size_a_) {
+ vcl_cerr << "vnl_sparse_lm: Input vector \"a\" length ("<<a.size()<<')'
+ << " not equal to num parameters in \"a\" ("<<size_a_<<")\n";
+ failure_code_ = ERROR_DODGY_INPUT;
+ return false;
+ }
+
+ if (int(b.size()) != size_b_) {
+ vcl_cerr << "vnl_sparse_lm: Input vector \"b\" length ("<<b.size()<<')'
+ << " not equal to num parameters in \"b\" ("<<size_b_<<")\n";
+ failure_code_ = ERROR_DODGY_INPUT;
+ return false;
+ }
+
+ if (int(c.size()) != size_c_) {
+ vcl_cerr << "vnl_sparse_lm: Input vector \"c\" length ("<<c.size()<<')'
+ << " not equal to num parameters in \"c\" ("<<size_c_<<")\n";
+ failure_code_ = ERROR_DODGY_INPUT;
+ return false;
+ }
+
+ return true;
+}
+
+
+//: allocate matrix memory by setting all the matrix sizes
+void vnl_sparse_lm::allocate_matrices()
+{
+ // CRS matrix of indices into e, A, B, C, W, Y
+ const vnl_crs_index& crs = f_->residual_indices();
+ // sparse vector iterator
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+
+ // Iterate through all i and j to set the size of the matrices and vectors defined above
+ for (int i=0; i<num_a_; ++i)
+ {
+ const unsigned int ai_size = f_->number_of_params_a(i);
+ U_[i].set_size(ai_size,ai_size);
+ Q_[i].set_size(size_c_, ai_size);
+ Z_[i].set_size(size_c_, ai_size);
+ Ma_[i].set_size(size_c_, ai_size);
+
+ vnl_crs_index::sparse_vector row = crs.sparse_row(i);
+ for (sv_itr r_itr=row.begin(); r_itr!=row.end(); ++r_itr)
+ {
+ const unsigned int j = r_itr->second;
+ const unsigned int k = r_itr->first;
+ const unsigned int bj_size = f_->number_of_params_b(j);
+ const unsigned int eij_size = f_->number_of_residuals(k);
+ A_[k].set_size(eij_size, ai_size);
+ B_[k].set_size(eij_size, bj_size);
+ C_[k].set_size(eij_size, size_c_);
+ W_[k].set_size(ai_size, bj_size);
+ Y_[k].set_size(ai_size, bj_size);
+ }
+ }
+ for (int j=0; j<num_b_; ++j)
+ {
+ const unsigned int bj_size = f_->number_of_params_b(j);
+ V_[j].set_size(bj_size,bj_size);
+ R_[j].set_size(size_c_, bj_size);
+ Mb_[j].set_size(size_c_, bj_size);
+ inv_V_[j].set_size(bj_size,bj_size);
+ }
+}
+
+
+//: compute the blocks making up the the normal equations: Jt J d = Jt e
+void vnl_sparse_lm::compute_normal_equations()
+{
+ // CRS matrix of indices into e, A, B, C, W, Y
+ const vnl_crs_index& crs = f_->residual_indices();
+ // sparse vector iterator
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+
+ // clear the ea and eb for summation
+ ea_.fill(0.0);
+ eb_.fill(0.0);
+ ec_.fill(0.0);
+ // clear the V for summation
+ for (unsigned int j=0; j<f_->number_of_b(); ++j)
+ {
+ V_[j].fill(0.0);
+ R_[j].fill(0.0);
+ }
+ T_.fill(0.0);
+ // compute blocks T, Q, R, U, V, W, ea, eb, and ec
+ // JtJ = |T Q R|
+ // |Qt U W| with U and V block diagonal
+ // |Rt Wt V| and W with same sparsity as residuals
+ for (unsigned int i=0; i<f_->number_of_a(); ++i)
+ {
+ vnl_matrix<double>& Ui = U_[i];
+ Ui.fill(0.0);
+ vnl_matrix<double>& Qi = Q_[i];
+ Qi.fill(0.0);
+ unsigned int ai_size = f_->number_of_params_a(i);
+ vnl_vector_ref<double> eai(ai_size, ea_.data_block()+f_->index_a(i));
+
+ vnl_crs_index::sparse_vector row = crs.sparse_row(i);
+ for (sv_itr r_itr=row.begin(); r_itr!=row.end(); ++r_itr)
+ {
+ unsigned int j = r_itr->second;
+ unsigned int k = r_itr->first;;
+ vnl_matrix<double>& Aij = A_[k];
+ vnl_matrix<double>& Bij = B_[k];
+ vnl_matrix<double>& Cij = C_[k];
+ vnl_matrix<double>& Vj = V_[j];
+ vnl_matrix<double>& Rj = R_[j];
+ vnl_vector_ref<double> ebj(Bij.cols(), eb_.data_block()+f_->index_b(j));
+
+ vnl_fastops::inc_X_by_AtA(T_, Cij); // T = C^T * C
+ vnl_fastops::inc_X_by_AtA(Ui,Aij); // Ui += A_ij^T * A_ij
+ vnl_fastops::inc_X_by_AtA(Vj,Bij); // Vj += B_ij^T * B_ij
+ vnl_fastops::AtB(W_[k],Aij,Bij); // Wij = A_ij^T * B_ij
+ vnl_fastops::inc_X_by_AtB(Qi,Cij,Aij); // Qi += C_ij^T * A_ij
+ vnl_fastops::inc_X_by_AtB(Rj,Cij,Bij); // Rj += C_ij^T * B_ij
+
+ vnl_vector_ref<double> eij(f_->number_of_residuals(k), e_.data_block()+f_->index_e(k));
+ vnl_fastops::inc_X_by_AtB(eai,Aij,eij); // e_a_i += A_ij^T * e_ij
+ vnl_fastops::inc_X_by_AtB(ebj,Bij,eij); // e_b_j += B_ij^T * e_ij
+ vnl_fastops::inc_X_by_AtB(ec_,Cij,eij); // e_c += C_ij^T * e_ij
+ }
+ }
+}
+
+
+//: extract the vector on the diagonal of Jt J
+vnl_vector<double> vnl_sparse_lm::extract_diagonal() const
+{
+ // Extract the diagonal of J^T*J as a vector
+ vnl_vector<double> diag_UVT(size_a_+size_b_+size_c_);
+ int z = 0;
+ for (int i=0; i<num_a_; ++i) {
+ const vnl_matrix<double>& Ui = U_[i];
+ for (unsigned int ii=0; ii<Ui.rows(); ++ii)
+ diag_UVT[z++] = Ui(ii,ii);
+ }
+ for (int j=0; j<num_b_; ++j) {
+ const vnl_matrix<double>& Vj = V_[j];
+ for (unsigned int ii=0; ii<Vj.rows(); ++ii)
+ diag_UVT[z++] = Vj(ii,ii);
+ }
+ for (int ii=0; ii<size_c_; ++ii)
+ diag_UVT[z++] = T_(ii,ii);
+
+ return diag_UVT;
+}
+
+
+//: set the vector on the diagonal of Jt J
+void vnl_sparse_lm::set_diagonal(const vnl_vector<double>& diag)
+{
+ int z=0;
+ for (int i=0; i<num_a_; ++i) {
+ vnl_matrix<double>& Ui = U_[i];
+ for (unsigned int ii=0; ii<Ui.rows(); ++ii)
+ Ui(ii,ii) = diag[z++];
+ }
+ for (int j=0; j<num_b_; ++j) {
+ vnl_matrix<double>& Vj = V_[j];
+ for (unsigned int ii=0; ii<Vj.rows(); ++ii)
+ Vj(ii,ii) = diag[z++];
+ }
+ for (int ii=0; ii<size_c_; ++ii)
+ T_(ii,ii) = diag[z++];
+}
+
+
+//: compute all inv(Vi) and Yij
+void vnl_sparse_lm::compute_invV_Y()
+{
+ // CRS matrix of indices into e, A, B, C, W, Y
+ const vnl_crs_index& crs = f_->residual_indices();
+ // sparse vector iterator
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+
+ for (int j=0; j<num_b_; ++j) {
+ vnl_matrix<double>& inv_Vj = inv_V_[j];
+ vnl_cholesky Vj_cholesky(V_[j],vnl_cholesky::quiet);
+ // use SVD as a backup if Cholesky is deficient
+ if ( Vj_cholesky.rank_deficiency() > 0 )
+ {
+ vnl_svd<double> Vj_svd(V_[j]);
+ inv_Vj = Vj_svd.inverse();
+ }
+ else
+ inv_Vj = Vj_cholesky.inverse();
+
+ vnl_crs_index::sparse_vector col = crs.sparse_col(j);
+ for (sv_itr c_itr=col.begin(); c_itr!=col.end(); ++c_itr)
+ {
+ unsigned int k = c_itr->first;
+ Y_[k] = W_[k]*inv_Vj; // Y_ij = W_ij * inv(V_j)
+ }
+ }
+}
+
+
+// compute Z and Sa
+void vnl_sparse_lm::compute_Z_Sa(vnl_matrix<double>& Sa)
+{
+ // CRS matrix of indices into e, A, B, C, W, Y
+ const vnl_crs_index& crs = f_->residual_indices();
+ // sparse vector iterator
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+
+ // compute Z = RYt-Q and Sa
+ for (int i=0; i<num_a_; ++i)
+ {
+ vnl_crs_index::sparse_vector row_i = crs.sparse_row(i);
+ vnl_matrix<double>& Zi = Z_[i];
+ Zi.fill(0.0);
+ Zi -= Q_[i];
+
+ // handle the diagonal blocks separately
+ vnl_matrix<double> Sii(U_[i]); // copy Ui to initialize Sii
+ for (sv_itr ri = row_i.begin(); ri != row_i.end(); ++ri)
+ {
+ unsigned int j = ri->second;
+ unsigned int k = ri->first;
+ vnl_matrix<double>& Yij = Y_[k];
+ vnl_fastops::dec_X_by_ABt(Sii,Yij,W_[k]); // S_ii -= Y_ij * W_ij^T
+ vnl_fastops::inc_X_by_ABt(Zi,R_[j],Yij); // Z_i += R_j * Y_ij^T
+ }
+ Sa.update(Sii,f_->index_a(i),f_->index_a(i));
+
+ // handle the (symmetric) off diagonal blocks
+ for (int h=i+1; h<num_a_; ++h)
+ {
+ vnl_crs_index::sparse_vector row_h = crs.sparse_row(h);
+ vnl_matrix<double> Sih(f_->number_of_params_a(i),
+ f_->number_of_params_a(h), 0.0);
+
+ // iterate through both sparse rows finding matching columns
+ bool row_done = false;
+ for (sv_itr ri = row_i.begin(), rh = row_h.begin();
+ ri != row_i.end() && rh != row_h.end(); ++ri, ++rh)
+ {
+ while (!row_done && ri->second != rh->second)
+ {
+ while (!row_done && ri->second < rh->second)
+ row_done = (++ri == row_i.end());
+ while (!row_done && rh->second < ri->second)
+ row_done = (++rh == row_h.end());
+ }
+ if (row_done)
+ break;
+ // S_ih -= Y_ij * W_hj^T
+ vnl_fastops::dec_X_by_ABt(Sih,Y_[ri->first],W_[rh->first]);
+ }
+ // this should also be a symmetric matrix
+ Sa.update(Sih,f_->index_a(i),f_->index_a(h));
+ Sa.update(Sih.transpose(),f_->index_a(h),f_->index_a(i));
+ }
+ }
+}
+
+
+//: compute Ma
+void vnl_sparse_lm::compute_Ma(const vnl_matrix<double>& H)
+{
+ // construct Ma = ZH
+ vnl_matrix<double> Hik;
+ for (int i=0; i<num_a_; ++i)
+ {
+ vnl_matrix<double>& Mai = Ma_[i];
+ Mai.fill(0.0);
+
+ for (int k=0; k<num_a_; ++k)
+ {
+ Hik.set_size(f_->number_of_params_a(i), f_->number_of_params_a(k));
+ H.extract(Hik,f_->index_a(i), f_->index_a(k));
+ vnl_fastops::inc_X_by_AB(Mai, Z_[k], Hik);
+ }
+ }
+}
+
+
+//: compute Mb
+void vnl_sparse_lm::compute_Mb()
+{
+ // CRS matrix of indices into e, A, B, C, W, Y
+ const vnl_crs_index& crs = f_->residual_indices();
+ // sparse vector iterator
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+
+ vnl_matrix<double> temp;
+ // construct Mb = (-R-MaW)inv(V)
+ for (int j=0; j<num_b_; ++j)
+ {
+ temp.set_size(size_c_,f_->number_of_params_b(j));
+ temp.fill(0.0);
+ temp -= R_[j];
+
+ vnl_crs_index::sparse_vector col = crs.sparse_col(j);
+ for (sv_itr c_itr=col.begin(); c_itr!=col.end(); ++c_itr)
+ {
+ unsigned int k = c_itr->first;
+ unsigned int i = c_itr->second;
+ vnl_fastops::dec_X_by_AB(temp,Ma_[i],W_[k]);
+ }
+ vnl_fastops::AB(Mb_[j],temp,inv_V_[j]);
+ }
+}
+
+
+//: solve for dc
+void vnl_sparse_lm::solve_dc(vnl_vector<double>& dc)
+{
+ // sparse vector iterator
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+
+ vnl_matrix<double> Sc(T_); // start with a copy of T
+ vnl_vector<double> sec(ec_); // start with a copy of ec
+
+ for (int i=0; i<num_a_; ++i)
+ {
+ const vnl_vector_ref<double> eai(f_->number_of_params_a(i),
+ const_cast<double*>(ea_.data_block()+f_->index_a(i)));
+ vnl_fastops::inc_X_by_ABt(Sc,Ma_[i],Q_[i]);
+ sec += Ma_[i] * eai;
+ }
+ for (int j=0; j<num_b_; ++j)
+ {
+ const vnl_vector_ref<double> ebi(f_->number_of_params_b(j),
+ const_cast<double*>(eb_.data_block()+f_->index_b(j)));
+ vnl_fastops::inc_X_by_ABt(Sc,Mb_[j],R_[j]);
+ sec += Mb_[j] * ebi;
+ }
+
+ if (size_c_ == 1)
+ {
+ dc[0] = sec[0] / Sc(0,0);
+ }
+ else
+ {
+ // Solve Sc*dc = sec for dc
+ vnl_cholesky Sc_cholesky(Sc,vnl_cholesky::quiet);
+ // use SVD as a backup if Cholesky is deficient
+ if ( Sc_cholesky.rank_deficiency() > 0 )
+ {
+ vnl_svd<double> Sc_svd(Sc);
+ dc = Sc_svd.solve(sec);
+ }
+ else
+ dc = Sc_cholesky.solve(sec);
+ }
+}
+
+
+//: compute sea using ea, Z, dc, Y, and eb
+void vnl_sparse_lm::compute_sea(vnl_vector<double> const& dc,
+ vnl_vector<double>& sea)
+{
+ // CRS matrix of indices into e, A, B, C, W, Y
+ const vnl_crs_index& crs = f_->residual_indices();
+ // sparse vector iterator
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+
+ sea = ea_; // initialize se to ea_
+ for (int i=0; i<num_a_; ++i)
+ {
+ vnl_vector_ref<double> sei(f_->number_of_params_a(i),sea.data_block()+f_->index_a(i));
+ vnl_crs_index::sparse_vector row_i = crs.sparse_row(i);
+
+ vnl_fastops::inc_X_by_AtB(sei,Z_[i],dc);
+
+ for (sv_itr ri = row_i.begin(); ri != row_i.end(); ++ri)
+ {
+ unsigned int k = ri->first;
+ vnl_matrix<double>& Yij = Y_[k];
+ vnl_vector_ref<double> ebj(Yij.cols(), eb_.data_block()+f_->index_b(ri->second));
+ sei -= Yij*ebj; // se_i -= Y_ij * e_b_j
+ }
+ }
+}
+
+
+//: compute Sa and sea
+// only used when size_c_ == 0
+void vnl_sparse_lm::compute_Sa_sea(vnl_matrix<double>& Sa,
+ vnl_vector<double>& sea)
+{
+ // CRS matrix of indices into e, A, B, C, W, Y
+ const vnl_crs_index& crs = f_->residual_indices();
+ // sparse vector iterator
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+
+ sea = ea_; // initialize se to ea_
+ for (int i=0; i<num_a_; ++i)
+ {
+ vnl_vector_ref<double> sei(f_->number_of_params_a(i),sea.data_block()+f_->index_a(i));
+ vnl_crs_index::sparse_vector row_i = crs.sparse_row(i);
+
+ // handle the diagonal blocks and computation of se separately
+ vnl_matrix<double> Sii(U_[i]); // copy Ui to initialize Sii
+ for (sv_itr ri = row_i.begin(); ri != row_i.end(); ++ri)
+ {
+ unsigned int k = ri->first;
+ vnl_matrix<double>& Yij = Y_[k];
+ vnl_fastops::dec_X_by_ABt(Sii,Yij,W_[k]); // S_ii -= Y_ij * W_ij^T
+ vnl_vector_ref<double> ebj(Yij.cols(), eb_.data_block()+f_->index_b(ri->second));
+ sei -= Yij*ebj; // se_i -= Y_ij * e_b_j
+ }
+ Sa.update(Sii,f_->index_a(i),f_->index_a(i));
+
+ // handle the (symmetric) off diagonal blocks
+ for (int h=i+1; h<num_a_; ++h)
+ {
+ vnl_crs_index::sparse_vector row_h = crs.sparse_row(h);
+ vnl_matrix<double> Sih(f_->number_of_params_a(i),f_->number_of_params_a(h),0.0);
+
+ // iterate through both sparse rows finding matching columns
+ bool row_done = false;
+ for (sv_itr ri = row_i.begin(), rh = row_h.begin();
+ ri != row_i.end() && rh != row_h.end(); ++ri, ++rh)
+ {
+ while (!row_done && ri->second != rh->second)
+ {
+ while (!row_done && ri->second < rh->second)
+ row_done = (++ri == row_i.end());
+ while (!row_done && rh->second < ri->second)
+ row_done = (++rh == row_h.end());
+ }
+ if (row_done)
+ break;
+ // S_ih -= Y_ij * W_hj^T
+ vnl_fastops::dec_X_by_ABt(Sih,Y_[ri->first],W_[rh->first]);
+ }
+ // this should also be a symmetric matrix
+ Sa.update(Sih,f_->index_a(i),f_->index_a(h));
+ Sa.update(Sih.transpose(),f_->index_a(h),f_->index_a(i));
+ }
+ }
+}
+
+
+//: back solve to find db using da and dc
+void vnl_sparse_lm::backsolve_db(vnl_vector<double> const& da,
+ vnl_vector<double> const& dc,
+ vnl_vector<double>& db)
+{
+ // CRS matrix of indices into e, A, B, C, W, Y
+ const vnl_crs_index& crs = f_->residual_indices();
+ // sparse vector iterator
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+
+ for (int j=0; j<num_b_; ++j)
+ {
+ vnl_vector<double> seb(eb_.data_block()+f_->index_b(j),f_->number_of_params_b(j));
+ vnl_crs_index::sparse_vector col = crs.sparse_col(j);
+ if ( size_c_ > 0 )
+ {
+ vnl_fastops::dec_X_by_AtB(seb,R_[j],dc);
+ }
+ for (sv_itr c_itr=col.begin(); c_itr!=col.end(); ++c_itr)
+ {
+ unsigned int k = c_itr->first;
+ unsigned int i = c_itr->second;
+ const vnl_vector_ref<double> dai(f_->number_of_params_a(i),
+ const_cast<double*>(da.data_block()+f_->index_a(i)));
+ vnl_fastops::dec_X_by_AtB(seb,W_[k],dai);
+ }
+ vnl_vector_ref<double> dbi(f_->number_of_params_b(j),db.data_block()+f_->index_b(j));
+ vnl_fastops::Ab(dbi,inv_V_[j],seb);
+ }
+}
+
+//------------------------------------------------------------------------------
+
+void vnl_sparse_lm::diagnose_outcome() const
+{
+ diagnose_outcome(vcl_cerr);
+}
+
+// fsm: should this function be a method on vnl_nonlinear_minimizer?
+// if not, the return codes should be moved into LM.
+void vnl_sparse_lm::diagnose_outcome(vcl_ostream& s) const
+{
+#define whoami "vnl_sparse_lm"
+ //if (!verbose_) return;
+ switch (failure_code_)
+ {
+ case ERROR_FAILURE:
+ s << (whoami ": OIOIOI -- failure in leastsquares function\n");
+ break;
+ case ERROR_DODGY_INPUT:
+ s << (whoami ": OIOIOI -- lmdif dodgy input\n");
+ break;
+ case CONVERGED_FTOL:
+ s << (whoami ": converged to ftol\n");
+ break;
+ case CONVERGED_XTOL:
+ s << (whoami ": converged to xtol\n");
+ break;
+ case CONVERGED_XFTOL:
+ s << (whoami ": converged nicely\n");
+ break;
+ case CONVERGED_GTOL:
+ s << (whoami ": converged via gtol\n");
+ break;
+ case TOO_MANY_ITERATIONS:
+ s << (whoami ": too many iterations\n");
+ break;
+ case FAILED_FTOL_TOO_SMALL:
+ s << (whoami ": ftol is too small. no further reduction in the sum of squares is possible.\n");
+ break;
+ case FAILED_XTOL_TOO_SMALL:
+ s << (whoami ": xtol is too small. no further improvement in the approximate solution x is possible.\n");
+ break;
+ case FAILED_GTOL_TOO_SMALL:
+ s << (whoami ": gtol is too small. f(a,b) is orthogonal to the columns of the jacobian to machine precision.\n");
+ break;
+ default:
+ s << (whoami ": OIOIOI: unkown info code from lmder.\n");
+ break;
+ }
+ unsigned int num_e = f_->number_of_e();
+ s << whoami ": " << num_iterations_ << " iterations, "
+ << num_evaluations_ << " evaluations, "<< num_e <<" residuals. RMS error start/end "
+ << get_start_error() << '/' << get_end_error() << vcl_endl;
+#undef whoami
+}
+
+
+vnl_matrix<double> const& vnl_sparse_lm::get_JtJ()
+{
+ return inv_covar_;
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lm.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lm.h
new file mode 100644
index 0000000000000000000000000000000000000000..99f64c7735ce1f4957b548a89093beb2008a3ccd
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lm.h
@@ -0,0 +1,173 @@
+// This is core/vnl/algo/vnl_sparse_lm.h
+#ifndef vnl_sparse_lm_h_
+#define vnl_sparse_lm_h_
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma interface
+#endif
+//:
+// \file
+// \brief Sparse Levenberg Marquardt nonlinear least squares
+// \author Matt Leotta (Brown)
+// \date April 14, 2005
+//
+// \verbatim
+// Modifications
+// Mar 15, 2010 MJL - Modified to handle 'c' parameters (globals)
+// \endverbatim
+//
+
+#include <vcl_iosfwd.h>
+#include <vcl_vector.h>
+#include <vnl/vnl_vector.h>
+#include <vnl/vnl_matrix.h>
+#include <vnl/vnl_nonlinear_minimizer.h>
+
+class vnl_sparse_lst_sqr_function;
+
+//: Sparse Levenberg Marquardt nonlinear least squares
+// Unlike vnl_levenberg_marquardt this does not use the MINPACK routines.
+// This class implements sparse Levenberg Marquardt as described in
+// the Hartley and Zisserman "Multiple View Geometry" book and further
+// described in a technical report on sparse bundle adjustment available
+// at http://www.ics.forth.gr/~lourakis/sba
+class vnl_sparse_lm : public vnl_nonlinear_minimizer
+{
+ public:
+
+ //: Initialize with the function object that is to be minimized.
+ vnl_sparse_lm(vnl_sparse_lst_sqr_function& f);
+
+ //: Destructor
+ ~vnl_sparse_lm();
+
+ //: Minimize the function supplied in the constructor until convergence or failure.
+ // On return, a, b, and c are such that f(a,b,c) is the lowest value achieved.
+ // Returns true for convergence, false for failure.
+ // If use_gradient is set to false, a finite difference approximation will be used,
+ // even if the Jacobian functions have been provided.
+ // If use_weights is set to false, weights will not be computed even if a
+ // weighting function has been provided.
+ bool minimize(vnl_vector<double>& a,
+ vnl_vector<double>& b,
+ vnl_vector<double>& c,
+ bool use_gradient = true,
+ bool use_weights = true);
+
+ // Coping with failure-------------------------------------------------------
+
+ //: Provide an ASCII diagnosis of the last minimization on vcl_ostream.
+ void diagnose_outcome(/*vcl_cerr*/) const;
+ void diagnose_outcome(vcl_ostream&) const;
+
+ //: Return J'*J computed at last minimum.
+ // it is an approximation of inverse of covariance
+ vnl_matrix<double> const& get_JtJ();
+
+ //: Access the final weights after optimization
+ const vnl_vector<double>& get_weights() const { return weights_; }
+
+protected:
+
+ //: used to compute the initial damping
+ double tau_;
+ //: the function to minimize
+ vnl_sparse_lst_sqr_function* f_;
+
+ vnl_matrix<double> inv_covar_;
+ bool set_covariance_; // Set if covariance_ holds J'*J
+
+ void init(vnl_sparse_lst_sqr_function* f);
+
+private:
+
+ //: allocate matrix memory by setting all the matrix sizes
+ void allocate_matrices();
+
+ //: check vector sizes and verify that they match the problem size
+ bool check_vector_sizes(vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c);
+
+ //: compute the blocks making up the the normal equations: Jt J d = Jt e
+ void compute_normal_equations();
+
+ //: extract the vector on the diagonal of Jt J
+ vnl_vector<double> extract_diagonal() const;
+
+ //: set the vector on the diagonal of Jt J
+ void set_diagonal(const vnl_vector<double>& diag);
+
+ //: compute all inv(Vi) and Yij
+ void compute_invV_Y();
+
+ //: compute Z and Sa
+ void compute_Z_Sa(vnl_matrix<double>& Sa);
+
+ //: compute Ma
+ void compute_Ma(const vnl_matrix<double>& H);
+
+ //: compute Mb
+ void compute_Mb();
+
+ //: solve for dc
+ void solve_dc(vnl_vector<double>& dc);
+
+ //: compute sea using ea, Z, dc, Y, and eb
+ void compute_sea(vnl_vector<double> const& dc,
+ vnl_vector<double>& sea);
+
+ //: compute Sa and sea
+ // only used when size_c_ == 0
+ void compute_Sa_sea(vnl_matrix<double>& Sa, vnl_vector<double>& sea);
+
+ //: back solve to find db using da and dc
+ void backsolve_db(vnl_vector<double> const& da,
+ vnl_vector<double> const& dc,
+ vnl_vector<double>& db);
+
+ const int num_a_;
+ const int num_b_;
+ const int num_e_;
+ const int num_nz_;
+
+ const int size_a_;
+ const int size_b_;
+ const int size_c_;
+ const int size_e_;
+
+ //: Storage for each of the Jacobians A_ij, B_ij, and C_ij
+ vcl_vector<vnl_matrix<double> > A_;
+ vcl_vector<vnl_matrix<double> > B_;
+ vcl_vector<vnl_matrix<double> > C_;
+
+ //: Storage for normal equation blocks
+ // diagonals of JtJ
+ vcl_vector<vnl_matrix<double> > U_;
+ vcl_vector<vnl_matrix<double> > V_;
+ vnl_matrix<double> T_;
+ // off-diagonals of JtJ
+ vcl_vector<vnl_matrix<double> > W_;
+ vcl_vector<vnl_matrix<double> > R_;
+ vcl_vector<vnl_matrix<double> > Q_;
+ // vectors Jte
+ vnl_vector<double> ea_;
+ vnl_vector<double> eb_;
+ vnl_vector<double> ec_;
+
+ // Storage for residual vector
+ vnl_vector<double> e_;
+
+ // Storage for weight vector
+ vnl_vector<double> weights_;
+
+ // Storage for intermediate results
+ vcl_vector<vnl_matrix<double> > inv_V_;
+ vcl_vector<vnl_matrix<double> > Y_;
+ vcl_vector<vnl_matrix<double> > Z_;
+ vcl_vector<vnl_matrix<double> > Ma_;
+ vcl_vector<vnl_matrix<double> > Mb_;
+
+};
+
+
+#endif // vnl_sparse_lm_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lu.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lu.cxx
index 36db7caf0fe6c2587a9ed6288a3e59ad3fd1cd2c..62d318a319b3ab5f0a15e8f6cbdf5197feb3c6ef 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lu.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lu.cxx
@@ -8,6 +8,15 @@
#include <vcl_cassert.h>
#include <vcl_iostream.h>
+#include <sparse/spMatrix.h>
+
+// destructor - undo the spCreate() from the constructor(s)
+// (memory leak fix of 7 Feb. 2008 by Toon Huysmans)
+vnl_sparse_lu::~vnl_sparse_lu()
+{
+ spDestroy( pmatrix_ );
+}
+
//: constructor - controls if condition information is computed
vnl_sparse_lu::vnl_sparse_lu(vnl_sparse_matrix<double> const & M, operation mode):
A_(M), factored_(false),condition_computed_(false), mode_(mode),norm_(0), rcond_(0), largest_(0), pivot_thresh_(0),absolute_thresh_(0),diag_pivoting_(1),pmatrix_(0)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lu.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lu.h
index 511131815516e26cc7ea7c44d7b3defee92fd452..f6418804c0630da6a3f6561b2fbaa072af09f0af 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lu.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_lu.h
@@ -17,8 +17,6 @@
#include <vnl/vnl_vector.h>
#include <vnl/vnl_sparse_matrix.h>
-#include <sparse/spMatrix.h>
-
//: Linear system solver for Mx = b using LU decomposition of a sparse matrix
// Encapsulating Sparse 1.3 by Kenneth S. Kundert.
@@ -42,11 +40,11 @@ class vnl_sparse_lu
//: Make sparse_lu decomposition of M optionally computing the reciprocal condition number.
vnl_sparse_lu(vnl_sparse_matrix<double> const& M, operation mode = quiet);
- ~vnl_sparse_lu() {}
+ ~vnl_sparse_lu();
//: set the relative pivot threshold should be between 0 and 1
// If set to one then pivoting is complete and slow
- // If near zero then roundoff error may be prohibitive but compuation is fast
+ // If near zero then roundoff error may be prohibitive but computation is fast
// Typical values are between 0.01 and 0.1.
void set_pivot_thresh(double pivot_thresh){pivot_thresh_=pivot_thresh;}
@@ -108,7 +106,10 @@ class vnl_sparse_lu
//: Assignment operator - privatised to avoid it being used
vnl_sparse_lu& operator=(vnl_sparse_lu const & that);
//: The internal matrix representation
- spMatrix pmatrix_;
+ //
+ // We don't use the typedef spMatrix directly here to avoid exposing
+ // the implementation detail (sparse/spMatrix.h) to the user.
+ void* pmatrix_;
};
#endif // vnl_sparse_lu_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_symmetric_eigensystem.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_symmetric_eigensystem.cxx
index 1d3374a593cd86d3eef36345d769ff8cba1f53e8..79c80f16db31d9260c6eb97d682abd73739226c4 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_symmetric_eigensystem.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_symmetric_eigensystem.cxx
@@ -6,12 +6,15 @@
// \file
#include "vnl_sparse_symmetric_eigensystem.h"
+#include "vnl_sparse_lu.h"
+#include <vnl/vnl_vector_ref.h>
#include <vcl_cassert.h>
#include <vcl_cstring.h>
+#include <vcl_cstdlib.h>
#include <vcl_iostream.h>
#include <vcl_vector.h>
-#include <vnl/algo/vnl_netlib.h> // dnlaso_()
+#include <vnl/algo/vnl_netlib.h> // dnlaso_() dseupd_() dsaupd_()
static vnl_sparse_symmetric_eigensystem * current_system = 0;
@@ -130,15 +133,15 @@ int vnl_sparse_symmetric_eigensystem::CalculateNPairs(vnl_sparse_matrix<double>&
long ierr = 0;
v3p_netlib_dnlaso_(sse_op_callback, sse_iovect_callback,
- &dim, &nvals, &nfigures, &nperm,
- &nmval, &temp_vals[0],
- &nmvec, &temp_vecs[0],
- &nblock,
- &maxop,
- &maxj,
- &work[0],
- &ind[0],
- &ierr);
+ &dim, &nvals, &nfigures, &nperm,
+ &nmval, &temp_vals[0],
+ &nmvec, &temp_vecs[0],
+ &nblock,
+ &maxop,
+ &maxj,
+ &work[0],
+ &ind[0],
+ &ierr);
if (ierr > 0)
{
if (ierr & 0x1)
@@ -201,6 +204,254 @@ int vnl_sparse_symmetric_eigensystem::CalculateNPairs(vnl_sparse_matrix<double>&
return ierr;
}
+
+//------------------------------------------------------------
+//: Here is where the fortran converted code gets called.
+// The sparse matrix A is assumed to be symmetric.
+// Find n eigenvalue/eigenvectors of the eigenproblem A * x = lambda * B * x.
+// !smallest and !magnitude - compute the N largest (algebraic) eigenvalues
+// smallest and !magnitude - compute the N smallest (algebraic) eigenvalues
+// !smallest and magnitude - compute the N largest (magnitude) eigenvalues
+// smallest and magnitude - compute the nev smallest (magnitude) eigenvalues
+// set sigma for shift/invert mode
+int vnl_sparse_symmetric_eigensystem::CalculateNPairs(
+ vnl_sparse_matrix<double>& A, vnl_sparse_matrix<double>& B, int nEV,
+ double tolerance, int numberLanczosVecs,
+ bool smallest, bool magnitude,
+ int maxIterations,
+ double sigma)
+{
+ mat = &A;
+ Bmat = &B;
+
+ // Clear current vectors.
+ if (vectors) {
+ delete[] vectors; vectors = NULL;
+ delete[] values; values = NULL;
+ }
+ nvalues = 0;
+
+ const long whichLength = 2;
+ char which[whichLength + 1];
+ which[whichLength] = '\0';
+ if (smallest)
+ which[0] = 'S';
+ else
+ which[0] = 'L';
+
+ if (magnitude)
+ which[1] = 'M';
+ else
+ which[1] = 'A';
+
+ long matSize = mat->columns(); // Dimension of the eigenproblem.
+ long ido = 0; // ido == 0 means initialization
+
+ long nconv = 0L; // Number of "converged" Ritz values.
+ long numberLanczosVecsL = numberLanczosVecs; // number of vectors to calc
+ long nEVL = nEV; // long number of EVs to calc
+
+ double *resid = new double[matSize];
+ vcl_memset((void*) resid, 0, sizeof(double)*matSize);
+
+ if (maxIterations <= 0)
+ maxIterations = nEVL * 100;
+
+ if (numberLanczosVecsL <= 0)
+ numberLanczosVecsL = 2 * nEVL + 1;
+ numberLanczosVecsL = (numberLanczosVecsL > matSize ? matSize : numberLanczosVecsL);
+ double *V = new double[matSize * numberLanczosVecsL + 1];
+
+#define DONE 99
+ const int genEigProblemLength = 1;
+ char genEigProblem = 'G';
+ long info = 0; // Initialization info (INPUT) and error flag (OUTPUT)
+
+#define IPARAMSIZE 12
+ long iParam[IPARAMSIZE];
+ // for the sake of consistency with parameter indices in FORTRAN,
+ // start at index 1...
+ iParam[0] = 0;
+ iParam[1] = 1; // always auto-shift
+ iParam[2] = 0; // no longer referenced
+ iParam[3] = maxIterations;
+ iParam[4] = 1; // NB: blocksize to be used in the recurrence.
+ // The code currently works only for NB = 1.
+
+ iParam[5] = 0; // output - number of converged Ritz values
+ iParam[6] = 0; // No longer referenced. Implicit restarting is ALWAYS used
+
+ long mode;
+
+ // if we have a sigma, it's mode 3, otherwise, mode 2
+ // the mode determines the OP used in the solution
+ // determine OP
+ vnl_sparse_matrix<double> OP;
+ if (sigma != 0.0)
+ {
+ // K*x = lambda*M*x, K symmetric, M symmetric positive semi-definite
+ // OP = (inv[K - sigma*M])*M and B = M.
+ // Shift-and-Invert mode
+ mode = 3;
+ // determine OP
+
+ OP = B;
+ OP *= sigma;
+ OP = A - OP;
+//vsl_print_summary(std::cout, OP);
+ }
+ else
+ {
+ // A*x = lambda*M*x, A symmetric, M symmetric positive definite
+ // OP = inv[M]*A and B = M.
+ mode = 2;
+ OP = B;
+ }
+ // iParam[7] is the mode of the solution
+ iParam[7] = mode;
+
+ // decompose for using in "multiplying" intermediate results
+ vnl_sparse_lu opLU(OP);
+
+//std::cout << opLU << std::endl;
+
+ iParam[8] = 0; // parameter for user supplied shifts - not used here
+
+ // iParam 9 - 11 are output
+ iParam[9] = 0; // total number of OP*x operations
+ iParam[10] = 0; // total number of B*x operations if BMAT='G'
+ iParam[11] = 0; // total number of steps of re-orthogonalization
+
+ // output vector filled with address information for intermediate data used
+ // by the solver
+ // use FORTRAN indexing again...
+ long iPntr[IPARAMSIZE];
+ for (int clrIx = 0; clrIx < IPARAMSIZE; clrIx++)
+ iPntr[clrIx]= 0;
+
+ // Double precision work array of length 3*N.
+ double *workd = new double[3 * matSize + 1];
+
+ // Double precision work array of length 3*N.
+ long lworkl = numberLanczosVecsL * (numberLanczosVecsL+9);
+
+ // Double precision work array of length at least NCV**2 + 8*NCV
+ double *workl = new double[lworkl + 1];
+
+ // start from scratch
+ bool basisCalculated = false;
+
+ vnl_vector<double> workVector;
+
+ while (!basisCalculated)
+ {
+ // Calling arpack routine dsaupd.
+ v3p_netlib_dsaupd_(
+ &ido, &genEigProblem, &matSize, which,
+ &nEVL, &tolerance, resid, &numberLanczosVecsL, &V[1], &matSize,
+ &iParam[1], &iPntr[1], &workd[1], &workl[1], &lworkl, &info,
+ genEigProblemLength, whichLength);
+
+ // Checking if aupp is done
+ if (ido==DONE)
+ {
+ nconv = iParam[5];
+ basisCalculated = true;
+ break;
+ }
+ else
+ {
+ switch (info) {
+ case -8: // Could not perform LAPACK eigenvalue calculation
+ case -9: // Starting vector is zero
+ case -9999: // Could not build an Arnoldi factorization
+ return info;
+ break;
+ case 0: // success
+ case 1: // hit maxIterations - should be DONE
+ case 3: // No shifts could be applied during a cycle of IRAM iteration
+ break;
+ default : // unknown ARPACK error
+ return info;
+ }
+
+ // setting z pointer to ( = Bx) into workd
+ if (ido == -1)
+ iPntr[3] = iPntr[2] + matSize;
+
+ vnl_vector_ref<double> x(matSize, &workd[iPntr[1]]);
+ vnl_vector_ref<double> y(matSize, &workd[iPntr[2]]);
+ vnl_vector_ref<double> z(matSize, &workd[iPntr[3]]); // z = Bx
+
+ switch (ido)
+ {
+ case -1:
+ // Performing y <- OP*x for the first time when mode != 2.
+ if (mode != 2)
+ B.mult(x, z);
+ // no "break;" - initialization continues below
+ case 1:
+ // Performing y <- OP*w.
+ if (mode != 2)
+ opLU.solve(z, &y);
+ else
+ {
+ A.mult(x, workVector);
+ x.update(workVector);
+ opLU.solve(x, &y);
+ }
+ break;
+ case 2:
+ B.mult(x, y);
+ break;
+ default:
+ break;
+ }
+ }
+ }
+
+ long rvec = 1; // get the values and vectors
+
+ // which Ritz vctors do we want?
+ const int howMnyLength = 1;
+ char howMny = 'A'; // all
+
+ // selection vector for which Ritz vectors to calc.
+ // we want them all, so allocate the space (dseupd uses it)
+ vnl_vector<long> select(numberLanczosVecsL);
+
+ // allocate eVals and eVecs
+ nvalues = nconv;
+ values = new double[nvalues];
+ vectors = new vnl_vector<double>[nvalues];
+
+ // hold the eigenvectors
+ double *Z = new double[nvalues * matSize];
+
+ v3p_netlib_dseupd_(&rvec, &howMny, select.data_block(), values, Z, &matSize, &sigma, &genEigProblem,
+ &matSize, which, &nEVL, &tolerance, resid, &numberLanczosVecsL, &V[1], &matSize, &iParam[1],
+ &iPntr[1], &workd[1], &workl[1], &lworkl, &info,
+ howMnyLength, genEigProblemLength, whichLength);
+
+ // Copy the eigenvectors
+ int evIx;
+ for (evIx = 0; evIx < nvalues; evIx++)
+ {
+ vnl_vector_ref<double> tempEVec(matSize, &Z[evIx * matSize]);
+ vectors[evIx] = tempEVec;
+ }
+
+ // Delete temporary space.
+ delete[] Z;
+ delete[] resid;
+ delete[] V;
+ delete[] workd;
+ delete[] workl;
+
+ return info;
+}
+
+
//------------------------------------------------------------
//: Callback from solver to calculate the product A p.
int vnl_sparse_symmetric_eigensystem::CalculateProduct(int n, int m,
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_symmetric_eigensystem.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_symmetric_eigensystem.h
index 3c881d64a9b4d178a99afc2c0062a7ae64559536..558ffd820420aff4735ce75c4ad9c981ea7bc3cf 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_symmetric_eigensystem.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_sparse_symmetric_eigensystem.h
@@ -12,19 +12,26 @@
//
// \verbatim
// Modifications
-// dac (Manchester) 28/03/2001: tidied up documentation
+// 28 Mar 2001: dac (Manchester) - tidied up documentation
+// 17 Dec 2010: Michael Bowers - added generalized sparse symmetric eigensystem
+// solver (see 2nd CalculateNPairs() method)
// \endverbatim
#include <vnl/vnl_sparse_matrix.h>
#include <vcl_vector.h>
//: Find the eigenvalues of a sparse symmetric matrix
-// Solve the eigenproblem $A x = \lambda x$, with $A$ symmetric and
-// sparse. The block Lanczos algorithm is used to allow the
+// Solve the standard eigenproblem $A x = \lambda x$, or the
+// generalized eigenproblem of $A x = \lambda B x$, where
+// $A$ symmetric and sparse and, optionally, B sparse, symmetric,
+// and positive definite. The block Lanczos algorithm is used to allow the
// recovery of a number of eigenvalue/eigenvector pairs from either
// end of the spectrum, to a required accuracy.
//
-// Uses the dnlaso routine from the LASO package of netlib.
+// Uses the dnlaso routine from the LASO package of netlib for
+// solving the standard case.
+// Uses the dsaupd routine from the ARPACK package of netlib for
+// solving the generalized case.
class vnl_sparse_symmetric_eigensystem
{
@@ -32,11 +39,24 @@ class vnl_sparse_symmetric_eigensystem
vnl_sparse_symmetric_eigensystem();
~vnl_sparse_symmetric_eigensystem();
- // Find n eigenvalue/eigenvectors. If smallest is true, will
- // calculate the n smallest eigenpairs, else the n largest.
+ // Find n eigenvalue/eigenvectors of the eigenproblem A * x = lambda * x.
+ // If smallest is true, will calculate the n smallest eigenpairs,
+ // else the n largest.
int CalculateNPairs(vnl_sparse_matrix<double>& M, int n,
bool smallest = true, long nfigures = 10);
+ // Find n eigenvalue/eigenvectors of the eigenproblem A * x = lambda * B * x.
+ // !smallest and !magnitude - compute the N largest (algebraic) eigenvalues
+ // smallest and !magnitude - compute the N smallest (algebraic) eigenvalues
+ // !smallest and magnitude - compute the N largest (magnitude) eigenvalues
+ // smallest and magnitude - compute the nev smallest (magnitude) eigenvalues
+ // set sigma for shift/invert method
+ int CalculateNPairs(vnl_sparse_matrix<double>& A, vnl_sparse_matrix<double>& B, int nEV,
+ double tolerance = 0, int numberLanczosVecs = 0,
+ bool smallest = false, bool magnitude = true,
+ int maxIterations = 0,
+ double sigma = 0.0);
+
// Recover specified eigenvector after computation. The argument
// must be less than the requested number of eigenvectors.
vnl_vector<double> get_eigenvector(int i) const;
@@ -52,7 +72,10 @@ class vnl_sparse_symmetric_eigensystem
vnl_vector<double> * vectors; // eigenvectors
double * values; // eigenvalues
+ // Matrix A of A*x = lambda*x (or lambda*B*x)
vnl_sparse_matrix<double> * mat;
+ // Matrix B of A*x = lambda*B*x
+ vnl_sparse_matrix<double> * Bmat;
vcl_vector<double*> temp_store;
};
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd.h
index 5723d60ef0bbc0475633503dc8f581b1c3517abb..cb206937da7934610a642dc1e3ed4de54cbe06b7 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd.h
@@ -66,7 +66,7 @@ class vnl_svd
typedef typename vnl_numeric_traits<T>::abs_t singval_t;
//:
- // Construct an vnl_svd<T> object from $m \times n$ matrix $M$. The
+ // Construct a vnl_svd<T> object from $m \times n$ matrix $M$. The
// vnl_svd<T> object contains matrices $U$, $W$, $V$ such that
// $U W V^\top = M$.
//
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd.txx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd.txx
index 3b5e0a82cebb43ff3f4298e54189a6628913525d..f056795c50839a068670282f2377a9da8927ba5d 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd.txx
@@ -28,7 +28,7 @@ macro(z, vcl_complex<double>);
//--------------------------------------------------------------------------------
-static bool test_heavily = false;
+static bool vnl_svd_test_heavily = false;
#include <vnl/vnl_matlab_print.h>
template <class T>
@@ -94,7 +94,7 @@ vnl_svd<T>::vnl_svd(vnl_matrix<T> const& M, double zero_out_tol):
// have trouble doing. For example, gcc can output
// code in -O2 and static-linked code that causes this problem.
// One solution to this is to persuade gcc to output slightly different code
- // by adding and -fPIC option to the command line for v3p\netlib\dsvdc.c. If
+ // by adding and -fPIC option to the command line for v3p/netlib/dsvdc.c. If
// that doesn't work try adding -ffloat-store, which should fix the problem
// at the expense of being significantly slower for big problems. Note that
// if this is the cause, core/vnl/tests/test_svd should have failed.
@@ -131,13 +131,13 @@ vnl_svd<T>::vnl_svd(vnl_matrix<T> const& M, double zero_out_tol):
}
}
- if (test_heavily)
+ if (vnl_svd_test_heavily)
{
// Test that recomposed matrix == M
typedef typename vnl_numeric_traits<T>::abs_t abs_t;
abs_t recomposition_residual = vcl_abs((recompose() - M).fro_norm());
abs_t n = vcl_abs(M.fro_norm());
- abs_t thresh = m_ * abs_t(vnl_math::eps) * n;
+ abs_t thresh = abs_t(m_) * abs_t(vnl_math::eps) * n;
if (recomposition_residual > thresh)
{
vcl_cerr << "vnl_svd<T>::vnl_svd<T>() -- Warning, recomposition_residual = "
@@ -188,7 +188,8 @@ vnl_svd<T>::zero_out_absolute(double tol)
Winverse_(k,k) = 0;
weight = 0;
--rank_;
- } else
+ }
+ else
{
Winverse_(k,k) = singval_t(1.0)/weight;
}
@@ -202,13 +203,13 @@ template <class T> void vnl_svd<T>::zero_out_relative(double tol) // sqrt(machin
}
static bool w=false;
-inline bool warned() { if (w) return true; else { w=true; return false; } }
+inline bool vnl_svn_warned() { if (w) return true; else { w=true; return false; } }
//: Calculate determinant as product of diagonals in W.
template <class T>
typename vnl_svd<T>::singval_t vnl_svd<T>::determinant_magnitude() const
{
- if (!warned() && m_ != n_)
+ if (!vnl_svn_warned() && m_ != n_)
vcl_cerr << __FILE__ ": called determinant_magnitude() on SVD of non-square matrix\n"
<< "(This warning is displayed only once)\n";
singval_t product = W_(0, 0);
@@ -229,12 +230,12 @@ template <class T>
vnl_matrix<T> vnl_svd<T>::recompose(unsigned int rnk) const
{
if (rnk > rank_) rnk=rank_;
- vnl_matrix<T> W(W_.rows(),W_.columns());
- W.fill(T(0));
+ vnl_matrix<T> Wmatr(W_.rows(),W_.columns());
+ Wmatr.fill(T(0));
for (unsigned int i=0;i<rnk;++i)
- W(i,i)=W_(i,i);
+ Wmatr(i,i)=W_(i,i);
- return U_*W*V_.conjugate_transpose();
+ return U_*Wmatr*V_.conjugate_transpose();
}
@@ -243,12 +244,12 @@ template <class T>
vnl_matrix<T> vnl_svd<T>::pinverse(unsigned int rnk) const
{
if (rnk > rank_) rnk=rank_;
- vnl_matrix<T> Winverse(Winverse_.rows(),Winverse_.columns());
- Winverse.fill(T(0));
+ vnl_matrix<T> W_inverse(Winverse_.rows(),Winverse_.columns());
+ W_inverse.fill(T(0));
for (unsigned int i=0;i<rnk;++i)
- Winverse(i,i)=Winverse_(i,i);
+ W_inverse(i,i)=Winverse_(i,i);
- return V_ * Winverse * U_.conjugate_transpose();
+ return V_ * W_inverse * U_.conjugate_transpose();
}
@@ -257,12 +258,12 @@ template <class T>
vnl_matrix<T> vnl_svd<T>::tinverse(unsigned int rnk) const
{
if (rnk > rank_) rnk=rank_;
- vnl_matrix<T> Winverse(Winverse_.rows(),Winverse_.columns());
- Winverse.fill(T(0));
+ vnl_matrix<T> W_inverse(Winverse_.rows(),Winverse_.columns());
+ W_inverse.fill(T(0));
for (unsigned int i=0;i<rnk;++i)
- Winverse(i,i)=Winverse_(i,i);
+ W_inverse(i,i)=Winverse_(i,i);
- return U_ * Winverse * V_.conjugate_transpose();
+ return U_ * W_inverse * V_.conjugate_transpose();
}
@@ -275,11 +276,12 @@ vnl_matrix<T> vnl_svd<T>::solve(vnl_matrix<T> const& B) const
vnl_matrix<T> yy(U_.rows(), B.columns(), T(0)); // zeros, so that it matches
yy.update(B); // cols of u.transpose. ???
x = U_.conjugate_transpose() * yy;
- } else
+ }
+ else
x = U_.conjugate_transpose() * B;
for (unsigned long i = 0; i < x.rows(); ++i) { // multiply with diagonal 1/W
T weight = W_(i, i);
- if (weight != T(0)) //vnl_numeric_traits<T>::zero)
+ if (weight != T(0)) // vnl_numeric_traits<T>::zero
weight = T(1) / weight;
for (unsigned long j = 0; j < x.columns(); ++j)
x(i, j) *= weight;
@@ -345,7 +347,8 @@ void vnl_svd<T>::solve_preinverted(vnl_vector<T> const& y, vnl_vector<T>* x_out)
vnl_vector<T> yy(U_.rows(), T(0)); // zeros, so that it match
yy.update(y); // cols of u.transpose. ??
x = U_.conjugate_transpose() * yy;
- } else
+ }
+ else
x = U_.conjugate_transpose() * y;
for (unsigned i = 0; i < x.size(); i++) // multiply with diagonal W, assumed inverted
x[i] *= W_(i, i);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd_economy.txx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd_economy.txx
index 21714e0053e4fc3098686e3e273d1ec0246f6f0f..e462d3e5065c766c123aeee28cec445af26863d3 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd_economy.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd_economy.txx
@@ -13,7 +13,7 @@
#include <vnl/vnl_matlab_print.h>
#define macro(p, T) \
-inline void vnl_linpack_svdc(vnl_netlib_svd_proto(T)) \
+inline void vnl_linpack_svdc_economy(vnl_netlib_svd_proto(T)) \
{ v3p_netlib_##p##svdc_(vnl_netlib_svd_params); }
macro(s, float);
macro(d, double);
@@ -41,13 +41,13 @@ vnl_svd_economy<real_t>::vnl_svd_economy( vnl_matrix<real_t> const& M ) :
long ldu = 0;
long info = 0;
const long job = 01; // no U, n svs in V (i.e. super-economy size)
- vnl_linpack_svdc((real_t*)X, &m_, &m_, &n_,
- wspace.data_block(),
- espace.data_block(),
- 0, &ldu,
- vspace.data_block(), &n_,
- work.data_block(),
- &job, &info);
+ vnl_linpack_svdc_economy((real_t*)X, &m_, &m_, &n_,
+ wspace.data_block(),
+ espace.data_block(),
+ 0, &ldu,
+ vspace.data_block(), &n_,
+ work.data_block(),
+ &job, &info);
// Error return?
if (info != 0)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd_fixed.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd_fixed.h
new file mode 100644
index 0000000000000000000000000000000000000000..5e36505e9ec36a3f3cfbacbc8d779568d8440b90
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd_fixed.h
@@ -0,0 +1,179 @@
+// This is core/vnl/algo/vnl_svd_fixed.h
+#ifndef vnl_svd_fixed_h_
+#define vnl_svd_fixed_h_
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma interface
+#endif
+//:
+// \file
+// \brief Holds the singular value decomposition of a vnl_matrix_fixed.
+// \author Andrew W. Fitzgibbon, Ian Scott
+// \date 12 Oct 2009
+//
+
+#include <vnl/vnl_numeric_traits.h>
+#include <vnl/vnl_vector_fixed.h>
+#include <vnl/vnl_matrix_fixed.h>
+#include <vnl/vnl_diag_matrix_fixed.h>
+#include <vcl_iosfwd.h>
+
+//: Holds the singular value decomposition of a vnl_matrix_fixed.
+//
+// The class holds three matrices U, W, V such that the original matrix
+// $M = U W V^\top$. The DiagMatrix W stores the singular values in decreasing
+// order. The columns of U which correspond to the nonzero singular values
+// form a basis for range of M, while the columns of V corresponding to the
+// zero singular values are the nullspace.
+//
+// The SVD is computed at construction time, and inquiries may then be made
+// of the SVD. In particular, this allows easy access to multiple
+// right-hand-side solves without the bother of putting all the RHS's into a
+// Matrix.
+//
+
+export template <class T, unsigned int R, unsigned int C>
+class vnl_svd_fixed
+{
+ public:
+ //: The singular values of a matrix of complex<T> are of type T, not complex<T>
+ typedef typename vnl_numeric_traits<T>::abs_t singval_t;
+
+ //:
+ // Construct a vnl_svd_fixed<T> object from $m \times n$ matrix $M$. The
+ // vnl_svd_fixed<T> object contains matrices $U$, $W$, $V$ such that
+ // $U W V^\top = M$.
+ //
+ // Uses linpack routine DSVDC to calculate an ``economy-size'' SVD
+ // where the returned $U$ is the same size as $M$, while $W$
+ // and $V$ are both $n \times n$. This is efficient for
+ // large rectangular solves where $m > n$, typical in least squares.
+ //
+ // The optional argument zero_out_tol is used to mark the zero singular
+ // values: If nonnegative, any s.v. smaller than zero_out_tol in
+ // absolute value is set to zero. If zero_out_tol is negative, the
+ // zeroing is relative to |zero_out_tol| * sigma_max();
+
+ vnl_svd_fixed(vnl_matrix_fixed<T,R,C> const &M, double zero_out_tol = 0.0);
+ ~vnl_svd_fixed() {}
+
+ // Data Access---------------------------------------------------------------
+
+ //: find weights below threshold tol, zero them out, and update W_ and Winverse_
+ void zero_out_absolute(double tol = 1e-8); //sqrt(machine epsilon)
+
+ //: find weights below tol*max(w) and zero them out
+ void zero_out_relative(double tol = 1e-8); //sqrt(machine epsilon)
+ int singularities () const { return W_.rows() - rank(); }
+ unsigned int rank () const { return rank_; }
+ singval_t well_condition () const { return sigma_min()/sigma_max(); }
+
+ //: Calculate determinant as product of diagonals in W.
+ singval_t determinant_magnitude () const;
+ singval_t norm() const;
+
+ //: Return the matrix U.
+ vnl_matrix_fixed<T,R,C> & U() { return U_; }
+
+ //: Return the matrix U.
+ vnl_matrix_fixed<T,R,C> const& U() const { return U_; }
+
+ //: Return the matrix U's (i,j)th entry (to avoid svd.U()(i,j); ).
+ T U(int i, int j) const { return U_(i,j); }
+
+ //: Get at DiagMatrix (q.v.) of singular values, sorted from largest to smallest
+ vnl_diag_matrix_fixed<singval_t, C> & W() { return W_; }
+
+ //: Get at DiagMatrix (q.v.) of singular values, sorted from largest to smallest
+ vnl_diag_matrix_fixed<singval_t, C> const & W() const { return W_; }
+ vnl_diag_matrix_fixed<singval_t, C> & Winverse() { return Winverse_; }
+ vnl_diag_matrix_fixed<singval_t, C> const & Winverse() const { return Winverse_; }
+ singval_t & W(int i, int j) { return W_(i,j); }
+ singval_t & W(int i) { return W_(i,i); }
+ singval_t sigma_max() const { return W_(0,0); } // largest
+ singval_t sigma_min() const { return W_(C-1,C-1); } // smallest
+
+ //: Return the matrix V.
+ vnl_matrix_fixed<T,C,C> & V() { return V_; }
+
+ //: Return the matrix V.
+ vnl_matrix_fixed<T,C,C> const& V() const { return V_; }
+
+ //: Return the matrix V's (i,j)th entry (to avoid svd.V()(i,j); ).
+ T V(int i, int j) const { return V_(i,j); }
+
+ //:
+ inline vnl_matrix_fixed<T,C,R> inverse () const { return pinverse(); }
+
+ //: pseudo-inverse (for non-square matrix) of desired rank.
+ vnl_matrix_fixed<T,C,R> pinverse (unsigned int rank = ~0u) const; // ~0u == (unsigned int)-1
+
+ //: Calculate inverse of transpose, using desired rank.
+ vnl_matrix_fixed<T,R,C> tinverse (unsigned int rank = ~0u) const; // ~0u == (unsigned int)-1
+
+ //: Recompose SVD to U*W*V', using desired rank.
+ vnl_matrix_fixed<T,R,C> recompose (unsigned int rank = ~0u) const; // ~0u == (unsigned int)-1
+
+ //: Solve the matrix equation M X = B, returning X
+ vnl_matrix<T> solve (vnl_matrix<T> const& B) const;
+
+ //: Solve the matrix-vector system M x = y, returning x.
+ vnl_vector_fixed<T, C> solve (vnl_vector_fixed<T, R> const& y) const;
+ void solve (T const *rhs, T *lhs) const; // min ||A*lhs - rhs||
+
+ //: Solve the matrix-vector system M x = y.
+ // Assuming that the singular values W have been preinverted by the caller.
+ void solve_preinverted(vnl_vector_fixed<T,R> const& rhs, vnl_vector_fixed<T,C>* out) const;
+
+ //: Return N such that M * N = 0
+ vnl_matrix<T> nullspace() const;
+
+ //: Return N such that M' * N = 0
+ vnl_matrix<T> left_nullspace() const;
+
+ //: Return N such that M * N = 0
+ vnl_matrix<T> nullspace(int required_nullspace_dimension) const;
+
+ //: Implementation to be done yet; currently returns left_nullspace(). - PVR.
+ vnl_matrix<T> left_nullspace(int required_nullspace_dimension) const;
+
+ //: Return the rightmost column of V.
+ // Does not check to see whether or not the matrix actually was rank-deficient -
+ // the caller is assumed to have examined W and decided that to his or her satisfaction.
+ vnl_vector_fixed<T,C> nullvector() const;
+
+ //: Return the rightmost column of U.
+ // Does not check to see whether or not the matrix actually was rank-deficient.
+ vnl_vector_fixed<T,R> left_nullvector() const;
+
+ bool valid() const { return valid_; }
+
+ private:
+
+ vnl_matrix_fixed<T, R, C> U_; // Columns Ui are basis for range of M for Wi != 0
+ vnl_diag_matrix_fixed<singval_t, C> W_;// Singular values, sorted in decreasing order
+ vnl_diag_matrix_fixed<singval_t, C> Winverse_;
+ vnl_matrix_fixed<T, C, C> V_; // Columns Vi are basis for nullspace of M for Wi = 0
+ unsigned rank_;
+ bool have_max_;
+ singval_t max_;
+ bool have_min_;
+ singval_t min_;
+ double last_tol_;
+ bool valid_; // false if the NETLIB call failed.
+
+ // Disallow assignment.
+ vnl_svd_fixed<T,R,C>(vnl_svd_fixed<T,R,C> const &) { }
+ vnl_svd_fixed<T,R,C>& operator=(vnl_svd_fixed<T,R,C> const &) { return *this; }
+};
+
+template <class T, unsigned int R, unsigned int C>
+inline
+vnl_matrix_fixed<T,C,R> vnl_svd_fixed_inverse(vnl_matrix_fixed<T,R,C> const& m)
+{
+ return vnl_svd_fixed<T,R,C>(m).inverse();
+}
+
+export template <class T, unsigned int R, unsigned int C>
+vcl_ostream& operator<<(vcl_ostream&, vnl_svd_fixed<T,R,C> const& svd);
+
+#endif // vnl_svd_fixed_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd_fixed.txx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd_fixed.txx
new file mode 100644
index 0000000000000000000000000000000000000000..4a34bf5ab8750bc8c77f6ee7503556455782dddf
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_svd_fixed.txx
@@ -0,0 +1,389 @@
+// This is core/vnl/algo/vnl_svd_fixed.txx
+#ifndef vnl_svd_fixed_txx_
+#define vnl_svd_fixed_txx_
+//:
+// \file
+
+#include "vnl_svd_fixed.h"
+
+#include <vcl_cassert.h>
+#include <vcl_cstdlib.h>
+#include <vcl_complex.h>
+#include <vcl_iostream.h>
+#include <vcl_algorithm.h> // min()
+
+#include <vnl/vnl_math.h>
+#include <vnl/vnl_fortran_copy_fixed.h>
+#include <vnl/algo/vnl_netlib.h> // dsvdc_()
+
+// use C++ overloading to call the right linpack routine from the template code :
+#define macro(p, T) \
+inline void vnl_linpack_svdc_fixed(vnl_netlib_svd_proto(T)) \
+{ v3p_netlib_##p##svdc_(vnl_netlib_svd_params); }
+macro(s, float);
+macro(d, double);
+macro(c, vcl_complex<float>);
+macro(z, vcl_complex<double>);
+#undef macro
+
+//--------------------------------------------------------------------------------
+
+static bool vnl_svd_fixed_test_heavily = false;
+#include <vnl/vnl_matlab_print.h>
+
+template <class T, unsigned int R, unsigned int C>
+vnl_svd_fixed<T,R,C>::vnl_svd_fixed(vnl_matrix_fixed<T,R,C> const& M, double zero_out_tol)
+{
+ {
+ const long n=R, p=C;
+ const unsigned mm = vcl_min(R+1u,C);
+
+ // Copy source matrix into fortran storage
+ // SVD is slow, don't worry about the cost of this transpose.
+ vnl_fortran_copy_fixed<T,R,C> X(M);
+
+ // Make workspace vectors.
+ vnl_vector_fixed<T, C> work(T(0));
+ vnl_vector_fixed<T, R*C> uspace(T(0));
+ vnl_vector_fixed<T, C*C> vspace(T(0));
+ vnl_vector_fixed<T, (R+1<C?R+1:C)> wspace(T(0)); // complex fortran routine actually _wants_ complex W!
+ vnl_vector_fixed<T, C> espace(T(0));
+
+ // Call Linpack SVD
+ long info = 0;
+ const long job = 21; // min(n,p) svs in U, n svs in V (i.e. economy size)
+ vnl_linpack_svdc_fixed((T*)X, &n, &n, &p,
+ wspace.data_block(),
+ espace.data_block(),
+ uspace.data_block(), &n,
+ vspace.data_block(), &p,
+ work.data_block(),
+ &job, &info);
+
+ // Error return?
+ if (info != 0)
+ {
+ // If info is non-zero, it contains the number of singular values
+ // for this the SVD algorithm failed to converge. The condition is
+ // not bogus. Even if the returned singular values are sensible,
+ // the singular vectors can be utterly wrong.
+
+ // It is possible the failure was due to NaNs or infinities in the
+ // matrix. Check for that now.
+ M.assert_finite();
+
+ // If we get here it might be because
+ // 1. The scalar type has such
+ // extreme precision that too few iterations were performed to
+ // converge to within machine precision (that is the svdc criterion).
+ // One solution to that is to increase the maximum number of
+ // iterations in the netlib code.
+ //
+ // 2. The LINPACK dsvdc_ code expects correct IEEE rounding behaviour,
+ // which some platforms (notably x86 processors)
+ // have trouble doing. For example, gcc can output
+ // code in -O2 and static-linked code that causes this problem.
+ // One solution to this is to persuade gcc to output slightly different code
+ // by adding and -fPIC option to the command line for v3p/netlib/dsvdc.c. If
+ // that doesn't work try adding -ffloat-store, which should fix the problem
+ // at the expense of being significantly slower for big problems. Note that
+ // if this is the cause, core/vnl/tests/test_svd should have failed.
+ //
+ // You may be able to diagnose the problem here by printing a warning message.
+ vcl_cerr << __FILE__ ": suspicious return value (" << info << ") from SVDC\n"
+ << __FILE__ ": M is " << M.rows() << 'x' << M.cols() << vcl_endl;
+
+ vnl_matlab_print(vcl_cerr, M, "M", vnl_matlab_print_format_long);
+ valid_ = false;
+ }
+ else
+ valid_ = true;
+
+ // Copy fortran outputs into our storage
+ {
+ const T *d = uspace.data_block();
+ for (long j = 0; j < p; ++j)
+ for (long i = 0; i < n; ++i)
+ U_(i,j) = *d++;
+ }
+
+ for (unsigned j = 0; j < mm; ++j)
+ W_(j, j) = vcl_abs(wspace(j)); // we get rid of complexness here.
+
+ for (unsigned j = mm; j < C; ++j)
+ W_(j, j) = 0;
+
+ {
+ const T *d = vspace.data_block();
+ for (unsigned j = 0; j < C; ++j)
+ for (unsigned i = 0; i < C; ++i)
+ V_(i,j) = *d++;
+ }
+ }
+
+ if (vnl_svd_fixed_test_heavily)
+ {
+ // Test that recomposed matrix == M
+ typedef typename vnl_numeric_traits<T>::abs_t abs_t;
+ abs_t recomposition_residual = vcl_abs((recompose() - M).fro_norm());
+ abs_t n = vcl_abs(M.fro_norm());
+ abs_t thresh = abs_t(R) * abs_t(vnl_math::eps) * n;
+ if (recomposition_residual > thresh)
+ {
+ vcl_cerr << "vnl_svd_fixed<T>::vnl_svd_fixed<T>() -- Warning, recomposition_residual = "
+ << recomposition_residual << vcl_endl
+ << "fro_norm(M) = " << n << vcl_endl
+ << "eps*fro_norm(M) = " << thresh << vcl_endl
+ << "Press return to continue\n";
+ char x;
+ vcl_cin.get(&x, 1, '\n');
+ }
+ }
+
+ if (zero_out_tol >= 0)
+ // Zero out small sv's and update rank count.
+ zero_out_absolute(double(+zero_out_tol));
+ else
+ // negative tolerance implies relative to max elt.
+ zero_out_relative(double(-zero_out_tol));
+}
+
+template <class T, unsigned int R, unsigned int C>
+vcl_ostream& operator<<(vcl_ostream& s, const vnl_svd_fixed<T,R,C>& svd)
+{
+ s << "vnl_svd_fixed<T,R,C>:\n"
+#if 0
+ << "M = [\n" << M << "]\n"
+#endif // 0
+ << "U = [\n" << svd.U() << "]\n"
+ << "W = " << svd.W() << '\n'
+ << "V = [\n" << svd.V() << "]\n"
+ << "rank = " << svd.rank() << vcl_endl;
+ return s;
+}
+
+//-----------------------------------------------------------------------------
+// Chunky bits.
+
+//: find weights below threshold tol, zero them out, and update W_ and Winverse_
+template <class T, unsigned int R, unsigned int C>
+void vnl_svd_fixed<T,R,C>::zero_out_absolute(double tol)
+{
+ last_tol_ = tol;
+ rank_ = C;
+ for (unsigned k = 0; k < C; k++)
+ {
+ singval_t& weight = W_(k, k);
+ if (vcl_abs(weight) <= tol)
+ {
+ Winverse_(k,k) = 0;
+ weight = 0;
+ --rank_;
+ }
+ else
+ {
+ Winverse_(k,k) = singval_t(1.0)/weight;
+ }
+ }
+}
+
+//: find weights below tol*max(w) and zero them out
+template <class T, unsigned int R, unsigned int C>
+void vnl_svd_fixed<T,R,C>::zero_out_relative(double tol) // sqrt(machine epsilon)
+{
+ zero_out_absolute(tol * vcl_abs(sigma_max()));
+}
+
+static bool wf=false;
+inline bool warned_f() { if (wf) return true; else { wf=true; return false; } }
+
+//: Calculate determinant as product of diagonals in W.
+template <class T, unsigned int R, unsigned int C>
+typename vnl_svd_fixed<T,R,C>::singval_t vnl_svd_fixed<T,R,C>::determinant_magnitude() const
+{
+ if (!warned_f() && R != C)
+ vcl_cerr << __FILE__ ": called determinant_magnitude() on SVD of non-square matrix\n"
+ << "(This warning is displayed only once)\n";
+ singval_t product = W_(0, 0);
+ for (unsigned long k = 1; k < C; k++)
+ product *= W_(k, k);
+
+ return product;
+}
+
+template <class T, unsigned int R, unsigned int C>
+typename vnl_svd_fixed<T,R,C>::singval_t vnl_svd_fixed<T,R,C>::norm() const
+{
+ return vcl_abs(sigma_max());
+}
+
+//: Recompose SVD to U*W*V'
+template <class T, unsigned int R, unsigned int C>
+vnl_matrix_fixed<T,R,C> vnl_svd_fixed<T,R,C>::recompose(unsigned int rnk) const
+{
+ if (rnk > rank_) rnk=rank_;
+ vnl_diag_matrix_fixed<T,C> Wmatr(W_);
+ for (unsigned int i=rnk;i<C;++i)
+ Wmatr(i,i)=0;
+
+ return U_*Wmatr*V_.conjugate_transpose();
+}
+
+
+//: Calculate pseudo-inverse.
+template <class T, unsigned int R, unsigned int C>
+vnl_matrix_fixed<T,C,R> vnl_svd_fixed<T,R,C>::pinverse(unsigned int rnk) const
+{
+ if (rnk > rank_) rnk=rank_;
+ vnl_diag_matrix_fixed<T,C> W_inverse(Winverse_);
+ for (unsigned int i=rnk;i<C;++i)
+ W_inverse(i,i)=0;
+
+ return V_ * W_inverse * U_.conjugate_transpose();
+}
+
+
+//: Calculate (pseudo-)inverse of transpose.
+template <class T, unsigned int R, unsigned int C>
+vnl_matrix_fixed<T,R,C> vnl_svd_fixed<T,R,C>::tinverse(unsigned int rnk) const
+{
+ if (rnk > rank_) rnk=rank_;
+ vnl_diag_matrix_fixed<T,C> W_inverse(Winverse_);
+ for (unsigned int i=rnk;i<C;++i)
+ W_inverse(i,i)=0;
+
+ return U_ * W_inverse * V_.conjugate_transpose();
+}
+
+
+//: Solve the matrix equation M X = B, returning X
+template <class T, unsigned int R, unsigned int C>
+vnl_matrix<T> vnl_svd_fixed<T,R,C>::solve(vnl_matrix<T> const& B) const
+{
+ vnl_matrix<T> x; // solution matrix
+ if (U_.rows() < U_.columns()) { // augment y with extra rows of
+ vnl_matrix<T> yy(U_.rows(), B.columns(), T(0)); // zeros, so that it matches
+ yy.update(B); // cols of u.transpose. ???
+ x = U_.conjugate_transpose() * yy;
+ }
+ else
+ x = U_.conjugate_transpose() * B;
+ for (unsigned long i = 0; i < x.rows(); ++i) { // multiply with diagonal 1/W
+ T weight = W_(i, i);
+ if (weight != T(0)) // vnl_numeric_traits<T>::zero
+ weight = T(1) / weight;
+ for (unsigned long j = 0; j < x.columns(); ++j)
+ x(i, j) *= weight;
+ }
+ x = V_ * x; // premultiply with v.
+ return x;
+}
+
+//: Solve the matrix-vector system M x = y, returning x.
+template <class T, unsigned int R, unsigned int C>
+vnl_vector_fixed<T, C> vnl_svd_fixed<T,R,C>::solve(vnl_vector_fixed<T, R> const& y) const
+{
+ vnl_vector_fixed<T, C> x; // Solution matrix.
+ x = U_.conjugate_transpose() * y;
+
+ for (unsigned i = 0; i < C; i++) { // multiply with diagonal 1/W
+ T weight = W_(i, i), zero_(0);
+ if (weight != zero_)
+ x[i] /= weight;
+ else
+ x[i] = zero_;
+ }
+ return V_ * x; // premultiply with v.
+}
+
+template <class T, unsigned int R, unsigned int C> // FIXME. this should implement the above, not the other way round.
+void vnl_svd_fixed<T,R,C>::solve(T const *y, T *x) const
+{
+ solve(vnl_vector_fixed<T, R>(y)).copy_out(x);
+}
+
+//: Solve the matrix-vector system M x = y.
+// Assume that the singular values W have been preinverted by the caller.
+template <class T, unsigned int R, unsigned int C>
+void vnl_svd_fixed<T,R,C>::solve_preinverted(vnl_vector_fixed<T, R> const& y, vnl_vector_fixed<T, C>* x_out) const
+{
+ vnl_vector_fixed<T, C> x; // solution matrix
+ x = U_.conjugate_transpose() * y;
+ for (unsigned i = 0; i < C; i++) // multiply with diagonal W, assumed inverted
+ x[i] *= W_(i, i);
+
+ *x_out = V_ * x; // premultiply with v.
+}
+
+//-----------------------------------------------------------------------------
+//: Return N s.t. M * N = 0
+template <class T, unsigned int R, unsigned int C>
+vnl_matrix<T> vnl_svd_fixed<T,R,C>::nullspace() const
+{
+ int k = rank();
+ if (k == C)
+ vcl_cerr << "vnl_svd_fixed<T>::nullspace() -- Matrix is full rank." << last_tol_ << vcl_endl;
+ return nullspace(C-k);
+}
+
+//-----------------------------------------------------------------------------
+//: Return N s.t. M * N = 0
+template <class T, unsigned int R, unsigned int C>
+vnl_matrix<T> vnl_svd_fixed<T,R,C>::nullspace(int required_nullspace_dimension) const
+{
+ return V_.extract(V_.rows(), required_nullspace_dimension, 0, C - required_nullspace_dimension);
+}
+
+//-----------------------------------------------------------------------------
+//: Return N s.t. M' * N = 0
+template <class T, unsigned int R, unsigned int C>
+vnl_matrix<T> vnl_svd_fixed<T,R,C>::left_nullspace() const
+{
+ int k = rank();
+ if (k == C)
+ vcl_cerr << "vnl_svd_fixed<T>::left_nullspace() -- Matrix is full rank." << last_tol_ << vcl_endl;
+ return U_.extract(U_.rows(), C-k, 0, k);
+}
+
+//: Implementation to be done yet; currently returns left_nullspace(). - PVr. // TODO
+template <class T, unsigned int R, unsigned int C>
+vnl_matrix<T> vnl_svd_fixed<T,R,C>::left_nullspace(int /*required_nullspace_dimension*/) const
+{
+ return left_nullspace();
+}
+
+
+//-----------------------------------------------------------------------------
+//: Return the rightmost column of V.
+// Does not check to see whether or not the matrix actually was rank-deficient -
+// the caller is assumed to have examined W and decided that to his or her satisfaction.
+template <class T, unsigned int R, unsigned int C>
+vnl_vector_fixed <T,C> vnl_svd_fixed<T,R,C>::nullvector() const
+{
+ vnl_vector_fixed<T, C> ret;
+ for (unsigned i = 0; i < C; ++i)
+ ret(i) = V_(i, C-1);
+ return ret;
+}
+
+//-----------------------------------------------------------------------------
+//: Return the rightmost column of U.
+// Does not check to see whether or not the matrix actually was rank-deficient.
+template <class T, unsigned int R, unsigned int C>
+vnl_vector_fixed <T,R> vnl_svd_fixed<T,R,C>::left_nullvector() const
+{
+ vnl_vector_fixed<T,R> ret;
+ const unsigned col = vcl_min(R, C) - 1;
+ for (unsigned i = 0; i < R; ++i)
+ ret(i) = U_(i, col);
+ return ret;
+}
+
+//--------------------------------------------------------------------------------
+
+#undef VNL_SVD_FIXED_INSTANTIATE
+#define VNL_SVD_FIXED_INSTANTIATE(T , R , C ) \
+template class vnl_svd_fixed<T, R, C >; \
+template vcl_ostream& operator<<(vcl_ostream &, vnl_svd_fixed<T, R, C > const &)
+
+#endif // vnl_svd_fixed_txx_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_symmetric_eigensystem.h b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_symmetric_eigensystem.h
index 0fd48fb14b43de4592030f823fd549db0707bf1b..3c5e4599e5f1751ebff36cea53cb7190bd262b7b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_symmetric_eigensystem.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_symmetric_eigensystem.h
@@ -48,6 +48,8 @@
// dac (Manchester) 28/03/2001: tidied up documentation
// Feb.2002 - Peter Vanroose - brief doxygen comment placed on single line
// Jan.2003 - Peter Vanroose - added missing implementation for solve(b,x)
+// Mar.2010 - Peter Vanroose - also made vnl_symmetric_eigensystem_compute()
+// & vnl_symmetric_eigensystem_compute_eigenvals() templated
// \endverbatim
#include <vnl/vnl_matrix.h>
@@ -60,22 +62,18 @@
// M12 M22 M23
// M13 M23 M33
// \endverbatim
+template <class T>
void vnl_symmetric_eigensystem_compute_eigenvals(
- double M11, double M12, double M13,
- double M22, double M23,
- double M33,
- double &l1, double &l2, double &l3);
+ T M11, T M12, T M13,
+ T M22, T M23,
+ T M33,
+ T &l1, T &l2, T &l3);
//: Find eigenvalues of a symmetric matrix
-bool vnl_symmetric_eigensystem_compute(vnl_matrix<float> const & A,
- vnl_matrix<float> & V,
- vnl_vector<float> & D);
-
-//: Find eigenvalues of a symmetric matrix
-
-bool vnl_symmetric_eigensystem_compute(vnl_matrix<double> const & A,
- vnl_matrix<double> & V,
- vnl_vector<double> & D);
+template <class T>
+bool vnl_symmetric_eigensystem_compute(vnl_matrix<T> const & A,
+ vnl_matrix<T> & V,
+ vnl_vector<T> & D);
//: Computes and stores the eigensystem decomposition of a symmetric matrix.
@@ -141,4 +139,7 @@ class vnl_symmetric_eigensystem
void solve(vnl_vector<T> const & b, vnl_vector<T> * x) { *x = solve(b); }
};
+#define VNL_SYMMETRIC_EIGENSYSTEM_INSTANTIATE(T) \
+extern "please include vnl/algo/vnl_symmetric_eigensystem.txx first"
+
#endif // vnl_symmetric_eigensystem_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_symmetric_eigensystem.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_symmetric_eigensystem.txx
similarity index 68%
rename from Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_symmetric_eigensystem.cxx
rename to Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_symmetric_eigensystem.txx
index 2c09ac730e4d1ce03d650ae6e838873165416825..bff0d3ee6fdba570af2b79032881c22b7049ab01 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_symmetric_eigensystem.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/algo/vnl_symmetric_eigensystem.txx
@@ -1,11 +1,14 @@
-// This is core/vnl/algo/vnl_symmetric_eigensystem.cxx
-#ifdef VCL_NEEDS_PRAGMA_INTERFACE
-#pragma implementation
-#endif
+// This is core/vnl/algo/vnl_symmetric_eigensystem.txx
+#ifndef vnl_symmetric_eigensystem_txx_
+#define vnl_symmetric_eigensystem_txx_
//:
// \file
// \author Andrew W. Fitzgibbon, Oxford RRG
-// Created: 29 Aug 96
+// \date Created: 29 Aug 96
+// \verbatim
+// Modifications
+// 24 Mar 2010 Peter Vanroose renamed from .cxx to .txx and moved out template instantiations
+// \endverbatim
//
//-----------------------------------------------------------------------------
@@ -24,64 +27,62 @@
// M12 M22 M23
// M13 M23 M33
// \endverbatim
+template <class T>
void vnl_symmetric_eigensystem_compute_eigenvals(
- double M11, double M12, double M13,
- double M22, double M23,
- double M33,
- double &l1, double &l2, double &l3)
+ T M11, T M12, T M13,
+ T M22, T M23,
+ T M33,
+ T &l1, T &l2, T &l3)
{
// Characteristic eqtn |M - xI| = 0
// x^3 + b x^2 + c x + d = 0
- const double b = -M11-M22-M33;
- const double c = M11*M22 +M11*M33 +M22*M33 -M12*M12 -M13*M13 -M23*M23;
- const double d = M11*M23*M23 +M12*M12*M33 +M13*M13*M22 -2.0*M12*M13*M23 -M11*M22*M33;
-
+ const T b = -M11-M22-M33;
+ const T c = M11*M22 +M11*M33 +M22*M33 -M12*M12 -M13*M13 -M23*M23;
+ const T d = M11*M23*M23 +M12*M12*M33 +M13*M13*M22 -2*M12*M13*M23 -M11*M22*M33;
// Using a numerically tweaked version of the real cubic solver http://www.1728.com/cubic2.htm
- const double b_3 = b/3.0;
- const double f = b_3*b_3 - c/3.0 ;
- const double g = b*c/6.0 - b_3*b_3*b_3 - 0.5*d;
-
+ const T b_3 = b/3;
+ const T f = b_3*b_3 - c/3 ;
+ const T g = b*c/6 - b_3*b_3*b_3 - d/2;
- if (f == 0.0 && g == 0.0)
+ if (f == 0 && g == 0)
{
l1 = l2 = l3 = - b_3 ;
return;
}
-
- const double f3 = f*f*f;
- const double g2 = g*g;
- const double sqrt_f = -vcl_sqrt(f);
+ const T f3 = f*f*f;
+ const T g2 = g*g;
+ const T sqrt_f = -vcl_sqrt(f);
// deal explicitly with repeated root and treat
// complex conjugate roots as numerically inaccurate repeated roots.
- // first check we are not too numerically innacurate
+ // first check we are not too numerically inaccurate
assert((g2 - f3) / vnl_math_sqr(vnl_math_cube(b)) < 1e-8);
if (g2 >= f3)
{
- if (g < 0.0)
- {
- l1 = 2.0 * sqrt_f - b_3;
- l2 = l3 = - sqrt_f - b_3;
- }
+ if (g < 0)
+ {
+ l1 = 2 * sqrt_f - b_3;
+ l2 = l3 = - sqrt_f - b_3;
+ }
else
- {
- l1 = l2 = sqrt_f - b_3;
- l3 = -2.0 * sqrt_f - b_3;
- }
+ {
+ l1 = l2 = sqrt_f - b_3;
+ l3 = -2 * sqrt_f - b_3;
+ }
return;
}
- const double sqrt_f3 = sqrt_f * sqrt_f * sqrt_f;
- const double k = vcl_acos(g / sqrt_f3) / 3.0;
- const double j = 2.0 * sqrt_f;
+ const T sqrt_f3 = sqrt_f * sqrt_f * sqrt_f;
+ const T k = vcl_acos(g / sqrt_f3) / 3;
+ const T j = 2 * sqrt_f;
l1 = j * vcl_cos(k) - b_3;
- l2 = j * vcl_cos(k + vnl_math::pi * 2.0 / 3.0) - b_3;
- l3 = j * vcl_cos(k - vnl_math::pi * 2.0 / 3.0) - b_3;
+ l2 = j * vcl_cos(k + T(vnl_math::pi * 2.0 / 3.0)) - b_3;
+ l3 = j * vcl_cos(k - T(vnl_math::pi * 2.0 / 3.0)) - b_3;
if (l2 < l1) vcl_swap(l2, l1);
if (l3 < l2)
@@ -89,28 +90,12 @@ void vnl_symmetric_eigensystem_compute_eigenvals(
vcl_swap(l2, l3);
if (l2 < l1) vcl_swap(l2, l1);
}
-
-
-
-}
-
-bool vnl_symmetric_eigensystem_compute(vnl_matrix<float> const & A,
- vnl_matrix<float> & V,
- vnl_vector<float> & D)
-{
- vnl_matrix<double> Ad(A.rows(), A.cols());
- vnl_matrix<double> Vd(V.rows(), V.cols());
- vnl_vector<double> Dd(D.size());
- vnl_copy(A, Ad);
- bool f = vnl_symmetric_eigensystem_compute(Ad, Vd, Dd);
- vnl_copy(Vd, V);
- vnl_copy(Dd, D);
- return f;
}
-bool vnl_symmetric_eigensystem_compute(vnl_matrix<double> const & A,
- vnl_matrix<double> & V,
- vnl_vector<double> & D)
+template <class T>
+bool vnl_symmetric_eigensystem_compute(vnl_matrix<T> const & A,
+ vnl_matrix<T> & V,
+ vnl_vector<T> & D)
{
A.assert_finite();
const long n = A.rows();
@@ -119,6 +104,9 @@ bool vnl_symmetric_eigensystem_compute(vnl_matrix<double> const & A,
if (D.size() != A.rows())
D.set_size(n);
+ // convert to double
+ vnl_matrix<double> Ad(A.rows(), A.cols()); vnl_copy(A, Ad);
+ vnl_vector<double> Dd(D.size());
vnl_vector<double> work1(n);
vnl_vector<double> work2(n);
vnl_vector<double> Vvec(n*n);
@@ -126,9 +114,9 @@ bool vnl_symmetric_eigensystem_compute(vnl_matrix<double> const & A,
long want_eigenvectors = 1;
long ierr = 0;
- // No need to transpose A, cos it's symmetric...
- vnl_matrix<double> B = A; // since A is read-only and rs_ might change its third argument...
- v3p_netlib_rs_(&n, &n, B.data_block(), &D[0], &want_eigenvectors, &Vvec[0], &work1[0], &work2[0], &ierr);
+ // No need to transpose A, 'cos it's symmetric...
+ v3p_netlib_rs_(&n, &n, Ad.data_block(), &Dd[0], &want_eigenvectors, &Vvec[0], &work1[0], &work2[0], &ierr);
+ vnl_copy(Dd, D);
if (ierr) {
vcl_cerr << "vnl_symmetric_eigensystem: ierr = " << ierr << vcl_endl;
@@ -141,7 +129,7 @@ bool vnl_symmetric_eigensystem_compute(vnl_matrix<double> const & A,
double *vptr = &Vvec[0];
for (int c = 0; c < n; ++c)
for (int r = 0; r < n; ++r)
- V(r,c) = *vptr++;
+ V(r,c) = T(*vptr++);
return true;
}
@@ -245,5 +233,10 @@ vnl_matrix<T> vnl_symmetric_eigensystem<T>::inverse_square_root() const
//--------------------------------------------------------------------------------
-template class vnl_symmetric_eigensystem<float>;
-template class vnl_symmetric_eigensystem<double>;
+#undef VNL_SYMMETRIC_EIGENSYSTEM_INSTANTIATE
+#define VNL_SYMMETRIC_EIGENSYSTEM_INSTANTIATE(T) \
+template class vnl_symmetric_eigensystem<T >; \
+template void vnl_symmetric_eigensystem_compute_eigenvals(T,T,T,T,T,T,T&,T&,T&); \
+template bool vnl_symmetric_eigensystem_compute(vnl_matrix<T > const&, vnl_matrix<T > &, vnl_vector<T >&)
+
+#endif // vnl_symmetric_eigensystem_txx_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/dll.h b/Utilities/ITK/Utilities/vxl/core/vnl/dll.h
index 7de504d89172b9f96ffedbe4930b69f75ad2edb4..92a7ed10dd63c41f0d88ea2d0c19d0e33271fcbf 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/dll.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/dll.h
@@ -8,7 +8,7 @@
#if defined(VCL_WIN32) && !defined(BUILDING_VNL_DLL)
-// if win32 and not buiding the DLL then you need a dllimport
+// if win32 and not building the DLL then you need a dllimport
// Only if you are building a DLL linked application.
# ifdef BUILD_DLL
# undef VNL_DLL_DATA
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/examples/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/core/vnl/examples/CMakeLists.txt
index fd1ac369be83987d0649810881392fd791a59796..958de449fc88c35412878e96473c5f51a277d739 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/examples/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/examples/CMakeLists.txt
@@ -13,3 +13,6 @@ ADD_EXECUTABLE(vnl_rosenbrock vnl_rosenbrock.cxx)
ADD_EXECUTABLE(vnl_svd vnl_svd.cxx)
#ADD_EXECUTABLE(vnl_svd_economy vnl_svd_economy.cxx)
ADD_EXECUTABLE(vnl_lsqr_test vnl_lsqr_test.cxx)
+ADD_EXECUTABLE(vnl_sample_beta vnl_sample_beta.cxx)
+ADD_EXECUTABLE(vnl_sparse_matrix_example vnl_sparse_matrix_example.cxx)
+ADD_EXECUTABLE(vnl_complex_squareroot vnl_complex_squareroot.cxx)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_complex_squareroot.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_complex_squareroot.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..ea6d5f0246fa658c60399985d654c4fbfae00e63
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_complex_squareroot.cxx
@@ -0,0 +1,30 @@
+// This little program computes the two complex square roots of 3+4i,
+// by solving the complex quadratic equation x^2 - c = 0, with c=3+4i.
+// It then also computes the four complex 4th roots of 24i-7 by solving
+// x^4 - c4 = 0.
+
+#include <vnl/algo/vnl_cpoly_roots.h>
+#include <vcl_iostream.h>
+
+int main()
+{
+ vcl_complex<double> c(3.0,4.0);
+ vnl_vector<vcl_complex<double> > equation(2);
+ // although the equation has three coefficients (1 for x^2, 0 for x and -c
+ // as the constant coefficient), the highest order coefficient must always
+ // be 1, and should not be placed in the equation vector.
+ // next, equation[0] is the second highest coefficient, etc.:
+ equation[0] = 0; equation[1] = -c;
+ vnl_cpoly_roots r(equation);
+ vcl_cout << "One square root of 3+4i is " << r.solns[0]
+ << "\nThe other square root is " << r.solns[1] << vcl_endl;
+
+ vcl_complex<double> c4(-7.0,24.0);
+ vnl_vector<vcl_complex<double> > eq(4);
+ eq[0] = eq[1] = eq[2] = 0; eq[3] = -c4;
+ vnl_cpoly_roots r4(eq);
+ vcl_cout << "\nThe 4th roots of 24i-7 are " << r4.solns[0]
+ << r4.solns[1] << r4.solns[2] << r4.solns[3] << vcl_endl;
+
+ return 0;
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_rosenbrock.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_rosenbrock.cxx
index b3f67199501d2754ef319bc60b6264546ecc89f4..4cc2ee11023a1b93c584bcc0e76754c4a66cf12a 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_rosenbrock.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_rosenbrock.cxx
@@ -64,34 +64,33 @@ int main()
vnl_double_2 x0(-1.9, 2);
// Temp variable.
- vnl_vector<double> x(2);
+ vnl_vector<double> x = x0.as_ref();
// Make a Levenberg Marquardt minimizer, attach f to it, and
// run the minimization
- x = x0;
vnl_levenberg_marquardt levmarq(f);
levmarq.minimize(x);
// Summarize the results, by querying the levmarq object.
- vcl_cout << "** LevenbergMarquardt default **" << vcl_endl
- << "Rosenbrock min of " << levmarq.get_end_error() << " at " << x << vcl_endl
- << "Iterations: " << levmarq.get_num_iterations() << " "
- << "Evaluations: " << levmarq.get_num_evaluations() << vcl_endl;
+ vcl_cout << "** LevenbergMarquardt default **\n"
+ << "Rosenbrock min of " << levmarq.get_end_error() << " at " << x << '\n'
+ << "Iterations: " << levmarq.get_num_iterations()
+ << " Evaluations: " << levmarq.get_num_evaluations() << vcl_endl;
levmarq.diagnose_outcome();
// Now rerun the optimizer with a new, looser, X tolerance.
//
levmarq.set_x_tolerance(0.1);
- x = x0;
+ x = x0.as_ref();
levmarq.minimize(x);
// Summarize the results. It has taken fewer iterations to reach the same
// answer.
- vcl_cout << "** LevenbergMarquardt xtol=0.1 **" << vcl_endl
- << "Rosenbrock min of " << levmarq.get_end_error() << " at " << x << vcl_endl
- << "Iterations: " << levmarq.get_num_iterations() << " "
- << "Evaluations: " << levmarq.get_num_evaluations() << vcl_endl;
+ vcl_cout << "** LevenbergMarquardt xtol=0.1 **\n"
+ << "Rosenbrock min of " << levmarq.get_end_error() << " at " << x << '\n'
+ << "Iterations: " << levmarq.get_num_iterations()
+ << " Evaluations: " << levmarq.get_num_evaluations() << vcl_endl;
levmarq.diagnose_outcome();
{
@@ -99,16 +98,16 @@ int main()
vcl_cout << "** Amoeba (Nelder Meade downhill simplex) **\n";
vnl_least_squares_cost_function cf(&f);
vnl_amoeba amoeba(cf);
- x = x0;
+ x = x0.as_ref();
amoeba.minimize(x);
- vcl_cout << "Rosenbrock min of " << cf.f(x) << " at " << x << vcl_endl
+ vcl_cout << "Rosenbrock min of " << cf.f(x) << " at " << x << '\n'
<< "Evaluations: " << amoeba.get_num_evaluations() << vcl_endl;
}
{
vcl_cout << "** Conjugate Gradient **\n";
vnl_rosenbrock_grad_cost_fun rcf;
vnl_conjugate_gradient cg(rcf);
- x = x0;
+ x = x0.as_ref();
cg.minimize(x);
vcl_cout << "CG min of " << rcf.f(x) << " at " << x << vcl_endl;
cg.diagnose_outcome();
@@ -118,10 +117,10 @@ int main()
vcl_cout << "** LBFGS (Limited memory Broyden Fletcher Goldfarb Shanno) **\n";
vnl_rosenbrock_grad_cost_fun rcf;
vnl_lbfgs lbfgs(rcf);
- x = x0;
+ x = x0.as_ref();
lbfgs.minimize(x);
// assert(lbfgs.get_end_error() == rcf.f(x));
- vcl_cout << "L-BFGS min of " << lbfgs.get_end_error() << " at " << x << vcl_endl
+ vcl_cout << "L-BFGS min of " << lbfgs.get_end_error() << " at " << x << '\n'
<< "Evaluations: " << lbfgs.get_num_evaluations() << vcl_endl;
}
@@ -129,10 +128,10 @@ int main()
vcl_cout << "** Powell (Powell's direction set method) **\n";
vnl_rosenbrock_grad_cost_fun rcf;
vnl_powell powell(&rcf);
- x = x0;
+ x = x0.as_ref();
powell.minimize(x);
// assert(lbfgs.get_end_error() == rcf.f(x));
- vcl_cout << "Powell min of " << powell.get_end_error() << " at " << x << vcl_endl
+ vcl_cout << "Powell min of " << powell.get_end_error() << " at " << x << '\n'
<< "Evaluations: " << powell.get_num_evaluations() << vcl_endl;
}
return 0;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_sample_beta.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_sample_beta.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..74804ec2d601c2c854dd3ab8c3b157fc2c464ce6
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_sample_beta.cxx
@@ -0,0 +1,41 @@
+// This is core/vnl/examples/vnl_sample_beta.cxx
+
+//:
+// \file
+// \brief Generate a sample set from a symmetric beta distribution
+//
+// This program generates n samples drawn from a Beta(a,a) distribution
+// for given a (first command line argument), and where n is the second argument.
+//
+// Algorithm is based on a theorem by Ulrich (1984) stating that, when U and V
+// are independent uniform [0,1] random variables, then the following r.v. is
+// Beta(a,a):
+// $\frac12 + \frac12 \sin(2\pi V) \sqrt{1-U^{\frac2{2a-1}}}$.
+//
+// \author Peter Vanroose, ABIS, Leuven, Belgium
+// \date November 2009
+//-----------------------------------------------------------------------------
+
+#include <vnl/vnl_sample.h>
+#include <vnl/vnl_math.h>
+#include <vcl_cmath.h>
+#include <vcl_cstdlib.h>
+#include <vcl_iostream.h>
+
+int main(int argc, char* argv[])
+{
+ if (argc != 3)
+ {
+ vcl_cout << "This program generates n samples drawn from a Beta(a,a) distribution\n"
+ << "for given a (first command line argument), and where n is the second argument.\n";
+ return -1;
+ }
+ double a = vcl_atof(argv[1]);
+ int n = vcl_atoi(argv[2]);
+ while (n--) {
+ double u = vnl_sample_uniform(0,1);
+ double v = vnl_sample_uniform(0,2*vnl_math::pi);
+ vcl_cout << 0.5+0.5*vcl_sin(v)*vcl_sqrt(1.0-vcl_pow(u,1.0/(a-0.5))) << '\n';
+ }
+ return 0;
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_sparse_matrix_example.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_sparse_matrix_example.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..97aec2e8ac84cb7f1f1717241ea558c72b7930ea
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/examples/vnl_sparse_matrix_example.cxx
@@ -0,0 +1,42 @@
+#include <vnl/vnl_sparse_matrix.h>
+#include <vnl/algo/vnl_sparse_symmetric_eigensystem.h>
+#include <vnl/vnl_random.h>
+
+#include <vcl_iostream.h>
+#include <vcl_cstdlib.h>
+
+int main()
+{
+ const int N = 100;
+ vnl_sparse_matrix<double> a(N, N);
+ vnl_random rg;
+
+ for (int i = 0; i < 10; ++i)
+ {
+ int x = rg.lrand32(N-1);
+ int y = rg.lrand32(N-1);
+ a(x,y) = a(y,x) = 10*rg.normal(); // symmetric matrix
+ }
+
+ a.normalize_rows();
+ a = a * a; // i.e., also a * aT
+
+ vnl_sparse_symmetric_eigensystem s;
+ int b = s.CalculateNPairs(a, 2, true, 3);
+
+ if (b == 0)
+ {
+ vcl_cout<<s.get_eigenvalue(0)<<vcl_endl;
+ vcl_cout<<s.get_eigenvector(0)<<vcl_endl;
+
+ vcl_cout<<s.get_eigenvalue(1)<<vcl_endl;
+ vcl_cout<<s.get_eigenvector(1)<<vcl_endl;
+
+ }
+ else
+ {
+ vcl_cerr<<"b = " << b << vcl_endl;
+ }
+
+ return 0;
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/introduction_doxy.txt b/Utilities/ITK/Utilities/vxl/core/vnl/introduction_doxy.txt
index e81368a613278338b430428e358172b416bf1ded..d559cebb7a551ddc48d8186e5ccd7ff36c175482 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/introduction_doxy.txt
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/introduction_doxy.txt
@@ -3,8 +3,8 @@
* The numerics library, vnl is intended to provide an environment for numerical
* programming which combines the ease of use of packages like Mathematica and
* Matlab with the speed of C and the elegance of C++.
-* It provides a C++ interface to the high-quality Fortran routines made available
-* in the public domain by numerical analysis researchers.
+* Its dependent, vnl_algo, provides a C++ interface to the high-quality Fortran
+* routines made available in the public domain by numerical analysis researchers.
*
* Matrix and vector classes include
* - vnl_vector<T> : Standard vector class
@@ -13,14 +13,79 @@
* - vnl_matrix_fixed<T,N,M> : Fixed size NxM matrix class
* - vnl_vector_ref<T> : Wrap user-supplied memory chunk as a vector
* - vnl_matrix_ref<T> : Wrap user-supplied memory chunk as a matrix
+* - vnl_c_vector<T> : underlying implementor class: math on blocks of memory
+* - vnl_diag_matrix<T> : Diagonal matrix class
+* - vnl_diag_matrix_fixed<T,N> : Fixed size NxN diagonal matrix class
+* - vnl_sym_matrix<T> : Symmetric matrix class
+* - vnl_sparse_matrix<T> : Efficient storage for matrices with many zeroes
+* - vnl_crs_index : like vnl_sparse_matrix<T>, but without the data
+* - vnl_linear_system : interface for large, sparse systems of linear equations
*
-* Functions to generate special matrixes:
-* - vnl_identity
+* Functions to generate special matrixes or vectors:
+* - vnl_identity_3x3
* - vnl_rotation_matrix
* - vnl_cross_product_matrix
+* - vnl_int_matrix
+* - vnl_double_2, vnl_float_3, vnl_int_4, ...: fixed-size, fixed-type vectors
+* - vnl_double_2x3, vnl_float_3x3, vnl_int_4x3, ...: fixed-size, fixed-type matrices
+*
+* Polynomial representations:
+* - vnl_real_polynomial
+* - vnl_real_npolynomial
+*
+* Useful utility functions and constants
+* - Common functions and constants (in vnl_math), like pi, sqrt2, ln10, euler, ...
+* - vnl_random : random number generation, with normal and box distributions.
+* - vnl_gamma, vnl_gamma_p, vnl_gamma_q, vnl_beta : gamma and beta functions
+* - vnl_erf
+* - vnl_bessel
+* - vnl_matrix_exp : compute the exponential of a square matrix
+* - vnl_power : compute the nth power of a small vnl_matrix_fixed
+* - vnl_operators.h contains vector and matrix comparison functions
+* - vnl_copy : easy conversion between vectors/matrices with different datatypes
+*
+* Computational functionality:
+* - vnl_definite_integral : computes the surface area under a given function
+* (see also vnl_simpson_integral in vnl_algo)
+*
+* Simple matrix operations
+* - vnl_transpose : transpose of a matrix for direct use in a multiplication
+* - vnl_rank, vnl_rank_row_reduce and vnl_rank_column_reduce
+* - vnl_trace
+* - vnl_cross
+* - vnl_det and vnl_determinant
+* - vnl_inverse, vnl_inverse_transpose and vnl_matrix_inverse
+* - vnl_orthogonal_complement
+* - vnl_file_matrix and vnl_file_vector : load from a file
+* - class vnl_fastops, with functions like AtA, ABt, Ab, inc_X_by_AtA, ...
+* - vnl_linear_operators_3.h : contains 3D linear algebra operations
+*
+* Alternative number representations
+* - vnl_complex, vnl_complexify, vnl_real, vnl_imag : represent and manipulate complex numbers
+* - vnl_quaternion<T>
+* - vnl_rational : numbers represented as the quotient of two integers
+* - vnl_bignum : arbitrary size integers
+* - vnl_finite<N> : modulo-N arithmetic, e.g. for finite fields
*
-* Matrix decompositions include
-* - vnl_svd and vnl_svd_economy : Singular value decomposition
+* Mapping functionality
+* - vnl_cost_function : R^n --> R. Used by minimizers
+* - vnl_least_squares_function, vnl_least_squares_cost_function : minimizer interface
+* - vnl_identity
+* - vnl_hungarian_algorithm : Find best column to row assignment given a cost matrix
+*
+* Miscellaneous
+* - vnl_sample : sampling from uniform, binomial and normal distributions
+* - vnl_matlab_print : pretty-print matrices and vectors in matlab-style format
+* - vnl_matlab_read : import data from files in the .mat format of Matlab
+* - vnl_matlab_write, vnl_matlab_filewrite : export data in the .mat format of Matlab
+*
+* \htmlonly
+* <hr/>
+* \endhtmlonly
+* \section vnl_algo vnl_algo : Computational Numerics Library
+*
+* Matrix decompositions include:
+* - vnl_svd, vnl_svd_fixed, and vnl_svd_economy : Singular value decomposition
* - vnl_qr : QR decomposition
* - vnl_cholesky : Cholesky decomposition (for symmetric matrices)
* - vnl_ldl_cholesky : Variant on Cholesky, allowing fast updating
@@ -31,52 +96,35 @@
* - vnl_sparse_symmetric_eigensystem
* - vnl_generalized_schur
*
-* Optimisation routines include
+* Optimisation routines include:
* - vnl_amoeba : Downhill simplex algorithm
-* - vnl_lsqr
-* - vnl_brent_minimizer (For 1D optimization)
+* - vnl_lsqr : least squares algorithm for (large, sparse) linear systems
+* - vnl_sparse_lu : LU decomposition to solve a (sparse) linear system
+* - vnl_brent_minimizer : minimizes a 1D function without using derivatives
+* - vnl_powell : minimizes an N-D function without using derivatives
* - vnl_conjugate_gradient
-* - vnl_lbfgs
-* - vnl_levenberg_marquardt
-* - vnl_powell
-* - vnl_bracket_minimum (To bracket a minimum of a 1D function)
+* - vnl_lbfgs, vnl_lbfgsb : Broyden Fletcher Goldfarb Shannon minimization
+* - vnl_levenberg_marquardt and vnl_sparse_lm : Levenberg-Marquardt nonlinear least squares
+* - vnl_bracket_minimum : bracket a minimum of a 1D function
+* - vnl_solve_qp : several quadratic programming problem solving functions
*
-* Support for manipulating polynomials
-* - vnl_real_polynomial
-* - vnl_real_npolynomial
+* Support for manipulating polynomials:
* - vnl_rnpoly_solve
* - vnl_rpoly_roots
* - vnl_cpoly_roots
*
-* Useful utility functions
-* - Common functions and constants (in vnl_math)
+* Useful utility functions:
* - vnl_fft_1d : 1D Fast Fourier Transform
* - vnl_fft_2d : 2D Fast Fourier Transform
+* - vnl_determinant (but see also vnl_determinant in library vnl)
+* - vnl_matrix_inverse (but see also vnl_matrix_inverse in library vnl)
+* - vnl_adjugate : return the adjugate (or adjoint, or cofactors) matrix
* - vnl_convolve
-* - vnl_random : random number generation, with normal and box distributions.
-* - vnl_gamma, vnl_gamma_p, vnl_gamma_q : gamma functions
-* - vnl_erf
* - vnl_chi_squared : CDF of chi-squared distribution
+* - vnl_fit_parabola : given three points, return 2nd degree fitting polynomial
*
-* Simple matrix operations
-* - vnl_transpose : transpose of a matrix for direct use in a multiplication
-* - vnl_adjugate : return the adjugate matrix
-* - vnl_rank, vnl_rank_row_reduce and vnl_rank_column_reduce
-* - vnl_trace
-* - vnl_unary_function
-* - vnl_cross
-* - vnl_det and vnl_determinant
-* - vnl_inverse, vnl_inverse_transpose and vnl_matrix_inverse
-* - vnl_orthogonal_complement
-*
-* Alternative number representations
-* - vnl_complex
-* - vnl_quaternion
-* - vnl_rational
-* - vnl_bignum
-* - vnl_finite
-*
-* \section Lead Developer
-* Amitha Perera is responsible for co-ordinating significant changes to vnl.
-* http://sourceforge.net/sendmessage.php?touser=237910
+* \section Lead Developers
+* Gehua Yang and Peter Vanroose are responsible for co-ordinating significant changes to vnl.
+* http://sourceforge.net/sendmessage.php?touser=717688
+* http://sourceforge.net/sendmessage.php?touser=290414
*/
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/core/vnl/io/CMakeLists.txt
index 74da98ef692bf692744fae09ef8d153f6b15e8e0..784f7164835a47c09db30cfc17683c2515b4f77f 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/CMakeLists.txt
@@ -32,5 +32,5 @@ INSTALL_TARGETS(/lib vnl_io)
INSTALL_NOBASE_HEADER_FILES(/include/vxl/core/vnl/io ${vnl_io_sources})
IF(BUILD_TESTING)
- SUBDIRS(tests)
+# SUBDIRS(tests)
ENDIF(BUILD_TESTING)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+double.4.20-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+double.4.20-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..a530d019158b998009b82eb5e831603a97397912
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+double.4.20-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_matrix_fixed.txx>
+VNL_IO_MATRIX_FIXED_INSTANTIATE(double,4,20);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+double.6.6-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+double.6.6-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..c6869c2f0b1ab6aa97e2d00f2844d5a5294f547b
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+double.6.6-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_matrix_fixed.txx>
+VNL_IO_MATRIX_FIXED_INSTANTIATE(double,6,6);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.3.3-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.3.3-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..264f037a10ce88da180ed8dad09e84a7810fb335
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.3.3-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_matrix_fixed.txx>
+VNL_IO_MATRIX_FIXED_INSTANTIATE(float,3,3);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.3.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.3.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..d4fa0b255d0eb6d1e3c4b5425859f1e270cde6b9
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.3.4-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_matrix_fixed.txx>
+VNL_IO_MATRIX_FIXED_INSTANTIATE(float,3,4);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.4.20-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.4.20-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..ea6e2f01e75f7d8f4eb1b0d935a8078fd88233ac
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.4.20-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_matrix_fixed.txx>
+VNL_IO_MATRIX_FIXED_INSTANTIATE(float,4,20);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.4.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.4.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..58346000cb52790a49a7435fcaf203cbf3274a9b
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_matrix_fixed+float.4.4-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_matrix_fixed.txx>
+VNL_IO_MATRIX_FIXED_INSTANTIATE(float,4,4);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_sym_matrix+float-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_sym_matrix+float-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..42e6229b1aac28782ace24b81df7fc27c577a287
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_sym_matrix+float-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_sym_matrix.txx>
+VNL_IO_SYM_MATRIX_INSTANTIATE(float);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+double.10-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+double.10-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..1c861b7ff1559d89cc0b824c7b4198e653da04d4
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+double.10-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_vector_fixed.txx>
+VNL_IO_VECTOR_FIXED_INSTANTIATE(double,10);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+double.6-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+double.6-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..7621adb7285a72b0c74c9148ed97a0c625295f2e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+double.6-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_vector_fixed.txx>
+VNL_IO_VECTOR_FIXED_INSTANTIATE(double,6);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.16-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.16-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..edfa6dd2b172dc7bc003f16690f0d8d974789260
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.16-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_vector_fixed.txx>
+VNL_IO_VECTOR_FIXED_INSTANTIATE(float, 16);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.2-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.2-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..ab2b327704c0765916076309a9a9dc2639467221
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.2-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_vector_fixed.txx>
+VNL_IO_VECTOR_FIXED_INSTANTIATE(float,2);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.3-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.3-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..55722b6d6062241496bb48687a6d29c1b125b380
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.3-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_vector_fixed.txx>
+VNL_IO_VECTOR_FIXED_INSTANTIATE(float,3);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..089f49509f58d5f1b22c20f4e07c6c1bee39cfad
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+float.4-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_vector_fixed.txx>
+VNL_IO_VECTOR_FIXED_INSTANTIATE(float,4);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+int.2-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+int.2-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..3acf015a677bf888ae47fd4b2ee630c3615de8cf
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+int.2-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_vector_fixed.txx>
+VNL_IO_VECTOR_FIXED_INSTANTIATE(int, 2);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+int.4-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+int.4-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..73ece243bd3e11e8e219a35a50a20f3c5ff94afd
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+int.4-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_vector_fixed.txx>
+VNL_IO_VECTOR_FIXED_INSTANTIATE(int, 4);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+uchar.16-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+uchar.16-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..7e1d0dd41075255811a295c8e07d72cc367e4d11
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+uchar.16-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_vector_fixed.txx>
+VNL_IO_VECTOR_FIXED_INSTANTIATE(unsigned char, 16);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+unsigned_short.2-.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+unsigned_short.2-.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..25e827312381507caabe587812db32af25a13981
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vnl_io_vector_fixed+unsigned_short.2-.cxx
@@ -0,0 +1,2 @@
+#include <vnl/io/vnl_io_vector_fixed.txx>
+VNL_IO_VECTOR_FIXED_INSTANTIATE(unsigned short,2);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vsl_vector_io+vcl_vector+vnl_vector_fixed+unsigned_short.2---.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vsl_vector_io+vcl_vector+vnl_vector_fixed+unsigned_short.2---.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..fa5881e25d9bdd0a381537615ed60cb0936a2775
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vsl_vector_io+vcl_vector+vnl_vector_fixed+unsigned_short.2---.cxx
@@ -0,0 +1,5 @@
+#include <vsl/vsl_vector_io.txx>
+#include <vnl/io/vnl_io_vector_fixed.h>
+
+typedef vcl_vector < vnl_vector_fixed<unsigned short, 2> > vect_nvecf;
+VSL_VECTOR_IO_INSTANTIATE( vect_nvecf );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vsl_vector_io+vnl_matrix_fixed+double.3.3--.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vsl_vector_io+vnl_matrix_fixed+double.3.3--.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..f863246fa90ab3a508d13ddb739fa0489fc83c63
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vsl_vector_io+vnl_matrix_fixed+double.3.3--.cxx
@@ -0,0 +1,5 @@
+#include <vsl/vsl_vector_io.txx>
+#include <vnl/io/vnl_io_matrix_fixed.txx>
+// use a typedef to remove commas from the macro parameter that cause errors
+typedef vnl_matrix_fixed<double,3,3> vnl_matrix_fixed_double_3_3;
+VSL_VECTOR_IO_INSTANTIATE(vnl_matrix_fixed_double_3_3);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vsl_vector_io+vnl_vector_fixed+float.3--.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vsl_vector_io+vnl_vector_fixed+float.3--.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..8f1e3c67a03b0fa29e96e706fc6ecbf275466788
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/Templates/vsl_vector_io+vnl_vector_fixed+float.3--.cxx
@@ -0,0 +1,5 @@
+#include <vsl/vsl_vector_io.txx>
+#include <vnl/io/vnl_io_vector_fixed.txx>
+typedef vnl_vector_fixed<float, 3> f3;
+VSL_VECTOR_IO_INSTANTIATE( f3 );
+
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/CMakeLists.txt
deleted file mode 100644
index 6c9875ddf10f1f8196999287ebf1696fc28b53b8..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/CMakeLists.txt
+++ /dev/null
@@ -1,41 +0,0 @@
-# This is core/vnl/io/tests/CMakeLists.txt
-SET(EXECUTABLE_OUTPUT_PATH ${vxl_BINARY_DIR}/core/vnl/io/tests)
-
-ADD_EXECUTABLE( vnl_io_test_all
- # Driver source
- test_driver.cxx
-
- # The tests
- golden_test_vnl_io.cxx
- test_bignum_io.cxx
- test_diag_matrix_io.cxx
- test_matrix_fixed_io.cxx
- test_matrix_io.cxx
- test_nonlinear_minimizer_io.cxx
- test_rational_io.cxx
- test_real_npolynomial_io.cxx
- test_real_polynomial_io.cxx
- test_sparse_matrix_io.cxx
- test_sym_matrix_io.cxx
- test_vector_fixed_io.cxx
- test_vector_io.cxx
-)
-
-TARGET_LINK_LIBRARIES( vnl_io_test_all vnl_io vsl testlib vpl )
-
-ADD_TEST( vnl_io_test_bignum_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_bignum_io )
-ADD_TEST( vnl_io_test_diag_matrix_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_diag_matrix_io )
-ADD_TEST( vnl_io_test_matrix_fixed_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_matrix_fixed_io )
-ADD_TEST( vnl_io_test_matrix_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_matrix_io )
-ADD_TEST( vnl_io_test_nonlinear_minimizer_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_nonlinear_minimizer_io )
-ADD_TEST( vnl_io_test_rational_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_rational_io )
-ADD_TEST( vnl_io_test_real_npolynomial_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_real_npolynomial_io )
-ADD_TEST( vnl_io_test_real_polynomial_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_real_polynomial_io )
-ADD_TEST( vnl_io_test_sparse_matrix_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_sparse_matrix_io )
-ADD_TEST( vnl_io_test_sym_matrix_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_sym_matrix_io )
-ADD_TEST( vnl_io_test_vector_fixed_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_vector_fixed_io )
-ADD_TEST( vnl_io_test_vector_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all test_vector_io )
-ADD_TEST( vnl_io_golden_test_vnl_io ${EXECUTABLE_OUTPUT_PATH}/vnl_io_test_all golden_test_vnl_io )
-
-ADD_EXECUTABLE( vnl_io_test_include test_include.cxx )
-TARGET_LINK_LIBRARIES( vnl_io_test_include vnl_io )
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/golden_test_vnl_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/golden_test_vnl_io.cxx
deleted file mode 100644
index 31ccc8ac1ee01555cd0d00ab2ec68ada4d9554c9..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/golden_test_vnl_io.cxx
+++ /dev/null
@@ -1,202 +0,0 @@
-// This is core/vnl/io/tests/golden_test_vnl_io.cxx
-
-//:
-// \file
-// \brief Read in a golden data file, and check the values are correct.
-//
-// If you need to recreate the golden data file, run this test with
-// the single parameter "create":
-// \verbatim
-// golden_test_vnl_io create
-// \endverbatim
-
-#include <vcl_string.h>
-#include <vcl_cstdlib.h> // for vcl_exit()
-#include <vsl/vsl_binary_io.h>
-#include <vnl/vnl_vector_fixed.h>
-#include <vnl/io/vnl_io_vector.h>
-#include <vnl/io/vnl_io_vector_fixed.h>
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/io/vnl_io_matrix.h>
-#include <vnl/io/vnl_io_matrix_fixed.h>
-#include <vnl/io/vnl_io_diag_matrix.h>
-#include <vnl/io/vnl_io_real_npolynomial.h>
-#include <vnl/io/vnl_io_real_polynomial.h>
-#include <vnl/io/vnl_io_sparse_matrix.h>
-#include <testlib/testlib_root_dir.h>
-#include <testlib/testlib_test.h>
-
-static void golden_test_vnl_io(bool save_file)
-{
- vcl_cout << "***********************************************************\n"
- << " Testing a golden data file for cross platform consistency\n"
- << "***********************************************************\n";
-
-
- //-----------------------------------------------------------------------------------
- // Create objects:
- // If the "create" flag was used on the command line, then the program saves an example
- // of each class
- // Otherwise it just fills them with values for comparison to the values read in.
- //------------------------------------------------------------------------------------
-
- // vnl_vector
- const int n_vec = 50;
- vnl_vector<double> v_out(n_vec),v_in;
-
- for (int i=0; i<n_vec; i++)
- {
- v_out(i) = (double)(i*i);
- }
-
- // vnl_matrix
- const int m_mat = 10;
- const int n_mat = 6;
- vnl_matrix<double> m_out(m_mat, n_mat), m_in;
-
- for (int i=0; i<m_mat; i++)
- {
- for (int j=0; j<n_mat; j++)
- {
- m_out(i,j) = (double)(i*j+i);
- }
- }
-
- // vnl_diag_matrix
- vnl_diag_matrix<double> diag_mat_out(v_out), diag_mat_in;
-
- // vnl_matrix_fixed
- double datablock[4] = {
- 1.1, 1.2,
- 2.1, 2.2
- };
- vnl_matrix_fixed<double,2,2> m_fixed_out(datablock), m_fixed_in;
-
- // vnl_real_n_polynomial
- vnl_vector<double> coeffs(4);
- vnl_matrix<unsigned int> exponents(4,2);
-
- coeffs(0) = 0.1;
- coeffs(1) = 0.2;
- coeffs(2) = 0.3;
- coeffs(3) = 0.5;
-
- exponents(0,0) = 1;
- exponents(1,0) = 2;
- exponents(2,0) = 3;
- exponents(3,0) = 4;
- exponents(0,1) = 5;
- exponents(1,1) = 6;
- exponents(2,1) = 7;
- exponents(3,1) = 8;
-
-
- vnl_real_npolynomial polyn_out(coeffs, exponents), polyn_in;
-
- // vnl_real_polynomial
- vnl_real_polynomial poly_out(v_out), poly_in(0);
-
- // vnl_sparse_matrix
- vnl_sparse_matrix<double> m_sparse_out(3,3), m_sparse_in(3,3);
- vcl_vector<int> col_1(3);
- vcl_vector<int> col_2(2);
- vcl_vector<int> col_3(1);
-
- col_1[0]=1;
- col_1[1]=2;
- col_1[2]=3;
- col_2[0]=1;
- col_2[1]=3;
- col_3[0]=2;
-
- vcl_vector<double> val_1(3);
- vcl_vector<double> val_2(2);
- vcl_vector<double> val_3(1);
-
- val_1[0]=1.1;
- val_1[1]=1.2;
- val_1[2]=1.3;
- val_2[0]=2.1;
- val_2[1]=2.3;
- val_3[0]=3.2;
-
- m_sparse_out.set_row(0, col_1, val_1);
- m_sparse_out.set_row(1, col_2, val_2);
- m_sparse_out.set_row(2, col_3, val_3);
-
-
- // vnl_vector_fixed
- vnl_vector_fixed<double,3> v_fixed_out(1.2,3.4,5.6), v_fixed_in;
-
- // Save if option set
- if (save_file)
- {
- vsl_b_ofstream bfs_out("golden_test_vnl_io.bvl");
- TEST ("Opened golden_test_vnl_io.bvl for writing ", ! bfs_out, false);
- if (!bfs_out)
- {
- vcl_cerr<<"Problems opening file for output - exiting\n";
- vcl_exit(1);
- }
- vsl_b_write(bfs_out, v_out);
- vsl_b_write(bfs_out, m_out);
- vsl_b_write(bfs_out, diag_mat_out);
- vsl_b_write(bfs_out, m_fixed_out);
- vsl_b_write(bfs_out, polyn_out);
- vsl_b_write(bfs_out, poly_out);
- vsl_b_write(bfs_out, m_sparse_out);
- vsl_b_write(bfs_out, v_fixed_out);
- bfs_out.close();
- }
-
- // Read in file to each class in turn
- vcl_string gold_path=testlib_root_dir()+"/core/vnl/io/tests/golden_test_vnl_io.bvl";
- vsl_b_ifstream bfs_in(gold_path.c_str());
- TEST ("Opened golden_test_vnl_io.bvl for reading ", ! bfs_in, false);
- vsl_b_read(bfs_in, v_in);
- vsl_b_read(bfs_in, m_in);
- vsl_b_read(bfs_in, diag_mat_in);
- vsl_b_read(bfs_in, m_fixed_in);
- vsl_b_read(bfs_in, polyn_in);
- vsl_b_read(bfs_in, poly_in);
- vsl_b_read(bfs_in, m_sparse_in);
- vsl_b_read(bfs_in, v_fixed_in);
- TEST ("Finished reading file successfully", (!bfs_in), false);
- bfs_in.close();
-
-
- // Test that each object created is the same as read in from the file.
- TEST ("v_out == v_in", v_out == v_in, true);
- TEST ("m_out == m_in", m_out == m_in, true);
- TEST ("diag_mat_out == diag_mat_in", diag_mat_out.diagonal() == diag_mat_in.diagonal(), true);
- TEST ("m_fixed_out == m_fixed_in", m_fixed_out == m_fixed_in, true);
- TEST ("polyn_out == polyn_in", poly_out.coefficients() == poly_in.coefficients(), true);
- TEST ("poly_out == poly_in", poly_out.coefficients() == poly_in.coefficients(), true);
-
-
- //Code to compare sparse matrices
- m_sparse_out.reset();
- m_sparse_in.reset();
- bool test_result=true;
-
- while (m_sparse_out.next() && m_sparse_in.next())
- {
- if (m_sparse_out.getrow()!=m_sparse_in.getrow() || m_sparse_out.getcolumn() != m_sparse_in.getcolumn()
- || m_sparse_out.value()!= m_sparse_in.value())
- {
- test_result=false;
- break;
- }
- }
-
- TEST ("m_sparse_out == m_sparse_in",test_result , true);
- TEST ("v_fixed_out == v_fixed_in", v_fixed_out == v_fixed_in, true);
-}
-
-
-static void golden_test_vnl_io(int argc, char* argv[])
-{
- golden_test_vnl_io(argc==2 && vcl_string(argv[1])==vcl_string("create"));
-}
-
-TESTMAIN_ARGS(golden_test_vnl_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_bignum_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_bignum_io.cxx
deleted file mode 100644
index 441ad1b2a58dec1db452aeae3c087dbda0a0ed47..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_bignum_io.cxx
+++ /dev/null
@@ -1,61 +0,0 @@
-// This is core/vnl/io/tests/test_bignum_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_bignum.h>
-#include <vnl/io/vnl_io_bignum.h>
-#include <vsl/vsl_binary_io.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_bignum_io()
-{
- vcl_cout << "**************\n"
- << "test_bignum_io\n"
- << "**************\n";
-
- vnl_bignum nil(0), big(-3245444l), verybig("4235702934875938745092384750293845"),
- p_inf("Infinity"), m_inf("-Inf");
-
- vsl_b_ofstream bfs_out("vnl_bignum_test_io.bvl.tmp");
- TEST ("Created vnl_bignum_test_io.bvl.tmp for writing",
- (!bfs_out), false);
- vsl_b_write(bfs_out, nil);
- vsl_b_write(bfs_out, big);
- vsl_b_write(bfs_out, verybig);
- vsl_b_write(bfs_out, p_inf);
- vsl_b_write(bfs_out, m_inf);
- bfs_out.close();
-
- vnl_bignum r1, r2, r3, r4, r5;
- vsl_b_ifstream bfs_in("vnl_bignum_test_io.bvl.tmp");
- TEST ("Opened vnl_bignum_test_io.bvl.tmp for reading",
- (!bfs_in), false);
- vsl_b_read(bfs_in, r1);
- vsl_b_read(bfs_in, r2);
- vsl_b_read(bfs_in, r3);
- vsl_b_read(bfs_in, r4);
- vsl_b_read(bfs_in, r5);
- TEST ("Finished reading file successfully", (!bfs_in), false);
- bfs_in.close();
-
- vpl_unlink ("vnl_bignum_test_io.bvl.tmp");
-
- TEST ("equality 0", nil, r1);
- TEST ("equality -3245444", big, r2);
- TEST ("equality 4235702934875938745092384750293845", verybig, r3);
- TEST ("equality +Infinity", p_inf, r4);
- TEST ("equality -Infinity", m_inf, r5);
-
- vcl_cout << "\n0 summary: ";
- vsl_print_summary(vcl_cout, nil);
- vcl_cout << "\n-3245444 summary: ";
- vsl_print_summary(vcl_cout, r2);
- vcl_cout << "\n4235702934875938745092384750293845 summary: ";
- vsl_print_summary(vcl_cout, verybig);
- vcl_cout << "\n+Infinity summary: ";
- vsl_print_summary(vcl_cout, r4);
- vcl_cout << "\n-Infinity summary: ";
- vsl_print_summary(vcl_cout, m_inf);
- vcl_cout << vcl_endl;
-}
-
-TESTMAIN(test_bignum_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_diag_matrix_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_diag_matrix_io.cxx
deleted file mode 100644
index 3a1c613979d9e16399ae5f81139f0a1e67bc28a4..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_diag_matrix_io.cxx
+++ /dev/null
@@ -1,58 +0,0 @@
-// This is core/vnl/io/tests/test_diag_matrix_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_vector.h>
-#include <vsl/vsl_binary_io.h>
-#include <vnl/vnl_diag_matrix.h>
-#include <vnl/io/vnl_io_diag_matrix.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_diag_matrix_double_io()
-{
- vcl_cout << "*******************\n"
- << "test_diag_matrix_io\n"
- << "*******************\n";
- //// test constructors, accessors
- const int n = 50;
- vnl_vector<double> v_out(n), v_in(n);
-
- for (int i=0; i<n; i++)
- {
- v_in(i) = (double)(i); // Different to check things change
- v_out(i) = (double)(i*i);
- }
-
- vnl_diag_matrix<double> diag_mat_out(v_out), diag_mat_in(v_in);
-
- vsl_print_summary(vcl_cout, diag_mat_out);
- vcl_cout << vcl_endl;
-
- vsl_b_ofstream bfs_out("vnl_diag_matrix_test_io.bvl.tmp");
- TEST ("Created vnl_diag_matrix_test_io.bvl.tmp for writing",
- (!bfs_out), false);
- vsl_b_write(bfs_out, diag_mat_out);
- bfs_out.close();
-
- vsl_b_ifstream bfs_in("vnl_diag_matrix_test_io.bvl.tmp");
- TEST ("Opened vnl_diag_matrix_test_io.bvl.tmp for reading",
- (!bfs_in), false);
- vsl_b_read(bfs_in, diag_mat_in);
- TEST ("Finished reading file successfully", (!bfs_in), false);
- bfs_in.close();
-
- vpl_unlink ("vnl_diag_matrix_test_io.bvl.tmp");
-
- TEST ("diag_mat_out.diagonal() == diag_mat_in.diagonal()",
- diag_mat_out.diagonal() == diag_mat_in.diagonal(), true);
-
-
- vsl_print_summary(vcl_cout, diag_mat_out);
- vcl_cout << vcl_endl;
-}
-
-void test_diag_matrix_io()
-{
- test_diag_matrix_double_io();
-}
-
-TESTMAIN( test_diag_matrix_io );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_driver.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_driver.cxx
deleted file mode 100644
index 7b296cc7f70e74c1a4bc39b6eb12ed1e96e62b87..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_driver.cxx
+++ /dev/null
@@ -1,35 +0,0 @@
-#include <testlib/testlib_register.h>
-
-DECLARE( test_bignum_io );
-DECLARE( test_diag_matrix_io );
-DECLARE( test_matrix_fixed_io );
-DECLARE( test_matrix_io );
-DECLARE( test_nonlinear_minimizer_io );
-DECLARE( test_rational_io );
-DECLARE( test_real_npolynomial_io );
-DECLARE( test_real_polynomial_io );
-DECLARE( test_sparse_matrix_io );
-DECLARE( test_sym_matrix_io );
-DECLARE( test_vector_fixed_io );
-DECLARE( test_vector_io );
-DECLARE( golden_test_vnl_io );
-
-void
-register_tests()
-{
- REGISTER( test_bignum_io );
- REGISTER( test_diag_matrix_io );
- REGISTER( test_matrix_fixed_io );
- REGISTER( test_matrix_io );
- REGISTER( test_nonlinear_minimizer_io );
- REGISTER( test_rational_io );
- REGISTER( test_real_npolynomial_io );
- REGISTER( test_real_polynomial_io );
- REGISTER( test_sparse_matrix_io );
- REGISTER( test_sym_matrix_io );
- REGISTER( test_vector_fixed_io );
- REGISTER( test_vector_io );
- REGISTER( golden_test_vnl_io );
-}
-
-DEFINE_MAIN;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_include.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_include.cxx
deleted file mode 100644
index 29746eaa169e710fb235a3146455e899510215ca..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_include.cxx
+++ /dev/null
@@ -1,14 +0,0 @@
-#include <vnl/io/vnl_io_real_polynomial.h>
-#include <vnl/io/vnl_io_real_npolynomial.h>
-#include <vnl/io/vnl_io_nonlinear_minimizer.h>
-#include <vnl/io/vnl_io_rational.h>
-#include <vnl/io/vnl_io_matrix.h>
-#include <vnl/io/vnl_io_diag_matrix.h>
-#include <vnl/io/vnl_io_sparse_matrix.h>
-#include <vnl/io/vnl_io_sym_matrix.h>
-#include <vnl/io/vnl_io_vector.h>
-#include <vnl/io/vnl_io_bignum.h>
-#include <vnl/io/vnl_io_matrix_fixed.h>
-#include <vnl/io/vnl_io_vector_fixed.h>
-
-int main() { return 0; }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_matrix_fixed_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_matrix_fixed_io.cxx
deleted file mode 100644
index 082602bc838d4ba26085d7538cf24dd9ca120cd5..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_matrix_fixed_io.cxx
+++ /dev/null
@@ -1,55 +0,0 @@
-// This is core/vnl/io/tests/test_matrix_fixed_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/io/vnl_io_matrix_fixed.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_matrix_fixed_double_2_2_io()
-{
- vcl_cout << "***************************************\n"
- << "Testing vnl_matrix_fixed<double,2,2> io\n"
- << "***************************************\n";
- //// test constructors, accessors
- double datablock[4] = {
- 1.1, 1.2,
- 2.1, 2.2
- };
- vnl_matrix_fixed<double,2,2> m_out(datablock), m_in0,m_in1;
-
- // Give some initial content
- m_in1 = m_out * 2.0;
-
- vsl_b_ofstream bfs_out("vnl_matrix_fixed_io.bvl.tmp",
- vcl_ios_out | vcl_ios_binary);
- TEST ("vnl_matrix_fixed_io.bvl.tmp for writing", (!bfs_out), false);
- vsl_b_write(bfs_out, m_out);
- vsl_b_write(bfs_out, m_out);
- bfs_out.close();
-
- vsl_b_ifstream bfs_in("vnl_matrix_fixed_io.bvl.tmp",
- vcl_ios_in | vcl_ios_binary);
- TEST ("vnl_matrix_fixed_io.bvl.tmp for reading", (!bfs_in), false);
- vsl_b_read(bfs_in, m_in0);
- vsl_b_read(bfs_in, m_in1);
- bfs_in.close();
-
- vpl_unlink ("vnl_matrix_fixed_io.bvl.tmp");
-
- // m_in0 is initially empty
- TEST ("m_out == m_in0", m_out, m_in0);
- // m_in1 has content
- TEST ("m_out == m_in1", m_out, m_in1);
-
- vsl_print_summary(vcl_cout, m_out);
- vcl_cout << vcl_endl;
-}
-
-
-void test_matrix_fixed_io()
-{
- test_matrix_fixed_double_2_2_io();
-}
-
-
-TESTMAIN(test_matrix_fixed_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_matrix_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_matrix_io.cxx
deleted file mode 100644
index b7bd4d206ba0866c67fb5202926b14cfe4328d78..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_matrix_io.cxx
+++ /dev/null
@@ -1,60 +0,0 @@
-// This is core/vnl/io/tests/test_matrix_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/io/vnl_io_matrix.h>
-#include <vsl/vsl_binary_io.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_matrix_double_io()
-{
- vcl_cout << "*****************************\n"
- << "Testing vnl_matrix<double> io\n"
- << "*****************************\n";
- //// test constructors, accessors
- const int m = 10;
- const int n = 6;
- vnl_matrix<double> m_out(m, n), m_in1(m,n),m_in2;
-
- for (int i=0; i<m; i++)
- {
- for (int j=0; j<n; j++)
- {
- m_out(i,j) = (double)(i*j+i);
- m_in1(i,j) = (double)(73);
- }
- }
-
- vsl_b_ofstream bfs_out("vnl_matrix_test_double_io.bvl.tmp");
- TEST("Created vnl_matrix_test_double_io.bvl.tmp for writing",
- (!bfs_out), false);
- vsl_b_write(bfs_out, m_out);
- vsl_b_write(bfs_out, m_out);
- bfs_out.close();
-
- vsl_b_ifstream bfs_in("vnl_matrix_test_double_io.bvl.tmp");
- TEST("Opened vnl_matrix_test_double_io.bvl.tmp for reading", (!bfs_in), false);
- vsl_b_read(bfs_in, m_in1);
- vsl_b_read(bfs_in, m_in2);
- TEST("Finished reading file successfully", (!bfs_in), false);
- bfs_in.close();
-
- vpl_unlink ("vnl_matrix_test_double_io.bvl.tmp");
-
- // m_in1 has content
- TEST("m_out == m_in1", m_out, m_in1);
- // m_in2 empty
- TEST("m_out == m_in2", m_out, m_in2);
-
- vsl_print_summary(vcl_cout, m_out);
- vcl_cout << vcl_endl;
-}
-
-
-void test_matrix_io()
-{
- test_matrix_double_io();
-}
-
-
-TESTMAIN(test_matrix_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_nonlinear_minimizer_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_nonlinear_minimizer_io.cxx
deleted file mode 100644
index dc0d71cc27878e8a90fe6508604cad1bd9ff8332..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_nonlinear_minimizer_io.cxx
+++ /dev/null
@@ -1,74 +0,0 @@
-// This is core/vnl/io/tests/test_nonlinear_minimizer_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_nonlinear_minimizer.h>
-#include <vnl/io/vnl_io_nonlinear_minimizer.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_nonlinear_minimizer_io()
-{
- vcl_cout << "**********************************\n"
- << "Testing vnl_nonlinear_minimizer_io\n"
- << "**********************************\n";
-
- //// test constructors, accessors
- vnl_nonlinear_minimizer minimizer_out, minimizer_in;
-
- // mininizer settings to be saved
- double xtol_out= 0.001;
- double ftol_out= xtol_out*0.01;
- double gtol_out= 0.005;
- int maxfev_out = 3000;
- double epsfcn_out = xtol_out* 0.001;
- bool trace_out = false;
- bool verbose_out = false;
- int cd_out =1;
-
- minimizer_out.set_f_tolerance(ftol_out);
- minimizer_out.set_x_tolerance(xtol_out);
- minimizer_out.set_g_tolerance(gtol_out);
- minimizer_out.set_max_function_evals(maxfev_out);
- minimizer_out.set_epsilon_function(epsfcn_out);
- minimizer_out.set_trace(trace_out);
- minimizer_out.set_verbose(verbose_out);
- minimizer_out.set_check_derivatives(cd_out);
-
- vsl_print_summary(vcl_cout, minimizer_out);
- vcl_cout << vcl_endl;
-
- vsl_b_ofstream bfs_out("vnl_nonlinear_minimizer_io.bvl.tmp");
- TEST("Created vnl_nonlinear_minimizer_test_io.bvl.tmp for writing", (!bfs_out), false);
- vsl_b_write(bfs_out, minimizer_out);
- bfs_out.close();
-
- vsl_b_ifstream bfs_in("vnl_nonlinear_minimizer_io.bvl.tmp");
- TEST("Opened vnl_nonlinear_minimizer_test_io.bvl.tmp for reading", (!bfs_in), false);
- vsl_b_read(bfs_in, minimizer_in);
- TEST("Finished reading file successfully", (!bfs_in), false);
- bfs_in.close();
-
- vpl_unlink ("vnl_nonlinear_minimizer_io.bvl.tmp");
-
- double ftol_in=minimizer_in.get_f_tolerance();
- double xtol_in=minimizer_in.get_x_tolerance();
- double gtol_in=minimizer_in.get_g_tolerance();
- int maxfev_in=minimizer_in.get_max_function_evals();
- double epsfcn_in=minimizer_in.get_epsilon_function();
- bool trace_in=minimizer_in.get_trace();
- bool verbose_in=minimizer_in.get_verbose();
- int cd_in=minimizer_in.get_check_derivatives();
-
- TEST("ftol_in == ftol_out", ftol_in == ftol_out, true);
- TEST("xtol_in == xtol_out", xtol_in == xtol_out, true);
- TEST("gtol_in == gtol_out", gtol_in == gtol_out, true);
- TEST("maxfev_in == maxfev_out", maxfev_in == maxfev_out, true);
- TEST("epsfcn_in == epsfcn_out", epsfcn_in == epsfcn_out, true);
- TEST("trace_in == trace_out", trace_in == trace_out, true);
- TEST("verbose_in == verbose_out", verbose_in == verbose_out, true);
- TEST("cd_in == cd_out", cd_in == cd_out, true);
-
- vsl_print_summary(vcl_cout, minimizer_in);
- vcl_cout << vcl_endl;
-}
-
-TESTMAIN(test_nonlinear_minimizer_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_rational_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_rational_io.cxx
deleted file mode 100644
index addad0ef982a3522babcee26f79e3ea58c4f36ba..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_rational_io.cxx
+++ /dev/null
@@ -1,47 +0,0 @@
-// This is core/vnl/io/tests/test_rational_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_rational.h>
-#include <vnl/io/vnl_io_rational.h>
-#include <vsl/vsl_binary_io.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_rational_io()
-{
- vcl_cout << "****************\n"
- << "test_rational_io\n"
- << "****************\n";
-
- vnl_rational nil(0L), inf(1L, 0L), one(2L,2L);
-
- vsl_b_ofstream bfs_out("vnl_rational_test_io.bvl.tmp");
- TEST ("Created vnl_rational_test_io.bvl.tmp for writing",
- (!bfs_out), false);
- vsl_b_write(bfs_out, nil);
- vsl_b_write(bfs_out, inf);
- vsl_b_write(bfs_out, one);
- bfs_out.close();
-
- vnl_rational r1, r2, r3;
- vsl_b_ifstream bfs_in("vnl_rational_test_io.bvl.tmp");
- TEST ("Opened vnl_rational_test_io.bvl.tmp for reading",
- (!bfs_in), false);
- vsl_b_read(bfs_in, r1);
- vsl_b_read(bfs_in, r2);
- vsl_b_read(bfs_in, r3);
- TEST ("Finished reading file successfully", (!bfs_in), false);
- bfs_in.close();
-
- vpl_unlink ("vnl_rational_test_io.bvl.tmp");
-
- TEST ("equality nil", nil, r1);
- TEST ("equality inf", inf, r2);
- TEST ("equality one", one, r3);
-
- vsl_print_summary(vcl_cout, nil);
- vsl_print_summary(vcl_cout, inf);
- vsl_print_summary(vcl_cout, one);
- vcl_cout << vcl_endl;
-}
-
-TESTMAIN(test_rational_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_real_npolynomial_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_real_npolynomial_io.cxx
deleted file mode 100644
index 384360a41cda9552213e6caa0ce56fd3d1df80ac..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_real_npolynomial_io.cxx
+++ /dev/null
@@ -1,65 +0,0 @@
-// This is core/vnl/io/tests/test_real_npolynomial_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_real_npolynomial.h>
-#include <vnl/io/vnl_io_real_npolynomial.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_real_npolynomial_io()
-{
- vcl_cout << "************************\n"
- << "test_real_npolynomial_io\n"
- << "************************\n";
- //// test constructors, accessors
- vnl_vector<double> coeffs(4),coeffs2;
- vnl_matrix<unsigned int> exponents(4,2);
-
- coeffs(0) = 0.1;
- coeffs(1) = 0.2;
- coeffs(2) = 0.3;
- coeffs(3) = 0.5;
-
- exponents(0,0) = 1;
- exponents(1,0) = 2;
- exponents(2,0) = 3;
- exponents(3,0) = 4;
- exponents(0,1) = 5;
- exponents(1,1) = 6;
- exponents(2,1) = 7;
- exponents(3,1) = 8;
-
- coeffs2 = coeffs*2.0;
-
- //vsl_print_summary(vcl_cout, coeffs);
-
- vnl_real_npolynomial poly_out(coeffs, exponents), poly_in0,poly_in1(coeffs2,exponents);
-
- vsl_b_ofstream bfs_out("vnl_real_npolynomial_test_io.bvl.tmp");
- TEST ("Created vnl_real_npolynomial_test_io.bvl.tmp for writing",
- (!bfs_out), false);
- vsl_b_write(bfs_out, poly_out);
- vsl_b_write(bfs_out, poly_out);
- bfs_out.close();
-
- vsl_b_ifstream bfs_in("vnl_real_npolynomial_test_io.bvl.tmp");
- TEST ("Opened vnl_real_npolynomial_test_io.bvl.tmp for reading",
- (!bfs_in), false);
- vsl_b_read(bfs_in, poly_in0);
- vsl_b_read(bfs_in, poly_in1);
- TEST ("Finished reading file successfully", (!bfs_in), false);
- bfs_in.close();
-
- vpl_unlink ("vnl_real_npolynomial_test_io.bvl.tmp");
-
- TEST ("poly_out.coefficients() == poly_in0.coefficients()",
- poly_out.coefficients() == poly_in0.coefficients(), true);
- TEST ("poly_out.coefficients() == poly_in1.coefficients()",
- poly_out.coefficients() == poly_in1.coefficients(), true);
-
- vsl_print_summary(vcl_cout, poly_out);
- vcl_cout << vcl_endl;
-}
-
-TESTMAIN(test_real_npolynomial_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_real_polynomial_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_real_polynomial_io.cxx
deleted file mode 100644
index b0d602c3ec27b594e338b0946d52223de1cb538c..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_real_polynomial_io.cxx
+++ /dev/null
@@ -1,50 +0,0 @@
-// This is core/vnl/io/tests/test_real_polynomial_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_real_polynomial.h>
-#include <vnl/io/vnl_io_real_polynomial.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_real_polynomial_io()
-{
- vcl_cout << "******************************\n"
- << "Testing vnl_real_polynomial io\n"
- << "******************************\n";
- //// test constructors, accessors
- const int n = 10;
- vnl_vector<double> v(n);
-
- for (int i=0; i<n; i++)
- {
- v(i) = (double)(i*i);
- }
-
- vnl_real_polynomial poly_out(v), poly_in0(0),poly_in1(v*2.0);
-
-
- vsl_b_ofstream bfs_out("vnl_real_polynomial_test_io.bvl.tmp");
- TEST("Created vnl_real_polynomial_test_io.bvl.tmp for writing", (!bfs_out), false);
- vsl_b_write(bfs_out, poly_out);
- vsl_b_write(bfs_out, poly_out);
- bfs_out.close();
-
- vsl_b_ifstream bfs_in("vnl_real_polynomial_test_io.bvl.tmp");
- TEST("Opened vnl_real_polynomial_test_io.bvl.tmp for reading", (!bfs_in), false);
- vsl_b_read(bfs_in, poly_in0);
- vsl_b_read(bfs_in, poly_in1);
- TEST("Finished reading file successfully", (!bfs_in), false);
- bfs_in.close();
-
- vpl_unlink ("vnl_real_polynomial_test_io.bvl.tmp");
-
- TEST("poly_out.coefficients() == poly_in0.coefficients()",
- poly_out.coefficients() == poly_in0.coefficients(), true);
- TEST("poly_out.coefficients() == poly_in1.coefficients()",
- poly_out.coefficients() == poly_in1.coefficients(), true);
-
- vsl_print_summary(vcl_cout, poly_in0);
- vcl_cout << vcl_endl;
-}
-
-
-TESTMAIN(test_real_polynomial_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_sparse_matrix_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_sparse_matrix_io.cxx
deleted file mode 100644
index ff3eb763d2415125328525ae02802a1ccad22a76..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_sparse_matrix_io.cxx
+++ /dev/null
@@ -1,104 +0,0 @@
-// This is core/vnl/io/tests/test_sparse_matrix_io.cxx
-#include <vcl_iostream.h>
-#include <vsl/vsl_binary_io.h>
-#include <vnl/vnl_sparse_matrix.h>
-#include <vnl/io/vnl_io_sparse_matrix.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-static bool Compare(vnl_sparse_matrix<double>& M1, vnl_sparse_matrix<double>& M2)
-{
- M1.reset();
- M2.reset();
-
- while (M1.next() && M2.next())
- {
- if (M1.getrow()!=M2.getrow() || M1.getcolumn() != M2.getcolumn() || M1.value()!= M2.value())
- {
- return false;
- }
- }
-
- return true;
-}
-
-void test_sparse_matrix_double_io()
-{
- vcl_cout << "************************************\n"
- << "Testing vnl_sparse_matrix<double> io\n"
- << "************************************\n";
- //// test constructors, accessors
-
- vnl_sparse_matrix<double> m_out(3,3), m_in0(3,3), m_in1(3,3);
- vcl_vector<int> col_1(3);
- vcl_vector<int> col_2(2);
- vcl_vector<int> col_3(1);
-
- col_1[0]=1;
- col_1[1]=2;
- col_1[2]=3;
- col_2[0]=1;
- col_2[1]=3;
- col_3[0]=2;
-
- vcl_vector<double> val_1(3);
- vcl_vector<double> val_2(2);
- vcl_vector<double> val_3(1);
-
- val_1[0]=1.1;
- val_1[1]=1.2;
- val_1[2]=1.3;
- val_2[0]=2.1;
- val_2[1]=2.3;
- val_3[0]=3.2;
-
- m_out.set_row(0, col_1, val_1);
- m_out.set_row(1, col_2, val_2);
- m_out.set_row(2, col_3, val_3);
-
- vsl_b_ofstream bfs_out("vnl_sparse_matrix_io.bvl.tmp");
- TEST ("vnl_sparse_matrix_io.bvl.tmp for writing", (!bfs_out), false);
- vsl_b_write(bfs_out, m_out);
- vsl_b_write(bfs_out, m_out);
- bfs_out.close();
-
- vsl_b_ifstream bfs_in("vnl_sparse_matrix_io.bvl.tmp");
- TEST ("vnl_sparse_matrix_io.bvl.tmp for reading", (!bfs_in), false);
- vsl_b_read(bfs_in, m_in0);
- vsl_b_read(bfs_in, m_in1);
- bfs_in.close();
-
- vpl_unlink ("vnl_sparse_matrix_io.bvl.tmp");
-
-#if 0
- bool test_result=true;
- m_out.reset();
- m_in.reset();
-
- while (m_out.next() && m_in.next())
- {
- if (m_out.getrow()!=m_in.getrow()
- || m_out.getcolumn() != m_in.getcolumn()
- || m_out.value()!= m_in.value())
- {
- test_result=false;
- break;
- }
- }
-#endif
-
- TEST ("m_out == m_in0",Compare(m_out,m_in0) , true);
- TEST ("m_out == m_in1",Compare(m_out,m_in1) , true);
-
- vsl_print_summary(vcl_cout, m_out);
- vcl_cout << vcl_endl;
-}
-
-
-void test_sparse_matrix_io()
-{
- test_sparse_matrix_double_io();
-}
-
-
-TESTMAIN(test_sparse_matrix_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_sym_matrix_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_sym_matrix_io.cxx
deleted file mode 100644
index d07c451ae3b2aeacd64736541cee5f03a912f43e..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_sym_matrix_io.cxx
+++ /dev/null
@@ -1,58 +0,0 @@
-// This is core/vnl/io/tests/test_sym_matrix_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_sym_matrix.h>
-#include <vnl/io/vnl_io_sym_matrix.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_sym_matrix_double_io()
-{
- vcl_cout << "*********************************\n"
- << "Testing vnl_sym_matrix<double> io\n"
- << "*********************************\n";
- //// test constructors, accessors
- const int n = 6;
- vnl_sym_matrix<double> m_out( n), m_in1(n),m_in2;
-
- for (int i=0; i<n; i++)
- {
- for (int j=0; j<=i; j++)
- {
- m_out(i,j) = (double)(i*j);
- m_in1(i,j) = (double)(73);
- }
- }
-
-
- vsl_b_ofstream bfs_out("vnl_sym_matrix_test_double_io.bvl.tmp");
- TEST("Created vnl_sym_matrix_test_double_io.bvl.tmp for writing", (!bfs_out), false);
- vsl_b_write(bfs_out, m_out);
- vsl_b_write(bfs_out, m_out);
- bfs_out.close();
-
- vsl_b_ifstream bfs_in("vnl_sym_matrix_test_double_io.bvl.tmp");
- TEST("Opened vnl_sym_matrix_test_double_io.bvl.tmp for reading", (!bfs_in), false);
- vsl_b_read(bfs_in, m_in1);
- vsl_b_read(bfs_in, m_in2);
- TEST("Finished reading file successfully", (!bfs_in), false);
- bfs_in.close();
-
- vpl_unlink ("vnl_sym_matrix_test_double_io.bvl.tmp");
-
- // m_in1 has content
- TEST("m_out == m_in1", m_out, m_in1);
- // m_in2 empty
- TEST("m_out == m_in2", m_out, m_in2);
-
- vsl_print_summary(vcl_cout, m_out);
- vcl_cout << vcl_endl;
-}
-
-
-void test_sym_matrix_io()
-{
- test_sym_matrix_double_io();
-}
-
-
-TESTMAIN(test_sym_matrix_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_vector_fixed_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_vector_fixed_io.cxx
deleted file mode 100644
index 5375fb78be8edf4e73c5c5d4570656169823c905..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_vector_fixed_io.cxx
+++ /dev/null
@@ -1,43 +0,0 @@
-// This is core/vnl/io/tests/test_vector_fixed_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_vector_fixed.h>
-#include <vnl/io/vnl_io_vector_fixed.h>
-#include <vsl/vsl_binary_io.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_vector_fixed_double_3_io()
-{
- vcl_cout << "*************************************\n"
- << "Testing vnl_vector_fixed<double,3> io\n"
- << "*************************************\n";
- //// test constructors, accessors
-
- vnl_vector_fixed<double,3> m_out(1.2,3.4,5.6), m_in;
-
- vsl_b_ofstream bfs_out("vnl_vector_fixed_io.bvl.tmp");
- TEST ("vnl_vector_fixed_io.bvl.tmp for writing", (!bfs_out), false);
- vsl_b_write(bfs_out, m_out);
- bfs_out.close();
-
- vsl_b_ifstream bfs_in("vnl_vector_fixed_io.bvl.tmp");
- TEST ("vnl_vector_fixed_io.bvl.tmp for reading", (!bfs_in), false);
- vsl_b_read(bfs_in, m_in);
- bfs_in.close();
-
- vpl_unlink ("vnl_vector_fixed_io.bvl.tmp");
-
- TEST ("m_out == m_in", m_out, m_in);
-
- vsl_print_summary(vcl_cout, m_out);
- vcl_cout << vcl_endl;
-}
-
-
-void test_vector_fixed_io()
-{
- test_vector_fixed_double_3_io();
-}
-
-
-TESTMAIN(test_vector_fixed_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_vector_io.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_vector_io.cxx
deleted file mode 100644
index 7e1723cf8d82d422d92738cad8bd548eb221adaf..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/tests/test_vector_io.cxx
+++ /dev/null
@@ -1,56 +0,0 @@
-// This is core/vnl/io/tests/test_vector_io.cxx
-#include <vcl_iostream.h>
-#include <vnl/io/vnl_io_vector.h>
-#include <vsl/vsl_binary_io.h>
-#include <testlib/testlib_test.h>
-#include <vpl/vpl.h>
-
-void test_vector_double_io()
-{
- vcl_cout << "*****************************\n"
- << "Testing vnl_vector<double> io\n"
- << "*****************************\n";
- //// test constructors, accessors
- const int n = 50;
- vnl_vector<double> v_out(n), v_in;
-
- for (int i=0; i<n; i++)
- {
- v_out(i) = (double)(i*i);
- }
-
- vcl_cout << "before saving:\t"; vsl_print_summary(vcl_cout, v_out);
-
- vsl_b_ofstream bfs_out("vnl_vector_test_double_io.bvl.tmp");
- TEST ("Created vnl_vector_test_double_io.bvl.tmp for writing",
- (!bfs_out), false);
- vsl_b_write(bfs_out, v_out);
- bfs_out.close();
-
- vcl_cout << "after saving:\t"; vsl_print_summary(vcl_cout, v_out);
-
- vsl_b_ifstream bfs_in("vnl_vector_test_double_io.bvl.tmp");
- TEST ("Opened vnl_vector_test_double_io.bvl.tmp for reading",
- (!bfs_in), false);
- vsl_b_read(bfs_in, v_in);
- TEST ("Finished reading file successfully", (!bfs_in), false);
- bfs_in.close();
-
- vcl_cout << "after reading in:\t"; vsl_print_summary(vcl_cout, v_in);
-
- vpl_unlink ("vnl_vector_test_double_io.bvl.tmp");
-
- TEST ("v_out == v_in", v_out, v_in);
-
- vsl_print_summary(vcl_cout, v_out);
- vcl_cout << vcl_endl;
-}
-
-
-void test_vector_io()
-{
- test_vector_double_io();
-}
-
-
-TESTMAIN(test_vector_io);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_bignum.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_bignum.h
index 2e92c02b00ddcf316205c0f7c57e5ea0b457a491..46a6a81551fd2ceca3840562192a29fd140e5077 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_bignum.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_bignum.h
@@ -14,12 +14,15 @@
#include <vcl_iosfwd.h>
//: Binary save vnl_bignum to stream.
+// \relatesalso vnl_bignum
void vsl_b_write(vsl_b_ostream & os, vnl_bignum const& v);
//: Binary load vnl_bignum from stream.
+// \relatesalso vnl_bignum
void vsl_b_read(vsl_b_istream & is, vnl_bignum & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_bignum
void vsl_print_summary(vcl_ostream & os, vnl_bignum const& b);
#endif // vnl_io_bignum_h
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_diag_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_diag_matrix.h
index 6d15464be1aa3b0cc42003a5c47a712004f74d25..ad2687a3b73963c6d3d0f5d6bfb9dbcb6eda1045 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_diag_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_diag_matrix.h
@@ -9,15 +9,18 @@
#include <vsl/vsl_binary_io.h>
#include <vnl/vnl_diag_matrix.h>
-//: Binary save vnl_real_polynomial to stream.
+//: Binary save vnl_diag_matrix to stream.
+// \relatesalso vnl_diag_matrix
template <class T>
void vsl_b_write(vsl_b_ostream &os, const vnl_diag_matrix<T> & v);
-//: Binary load vnl_real_polynomial from stream.
+//: Binary load vnl_diag_matrix from stream.
+// \relatesalso vnl_diag_matrix
template <class T>
void vsl_b_read(vsl_b_istream &is, vnl_diag_matrix<T> & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_diag_matrix
template <class T>
void vsl_print_summary(vcl_ostream& os,const vnl_diag_matrix<T> & b);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_matrix.h
index c3a9d743a5c4bec4ab91eb64c834a40bbac64d10..f96b2a264f129b94f5c52a43b8694740db0565e5 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_matrix.h
@@ -11,14 +11,17 @@
#include <vcl_iosfwd.h>
//: Binary save vnl_matrix to stream.
+// \relatesalso vnl_matrix
template <class T>
void vsl_b_write(vsl_b_ostream & os, const vnl_matrix<T> & v);
//: Binary load vnl_matrix from stream.
+// \relatesalso vnl_matrix
template <class T>
void vsl_b_read(vsl_b_istream & is, vnl_matrix<T> & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_matrix
template <class T>
void vsl_print_summary(vcl_ostream & os,const vnl_matrix<T> & b);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_matrix_fixed.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_matrix_fixed.h
index ff2274a9fa6a33acb1c3746c43bc6f9d6c893a77..63d41451bc373c3ffd10132bf44cc7802a7b993c 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_matrix_fixed.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_matrix_fixed.h
@@ -10,14 +10,17 @@
#include <vnl/vnl_matrix_fixed.h>
//: Binary save vnl_matrix_fixed to stream.
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned m, unsigned n>
void vsl_b_write(vsl_b_ostream & os, const vnl_matrix_fixed<T,m,n> & v);
//: Binary load vnl_matrix_fixed from stream.
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned m, unsigned n>
void vsl_b_read(vsl_b_istream & is, vnl_matrix_fixed<T,m,n> & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned m, unsigned n>
void vsl_print_summary(vcl_ostream & os,const vnl_matrix_fixed<T,m,n> & b);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_rational.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_rational.h
index cbe31e34a874ed34ef6933a289fdbe10c30ad205..e58c101af23fc7a898139ec285bc2103924704ae 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_rational.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_rational.h
@@ -14,12 +14,15 @@
#include <vcl_iosfwd.h>
//: Binary save vnl_rational to stream.
+// \relatesalso vnl_rational
void vsl_b_write(vsl_b_ostream & os, vnl_rational const& v);
//: Binary load vnl_rational from stream.
+// \relatesalso vnl_rational
void vsl_b_read(vsl_b_istream & is, vnl_rational & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_rational
void vsl_print_summary(vcl_ostream & os, vnl_rational const& b);
#endif // vnl_io_rational_h
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_real_npolynomial.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_real_npolynomial.h
index bca6f8ab8ee54ffb3f0c52483c6b488cfe10e1b2..237c59dd91fd7b510caa5ad6547686d7336a8b37 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_real_npolynomial.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_real_npolynomial.h
@@ -13,12 +13,15 @@
#include <vnl/vnl_real_npolynomial.h>
//: Binary save vnl_real_npolynomial to stream.
+// \relatesalso vnl_real_npolynomial
void vsl_b_write(vsl_b_ostream &os, const vnl_real_npolynomial & v);
//: Binary load vnl_real_polynomial from stream.
+// \relatesalso vnl_real_npolynomial
void vsl_b_read(vsl_b_istream &is, vnl_real_npolynomial & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_real_npolynomial
void vsl_print_summary(vcl_ostream& os,const vnl_real_npolynomial & b);
#endif // vnl_io_real_npolynomial_h
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_real_polynomial.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_real_polynomial.h
index 9f3f266cbe7645d77248bc5f77a81a5964c0c926..e89f8c878fb20cff63d246fc7cd28d4b857c26ab 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_real_polynomial.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_real_polynomial.h
@@ -12,13 +12,16 @@
#include <vsl/vsl_binary_io.h>
#include <vnl/vnl_real_polynomial.h>
-//: Binary save vnl_real_npolynomial to stream.
+//: Binary save vnl_real_polynomial to stream.
+// \relatesalso vnl_real_polynomial
void vsl_b_write(vsl_b_ostream &os, const vnl_real_polynomial & v);
//: Binary load vnl_real_polynomial from stream.
+// \relatesalso vnl_real_polynomial
void vsl_b_read(vsl_b_istream &is, vnl_real_polynomial & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_real_polynomial
void vsl_print_summary(vcl_ostream& os,const vnl_real_polynomial & b);
#endif // vnl_io_real_polynomial_h
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sparse_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sparse_matrix.h
index b582e22b75b98534c2eecdae662f68a4c902e73c..e2fed3dc57987bc345becfe04ecb6e8d5f13df13 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sparse_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sparse_matrix.h
@@ -3,21 +3,24 @@
#define vnl_io_sparse_matrix_h
//:
// \file
-// \author Louise Bucther
+// \author Louise Butcher
// \date 20-Mar-2001
#include <vnl/vnl_sparse_matrix.h>
#include <vsl/vsl_binary_io.h>
//: Binary save vnl_sparse_matrix to stream.
+// \relatesalso vnl_sparse_matrix
template <class T>
void vsl_b_write(vsl_b_ostream & os, const vnl_sparse_matrix<T> & v);
//: Binary load vnl_sparse_matrix from stream.
+// \relatesalso vnl_sparse_matrix
template <class T>
void vsl_b_read(vsl_b_istream & is, vnl_sparse_matrix<T> & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_sparse_matrix
template <class T>
void vsl_print_summary(vcl_ostream & os,const vnl_sparse_matrix<T> & b);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sparse_matrix.txx b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sparse_matrix.txx
index 8b7117eae9f9728fc56531ad426c0183ce1109a0..2d190608676c691854396441a2ad55e646be2196 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sparse_matrix.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sparse_matrix.txx
@@ -9,10 +9,11 @@
#include <vsl/vsl_binary_io.h>
#include <vcl_cassert.h>
-//I/O for vnl_sparse_matrix_pair
+// I/O for vnl_sparse_matrix_pair
//==================================================================================
-//IO Helper functions
+// IO Helper functions
//==================================================================================
+
//=================================================================================
//: Binary save self to stream.
template<class T>
@@ -48,7 +49,6 @@ void vsl_b_read(vsl_b_istream &is, vnl_sparse_matrix_pair<T> & p)
}
}
-//====================================================================================
//================================================================================
//: Output a human readable summary to the stream
template<class T>
@@ -57,7 +57,8 @@ void vsl_print_summary(vcl_ostream& os,const vnl_sparse_matrix_pair<T>& p)
os<< "Sparse matrix pair ( " << p.first << ',' << p.second << " )\n";
}
-//I/O for vnl_sparse_matrix
+// I/O for vnl_sparse_matrix
+
//=================================================================================
//: Binary save self to stream.
template<class T>
@@ -133,10 +134,10 @@ void vsl_b_read(vsl_b_istream &is, vnl_sparse_matrix<T> & p)
for (int j=0;j<row_size;j++)
{
- pair_t p;
- vsl_b_read(is, p);
- indexes[j] = p.first;
- values[j] = p.second;
+ pair_t q;
+ vsl_b_read(is, q);
+ indexes[j] = q.first;
+ values[j] = q.second;
}
p.set_row(i, indexes, values);
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sym_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sym_matrix.h
index 0206fa02ed7c05d279e92505954d77dcfbd457d1..344280dbc32e3c84e386d7f5032980821fffd927 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sym_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_sym_matrix.h
@@ -10,14 +10,17 @@
#include <vnl/vnl_sym_matrix.h>
//: Binary save vnl_matrix to stream.
+// \relatesalso vnl_sym_matrix
template <class T>
void vsl_b_write(vsl_b_ostream & os, const vnl_sym_matrix<T> & v);
//: Binary load vnl_matrix from stream.
+// \relatesalso vnl_sym_matrix
template <class T>
void vsl_b_read(vsl_b_istream & is, vnl_sym_matrix<T> & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_sym_matrix
template <class T>
void vsl_print_summary(vcl_ostream & os,const vnl_sym_matrix<T> & b);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_vector.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_vector.h
index 56c7d4f8b2683e0a92d9a3555a5a26d7cda0b272..79d363f14d9e746e88210637f760886598036cb3 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_vector.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_vector.h
@@ -3,7 +3,7 @@
#define vnl_io_vector_h
//:
// \file
-// \author Louise Bucther
+// \author Louise Butcher
// \date 20-Mar-2001
#include <vsl/vsl_fwd.h>
@@ -11,14 +11,17 @@
#include <vcl_iosfwd.h>
//: Binary save vnl_vector to stream.
+// \relatesalso vnl_vector
template <class T>
void vsl_b_write(vsl_b_ostream & os, const vnl_vector<T> & v);
//: Binary load vnl_vector from stream.
+// \relatesalso vnl_vector
template <class T>
void vsl_b_read(vsl_b_istream & is, vnl_vector<T> & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_vector
template <class T>
void vsl_print_summary(vcl_ostream & os,const vnl_vector<T> & b);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_vector_fixed.h b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_vector_fixed.h
index c9e434e8e96c6dd5e36c9480f7db2aeb16b9fb50..e1197f25f52ad569e07c817d03362dfeae767b9c 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_vector_fixed.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/io/vnl_io_vector_fixed.h
@@ -11,14 +11,17 @@
#include <vcl_iosfwd.h>
//: Binary save vnl_vector_fixed to stream.
+// \relatesalso vnl_vector_fixed
template <class T, unsigned n>
void vsl_b_write(vsl_b_ostream & os, const vnl_vector_fixed<T,n> & v);
//: Binary load vnl_vector_fixed from stream.
+// \relatesalso vnl_vector_fixed
template <class T, unsigned n>
void vsl_b_read(vsl_b_istream & is, vnl_vector_fixed<T,n> & v);
//: Print human readable summary of object to a stream
+// \relatesalso vnl_vector_fixed
template <class T, unsigned n>
void vsl_print_summary(vcl_ostream & os,const vnl_vector_fixed<T,n> & b);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/core/vnl/tests/CMakeLists.txt
deleted file mode 100644
index 5233bc35b38ec2e4dbfb209eeb874fae596fcb3b..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/CMakeLists.txt
+++ /dev/null
@@ -1,85 +0,0 @@
-# This is core/vnl/tests/CMakeLists.txt
-
-ADD_EXECUTABLE( vnl_test_all
- # Driver source and utilities
- test_driver.cxx
-
- # The tests
- test_bignum.cxx
- test_complex.cxx
- test_inverse.cxx
- test_diag_matrix.cxx
- test_file_matrix.cxx
- test_finite.cxx
- test_math.cxx
- #test_matlab.cxx # Removing for ITK: needs vul and vpl
- test_matrix.cxx
- test_matrix_exp.cxx
- test_matrix_fixed.cxx
- test_vector_fixed_ref.cxx
- test_matrix_fixed_ref.cxx
- test_numeric_traits.cxx
- test_quaternion.cxx
- test_rational.cxx
- test_real_polynomial.cxx
- test_real_npolynomial.cxx
- test_resize.cxx
- test_rotation_matrix.cxx
- test_sample.cxx
- test_sym_matrix.cxx
- test_transpose.cxx
- test_fastops.cxx
- test_vector.cxx
- test_gamma.cxx
- test_random.cxx
- test_arithmetic.cxx test_arithmetic_body.h
- test_hungarian_algorithm.cxx
- test_integrant.cxx
- test_bessel.cxx
-)
-
-IF(CMAKE_COMPILER_IS_GNUCXX)
- SET_SOURCE_FILES_PROPERTIES(test_rational.cxx PROPERTIES COMPILE_FLAGS -O1)
- SET_SOURCE_FILES_PROPERTIES(test_bignum.cxx PROPERTIES COMPILE_FLAGS -O3)
- SET_SOURCE_FILES_PROPERTIES(test_finite.cxx PROPERTIES COMPILE_FLAGS -O0)
-ENDIF(CMAKE_COMPILER_IS_GNUCXX)
-
-TARGET_LINK_LIBRARIES(vnl_test_all itkvnl itktestlib ${CMAKE_THREAD_LIBS})
-
-ADD_EXECUTABLE(vnl_basic_operation_timings basic_operation_timings.cxx)
-TARGET_LINK_LIBRARIES(vnl_basic_operation_timings itkvnl)
-
-ADD_TEST( vnl_test_bignum ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_bignum )
-ADD_TEST( vnl_test_complex ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_complex )
-ADD_TEST( vnl_test_diag_matrix ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_diag_matrix )
-ADD_TEST( vnl_test_file_matrix ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_file_matrix )
-ADD_TEST( vnl_test_finite ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_finite )
-ADD_TEST( vnl_test_inverse ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_inverse )
-ADD_TEST( vnl_test_math ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_math )
-#ADD_TEST( vnl_test_matlab ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_matlab )
-ADD_TEST( vnl_test_matrix ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_matrix )
-ADD_TEST( vnl_test_matrix_exp ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_matrix_exp )
-ADD_TEST( vnl_test_matrix_fixed ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_matrix_fixed )
-ADD_TEST( vnl_test_vector_fixed_ref ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_vector_fixed_ref )
-ADD_TEST( vnl_test_matrix_fixed_ref ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_matrix_fixed_ref )
-ADD_TEST( vnl_test_numeric_traits ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_numeric_traits )
-ADD_TEST( vnl_test_random ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_random )
-ADD_TEST( vnl_test_rational ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_rational )
-ADD_TEST( vnl_test_real_polynomial ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_real_polynomial )
-ADD_TEST( vnl_test_real_npolynomial ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_real_npolynomial )
-ADD_TEST( vnl_test_resize ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_resize )
-ADD_TEST( vnl_test_rotation_matrix ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_rotation_matrix )
-ADD_TEST( vnl_test_sample ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_sample )
-ADD_TEST( vnl_test_sym_matrix ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_sym_matrix )
-ADD_TEST( vnl_test_transpose ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_transpose )
-ADD_TEST( vnl_test_fastops ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_fastops )
-ADD_TEST( vnl_test_vector ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_vector )
-ADD_TEST( vnl_test_gamma ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_gamma )
-ADD_TEST( vnl_test_arithmetic ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_arithmetic )
-ADD_TEST( vnl_test_hungarian_algorithm ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_hungarian_algorithm )
-ADD_TEST( vnl_test_integrant ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_integrant )
-ADD_TEST( vnl_test_bessel ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_bessel )
-ADD_TEST( vnl_test_quaternion ${EXECUTABLE_OUTPUT_PATH}/vnl_test_all test_quaternion )
-
-ADD_EXECUTABLE(vnl_test_include test_include.cxx)
-TARGET_LINK_LIBRARIES(vnl_test_include itkvnl_algo itkvnl)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/basic_operation_timings.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/basic_operation_timings.cxx
deleted file mode 100644
index 318f1a8b6feac9640e9febba1bc1c4dfdac24ced..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/basic_operation_timings.cxx
+++ /dev/null
@@ -1,214 +0,0 @@
-//:
-// \file
-// \brief Tool to test performance of various vnl operations.
-// \author Ian Scott
-
-#include <vcl_vector.h>
-#include <vcl_iostream.h>
-#include <vcl_fstream.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_random.h>
-#include <vcl_ctime.h>
-#include <vcl_algorithm.h>
-#include <vcl_string.h>
-
-const unsigned nstests = 10;
-
-
-void fill_with_rng(double * begin, double * end, double a, double b, vnl_random &rng)
-{
- while (begin != end)
- {
- *begin = rng.drand64(a, b);
- ++begin;
- }
-}
-
-void fill_with_rng(float * begin, float * end, float a, float b, vnl_random &rng)
-{
- while (begin != end)
- {
- *begin = (float) rng.drand32(a, b);
- ++begin;
- }
-}
-
-template <class T>
-void distance_squared(const vcl_vector<vnl_vector<T> > &s1,
- const vcl_vector<vnl_vector<T> > &s2,
- vcl_vector<T> & d, int n_loops)
-{
- vnl_vector<double> stats(nstests);
- for (unsigned st=0;st<nstests;++st)
- {
- vcl_clock_t t0=vcl_clock();
- for (int l=0;l<n_loops;++l)
- {
- for (unsigned i=0;i<d.size();++i)
- d[i] = vnl_vector_ssd(s1[i], s2[i]);
- }
- vcl_clock_t t1=vcl_clock();
- stats[st] = (1e9*((double(t1)-double(t0)))/((double)n_loops*(double)CLOCKS_PER_SEC));
- }
- vcl_sort(stats.begin(), stats.end());
- vcl_cout<<" Mean: "<<stats.mean()
- <<"ns +/-"<<stats((unsigned)(nstests*0.75))-stats((unsigned)(nstests*0.25))<<"ns\n\n";
-}
-
-template <class T>
-void dot_product(const vcl_vector<vnl_vector<T> > &s1,
- const vcl_vector<vnl_vector<T> > &s2,
- vcl_vector<T> & d, int n_loops)
-{
- vnl_vector<double> stats(nstests);
- for (unsigned st=0;st<nstests;++st)
- {
- vcl_clock_t t0=vcl_clock();
- for (int l=0;l<n_loops;++l)
- {
- for (unsigned i=0;i<d.size();++i)
- d[i] = dot_product(s1[i], s2[i]);
- }
- vcl_clock_t t1=vcl_clock();
- stats[st] = (1e9*((double(t1)-double(t0)))/((double)n_loops*(double)CLOCKS_PER_SEC));
- }
- vcl_sort(stats.begin(), stats.end());
- vcl_cout<<" Mean: "<<stats.mean()
- <<"ns +/-"<<stats((unsigned)(nstests*0.75))-stats((unsigned)(nstests*0.25))<<"ns\n\n";
-}
-
-template <class T>
-void mat_x_vec(const vnl_matrix<T> &s1, const vcl_vector<vnl_vector<T> > &s2,
- int n_loops)
-{
- vnl_vector<double> stats(nstests);
- for (unsigned st=0;st<nstests;++st)
- {
- vcl_clock_t t0=vcl_clock();
- for (int l=0;l<n_loops;++l)
- {
- for (unsigned i=0;i<s2.size();++i)
- s1 * s2[i];
- }
- vcl_clock_t t1=vcl_clock();
- stats[st] = (1e6*((double(t1)-double(t0)))/((double)n_loops*(double)CLOCKS_PER_SEC));
- }
- vcl_sort(stats.begin(), stats.end());
- vcl_cout<<" Mean: "<<stats.mean()
- <<"us +/-"<<stats((unsigned)(nstests*0.75))-stats((unsigned)(nstests*0.25))<<"us\n\n";
-}
-
-template <class T>
-void vec_x_mat(const vcl_vector<vnl_vector<T> > &s1, const vnl_matrix<T> &s2,
- int n_loops)
-{
- vnl_vector<double> stats(nstests);
- for (unsigned st=0;st<nstests;++st)
- {
- vcl_clock_t t0=vcl_clock();
- for (int l=0;l<n_loops;++l)
- {
- for (unsigned i=0;i<s2.size();++i)
- s1[i] * s2;
- }
- vcl_clock_t t1=vcl_clock();
- stats[st] = (1e6*((double(t1)-double(t0)))/((double)n_loops*(double)CLOCKS_PER_SEC));
- }
- vcl_sort(stats.begin(), stats.end());
- vcl_cout<<" Mean: "<<stats.mean()
- <<"us +/-"<<stats((unsigned)(nstests*0.75))-stats((unsigned)(nstests*0.25))<<"us\n\n";
-}
-
-template <class T>
-void print_pointers(const vcl_vector<vnl_vector<T> >&va, const vcl_vector<vnl_vector<T> >&vb,
- const vcl_vector<vnl_vector<T> >&vc, const vcl_vector<T>&na,
- const vnl_matrix<T>&ma, const vcl_string& file)
-{
-#ifdef DEBUG
- unsigned i;
- vcl_ofstream os(file.c_str());
- os << "Data values\n"
- << "\nva:" << &va.front() << ' ' << &va.back() << '\n';
- for (i=0; i<va.size(); ++i)
- { os << va[i].data_block() << va[i].size() << '\n'; }
-
- os << "\n\nvb:" << &vb.front() << ' ' << &vb.back() << '\n';
- for (i=0; i<vb.size(); ++i)
- { os << vb[i].data_block() << vb[i].size() << '\n'; }
-
- os << "\n\nvc:" << &vc.front() << ' ' << &vc.back() << '\n';
- for (i=0; i<vc.size(); ++i)
- { os << vc[i].data_block() << vc[i].size() << '\n'; }
-
- os << "\n\nna:" << &na.front() << ' ' << &na.back() << '\n'
-
- << "\n\nma:" << ma.data_block() << ' ' << ma.rows() << ' ' << ma.cols() << '\n';
- for (i=0; i<ma.rows(); ++i)
- { os << ma[i] << '\n'; }
-#else
- (void)va;
- (void)vb;
- (void)vc;
- (void)na;
- (void)ma;
- (void)file;
-#endif // DEBUG
-}
-
-template <class T>
-void run_for_size(unsigned m, unsigned n, T /*dummy*/, const char * type, const char *size,
- vnl_random &rng)
-{
- const unsigned n_data = 10;
- vcl_vector<vnl_vector<T> > x(n_data), y(n_data), z(n_data);
- vcl_vector<T> v(n_data);
- vnl_matrix<T> A(m,n);
-
- for (unsigned k=0;k<n_data;++k)
- {
- x[k].set_size(n);
- z[k].set_size(m);
- y[k].set_size(m);
- fill_with_rng(x[k].begin(), x[k].end(), T(-10000),T(10000), rng);
- fill_with_rng(y[k].begin(), y[k].end(), T(-10000),T(10000), rng);
- fill_with_rng(z[k].begin(), z[k].end(), T(-10000),T(10000), rng);
- }
- fill_with_rng(A.begin(), A.end(), -10000,10000, rng);
-
- int n_loops = 1000000/m;
- vcl_cout<<"\nTimes to operator on "<<type<<' '<<m<<"-d vectors and "
- <<m<<" x "<<n<<" matrices, size " << size << '\n'
- <<"Sum of square differences " << vcl_flush;
- distance_squared(z,y,v,n_loops);
- print_pointers(z, y, x, v, A, vcl_string("testA")+type+size);
- vcl_cout<<"Vector dot product " << vcl_flush;
- print_pointers(z, y, x, v, A, vcl_string("testB")+type+size);
- dot_product(z,y,v,n_loops);
- print_pointers(z, y, x, v, A, vcl_string("testC")+type+size);
- vcl_cout<<"Matrix x Vector multiplication " << vcl_flush;
- mat_x_vec(A,x,n_loops/n+1);
- print_pointers(z, y, x, v, A, vcl_string("testD")+type+size);
-#if 0
- vcl_cout<<"Vector x Matrix multiplication " << vcl_flush;
- vec_x_mat(y,A,n_loops/n+1);
-#endif
- print_pointers(z, y, x, v, A, vcl_string("testE")+type+size);
-}
-
-int main(int, char *[])
-{
- vcl_cout << "Range = 75%tile-25%tile\n";
- vnl_random rng(9667566ul);
- run_for_size(2, 20, double(), "double", "2x20", rng);
- run_for_size(300, 300, double(), "double", "300x300", rng);
- run_for_size(100, 10000, double(), "double", "100x10000", rng);
- run_for_size(10000, 100, double(), "double", "10000x100", rng);
- run_for_size(30, 30000, double(), "double", "30x30000", rng);
- run_for_size(2, 20, float(), "float", "2x20", rng);
- run_for_size(300, 300, float(), "float", "300x300", rng);
- run_for_size(100, 10000, float(), "float", "100x10000", rng);
- run_for_size(10000, 100, float(), "float", "10000x100", rng);
- run_for_size(30, 30000, float(), "float", "30x30000", rng);
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/data_3x3_matrix b/Utilities/ITK/Utilities/vxl/core/vnl/tests/data_3x3_matrix
deleted file mode 100644
index eb58eb1e75b4da23ed250da8964f5fc49ee0d281..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/data_3x3_matrix
+++ /dev/null
@@ -1,3 +0,0 @@
- 0.9501 0.4860 0.4565
- 0.2311 0.8913 0.0185
- 0.6068 0.7621 0.8214
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_arithmetic.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_arithmetic.cxx
deleted file mode 100644
index c34b4efbe9bbd2cd07cb108ffc9c32ff0156f391..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_arithmetic.cxx
+++ /dev/null
@@ -1,82 +0,0 @@
-#include <testlib/testlib_test.h>
-
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_vector_ref.h>
-#include <vnl/vnl_matrix_ref.h>
-#include <vnl/vnl_vector_fixed.h>
-#include <vnl/vnl_matrix_fixed.h>
-
-#include <vcl_cassert.h>
-#include <vcl_iostream.h>
-
-
-// --- dynamic ------------------------------
-
-#define NewMat(mat, r,c,data) \
- assert( sizeof(data) >= r*c*sizeof(double) ); \
- vnl_matrix<double> mat( data, r, c )
-#define NewVec(vec, n,data) \
- assert( sizeof(data) >= n*sizeof(double) ); \
- vnl_vector<double> vec( data, n )
-
-static
-void
-test_arithmetic_dynamic()
-{
-#include "test_arithmetic_body.h"
-}
-
-#undef NewMat
-#undef NewVec
-
-
-// --- ref ----------------------------------
-
-#define NewMat(mat, r,c,data) \
- assert( sizeof(data) >= r*c*sizeof(double) ); \
- vnl_matrix_ref<double> mat( r, c, data )
-#define NewVec(vec, n,data) \
- assert( sizeof(data) >= n*sizeof(double) ); \
- vnl_vector_ref<double> vec( n, data )
-
-static
-void
-test_arithmetic_ref()
-{
-#include "test_arithmetic_body.h"
-}
-
-
-// --- fixed --------------------------------
-
-#undef NewMat
-#undef NewVec
-
-#define NewMat(mat, r,c,data) \
- assert( sizeof(data) >= r*c*sizeof(double) ); \
- vnl_matrix_fixed<double,r,c> mat( data )
-#define NewVec(vec, n,data) \
- assert( sizeof(data) >= n*sizeof(double) ); \
- vnl_vector_fixed<double,n> vec( data )
-
-void
-test_arithmetic_fixed()
-{
-#include "test_arithmetic_body.h"
-}
-
-#undef NewMat
-#undef NewVec
-
-void test_arithmetic()
-{
- vcl_cout << "---- dynamic ----\n";
- test_arithmetic_dynamic();
- vcl_cout << "---- reference ----\n";
- test_arithmetic_ref();
- vcl_cout << "---- fixed ----\n";
- test_arithmetic_fixed();
-}
-
-TESTMAIN( test_arithmetic );
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_arithmetic_body.h b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_arithmetic_body.h
deleted file mode 100644
index d718ca01fddb2e69c9c3a20af31ae7701e09b3fe..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_arithmetic_body.h
+++ /dev/null
@@ -1,301 +0,0 @@
-#ifndef vnl_test_arithmetic_body_h_
-#define vnl_test_arithmetic_body_h_
-// See test_arithmetic.cxx for the actual test.
-
-// This is a "generic" test body. It expects the macros NewMat and
-// NewVec to be defined. The semantics are:
-//
-// NewMat( m, r, c, data ) : define a r x c double matrix m
-// initialized from (or referring to) data.
-// NewVec( v, n, data ) : define an n-dimensional double vector v
-// initialized from (or referring to) data.
-//
-// data will be an array of size >= r*c for NewMat, >= n for NewVec.
-
-
-//void
-//test_arithmetic()
-//{
- double m1_data[] = { 1, 2, 3, 4, 5, 6 };
- double m2_data[] = { 7, 8, 9, 1, 2, 3 };
- double m3_data[] = { 3, 4, 5, 6, 7, 8 };
- double v1_data[] = { 3, 2 };
- double v2_data[] = { 1, 4 };
- double v3_data[] = { 1, 2, 3 };
-
- double m1_data_copy[] = { 1, 2, 3, 4, 5, 6 };
- double m2_data_copy[] = { 7, 8, 9, 1, 2, 3 };
- //double m3_data_copy[] = { 3, 4, 5, 6, 7, 8 };
- double v1_data_copy[] = { 3, 2 };
- double v2_data_copy[] = { 1, 4 };
- //double v3_data_copy[] = { 1, 2, 3 };
-
- // Storage for temporary vectors/matrices, when the actual type is a
- // reference.
- double tmp1[100];
-
- testlib_test_begin( "3x2 matrix construction" );
- NewMat( m1, 3, 2, m1_data );
- testlib_test_perform(
- m1.rows() == 3 && m1.cols() == 2 &&
- m1(0,0)==1 && m1(0,1)==2 &&
- m1(1,0)==3 && m1(1,1)==4 &&
- m1(2,0)==5 && m1(2,1)==6
- );
-
- testlib_test_begin( "2x3 matrix construction" );
- NewMat( m3, 2, 3, m3_data );
- testlib_test_perform(
- m3.rows() == 2 && m3.cols() == 3 &&
- m3(0,0)==3 && m3(0,1)==4 && m3(0,2)==5 &&
- m3(1,0)==6 && m3(1,1)==7 && m3(1,2)==8
- );
-
- testlib_test_begin( "2 vector construction" );
- NewVec( v1, 2, v1_data );
- testlib_test_perform(
- v1.size() == 2 &&
- v1[0] == 3 && v1[1] == 2
- );
-
- testlib_test_begin( "3 vector construction" );
- NewVec( v3, 3, v3_data );
- testlib_test_perform(
- v3.size() == 3 &&
- v3[0] == 1 && v3[1] == 2 && v3[2] == 3
- );
-
-
- // Assume these will work
- NewMat( m2, 3, 2, m2_data );
- NewVec( v2, 2, v2_data );
- NewMat( m1_orig, 3, 2, m1_data_copy );
- NewMat( m2_orig, 3, 2, m2_data_copy );
- //NewMat( m3_orig, 3, 2, m3_data_copy );
- NewVec( v1_orig, 2, v1_data_copy );
- NewVec( v2_orig, 2, v2_data_copy );
- //NewVec( v3_orig, 2, v3_data_copy );
-
- // Equality
- {
- TEST( "Equality operator/1", v1 == v1_orig, true );
- TEST( "Equality operator/2", v1 == v2_orig, false );
- TEST( "Inequality operator/1", v1 != v1_orig, false );
- TEST( "Inequality operator/2", v1 != v2_orig, true );
- }
-
- // Assignment should do a data copy, even if the types are
- // references.
- {
- double v_result_data[] = { 9, 2 };
- NewVec( v_result, 2, v_result_data );
-
- NewVec( tv, 2, tmp1 );
- tv = v1;
- tv(0) = 9;
- TEST( "Assignment on vector", tv == v_result && v1 == v1_orig, true );
-
- double m_result_data[] = { 1, 2, 3, 8, 5, 6 };
- NewMat( m_result, 3, 2, m_result_data );
-
- NewMat( tm, 3, 2, tmp1 );
- tm = m1;
- tm(1,1) = 8;
- TEST( "Assignment on matrix", tm == m_result && m1 == m1_orig, true );
- }
-
- // Addition
- {
- // Vector-vector
- double v_add1_data[] = { 4, 6 };
- NewVec( v_add1, 2, v_add1_data );
-
- NewVec( tv1, 2, tmp1 );
- tv1 = v1;
- tv1 += v2;
- TEST( "v += v", tv1 == v_add1 && v2 == v2_orig, true );
- TEST( "v + v", v1+v2 == v_add1 && v1 == v1_orig && v2 == v2_orig, true );
-
- // Vector-scalar
- double v_add2_data[] = { 8, 7 };
- NewVec( v_add2, 2, v_add2_data );
-
- NewVec( tv2, 2, tmp1 );
- tv2 = v1;
- tv2 += 5;
- TEST( "v += s", tv2 == v_add2, true );
- TEST( "v + s", v1+5.0 == v_add2 && v1 == v1_orig, true );
- TEST( "s + v", 5.0+v1 == v_add2 && v1 == v1_orig, true );
-
- // Matrix-matrix
- double m_add1_data[] = { 8, 10, 12, 5, 7, 9 };
- NewMat( m_add1, 3, 2, m_add1_data );
-
- NewMat( mv1, 3, 2, tmp1 );
- mv1 = m1;
- mv1 += m2;
- TEST( "m += m", mv1 == m_add1 && m2 == m2_orig, true );
- TEST( "m + m", m1+m2 == m_add1 && m1 == m1_orig && m2 == m2_orig, true );
-
- // Matrix-scalar
- double m_add2_data[] = { 4, 5, 6, 7, 8, 9 };
- NewMat( m_add2, 3, 2, m_add2_data );
-
- NewMat( mv2, 3, 2, tmp1 );
- mv2 = m1;
- mv2 += 3;
- TEST( "m += s", mv2 == m_add2, true );
- TEST( "m + s", m1+3.0 == m_add2 && m1 == m1_orig, true );
- TEST( "s + m", 3.0+m1 == m_add2 && m1 == m1_orig, true );
- }
-
- // Subtraction
- {
- // Vector-vector
- double v_sub1_data[] = { 2, -2 };
- NewVec( v_sub1, 2, v_sub1_data );
-
- NewVec( tv1, 2, tmp1 );
- tv1 = v1;
- tv1 -= v2;
- TEST( "v -= v", tv1 == v_sub1 && v2 == v2_orig, true );
- TEST( "v - v", v1-v2 == v_sub1 && v1 == v1_orig && v2 == v2_orig, true );
-
- // Vector-scalar
- double v_sub2_data[] = { 2, 1 };
- NewVec( v_sub2, 2, v_sub2_data );
- double v_sub3_data[] = { -2, -1 };
- NewVec( v_sub3, 2, v_sub3_data );
-
- NewVec( tv2, 2, tmp1 );
- tv2 = v1;
- tv2 -= 1;
- TEST( "v -= s", tv2 == v_sub2, true );
- TEST( "v - s", v1-1.0 == v_sub2 && v1 == v1_orig, true );
- TEST( "s - v", 1.0-v1 == v_sub3 && v1 == v1_orig, true );
-
- // Matrix-matrix
- double m_sub1_data[] = { -6, -6, -6, 3, 3, 3 };
- NewMat( m_sub1, 3, 2, m_sub1_data );
-
- NewMat( mv1, 3, 2, tmp1 );
- mv1 = m1;
- mv1 -= m2;
- TEST( "m -= m", mv1 == m_sub1 && m2 == m2_orig, true );
- TEST( "m - m", m1-m2 == m_sub1 && m1 == m1_orig && m2 == m2_orig, true );
-
- // Matrix+scalar
- double m_sub2_data[] = { 0, 1, 2, 3, 4, 5 };
- double m_sub3_data[] = { 0, -1, -2, -3, -4, -5 };
- NewMat( m_sub2, 3, 2, m_sub2_data );
- NewMat( m_sub3, 3, 2, m_sub3_data );
-
- NewMat( mv2, 3, 2, tmp1 );
- mv2 = m1;
- mv2 -= 1;
- TEST( "m -= s", mv2 == m_sub2, true );
- TEST( "m - s", m1-1.0 == m_sub2 && m1 == m1_orig, true );
- TEST( "s - m", 1.0-m1 == m_sub3 && m1 == m1_orig, true );
- }
-
- // Multiplication
- {
- // Vector-scalar
- double v_mul1_data[] = { 9, 6 };
- NewVec( v_mul1, 2, v_mul1_data );
-
- NewVec( tv1, 2, tmp1 );
- tv1 = v1;
- tv1 *= 3;
- TEST( "v *= s", tv1 == v_mul1, true );
- TEST( "v * s", v1*3.0 == v_mul1 && v1 == v1_orig, true );
- TEST( "s * v", 3.0*v1 == v_mul1 && v1 == v1_orig, true );
-
- // Matrix-scalar
- double m_mul1_data[] = { 2, 4, 6, 8, 10, 12 };
- NewMat( m_mul1, 3, 2, m_mul1_data );
-
- NewMat( mv1, 3, 2, tmp1 );
- mv1 = m1;
- mv1 *= 2;
- TEST( "m *= s", mv1 == m_mul1, true );
- TEST( "m * s", m1*2.0 == m_mul1 && m1 == m1_orig, true );
- TEST( "s * m", 2.0*m1 == m_mul1 && m1 == m1_orig, true );
-
- // Matrix-vector
- double v_mul2_data[] = { 7, 17, 27 };
- NewVec( v_mul2, 3, v_mul2_data );
-
- TEST( "m * v", m1*v1 == v_mul2, true );
- }
-
- // Division
- {
- // Vector-scalar
- double v_div1_data[] = { 1.5, 1 };
- NewVec( v_div1, 2, v_div1_data );
-
- NewVec( tv1, 2, tmp1 );
- tv1 = v1;
- tv1 /= 2;
- TEST( "v /= s", tv1 == v_div1, true );
- TEST( "v / s", v1/2.0 == v_div1 && v1 == v1_orig, true );
-
- // Matrix+scalar
- double m_div1_data[] = { 0.5, 1.0, 1.5, 2.0, 2.5, 3.0 };
- NewMat( m_div1, 3, 2, m_div1_data );
-
- NewMat( tm1, 3, 2, tmp1 );
- tm1 = m1;
- tm1 /= 2;
- TEST( "m /= s", tm1 == m_div1, true );
- TEST( "m / s", m1/2.0 == m_div1 && m1 == m1_orig, true );
- }
-
- // Element product
- {
- // Vector
- double v_ep1_data[] = { 3, 8 };
- NewVec( v_ep1, 2, v_ep1_data );
-
- TEST( "element_product(v,v)", element_product(v1,v2) == v_ep1, true );
-
- // Matrix
- double m_ep1_data[] = { 7, 16, 27, 4, 10, 18 };
- NewMat( m_ep1, 3, 2, m_ep1_data );
-
- TEST( "element_product(m,m)", element_product(m1,m2) == m_ep1, true );
- }
-
- // Element quotient
- {
- // Vector
- double v_eq1_data[] = { 3, 0.5 };
- NewVec( v_eq1, 2, v_eq1_data );
-
- TEST( "element_quotient(v,v)", element_quotient(v1,v2) == v_eq1, true );
-
- // Matrix
- double m_eq1_data[] = { 1.0/7.0, 2.0/8.0, 3.0/9.0, 4.0/1.0, 5.0/2.0, 6.0/3.0 };
- NewMat( m_eq1, 3, 2, m_eq1_data );
-
- TEST( "element_quotient(m,m)", element_quotient(m1,m2) == m_eq1, true );
- }
-
- // Negation
- {
- // Vector
- double v_neg1_data[] = { -3, -2 };
- NewVec( v_neg1, 2, v_neg1_data );
-
- TEST( "-v", -v1 == v_neg1 && v1 == v1_orig, true );
-
- // Matrix
- double m_neg1_data[] = { -1, -2, -3, -4, -5, -6 };
- NewMat( m_neg1, 3, 2, m_neg1_data );
-
- TEST( "-m", -m1 == m_neg1 && m1 == m1_orig, true );
- }
-//}
-
-#endif // vnl_test_arithmetic_body_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_bessel.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_bessel.cxx
deleted file mode 100644
index 4b534fc72afe32b63682e7c9af513e807824602c..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_bessel.cxx
+++ /dev/null
@@ -1,33 +0,0 @@
-// This is core/vnl/tests/test_bessel.cxx
-#include <vnl/vnl_bessel.h>
-// not used? #include <vcl_fstream.h>
-#include <testlib/testlib_test.h>
-
-
-static void test_bessel()
-{
- TEST_NEAR("J_0(0)=1.0",vnl_bessel(0,0.0),1.0,1e-8);
-
- // First zero of Bessel function of order 0
- TEST_NEAR("J_0(2.4048)=0.0",vnl_bessel(0,2.4048),0.0,1e-4);
- // Second zero of Bessel function of order 0
- TEST_NEAR("J_0(5.5201)=0.0",vnl_bessel(0,5.5201),0.0,1e-4);
-
- TEST_NEAR("J_1(0)=0.0",vnl_bessel(1,0.0),0.0,1e-5);
-
- // First zero of Bessel function of order 1
- TEST_NEAR("J_1(3.8315)=0.0",vnl_bessel(1,3.8315),0.0,1e-4);
-
- TEST_NEAR("bessel0(1.23)",vnl_bessel0(1.23),vnl_bessel(0,1.23),1e-8);
- TEST_NEAR("bessel0(0.23)",vnl_bessel0(0.23),vnl_bessel(0,0.23),1e-8);
- TEST_NEAR("bessel0(0.001)",vnl_bessel0(0.001),1.0,1e-5);
-
- // Test consistency
- vnl_vector<double> J(3);
- vnl_bessel(2,1.234,J);
- TEST_NEAR("bessel(0,1.234)",vnl_bessel(0,1.234),J[0],1e-8);
- TEST_NEAR("bessel(1,1.234)",vnl_bessel(1,1.234),J[1],1e-8);
- TEST_NEAR("bessel(2,1.234)",vnl_bessel(2,1.234),J[2],1e-8);
-}
-
-TESTMAIN(test_bessel);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_bignum.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_bignum.cxx
deleted file mode 100644
index 36a77304b98e33de155ae8b30c312f760e3cc1ff..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_bignum.cxx
+++ /dev/null
@@ -1,758 +0,0 @@
-//:
-// \file
-// converted from COOL/test/test_BigNum.C by Peter Vanroose, 25 April 2002.
-
-#include <vcl_iostream.h>
-#include <vcl_limits.h> // for vcl_numeric_limits<double>::infinity()
-#ifndef __alpha__ // On Alpha, compiler runs out of memory when including these
-# include <vcl_sstream.h>
-# include <vcl_iomanip.h>
-#endif
-#include <vnl/vnl_bignum.h>
-#include <vnl/vnl_bignum_traits.h>
-#include <vnl/vnl_numeric_traits.h> // for vnl_numeric_traits<double>::maxval
-
-#include <testlib/testlib_test.h>
-
-static void run_constructor_tests()
-{
- vcl_cout << "\nbignum constructor tests:\n";
-
- vcl_cout << "long constructor:\n";
- {vnl_bignum b(0L); TEST("vnl_bignum b(0L);", b, 0L);}
- {vnl_bignum b(1L); TEST("vnl_bignum b(1L);", b, 1L);}
- {vnl_bignum b(-1L); TEST("vnl_bignum b(-1L);", b, -1L);}
- {vnl_bignum b(0x7fffL); TEST("vnl_bignum b(0x7fffL);", b, 0x7fffL);}
- {vnl_bignum b(-0x7fffL); TEST("vnl_bignum b(-0x7fffL);", b, -0x7fffL);}
- {vnl_bignum b(0x7fffffffL); TEST("vnl_bignum b(0x7fffffffL);", b, 0x7fffffffL);}
- {vnl_bignum b(-0x7fffffffL); TEST("vnl_bignum b(-0x7fffffffL);", b, -0x7fffffffL);}
- {vnl_bignum b(0xf00000L); TEST("vnl_bignum b(0xf00000L);", b, 0xf00000);}
-
- vcl_cout << "double constructor:\n";
- {vnl_bignum b(0.0); TEST("vnl_bignum b(0.0);", (double)b, 0.0);}
- {vnl_bignum b(1.0); TEST("vnl_bignum b(1.0);", (double)b, 1.0);}
- {vnl_bignum b(-1.0); TEST("vnl_bignum b(-1.0);", (double)b, -1.0);}
- {vnl_bignum b(vnl_numeric_traits<double>::maxval);
- TEST("vnl_bignum b(vnl_numeric_traits<double>::maxval);", (double)b, vnl_numeric_traits<double>::maxval);}
- {vnl_bignum b(-vnl_numeric_traits<double>::maxval);
- TEST("vnl_bignum b(-vnl_numeric_traits<double>::maxval);", (double)b, -vnl_numeric_traits<double>::maxval);}
- {vnl_bignum b(1234567.0); TEST("vnl_bignum b(1234567.0);", (double)b, 1234567.0);}
- {vnl_bignum b(-1234567.0); TEST("vnl_bignum b(-1234567.0);", (double)b, -1234567.0);}
- {vnl_bignum b(1234567e3); TEST("vnl_bignum b(1234567e3);", (double)b, 1234567e3);}
- {vnl_bignum b(-1234567e3); TEST("vnl_bignum b(-1234567e3);", (double)b, -1234567e3);}
- {vnl_bignum b(double(0xf00000)); TEST("vnl_bignum b(double(0xf00000));", b, 0xf00000);}
-
- vcl_cout << "long double constructor:\n";
- {vnl_bignum b(0.0L); TEST("vnl_bignum b(0.0L);", (long double)b, 0.0L);}
- {vnl_bignum b(1.0L); TEST("vnl_bignum b(1.0L);", (long double)b, 1.0L);}
- {vnl_bignum b(-1.0L); TEST("vnl_bignum b(-1.0L);", (long double)b, -1.0L);}
- {vnl_bignum b(1234567.0L); TEST("vnl_bignum b(1234567.0L);", (long double)b, 1234567.0L);}
- {vnl_bignum b(-1234567.0L); TEST("vnl_bignum b(-1234567.0L);", (long double)b, -1234567.0L);}
- {vnl_bignum b(1234567e3L); TEST("vnl_bignum b(1234567e3L);", (long double)b, 1234567e3L);}
- {vnl_bignum b(-1234567e3L); TEST("vnl_bignum b(-1234567e3L);", (long double)b, -1234567e3L);}
- {vnl_bignum b((long double)(0xf00000)); TEST("vnl_bignum b((long double)(0xf00000));", (long double)b, (long double)0xf00000);}
-
- vcl_cout << "char* constructor:\n";
- {vnl_bignum b("-1"); TEST("vnl_bignum b(\"-1\");", b, -1L);}
- {vnl_bignum b("+1"); TEST("vnl_bignum b(\"+1\");", b, 1L);}
- {vnl_bignum b("1"); TEST("vnl_bignum b(\"1\");", b, 1L);}
- {vnl_bignum b("123"); TEST("vnl_bignum b(\"123\");", b, 123L);}
- {vnl_bignum b("123e5"); TEST("vnl_bignum b(\"123e5\");", b, 12300000L);}
- {vnl_bignum b("123e+4"); TEST("vnl_bignum b(\"123e+4\");", b, 1230000L);}
- {vnl_bignum b("123e12"); TEST("vnl_bignum b(\"123e12\");", (double)b, 123e12);}
-#ifndef __alpha__ // On Alpha, compiler runs out of memory when using <sstream>
- {vnl_bignum b("-1e120"); vcl_stringstream s; s << b; vcl_cout << b << '\n';
- // verify that b outputs as "-1000...00" (120 zeros)
- bool t = s.str()[0] == '-' && s.str()[1] == '1';
- for (int i=0; i<120; ++i) t = t && s.str()[i+2] == '0';
- TEST("vnl_bignum b(\"-1e120\") outputs first 122 digits as \"-10000...00\"", t, true);
- // This isolates a problem that used to be part of the previous test.
- // I don't think this test failure is a bug in vnl.
- // vnl_bignum seems to populate the stringstream with 122 chars,
- // but the stringstream then reports its size as something else
- // on some systems. - FWW
- TEST("vnl_bignum b(\"-1e120\") outputs a length 122 string", s.str().length(), 122);
- vcl_cout << "length of string: " << s.str().length() << vcl_endl;
- }
-#else
- {vnl_bignum b("-1e120"); vcl_cout << b << '\n';}
-#endif
- {vnl_bignum b("0x0"); TEST("vnl_bignum b(\"0x0\");", b, 0x0);}
- {vnl_bignum b("0x9"); TEST("vnl_bignum b(\"0x9\");", b, 0x9);}
- {vnl_bignum b("0xa"); TEST("vnl_bignum b(\"0xa\");", b, 0xa);}
- {vnl_bignum b("0xf"); TEST("vnl_bignum b(\"0xf\");", b, 0xf);}
- {vnl_bignum b("0xA"); TEST("vnl_bignum b(\"0xA\");", b, 0xa);}
- {vnl_bignum b("0xF"); TEST("vnl_bignum b(\"0xF\");", b, 0xf);}
- {vnl_bignum b("0x1aF"); TEST("vnl_bignum b(\"0x1aF\");", b, 0x1af);}
- {vnl_bignum b("0"); TEST("vnl_bignum b(\"0\");", b, 0);}
- {vnl_bignum b("00"); TEST("vnl_bignum b(\"00\");", b, 0);}
- {vnl_bignum b("012334567"); TEST("vnl_bignum b(\"012334567\");", b, 012334567);}
- {vnl_bignum b("9"); TEST("vnl_bignum b(\"9\");", b, 9);}
- {vnl_bignum b(" 9"); TEST("vnl_bignum b(\" 9\");", b, 9);}
- // infinity:
- {vnl_bignum b("+Inf"); TEST("vnl_bignum b(\"+Inf\");", b.is_plus_infinity(), true);}
- {vnl_bignum b("Infinity"); TEST("vnl_bignum b(\"Infinity\");", b.is_plus_infinity(), true);}
- {vnl_bignum b("-Infin"); TEST("vnl_bignum b(\"-Infin\");", b.is_minus_infinity(), true);}
-
-#ifndef __alpha__ // On Alpha, compiler runs out of memory when using <sstream>
- vcl_cout << "reading from istream:\n";
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "+1"; is >> b; TEST("\"+1\" >> b;", b, 1L);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "-1"; is >> b; TEST("\"-1\" >> b;", b, -1L);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "123"; is >> b; TEST("\"123\" >> b;", b, 123L);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "123e5"; is >> b; TEST("\"123e5\" >> b;", b, 12300000L);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "123e+4"; is >> b; TEST("\"123e+4\" >> b;", b, 1230000L);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "0x0"; is >> b; TEST("\"0x0\" >> b;", b, 0x0);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "0x9"; is >> b; TEST("\"0x9\" >> b;", b, 0x9);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "0xa"; is >> b; TEST("\"0xa\" >> b;", b, 0xa);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "0xf"; is >> b; TEST("\"0xf\" >> b;", b, 0xf);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "0xA"; is >> b; TEST("\"0xA\" >> b;", b, 0xa);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "0xF"; is >> b; TEST("\"0xF\" >> b;", b, 0xf);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "0x1aF"; is >> b; TEST("\"0x1aF\" >> b;", b, 0x1af);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "0"; is >> b; TEST("\"0\" >> b;", b, 0L);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "00"; is >> b; TEST("\"00\" >> b;", b, 0L);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "012334567"; is >> b; TEST("\"012334567\" >> b;", b, 012334567);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << "9"; is >> b; TEST("\"9\" >> b;", b, 9L);}
- {vcl_stringstream is(vcl_ios_in | vcl_ios_out); vnl_bignum b;
- is << " 9"; is >> b; TEST("\" 9\" >> b;", b, 9L);}
-#endif
-
- vcl_cout << "vnl_bignum& constructor:\n";
- {vnl_bignum b50(vnl_bignum(0L));
- TEST("vnl_bignum b50(vnl_bignum(0L));", (long)b50, 0L);}
-
- {vnl_bignum b51(vnl_bignum(100L));
- TEST("vnl_bignum b51(vnl_bignum(100L));", (long)b51, 100L);}
-}
-
-static void run_conversion_operator_tests()
-{
- vcl_cout << "\nConversion operator tests:\n";
-
- vcl_cout << "short conversion operator:\n";
- TEST("short(vnl_bignum(0L)) == 0", short(vnl_bignum(0L)), 0);
- TEST("short(vnl_bignum(0x7fffL)) == 0x7fff", short(vnl_bignum(0x7fffL)), 0x7fff);
- TEST("short(vnl_bignum(-0x7fffL)) == -0x7fff", short(vnl_bignum(-0x7fffL)), -0x7fff);
- TEST("short(vnl_bignum(-0x8000L)) == short(-0x8000)", short(vnl_bignum(-0x8000L)), short(-0x8000));
-
- vcl_cout << "int conversion operator:\n";
- TEST("int(vnl_bignum(0L)) == 0", int(vnl_bignum(0L)), 0);
- TEST("int(vnl_bignum(0x7fffffffL)) == 0x7fffffff", int(vnl_bignum(0x7fffffffL)), 0x7fffffff);
- TEST("int(vnl_bignum(-0x7fffffffL)) == -0x7fffffff", int(vnl_bignum(-0x7fffffffL)), -0x7fffffff);
-
- vcl_cout << "long conversion operator:\n";
- vnl_bignum b(0x7fffffffL);
- ++b;
- // Two casts are used here instead of a direct cast to unsigned long
- // because vnl_bignum does not implement an overload of "cast to
- // unsigned long".
- TEST("vnl_bignum b(0x7fffffffL); ++b; (unsigned long)long(b) == 0x80000000UL", (unsigned long)long(b), 0x80000000UL);
- --b;
- TEST("vnl_bignum b(0x80000000UL); --b; long(b) == 0x7fffffffL", long(b), 0x7fffffffL);
-
- // Use -0x7fffffffL-0x1L below instead of -0x80000000L because the
- // latter is parsed like -(0x80000000L) and 0x80000000L is promoted
- // to unsigned long because it is too big to be a signed long.
- ++b; b = -b;
- TEST("vnl_bignum b(0x7fffffffL); ++b; b=-b; long(b) == -0x7fffffffL-0x1L", long(b), -0x7fffffffL-0x1L);
-
- vcl_cout << "float conversion operator:\n";
- TEST("float(vnl_bignum(0.0)) == 0.0", (float) vnl_bignum(0.0), 0.0);
- TEST("float(vnl_bignum(99999.0)) == 99999.0",
- ((float) vnl_bignum(99999.0)), 99999.0);
- TEST("float(vnl_bignum(vnl_numeric_traits<float>::maxval)) == vnl_numeric_traits<float>::maxval",
- (vnl_numeric_traits<float>::maxval), (float) vnl_bignum(vnl_numeric_traits<float>::maxval));
- TEST("float(vnl_bignum(-vnl_numeric_traits<float>::maxval)) == -vnl_numeric_traits<float>::maxval",
- (-vnl_numeric_traits<float>::maxval), float(vnl_bignum(-vnl_numeric_traits<float>::maxval)));
- TEST("float(vnl_bignum(\"+Inf\")) == +Inf", (float) vnl_bignum("+Inf"), vcl_numeric_limits<float>::infinity());
-
- b = vnl_numeric_traits<double>::maxval;
- ++b;
- TEST("vnl_numeric_traits<double>::maxval + 1 is valid", b.is_infinity(), false);
-
- vcl_cout << "double conversion operator:\n";
- TEST("double(vnl_bignum(0.0)) == 0.0", (double) vnl_bignum(0.0), 0.0);
- TEST("double(vnl_bignum(99999.0)) == 99999.0",
- (double) vnl_bignum(99999.0), 99999.0);
- TEST("double(vnl_bignum(1e300)) == 1e300",
- double(vnl_bignum(1e300)), 1e300);
- TEST("double(vnl_bignum(-1e300)) == -1e300",
- double(vnl_bignum(-1e300)), -1e300);
- TEST("double(vnl_bignum(vnl_numeric_traits<float>::maxval)) == vnl_numeric_traits<float>::maxval",
- (vnl_numeric_traits<float>::maxval), (double) vnl_bignum(vnl_numeric_traits<float>::maxval));
- TEST("double(vnl_bignum(-vnl_numeric_traits<float>::maxval)) == -vnl_numeric_traits<float>::maxval",
- (-vnl_numeric_traits<float>::maxval), double(vnl_bignum(-vnl_numeric_traits<float>::maxval)));
- TEST("double(vnl_bignum(vnl_numeric_traits<double>::maxval)) == vnl_numeric_traits<double>::maxval",
- (double) vnl_bignum(vnl_numeric_traits<double>::maxval), vnl_numeric_traits<double>::maxval);
- TEST("double(vnl_bignum(-vnl_numeric_traits<double>::maxval)) == -vnl_numeric_traits<double>::maxval",
- (double) vnl_bignum(-vnl_numeric_traits<double>::maxval), -vnl_numeric_traits<double>::maxval);
- TEST("double(vnl_bignum(\"+Inf\")) == +Inf", (double) vnl_bignum("+Inf"), vcl_numeric_limits<double>::infinity());
-
- // Test for bug in bignum::dtobignum()
- // it wasn't resetting the value at the start.
- const vnl_bignum e(1000);
- vnl_bignum d(20);
- vnl_bignum_from_string(d, "1000");
- TEST("vnl_bignum_from_string", e, d);
-}
-
-static void run_assignment_tests()
-{
- vcl_cout << "\nStarting assignment tests:\n";
- vnl_bignum b1;
-
- TEST_RUN ("vnl_bignum b1; b1 = 0xffff;", b1 = 0xffffL, long(b1), 0xffffL);
-
- // double assignment operator
- TEST_RUN ("double(b1) == -1.23e6", b1 = -1.23e6, double(b1), -1.23e6);
-
- // long assignment operator
- TEST_RUN ("long(b1) = -0x7fffffff", b1 = -0x7fffffffL, long(b1), -0x7fffffff);
-
- // char * assignment operator
- TEST_RUN ("long(b1) = 0x1fffffL", b1 = "0x1fffff", long(b1), 0x1fffffL);
-
-
- // vnl_bignum& assignment operator
- b1 = "0";
- vnl_bignum b5(0x1ffffL);
- TEST_RUN ("b1 = b5", b1 = b5, b1, b5);
-}
-
-static void run_logical_comparison_tests()
-{
- vcl_cout << "\nStarting logical comparison tests:\n";
- vnl_bignum b0(0L);
- vnl_bignum b1(1L);
- vnl_bignum b2(0x7fffL);
- vnl_bignum b3(-0x7fffL);
- vnl_bignum p_inf("+Inf");
- vnl_bignum m_inf("-Inf");
-
- TEST("b0 == b0", b0 == b0, true);
- TEST("b0 == b1", b0 == b1, false);
- TEST("b0 == b2", b0 == b2, false);
- TEST("b0 == b3", b0 == b3, false);
- TEST("b1 == b1", b1 == b1, true);
- TEST("b1 == b2", b1 == b2, false);
- TEST("b1 == b3", b1 == b3, false);
- TEST("b2 == b2", b2 == b2, true);
- TEST("b2 == b3", b2 == b3, false);
- TEST("b3 == b3", b3 == b3, true);
- TEST("p_inf == p_inf", p_inf == p_inf, true);
- TEST("p_inf == m_inf", p_inf == m_inf, false);
- TEST("m_inf == m_inf", m_inf == m_inf, true);
- TEST("b0 == p_inf", b0 == p_inf, false);
- TEST("b1 == p_inf", b1 == p_inf, false);
- TEST("b2 == p_inf", b2 == p_inf, false);
- TEST("b3 == p_inf", b3 == p_inf, false);
- TEST("b0 == m_inf", b0 == m_inf, false);
- TEST("b1 == m_inf", b1 == m_inf, false);
- TEST("b2 == m_inf", b2 == m_inf, false);
- TEST("b3 == m_inf", b3 == m_inf, false);
-
- TEST("b0 != b0", b0 != b0, false);
- TEST("b0 != b1", b0 != b1, true);
- TEST("b0 != b2", b0 != b2, true);
- TEST("b0 != b3", b0 != b3, true);
- TEST("b1 != b1", b1 != b1, false);
- TEST("b1 != b2", b1 != b2, true);
- TEST("b1 != b3", b1 != b3, true);
- TEST("b2 != b2", b2 != b2, false);
- TEST("b2 != b3", b2 != b3, true);
- TEST("b3 != b3", b3 != b3, false);
-
- TEST("b0 < b0", b0 < b0, false);
- TEST("b0 < b1", b0 < b1, true);
- TEST("b0 < b2", b0 < b2, true);
- TEST("b0 < b3", b0 < b3, false);
- TEST("b1 < b1", b1 < b1, false);
- TEST("b1 < b2", b1 < b2, true);
- TEST("b1 < b3", b1 < b3, false);
- TEST("b2 < b2", b2 < b2, false);
- TEST("b2 < b3", b2 < b3, false);
- TEST("b3 < b3", b3 < b3, false);
- TEST("p_inf < p_inf", p_inf < p_inf, false);
- TEST("p_inf < m_inf", p_inf < m_inf, false);
- TEST("m_inf < p_inf", m_inf < p_inf, true);
- TEST("m_inf < m_inf", m_inf < m_inf, false);
- TEST("b0 < p_inf", b0 < p_inf, true);
- TEST("b1 < p_inf", b1 < p_inf, true);
- TEST("b2 < p_inf", b2 < p_inf, true);
- TEST("b3 < p_inf", b3 < p_inf, true);
- TEST("b0 < m_inf", b0 < m_inf, false);
- TEST("b1 < m_inf", b1 < m_inf, false);
- TEST("b2 < m_inf", b2 < m_inf, false);
- TEST("b3 < m_inf", b3 < m_inf, false);
-
- TEST("b0 > b0", b0 > b0, false);
- TEST("b0 > b1", b0 > b1, false);
- TEST("b0 > b2", b0 > b2, false);
- TEST("b0 > b3", b0 > b3, true);
- TEST("b1 > b1", b1 > b1, false);
- TEST("b1 > b2", b1 > b2, false);
- TEST("b1 > b3", b1 > b3, true);
- TEST("b2 > b2", b2 > b2, false);
- TEST("b2 > b3", b2 > b3, true);
- TEST("b3 > b3", b3 > b3, false);
- TEST("p_inf > p_inf", p_inf > p_inf, false);
- TEST("p_inf > m_inf", p_inf > m_inf, true);
- TEST("m_inf > p_inf", m_inf > p_inf, false);
- TEST("m_inf > m_inf", m_inf > m_inf, false);
- TEST("b0 > p_inf", b0 > p_inf, false);
- TEST("b1 > p_inf", b1 > p_inf, false);
- TEST("b2 > p_inf", b2 > p_inf, false);
- TEST("b3 > p_inf", b3 > p_inf, false);
- TEST("b0 > m_inf", b0 > m_inf, true);
- TEST("b1 > m_inf", b1 > m_inf, true);
- TEST("b2 > m_inf", b2 > m_inf, true);
- TEST("b3 > m_inf", b3 > m_inf, true);
-
- TEST("b3 != b2", b3 != b2, true);
- TEST("b3 != b3", b3 != b3, false);
- TEST("b3 < b2", b3 < b2, true);
- TEST("b3 <= b2", b3 <= b2, true);
- TEST("b3 <= b3", b3 <= b3, true);
- TEST("b3 > b3", b3 > b3, false);
- TEST("b3 > b2", b3 > b2, false);
- TEST("b3 >= b2", b3 >= b2, false);
- TEST("b3 >= b3", b3 >= b3, true);
- TEST("b2 >= b2", b2 >= b2, true);
- vcl_cout << b2 << " == " << &b2 << vcl_endl;
- TEST("<<", 1, 1);
-}
-
-static void run_division_tests()
-{
- vcl_cout << "\nStarting division tests:\n";
-
- TEST("long(vnl_bignum(0L)/vnl_bignum(1L))", long(vnl_bignum(0L)/vnl_bignum(1L)), 0L);
- TEST("long(vnl_bignum(-1L)/vnl_bignum(1L))", long(vnl_bignum(-1L)/vnl_bignum(1L)), -1L);
- TEST("long(vnl_bignum(-1L)/vnl_bignum(\"+Inf\"))", long(vnl_bignum(-1L)/vnl_bignum("+Inf")), 0L);
- TEST("vnl_bignum(\"+Inf\")/(-1L)", vnl_bignum("+Inf")/(-1L), vnl_bignum("-Inf"));
- TEST("vnl_bignum(-1L)/0L", vnl_bignum(-1L)/0L, vnl_bignum("-Inf"));
-
- long i,j,k,l;
- long div_errors = 0;
- long mod_errors = 0;
-
- vcl_cout << " for (i = 0xffffff; i > 0; i /= 0x10)\n"
- << " for (j = 0x7ffffff; j > 0; j /= 0x10)\n"
- << " for (k = 1; k < 17; ++k)\n"
- << " for (l = 1; l < 17; ++l)\n ";
- for (i = 0xffffff; i > 0; i /= 0x10) {
- vcl_cout.put('.');
- vcl_cout.flush();
- for (j = 0x7ffffff; j > 0; j /= 0x10) {
- for (k = 1; k < 17; ++k) {
- for (l = 1; l < 17; ++l) {
- vnl_bignum b1(i+k);
- vnl_bignum b2(j+l);
- vnl_bignum b3(long((i+k)/(j+l)));
- if (b1/b2 != b3) {
- TEST("(vnl_bignum(i+k)/vnl_bignum(j+l)) == vnl_bignum(long((i+k)/(j+l)))", false, true);
-#ifndef __alpha__ // On Alpha, compiler runs out of memory when using <iomanip>
- vcl_cout<<vcl_hex<< "i=0x"<<i<<", j=0x"<<j<<", k=0x"<<k<<", l="<<l
- <<vcl_dec<<", b1="<<b1<<", b2="<<b2<<", b3="<<b3<<'\n';
-#endif
- ++div_errors;
- }
- b3 = vnl_bignum(long((i+k)%(j+l)));
- if (b1%b2 != b3) {
- TEST("(vnl_bignum(i+k)%vnl_bignum(j+l)) == vnl_bignum(long((i+k)%(j+l)))", false, true);
-#ifndef __alpha__ // On Alpha, compiler runs out of memory when using <iomanip>
- vcl_cout<<vcl_hex<< "i=0x"<<i<<", j=0x"<<j<<", k=0x"<<k<<", l="<<l
- <<vcl_dec<<", b1="<<b1<<", b2="<<b2<<", b3="<<b3<<'\n';
-#endif
- ++mod_errors;
- }
- }
- }
- }
- }
-
- vcl_cout << "\n";
- TEST("(vnl_bignum(i+k)/vnl_bignum(j+l)) == vnl_bignum(long((i+k)/(j+l)))",
- div_errors, 0);
- TEST("(vnl_bignum(i+k)%vnl_bignum(j+l)) == vnl_bignum(long((i+k)%(j+l)))",
- mod_errors, 0);
-
-#ifdef INTERACTIVE
- char num[130], den[130];
- vnl_bignum b,r;
-
- while (true) {
- vcl_cout << "Enter next numerator: ";
- vcl_cin >> num;
- vcl_cout << "Enter next denominator: ";
- vcl_cin >> den;
-
- b = vnl_bignum(num)/vnl_bignum(den);
- r = vnl_bignum(num) % vnl_bignum(den);
- vcl_cout << "\nquotient = " << b
- << "\n "; b.dump();
- vcl_cout << "\n\nremainder = " << r
- << "\n "; r.dump();
- vcl_cout << '\n';
- }
-#endif
-}
-
-static void run_multiplication_division_tests()
-{
- vcl_cout << "\nCheck example in book:\n";
-
- vnl_bignum b2 = "0xffffffff"; // Create vnl_bignum object
- vnl_bignum b3 = "12345e30"; // Create vnl_bignum object
-
- vcl_cout << "b2 = " << b2 << vcl_endl
- << "b3 = " << b3 << vcl_endl;
-
- TEST("(b2*b3) / b3 = b2", ((b2*b3) / b3 == b2), 1);
- TEST("(b2*b3) / b2 = b3", ((b2*b3) / b2 == b3), 1);
- TEST("((b3/b2) * b2) + (b3%b2) = b3", (((b3/b2) * b2) + (b3%b2) == b3), 1);
-}
-
-static void run_addition_subtraction_tests()
-{
- vcl_cout << "\nStarting addition, subtraction tests:\n";
-
- long i,j;
- long add_errors = 0;
- long sub_errors = 0;
- vnl_bignum bi,bj,bij;
-
- vcl_cout << " for (i = 1; i < 0xfffffff; i *= 3)\n"
- << " for (j = 1; j < 0xfffffff; j *= 3)\n ";
-
- {for (i = 1; i < 0xfffffff; i *= 3) {
- vcl_cout.put('.');
- vcl_cout.flush();
- for (j = 1; j < 0xfffffff; j *= 3) {
- bi = i;
- bj = j;
- bij = vnl_bignum(i+j);
- if (bi + bj != bij) {
- TEST("bi + bj == vnl_bignum(i + j)", false, true);
- vcl_cout << "i = "<<i<<", j = "<<j<<"\n";
- ++add_errors;
- }
- bij = vnl_bignum(i-j);
- if (bi - bj != bij) {
- TEST("bi - bj == vnl_bignum(i - j)", false, true);
- vcl_cout << "i = "<<i<<", j = "<<j<<"\n";
- ++sub_errors;
- }
- }
- }}
- vcl_cout << "\n";
- TEST("bi + bj == vnl_bignum(i + j)", add_errors, 0);
- TEST("bi - bj == vnl_bignum(i - j)", sub_errors, 0);
-
- vnl_bignum b0(0L);
- vnl_bignum zillion("1000000000000000000");
- vnl_bignum b1000(1000L), b1000000(1000000L);
- vnl_bignum p_inf("+Inf"), m_inf("-Inf");
-
- TEST("-b0 == b0", -b0, b0);
- TEST("-p_inf == m_inf", -p_inf, m_inf);
- TEST("-m_inf == p_inf", -m_inf, p_inf);
- TEST("-b1000 == vnl_bignum(-1L)*b1000", -b1000, vnl_bignum(-1L)*b1000);
- TEST("-(-b1000000) == b1000000", -(-b1000000), b1000000);
- TEST("b0 + b1000 == b1000", b0 + b1000, b1000);
- TEST("b0 + b1000000 == b1000000", b0 + b1000000, b1000000);
- TEST("b1000 + b0 == b1000", b1000 + b0, b1000);
- TEST("b1000000 + b0 == b1000000", b1000000 + b0, b1000000);
- TEST("b0 + (-b1000) == -b1000", b0 + (-b1000), -b1000);
- TEST("-b1000 + b0 == -b1000", -b1000 + b0, -b1000);
- TEST("-b1000 + (-b1000) == (vnl_bignum(2L)*(-b1000))",
- -b1000 + (-b1000), (vnl_bignum(2L)*(-b1000)));
- TEST("-b1000000 + (-b1000000) == (vnl_bignum(2L)*(-b1000000))",
- -b1000000 + (-b1000000), (vnl_bignum(2L)*(-b1000000)));
- TEST("b1000000 + (-b1000000) == b0", b1000000 + (-b1000000), b0);
- TEST("zillion + (-zillion) == b0", zillion + (-zillion), b0);
- TEST("zillion + b1000 == b1000000*b1000000*b1000000 + b1000",
- zillion + b1000, b1000000*b1000000*b1000000 + b1000);
- TEST("zillion + p_inf == p_inf", zillion + p_inf, p_inf);
- TEST("zillion + m_inf == m_inf", zillion + m_inf, m_inf);
- TEST("p_inf + zillion == p_inf", p_inf + zillion, p_inf);
- TEST("m_inf + zillion == m_inf", m_inf + zillion, m_inf);
-
- TEST("b0 - b1000 == -b1000", b0 - b1000, -b1000);
- TEST("b0 - b1000000 == -b1000000", b0 -b1000000, -b1000000);
- TEST("b1000 - b0 == b1000", b1000 - b0, b1000);
- TEST("b1000000 - b0 == b1000000", b1000000 - b0, b1000000);
- TEST("b0 - (-b1000) == b1000", b0 - (-b1000), b1000);
- TEST("-b1000 - b0 == -b1000", -b1000 - b0, -b1000);
- TEST("-b1000 - (-b1000) == b0", -b1000 - (-b1000), b0);
- TEST("-b1000 - (-zillion) == zillion - b1000",
- -b1000 - (-zillion), zillion - b1000);
- TEST("-b1000000 - (-b1000000) == b0", -b1000000 - (-b1000000), b0);
- TEST("-b1000000 - (b1000000) == -vnl_bignum(2L)*b1000000",
- -b1000000 - (b1000000), -vnl_bignum(2L)*b1000000);
- TEST("b1000000 - (-b1000000) == vnl_bignum(2L)*b1000000",
- b1000000 - (-b1000000), vnl_bignum(2L)*b1000000);
- TEST("zillion - (-zillion) == vnl_bignum(2L)*zillion",
- zillion - (-zillion), vnl_bignum(2L)*zillion);
- TEST("zillion - b1000 == b1000000*b1000000*b1000000 - b1000",
- zillion - b1000, b1000000*b1000000*b1000000 - b1000);
- TEST("-zillion - b1000 == -b1000000*b1000000*b1000000 - b1000",
- -zillion - b1000, -b1000000*b1000000*b1000000 - b1000);
- TEST("zillion - p_inf == m_inf", zillion - p_inf, m_inf);
- TEST("zillion - m_inf == p_inf", zillion - m_inf, p_inf);
- TEST("p_inf - zillion == p_inf", p_inf - zillion, p_inf);
- TEST("m_inf - zillion == m_inf", m_inf - zillion, m_inf);
-
- // example in book
- vnl_bignum b2 = "0xffffffff"; // Create vnl_bignum object
- vnl_bignum b3 = "12345e30"; // Create vnl_bignum object
- TEST("(b2+b3) - b2 = b3", (b2+b3) - b2 == b3, 1);
- TEST("(b2+b3) - b3 = b2", (b2+b3) - b3 == b2, 1);
- b3.dump();
- TEST("b3.dump()", 1, 1);
-}
-
-
-static void run_increment_tests()
-{
- vcl_cout << "increment special cases:\n";
- vnl_bignum b1;
- TEST("b1 == 0", b1, 0);
- ++b1;
- TEST("++b1 == 1", b1, 1);
- ++b1;
- TEST("++b1 == 2", b1, 2);
- --b1;
- TEST("--b1 == 1", b1, 1);
- --b1;
- TEST("--b1 == 0", b1, 0);
- --b1;
- TEST("--b1 == -1", b1, -1);
- --b1;
- TEST("--b1 == -2", b1, -2);
- ++b1;
- TEST("++b1 == -1", b1, -1);
- ++b1;
- TEST("++b1 == 0", b1, 0);
-
- vnl_bignum b2("Infinity");
- TEST("b2 == infinity", b2.is_plus_infinity(), true);
- ++b2;
- TEST("++b2 == infinity", b2.is_plus_infinity(), true);
- --b2;
- TEST("--b2 == infinity", b2.is_plus_infinity(), true);
-
- vnl_bignum b3("-Infinity");
- TEST("b3 == -infinity", b3.is_minus_infinity(), true);
- ++b3;
- TEST("++b3 == -infinity", b3.is_minus_infinity(), true);
- --b3;
- TEST("--b3 == -infinity", b3.is_minus_infinity(), true);
-
- vnl_bignum b4("65534");
- TEST("b4 == 65534", b4, 65534);
- ++b4;
- TEST("++b4 == 65535", b4, 65535);
- ++b4;
- TEST("++b4 == 65536", b4, 65536);
- ++b4;
- TEST("++b4 == 65537", b4, 65537);
- --b4;
- TEST("--b4 == 65536", b4, 65536);
- --b4;
- TEST("--b4 == 65535", b4, 65535);
- --b4;
- TEST("--b4 == 65534", b4, 65534);
-
-
- vnl_bignum b5("-65534");
- TEST("b5 == -65534", b5, -65534);
- --b5;
- TEST("--b5 == -65535", b5, -65535);
- --b5;
- TEST("--b5 == -65536", b5, -65536);
- --b5;
- TEST("--b5 == -65537", b5, -65537);
- ++b5;
- TEST("++b5 == -65536", b5, -65536);
- ++b5;
- TEST("++b5 == -65535", b5, -65535);
- ++b5;
- TEST("++b5 == -65534", b5, -65534);
-}
-
-
-static void run_multiplication_tests()
-{
- vcl_cout << "\nStarting multiplication tests:\n";
-
- vnl_bignum b0(0L), b1000(1000L), b1000000(1000000L),
- zillion("1000000000000000000");
- vnl_bignum p_inf("+Inf"), m_inf("-Inf");
-
- TEST("b0*b0 == b0", b0*b0, b0);
- TEST("b0*b1000 == b0", b0*b1000, b0);
- TEST("b1000*b0 == b0", b1000*b0, b0);
- TEST("b1000*b1000 == b1000000", b1000*b1000, b1000000);
- TEST("b1000*b1000000 == b1000000*b1000", b1000*b1000000, b1000000*b1000);
- TEST("-b1000000*b1000000*b1000000 == -zillion", -b1000000*b1000000*b1000000, -zillion);
- TEST("zillion*-b1000 == b1000*-zillion", zillion*-b1000, b1000*-zillion);
- TEST("p_inf*b1000 == p_inf", p_inf*b1000, p_inf);
- TEST("m_inf*b1000 == m_inf", m_inf*b1000, m_inf);
-}
-
-static void run_left_shift_tests()
-{
- vnl_bignum b1(1L);
- vnl_bignum p_inf("+Inf"), m_inf("-Inf");
-
- // left shift
- TEST("int(b1) == 1",int(b1), 1);
- TEST("long(b1 << 1) == 2",long(b1 << 1), 2);
- TEST("long(b1 << 2) == 4",long(b1 << 2), 4);
- TEST("long(b1 << 3) == 8",long(b1 << 3), 8);
- TEST("long(b1 << 4) == 16",long(b1 << 4), 16);
- TEST("long(b1 << 5) == 32",long(b1 << 5), 32);
- TEST("long(b1 << 6) == 64",long(b1 << 6), 64);
- TEST("long(b1 << 7) == 128",long(b1 << 7), 128);
- TEST("long(b1 << 8) == 256",long(b1 << 8), 256);
- TEST("long(b1 << 9) == 512",long(b1 << 9), 512);
- TEST("long(b1 << 10) == 1024",long(b1 << 10), 1024);
- TEST("long(b1 << 11) == 2048",long(b1 << 11), 2048);
- TEST("long(b1 << 12) == 4096",long(b1 << 12), 4096);
- TEST("long(b1 << 13) == 8192",long(b1 << 13), 8192);
- TEST("long(b1 << 14) == 16384",long(b1 << 14), 16384);
- TEST("long(b1 << 15) == 32768",long(b1 << 15), 32768);
- TEST("long(b1 << 16) == 65536",long(b1 << 16), 65536);
- TEST("(b1 << 32) == vnl_bignum(\"4294967296\")",
- (b1 << 32), vnl_bignum("4294967296"));
- TEST("p_inf << 16 == p_inf",p_inf << 16, p_inf);
-
- TEST("long(-b1 << 1) == -2",long(-b1 << 1), -2);
- TEST("long(-b1 << 2) == -4",long(-b1 << 2), -4);
- TEST("long(-b1 << 3) == -8",long(-b1 << 3), -8);
- TEST("long(-b1 << 4) == -16",long(-b1 << 4), -16);
- TEST("long(-b1 << 5) == -32",long(-b1 << 5), -32);
- TEST("long(-b1 << 6) == -64",long(-b1 << 6), -64);
- TEST("long(-b1 << 7) == -128",long(-b1 << 7), -128);
- TEST("long(-b1 << 8) == -256",long(-b1 << 8), -256);
- TEST("long(-b1 << 9) == -512",long(-b1 << 9), -512);
- TEST("long(-b1 << 10) == -1024",long(-b1 << 10), -1024);
- TEST("long(-b1 << 11) == -2048",long(-b1 << 11), -2048);
- TEST("long(-b1 << 12) == -4096",long(-b1 << 12), -4096);
- TEST("long(-b1 << 13) == -8192",long(-b1 << 13), -8192);
- TEST("long(-b1 << 14) == -16384",long(-b1 << 14), -16384);
- TEST("long(-b1 << 15) == -32768",long(-b1 << 15), -32768);
- TEST("long(-b1 << 16) == -65536",long(-b1 << 16), -65536);
- TEST("(-b1 << 32) == vnl_bignum(\"-4294967296\")",
- (-b1 << 32), vnl_bignum("-4294967296"));
- TEST("m_inf << 16 == m_inf",m_inf << 16, m_inf);
-
- TEST("long(b1 << -16) == 0",long(b1 << -16), 0);
- TEST("long(-b1 << -16) == 0",long(-b1 << -16), 0);
-}
-
-static void run_right_shift_tests()
-{
- vnl_bignum b2("4294967296");
- vnl_bignum p_inf("+Inf"), m_inf("-Inf");
-
- // right shift
- TEST("b2 == vnl_bignum(\"4294967296\")",b2, vnl_bignum("4294967296"));
- TEST("(b2 >> 1) == vnl_bignum(\"2147483648\")", (b2 >> 1), vnl_bignum("2147483648"));
- TEST("long(b2 >> 2) == 1073741824",long(b2 >> 2), 1073741824L);
- TEST("long(b2 >> 3) == 536870912",long(b2 >> 3), 536870912L);
- TEST("long(b2 >> 4) == 268435456",long(b2 >> 4), 268435456L);
- TEST("long(b2 >> 5) == 134217728",long(b2 >> 5), 134217728L);
- TEST("long(b2 >> 6) == 67108864",long(b2 >> 6), 67108864L);
- TEST("long(b2 >> 7) == 33554432",long(b2 >> 7), 33554432L);
- TEST("long(b2 >> 8) == 16777216",long(b2 >> 8), 16777216L);
- TEST("long(b2 >> 9) == 8388608",long(b2 >> 9), 8388608L);
- TEST("long(b2 >> 10) == 4194304",long(b2 >> 10), 4194304L);
- TEST("long(b2 >> 11) == 2097152",long(b2 >> 11), 2097152L);
- TEST("long(b2 >> 12) == 1048576",long(b2 >> 12), 1048576L);
- TEST("long(b2 >> 13) == 524288",long(b2 >> 13), 524288L);
- TEST("long(b2 >> 14) == 262144",long(b2 >> 14), 262144L);
- TEST("long(b2 >> 15) == 131072",long(b2 >> 15), 131072L);
- TEST("long(b2 >> 16) == 65536",long(b2 >> 16), 65536L);
- TEST("long(b2 >> 32) == 1",long(b2 >> 32), 1L);
- TEST("long(b2 >> 33) == 0",long(b2 >> 33), 0L);
- TEST("long(b2 >> 67) == 0",long(b2 >> 67), 0L);
- TEST("p_inf >> 16 == p_inf",p_inf >> 16, p_inf);
-
- TEST("(-b2 >> 1) == vnl_bignum(\"-2147483648\")", (-b2 >> 1), vnl_bignum("-2147483648"));
- TEST("long(-b2 >> 2) == -1073741824",long(-b2 >> 2), -1073741824L);
- TEST("long(-b2 >> 3) == -536870912",long(-b2 >> 3), -536870912L);
- TEST("long(-b2 >> 4) == -268435456",long(-b2 >> 4), -268435456L);
- TEST("long(-b2 >> 5) == -134217728",long(-b2 >> 5), -134217728L);
- TEST("long(-b2 >> 6) == -67108864",long(-b2 >> 6), -67108864L);
- TEST("long(-b2 >> 7) == -33554432",long(-b2 >> 7), -33554432L);
- TEST("long(-b2 >> 8) == -16777216",long(-b2 >> 8), -16777216L);
- TEST("long(-b2 >> 9) == -8388608",long(-b2 >> 9), -8388608L);
- TEST("long(-b2 >> 10) == -4194304",long(-b2 >> 10), -4194304L);
- TEST("long(-b2 >> 11) == -2097152",long(-b2 >> 11), -2097152L);
- TEST("long(-b2 >> 12) == -1048576",long(-b2 >> 12), -1048576L);
- TEST("long(-b2 >> 13) == -524288",long(-b2 >> 13), -524288L);
- TEST("long(-b2 >> 14) == -262144",long(-b2 >> 14), -262144L);
- TEST("long(-b2 >> 15) == -131072",long(-b2 >> 15), -131072L);
- TEST("long(-b2 >> 16) == -65536",long(-b2 >> 16), -65536L);
- TEST("long(-b2 >> 32) == -1",long(-b2 >> 32), -1);
- TEST("long(-b2 >> 33) == -0",long(-b2 >> 33), 0);
- TEST("long(-b2 >> 67) == -0",long(-b2 >> 67), 0);
- TEST("m_inf >> 16 == m_inf",m_inf >> 16, m_inf);
-}
-
-static void run_shift_tests()
-{
- vcl_cout << "\nStarting shift tests:\n";
-
- run_left_shift_tests();
- run_right_shift_tests();
-#ifdef INTERACTIVE
- vnl_bignum b;
- char s[100];
- int sh;
-
- while (true) {
- vcl_cout << "Enter next vnl_bignum: ";
- vcl_cin >> s;
- b = s;
- vcl_cout << "Enter shift amount: ";
- vcl_cin >> sh;
- vcl_cout << "Shift == " << sh << "\n";
-
- b = b << sh;
- }
-#endif
-}
-
-void test_bignum()
-{
- run_constructor_tests();
- run_conversion_operator_tests();
- run_assignment_tests();
- run_addition_subtraction_tests();
- run_increment_tests();
- run_multiplication_tests();
- run_division_tests();
- run_multiplication_division_tests();
- run_shift_tests();
- run_logical_comparison_tests();
-}
-
-TESTMAIN(test_bignum);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_complex.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_complex.cxx
deleted file mode 100644
index f369d7130d305ba68abcbaf3f5f4feaa8654b746..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_complex.cxx
+++ /dev/null
@@ -1,121 +0,0 @@
-// This is core/vnl/tests/test_complex.cxx
-
-//:
-// \file
-
-#include <vcl_iostream.h>
-#include <vcl_cmath.h>
-#include <vcl_complex.h>
-
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_random.h>
-
-#include <testlib/testlib_test.h>
-
-//: inverse cosine for complex numbers.
-// The implementation is at the bottom of this file.
-// \author Peter Vanroose, ESAT, KULeuven.
-vcl_complex<double> tc_acos(vcl_complex<double> x);
-
-// make a vector with random, complex entries :
-static void fill_rand(vcl_complex<double> *b, vcl_complex<double> *e, vnl_random &rng)
-{
- for (vcl_complex<double> *p=b; p<e; ++p)
- (*p) = vcl_complex<double>( rng.drand64(-1.0, +1.0), rng.drand64(-1.0, +1.0) );
-}
-
-static void test_operators()
-{
- vcl_complex<double> a(-5), b(7,-1), c;
- c = a + b;
- c = a - b;
- c = a * b;
- c = a / b;
- a += b;
- a -= b;
- a *= b;
- a /= b;
- vcl_cout << "a=" << a << '\n'
- << "b=" << b << '\n'
- << "c=" << c << '\n'
- << '\n';
-}
-
-static void test_vector()
-{
- vnl_random rng(9667566);
- vnl_vector<vcl_complex<double> > a(5); fill_rand(a.begin(), a.end(), rng);
- vnl_vector<vcl_complex<double> > b(5); fill_rand(b.begin(), b.end(), rng);
-
- vcl_cout << "a=" << a << '\n'
- << "b=" << b << '\n';
-
- vcl_complex<double> i(0,1);
-
- vcl_cout << dot_product(a,b) << '\n';
- testlib_test_assert_near("inner_product() conjugates correctly",
- inner_product(i*a,b), i*inner_product(a,b));
- testlib_test_assert_near("inner_product() conjugates correctly",
- inner_product(a,i*b),-i*inner_product(a,b));
-
- testlib_test_assert_near("dot_product() does not conjugate",
- dot_product(i*a,b), i*dot_product(a,b));
- testlib_test_assert_near("dot_product() does not conjugate",
- dot_product(a,i*b), i*dot_product(a,b));
-
- double norma=0;
- for (unsigned n=0; n<a.size(); ++n)
- norma += vcl_real(a[n])*vcl_real(a[n]) + vcl_imag(a[n])*vcl_imag(a[n]);
- norma = vcl_sqrt(norma);
- testlib_test_assert_near("correct magnitude", norma, a.magnitude());
-}
-
-static void test_cosine()
-{
- int seed = 12345;
- for (int i=0; i<20; ++i)
- {
- seed = (seed*16807)%2147483647L;
- double u = double(seed)/1367130552L;
- if (u<0) u = -u; // between 0 and pi/2
- seed = (seed*16807)%2147483647L;
- double v = double(seed)/1000000000L;
- vcl_complex<double> c(u,v);
- vcl_complex<double> d = vcl_cos(c);
- vcl_complex<double> e = tc_acos(d);
- vcl_cout << c << ' ' << d << ' ' << e << '\n';
- testlib_test_assert_near("acos", c, e, 1e-12);
- }
-}
-
-void test_complex()
-{
- test_operators();
- test_vector();
- test_cosine();
-}
-
-TESTMAIN(test_complex);
-
-//: inverse cosine for complex numbers.
-// implementation by Peter Vanroose, ESAT, KULeuven.
-vcl_complex<double> tc_acos(vcl_complex<double> x)
-{
- double a = vcl_real(x), b = vcl_imag(x);
- // special cases:
- if (b==0 && a > 1)
- return vcl_complex<double>(0.0, vcl_log(a+vcl_sqrt(a*a-1))); // == acosh(a)
- else if (b==0 && a >= -1.0)
- return vcl_acos(a);
-
- // the general case:
- // the result c + d*i satisfies a = cos(c)*cosh(d), b = -sin(c)*sinh(d)
- // hence $\frac{a^2}{\cos^2(c)} - \frac{b^2}{\sin^2(c)} = 1$.
- double q = (a*a-1)*(a*a-1)+b*b*(b*b+2*a*a+2);
- double t = 0.5*(1+a*a+b*b-vcl_sqrt(q));
- // this $t = \cos^2(c)$ solves the latter biquadratic equation and lies in [0,1].
- double aa = a/vcl_sqrt(t), bb = b/vcl_sqrt(1-t);
- double r_real = vcl_acos(vcl_sqrt(t));
- double r_imag = vcl_log(vcl_fabs(aa-bb));
- return vcl_complex<double>(r_real, r_imag);
-}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_diag_matrix.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_diag_matrix.cxx
deleted file mode 100644
index f2c45a3d1590a21cfc5e56476ec913b0933645cd..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_diag_matrix.cxx
+++ /dev/null
@@ -1,104 +0,0 @@
-// This is core/vnl/tests/test_diag_matrix.cxx
-#include <testlib/testlib_test.h>
-//:
-// \file
-// \author Peter Vanroose, KULeuven
-// \date 20 Sept. 2002
-
-#include <vcl_iostream.h>
-#include <vnl/vnl_diag_matrix.h>
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/vnl_vector_fixed.h>
-
-void test_diag_matrix()
-{
- const unsigned int N = 3;
-
- vnl_diag_matrix<double> m1(N);
- for (unsigned i=0; i<N; i++)
- m1(i,i) = i*0.25-0.25;
-
- vnl_diag_matrix<double> const m1c=m1; // must be const in order to use m(i,j)
- vcl_cout << "m1 = " << m1 << " =\n";
- for (unsigned i=0; i<N; i++) {
- vcl_cout << '\t';
- for (unsigned j=0; j<N; j++)
- vcl_cout << m1c(i,j) << ' ';
- vcl_cout << '\n';
- }
-
- vnl_diag_matrix<double> m2(N);
- for (unsigned i=0; i<N; i++)
- m2(i,i) = 2.0-1.25*i;
-
- vnl_diag_matrix<double> const m2c=m2;
- vcl_cout << "m2 = " << m2 << " =\n";
- for (unsigned i=0; i<N; i++) {
- vcl_cout << '\t';
- for (unsigned j=0; j<N; j++)
- vcl_cout << m2c(i,j) << ' ';
- vcl_cout << '\n';
- }
-
- vnl_diag_matrix<double> const sum = m1 + m2;
- vcl_cout << "sum = " << sum << '\n';
- TEST("sum", sum(0,0) == 1.75 && sum(1,1) == 0.75 && sum(2,2) == -0.25, true);
-
- vnl_diag_matrix<double> const diff = m1 - m2;
- vcl_cout << "difference = " << diff << " =\n";
- TEST("difference", diff(0,0) == -2.25 && diff(1,1) == -0.75 && diff(2,2) == 0.75, true);
-
- vnl_diag_matrix<double> const prod = m1 * m2;
- vcl_cout << "product = " << prod << '\n';
- TEST("product", prod(0,0) == -0.5 && prod(1,1) == 0.0 && prod(2,2) == -0.125, true);
-
- vnl_vector_fixed<double,N> th; th(0)=2.0; th(1)=-3.0; th(2)=6.0;
- vcl_cout << "vector = " << th << '\n';
-
- vnl_vector<double> vec = m1 * th.as_ref();
- vcl_cout << "vector product (post-multiplied) = " << vec << '\n';
- TEST("vector product", vec(0) == -0.5 && vec(1) == 0.0 && vec(2) == 1.5, true);
-
- vec = th.as_ref() * m1;
- vcl_cout << "vector product (pre-multiplied) = " << vec << '\n';
- TEST("vector product", vec(0) == -0.5 && vec(1) == 0.0 && vec(2) == 1.5, true);
-
- vnl_matrix_fixed<double,N,N> mat;
- mat(0,0)=0.0; mat(0,1)=-th(2); mat(0,2)= th(1);
- mat(1,0)= th(2); mat(1,1)=0.0; mat(1,2)=-th(0);
- mat(2,0)=-th(1); mat(2,1)= th(0); mat(2,2)=0.0;
- vcl_cout << "matrix =\n" << mat;
-
- vnl_matrix_fixed<double,N,N> s1=m1+mat.as_ref();
- vcl_cout << "m1+matrix =\n" << s1;
- TEST("matrix sum", s1(0,0) == -0.25 && s1(0,1) == -6.0 && s1(0,2) == -3.0
- && s1(1,0) == 6.0 && s1(1,1) == 0.0 && s1(1,2) == -2.0
- && s1(2,0) == 3.0 && s1(2,1) == 2.0 && s1(2,2) == 0.25, true);
- vnl_matrix_fixed<double,N,N> s2=mat.as_ref()+m1;
- vcl_cout << "matrix+m1 =\n" << s2;
- TEST("matrix sum", s2(0,0) == -0.25 && s2(0,1) == -6.0 && s2(0,2) == -3.0
- && s2(1,0) == 6.0 && s2(1,1) == 0.0 && s2(1,2) == -2.0
- && s2(2,0) == 3.0 && s2(2,1) == 2.0 && s2(2,2) == 0.25, true);
- vnl_matrix_fixed<double,N,N> d1=m1-mat.as_ref();
- vcl_cout << "m1-matrix =\n" << d1;
- TEST("matrix difference", d1(0,0) == -0.25 && d1(0,1) == 6.0 && d1(0,2) == 3.0
- && d1(1,0) == -6.0 && d1(1,1) == 0.0 && d1(1,2) == 2.0
- && d1(2,0) == -3.0 && d1(2,1) == -2.0 && d1(2,2) == 0.25, true);
- vnl_matrix_fixed<double,N,N> d2=mat.as_ref()-m1;
- vcl_cout << "matrix-m1 =\n" << d2;
- TEST("matrix difference", d2(0,0) == 0.25 && d2(0,1) == -6.0 && d2(0,2) == -3.0
- && d2(1,0) == 6.0 && d2(1,1) == -0.0 && d2(1,2) == -2.0
- && d2(2,0) == 3.0 && d2(2,1) == 2.0 && d2(2,2) == -0.25, true);
- vnl_matrix_fixed<double,N,N> p1=m1*mat.as_ref();
- vcl_cout << "m1*matrix =\n" << p1;
- TEST("matrix product", p1(0,0) == 0.0 && p1(0,1) == 1.5 && p1(0,2) == 0.75
- && p1(1,0) == 0.0 && p1(1,1) == 0.0 && p1(1,2) == 0.0
- && p1(2,0) == 0.75 && p1(2,1) == 0.5 && p1(2,2) == 0.0, true);
- vnl_matrix_fixed<double,N,N> p2=mat.as_ref()*m1;
- vcl_cout << "matrix*m1 =\n" << p2;
- TEST("matrix product", p2(0,0) == 0.0 && p2(0,1) == 0.0 && p2(0,2) == -0.75
- && p2(1,0) == -1.5 && p2(1,1) == 0.0 && p2(1,2) == -0.5
- && p2(2,0) == -0.75 && p2(2,1) == 0.0 && p2(2,2) == 0.0, true);
-}
-
-TESTMAIN(test_diag_matrix);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_driver.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_driver.cxx
deleted file mode 100644
index 12b8707e1ac2d312129e33c730573e5001e63bdb..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_driver.cxx
+++ /dev/null
@@ -1,71 +0,0 @@
-#include <testlib/testlib_register.h>
-
-DECLARE( test_bignum );
-DECLARE( test_complex );
-DECLARE( test_inverse );
-DECLARE( test_diag_matrix );
-DECLARE( test_file_matrix );
-DECLARE( test_finite );
-DECLARE( test_math );
-//DECLARE( test_matlab );
-DECLARE( test_matrix );
-DECLARE( test_matrix_exp );
-DECLARE( test_matrix_fixed );
-DECLARE( test_matrix_fixed_ref );
-DECLARE( test_numeric_traits );
-DECLARE( test_quaternion );
-DECLARE( test_rational );
-DECLARE( test_real_polynomial );
-DECLARE( test_real_npolynomial );
-DECLARE( test_resize );
-DECLARE( test_rotation_matrix );
-DECLARE( test_sample );
-DECLARE( test_sym_matrix );
-DECLARE( test_transpose );
-DECLARE( test_fastops );
-DECLARE( test_vector );
-DECLARE( test_vector_fixed_ref );
-DECLARE( test_gamma );
-DECLARE( test_random );
-DECLARE( test_arithmetic );
-DECLARE( test_hungarian_algorithm );
-DECLARE( test_integrant );
-DECLARE( test_bessel );
-
-void
-register_tests()
-{
- REGISTER( test_bignum );
- REGISTER( test_complex );
- REGISTER( test_inverse );
- REGISTER( test_diag_matrix );
- REGISTER( test_file_matrix );
- REGISTER( test_finite );
- REGISTER( test_math );
- //REGISTER( test_matlab );
- REGISTER( test_matrix );
- REGISTER( test_matrix_exp );
- REGISTER( test_matrix_fixed );
- REGISTER( test_matrix_fixed_ref );
- REGISTER( test_numeric_traits );
- REGISTER( test_quaternion );
- REGISTER( test_rational );
- REGISTER( test_real_polynomial );
- REGISTER( test_real_npolynomial );
- REGISTER( test_resize );
- REGISTER( test_rotation_matrix );
- REGISTER( test_sample );
- REGISTER( test_sym_matrix );
- REGISTER( test_transpose );
- REGISTER( test_fastops );
- REGISTER( test_vector );
- REGISTER( test_vector_fixed_ref );
- REGISTER( test_gamma );
- REGISTER( test_random );
- REGISTER( test_arithmetic );
- REGISTER( test_hungarian_algorithm );
- REGISTER( test_integrant );
- REGISTER( test_bessel );
-}
-
-DEFINE_MAIN;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_fastops.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_fastops.cxx
deleted file mode 100644
index 482f8bd3a3e2c2e183534b050a0b41179b970743..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_fastops.cxx
+++ /dev/null
@@ -1,269 +0,0 @@
-// This is core/vnl/tests/test_fastops.cxx
-#include <testlib/testlib_test.h>
-//:
-// \file
-// \author Peter Vanroose
-// \date 17 June 2004
-#include <vnl/vnl_fastops.h>
-
-void test_fastops()
-{
- // The data to work with
- vnl_matrix<double> result_m, X; vnl_vector<double> result_v, Y;
- vnl_matrix<double> id1x1(1,1); id1x1.set_identity();
- vnl_matrix<double> id2x2(2,2); id2x2.set_identity();
- vnl_matrix<double> id3x3(3,3); id3x3.set_identity();
- vnl_matrix<double> id10x10(10,10); id10x10.set_identity();
- vnl_matrix<double> id99x99(99,99); id99x99.set_identity();
- double data[10] = { -7.5, 1.5, 0., -107.25, 511., -509.75, 1.25, -1., 0., 1. };
- vnl_matrix<double> m1x1(data,1,1); // the number -7.5
- vnl_matrix<double> m2x2(data,2,2);
- vnl_matrix<double> m2x2t = m2x2.transpose();
- vnl_matrix<double> m3x3(data,3,3);
- vnl_matrix<double> m3x3t = m3x3.transpose();
- vnl_vector<double> v1(data,1); // the number -7.5
- vnl_vector<double> v2(data,2);
- vnl_vector<double> v3(data,3);
- vnl_vector<double> v10(data,10);
- vnl_matrix<double> m10x2(10,2), m2x10(2,10);
- for (unsigned int i=0; i<10; ++i)
- for (unsigned int j=0; j<2; ++j)
- m10x2[i][j] = m2x10[j][i] = (i+1)*1.5 + (j+1)*(j+i);
-
- // First test: $I \times I$
- result_m.set_size(1,1);
- vnl_fastops::AtA(result_m, id1x1);
- TEST("vnl_fastops::AtA(id1x1)", result_m, id1x1);
- vnl_fastops::AB(result_m, id1x1, id1x1);
- TEST("vnl_fastops::AB(id1x1,id1x1)", result_m, id1x1);
- vnl_fastops::AtB(result_m, id1x1, id1x1);
- TEST("vnl_fastops::AtB(id1x1,id1x1)", result_m, id1x1);
- vnl_fastops::ABt(result_m, id1x1, id1x1);
- TEST("vnl_fastops::ABt(id1x1,id1x1)", result_m, id1x1);
- result_m.set_size(2,2);
- vnl_fastops::AtA(result_m, id2x2);
- TEST("vnl_fastops::AtA(id2x2)", result_m, id2x2);
- vnl_fastops::AB(result_m, id2x2, id2x2);
- TEST("vnl_fastops::AB(id2x2,id2x2)", result_m, id2x2);
- vnl_fastops::AtB(result_m, id2x2, id2x2);
- TEST("vnl_fastops::AtB(id2x2,id2x2)", result_m, id2x2);
- vnl_fastops::ABt(result_m, id2x2, id2x2);
- TEST("vnl_fastops::ABt(id2x2,id2x2)", result_m, id2x2);
- result_m.set_size(99,99);
- vnl_fastops::AtA(result_m, id99x99);
- TEST("vnl_fastops::AtA(id99x99)", result_m, id99x99);
- vnl_fastops::AB(result_m, id99x99, id99x99);
- TEST("vnl_fastops::AB(id99x99,id99x99)", result_m, id99x99);
- vnl_fastops::AtB(result_m, id99x99, id99x99);
- TEST("vnl_fastops::AtB(id99x99,id99x99)", result_m, id99x99);
- vnl_fastops::ABt(result_m, id99x99, id99x99);
- TEST("vnl_fastops::ABt(id99x99,id99x99)", result_m, id99x99);
-
- // Second test: $I \times M$ and $M \times I$ and $M^\top \times I$
- result_m.set_size(1,1); result_v.set_size(1);
- vnl_fastops::AB(result_m, id1x1, m1x1);
- TEST("vnl_fastops::AB(id1x1,m1x1)", result_m, m1x1);
- vnl_fastops::AB(result_m, m1x1, id1x1);
- TEST("vnl_fastops::AB(m1x1,id1x1)", result_m, m1x1);
- vnl_fastops::AtB(result_v, id1x1, v1);
- TEST("vnl_fastops::AtB(id1x1,v1)", result_v, v1);
- vnl_fastops::AtB(result_m, id1x1, m1x1);
- TEST("vnl_fastops::AtB(id1x1,m1x1)", result_m, m1x1);
- vnl_fastops::ABt(result_m, m1x1, id1x1);
- TEST("vnl_fastops::ABt(m1x1,id1x1)", result_m, m1x1);
- vnl_fastops::AtB(result_m, m1x1, id1x1);
- TEST("vnl_fastops::AtB(m1x1,id1x1)", result_m, m1x1);
- vnl_fastops::ABt(result_m, id1x1, m1x1);
- TEST("vnl_fastops::ABt(id1x1,m1x1)", result_m, m1x1);
- result_m.set_size(2,2); result_v.set_size(2);
- vnl_fastops::AB(result_m, id2x2, m2x2);
- TEST("vnl_fastops::AB(id2x2,m2x2)", result_m, m2x2);
- vnl_fastops::AB(result_m, m2x2, id2x2);
- TEST("vnl_fastops::AB(m2x2,id2x2)", result_m, m2x2);
- vnl_fastops::AtB(result_v, id2x2, v2);
- TEST("vnl_fastops::AtB(id2x2,v2)", result_v, v2);
- vnl_fastops::AtB(result_m, id2x2, m2x2);
- TEST("vnl_fastops::AtB(id2x2,m2x2)", result_m, m2x2);
- vnl_fastops::ABt(result_m, m2x2, id2x2);
- TEST("vnl_fastops::ABt(m2x2,id2x2)", result_m, m2x2);
- vnl_fastops::AtB(result_m, m2x2, id2x2);
- TEST("vnl_fastops::AtB(m2x2,id2x2)", result_m, m2x2t);
- vnl_fastops::ABt(result_m, id2x2, m2x2);
- TEST("vnl_fastops::ABt(id2x2,m2x2)", result_m, m2x2t);
- result_m.set_size(3,3); result_v.set_size(3);
- vnl_fastops::AB(result_m, id3x3, m3x3);
- TEST("vnl_fastops::AB(id3x3,m3x3)", result_m, m3x3);
- vnl_fastops::AB(result_m, m3x3, id3x3);
- TEST("vnl_fastops::AB(m3x3,id3x3)", result_m, m3x3);
- vnl_fastops::AtB(result_v, id3x3, v3);
- TEST("vnl_fastops::AtB(id3x3,v3)", result_v, v3);
- vnl_fastops::AtB(result_m, id3x3, m3x3);
- TEST("vnl_fastops::AtB(id3x3,m3x3)", result_m, m3x3);
- vnl_fastops::ABt(result_m, m3x3, id3x3);
- TEST("vnl_fastops::ABt(m3x3,id3x3)", result_m, m3x3);
- vnl_fastops::AtB(result_m, m3x3, id3x3);
- TEST("vnl_fastops::AtB(m3x3,id3x3)", result_m, m3x3t);
- vnl_fastops::ABt(result_m, id3x3, m3x3);
- TEST("vnl_fastops::ABt(id3x3,m3x3)", result_m, m3x3t);
- result_v.set_size(10);
- vnl_fastops::AtB(result_v, id10x10, v10);
- TEST("vnl_fastops::AtB(id10x10,v10)", result_v, v10);
-
- // Third test: $M \times M$ and $M^\top \times M$ and $M \times M^\top$
- result_m.set_size(1,1); result_v.set_size(1);
- vnl_fastops::AtA(result_m, m1x1);
- TEST("vnl_fastops::AtA(m1x1)", result_m, m1x1*m1x1);
- vnl_fastops::AB(result_m, m1x1, m1x1);
- TEST("vnl_fastops::AB(m1x1,m1x1)", result_m, m1x1*m1x1);
- vnl_fastops::AtB(result_v, m1x1, v1);
- TEST("vnl_fastops::AtB(m1x1,v1)", result_v, m1x1*v1);
- vnl_fastops::AtB(result_m, m1x1, m1x1);
- TEST("vnl_fastops::AtB(m1x1,m1x1)", result_m, m1x1*m1x1);
- vnl_fastops::ABt(result_m, m1x1, m1x1);
- TEST("vnl_fastops::ABt(m1x1,m1x1)", result_m, m1x1*m1x1);
- result_m.set_size(2,2); result_v.set_size(2);
- vnl_fastops::AtA(result_m, m2x2);
- TEST("vnl_fastops::AtA(m2x2)", result_m, m2x2t*m2x2);
- vnl_fastops::AB(result_m, m2x2, m2x2);
- TEST("vnl_fastops::AB(m2x2,m2x2)", result_m, m2x2*m2x2);
- vnl_fastops::AtB(result_v, m2x2, v2);
- TEST("vnl_fastops::AtB(m2x2,v2)", result_v, m2x2t*v2);
- vnl_fastops::AtB(result_m, m2x2, m2x2);
- TEST("vnl_fastops::AtB(m2x2,m2x2)", result_m, m2x2t*m2x2);
- vnl_fastops::ABt(result_m, m2x2, m2x2);
- TEST("vnl_fastops::ABt(m2x2,m2x2)", result_m, m2x2*m2x2t);
- result_m.set_size(3,3); result_v.set_size(3);
- vnl_fastops::AtA(result_m, m3x3);
- TEST("vnl_fastops::AtA(m3x3)", result_m, m3x3t*m3x3);
- vnl_fastops::AB(result_m, m3x3, m3x3);
- TEST("vnl_fastops::AB(m3x3,m3x3)", result_m, m3x3*m3x3);
- vnl_fastops::AtB(result_v, m3x3, v3);
- TEST("vnl_fastops::AtB(m3x3,v3)", result_v, m3x3t*v3);
- vnl_fastops::AtB(result_m, m3x3, m3x3);
- TEST("vnl_fastops::AtB(m3x3,m3x3)", result_m, m3x3t*m3x3);
- vnl_fastops::ABt(result_m, m3x3, m3x3);
- TEST("vnl_fastops::ABt(m3x3,m3x3)", result_m, m3x3*m3x3t);
- result_m.set_size(2,2);
- vnl_fastops::AB(result_m, m2x10, m10x2);
- TEST("vnl_fastops::AB(m2x10,m10x2)", result_m, m2x10*m10x2);
- vnl_fastops::AtB(result_m, m10x2, m10x2);
- TEST("vnl_fastops::AtB(m10x2,m10x2)", result_m, m2x10*m10x2);
- vnl_fastops::ABt(result_m, m2x10, m2x10);
- TEST("vnl_fastops::ABt(m2x10,m2x10)", result_m, m2x10*m10x2);
- result_m.set_size(10,10);
- vnl_fastops::AB(result_m, m10x2, m2x10);
- TEST("vnl_fastops::AB(m10x2,m2x10)", result_m, m10x2*m2x10);
- vnl_fastops::AtB(result_m, m2x10, m2x10);
- TEST("vnl_fastops::AtB(m2x10,m2x10)", result_m, m10x2*m2x10);
- vnl_fastops::ABt(result_m, m10x2, m10x2);
- TEST("vnl_fastops::ABt(m10x2,m10x2)", result_m, m10x2*m2x10);
- result_v.set_size(2);
- vnl_fastops::AtB(result_v, m10x2, v10);
- TEST("vnl_fastops::AtB(m10x2,v10)", result_v, m2x10*v10);
- result_v.set_size(10);
- vnl_fastops::AtB(result_v, m2x10, v2);
- TEST("vnl_fastops::AtB(m2x10,v2)", result_v, m10x2*v2);
-
- // Fourth test: increments and decrements
- X = m1x1; Y = v1;
- vnl_fastops::inc_X_by_AtA(X, m1x1);
- TEST("vnl_fastops::inc_X_by_AtA(X, m1x1)", X, m1x1*m1x1+m1x1);
- vnl_fastops::dec_X_by_AtA(X, m1x1);
- TEST("vnl_fastops::dec_X_by_AtA(X, m1x1)", X, m1x1);
- vnl_fastops::inc_X_by_AB(X, m1x1, m1x1);
- TEST("vnl_fastops::inc_X_by_AB(X, m1x1,m1x1)", X, m1x1*m1x1+m1x1);
- vnl_fastops::dec_X_by_AB(X, m1x1, m1x1);
- TEST("vnl_fastops::dec_X_by_AB(X, m1x1,m1x1)", X, m1x1);
- vnl_fastops::inc_X_by_AtB(Y, m1x1, v1);
- TEST("vnl_fastops::inc_X_by_AtB(X, m1x1,v1)", Y, m1x1*v1+v1);
- vnl_fastops::dec_X_by_AtB(Y, m1x1, v1);
- TEST("vnl_fastops::dec_X_by_AtB(X, m1x1,v1)", Y, v1);
- vnl_fastops::inc_X_by_AtB(X, m1x1, m1x1);
- TEST("vnl_fastops::inc_X_by_AtB(X, m1x1,m1x1)", X, m1x1*m1x1+m1x1);
- vnl_fastops::dec_X_by_AtB(X, m1x1, m1x1);
- TEST("vnl_fastops::dec_X_by_AtB(X, m1x1,m1x1)", X, m1x1);
- vnl_fastops::inc_X_by_ABt(X, m1x1, m1x1);
- TEST("vnl_fastops::inc_X_by_ABt(X, m1x1,m1x1)", X, m1x1*m1x1+m1x1);
- vnl_fastops::dec_X_by_ABt(X, m1x1, m1x1);
- TEST("vnl_fastops::dec_X_by_ABt(X, m1x1,m1x1)", X, m1x1);
- X = m2x2; Y = v2;
- vnl_fastops::inc_X_by_AtA(X, m2x2);
- TEST("vnl_fastops::inc_X_by_AtA(X, m2x2)", X, m2x2t*m2x2+m2x2);
- vnl_fastops::dec_X_by_AtA(X, m2x2);
- TEST("vnl_fastops::dec_X_by_AtA(X, m2x2)", X, m2x2);
- vnl_fastops::inc_X_by_AB(X, m2x2, m2x2);
- TEST("vnl_fastops::inc_X_by_AB(X, m2x2,m2x2)", X, m2x2*m2x2+m2x2);
- vnl_fastops::dec_X_by_AB(X, m2x2, m2x2);
- TEST("vnl_fastops::dec_X_by_AB(X, m2x2,m2x2)", X, m2x2);
- vnl_fastops::inc_X_by_AtB(Y, m2x2, v2);
- TEST("vnl_fastops::inc_X_by_AtB(X, m2x2,v2)", Y, m2x2t*v2+v2);
- vnl_fastops::dec_X_by_AtB(Y, m2x2, v2);
- TEST("vnl_fastops::dec_X_by_AtB(X, m2x2,v2)", Y, v2);
- vnl_fastops::inc_X_by_AtB(X, m2x2, m2x2);
- TEST("vnl_fastops::inc_X_by_AtB(X, m2x2,m2x2)", X, m2x2t*m2x2+m2x2);
- vnl_fastops::dec_X_by_AtB(X, m2x2, m2x2);
- TEST("vnl_fastops::dec_X_by_AtB(X, m2x2,m2x2)", X, m2x2);
- vnl_fastops::inc_X_by_ABt(X, m2x2, m2x2);
- TEST("vnl_fastops::inc_X_by_ABt(X, m2x2,m2x2)", X, m2x2*m2x2t+m2x2);
- vnl_fastops::dec_X_by_ABt(X, m2x2, m2x2);
- TEST("vnl_fastops::dec_X_by_ABt(X, m2x2,m2x2)", X, m2x2);
- X = m3x3; Y = v3;
- vnl_fastops::inc_X_by_AtA(X, m3x3);
- TEST("vnl_fastops::inc_X_by_AtA(X, m3x3)", X, m3x3t*m3x3+m3x3);
- vnl_fastops::dec_X_by_AtA(X, m3x3);
- TEST("vnl_fastops::dec_X_by_AtA(X, m3x3)", X, m3x3);
- vnl_fastops::inc_X_by_AB(X, m3x3, m3x3);
- TEST("vnl_fastops::inc_X_by_AB(X, m3x3,m3x3)", X, m3x3*m3x3+m3x3);
- vnl_fastops::dec_X_by_AB(X, m3x3, m3x3);
- TEST("vnl_fastops::dec_X_by_AB(X, m3x3,m3x3)", X, m3x3);
- vnl_fastops::inc_X_by_AtB(Y, m3x3, v3);
- TEST("vnl_fastops::inc_X_by_AtB(X, m3x3,v3)", Y, m3x3t*v3+v3);
- vnl_fastops::dec_X_by_AtB(Y, m3x3, v3);
- TEST("vnl_fastops::dec_X_by_AtB(X, m3x3,v3)", Y, v3);
- vnl_fastops::inc_X_by_AtB(X, m3x3, m3x3);
- TEST("vnl_fastops::inc_X_by_AtB(X, m3x3,m3x3)", X, m3x3t*m3x3+m3x3);
- vnl_fastops::dec_X_by_AtB(X, m3x3, m3x3);
- TEST("vnl_fastops::dec_X_by_AtB(X, m3x3,m3x3)", X, m3x3);
- vnl_fastops::inc_X_by_ABt(X, m3x3, m3x3);
- TEST("vnl_fastops::inc_X_by_ABt(X, m3x3,m3x3)", X, m3x3*m3x3t+m3x3);
- vnl_fastops::dec_X_by_ABt(X, m3x3, m3x3);
- TEST("vnl_fastops::dec_X_by_ABt(X, m3x3,m3x3)", X, m3x3);
- X = m2x2;
- vnl_fastops::inc_X_by_AB(X, m2x10, m10x2);
- TEST("vnl_fastops::inc_X_by_AB(X, m2x10,m10x2)", X, m2x10*m10x2+m2x2);
- vnl_fastops::dec_X_by_AB(X, m2x10, m10x2);
- TEST("vnl_fastops::dec_X_by_AB(X, m2x10,m10x2)", X, m2x2);
- vnl_fastops::inc_X_by_AtB(X, m10x2, m10x2);
- TEST("vnl_fastops::inc_X_by_AtB(X, m10x2,m10x2)", X, m2x10*m10x2+m2x2);
- vnl_fastops::dec_X_by_AtB(X, m10x2, m10x2);
- TEST("vnl_fastops::dec_X_by_AtB(X, m10x2,m10x2)", X, m2x2);
- vnl_fastops::inc_X_by_ABt(X, m2x10, m2x10);
- TEST("vnl_fastops::inc_X_by_ABt(X, m2x10,m2x10)", X, m2x10*m10x2+m2x2);
- vnl_fastops::dec_X_by_ABt(X, m2x10, m2x10);
- TEST("vnl_fastops::dec_X_by_ABt(X, m2x10,m2x10)", X, m2x2);
- X = m10x2*m2x10;
- vnl_fastops::inc_X_by_AB(X, m10x2, m2x10);
- TEST("vnl_fastops::inc_X_by_AB(X, m10x2,m2x10)", X, m10x2*m2x10*2);
- vnl_fastops::dec_X_by_AB(X, m10x2, m2x10);
- TEST("vnl_fastops::dec_X_by_AB(X, m10x2,m2x10)", X, m10x2*m2x10);
- vnl_fastops::inc_X_by_AtB(X, m2x10, m2x10);
- TEST("vnl_fastops::inc_X_by_AtB(X, m2x10,m2x10)", X, m10x2*m2x10*2);
- vnl_fastops::dec_X_by_AtB(X, m2x10, m2x10);
- TEST("vnl_fastops::dec_X_by_AtB(X, m2x10,m2x10)", X, m10x2*m2x10);
- vnl_fastops::inc_X_by_ABt(X, m10x2, m10x2);
- TEST("vnl_fastops::inc_X_by_ABt(X, m10x2,m10x2)", X, m10x2*m2x10*2);
- vnl_fastops::dec_X_by_ABt(X, m10x2, m10x2);
- TEST("vnl_fastops::dec_X_by_ABt(X, m10x2,m10x2)", X, m10x2*m2x10);
- Y = v2;
- vnl_fastops::inc_X_by_AtB(Y, m10x2, v10);
- TEST("vnl_fastops::inc_X_by_AtB(X, m10x2,v10)", Y, m2x10*v10+v2);
- vnl_fastops::dec_X_by_AtB(Y, m10x2, v10);
- TEST("vnl_fastops::dec_X_by_AtB(X, m10x2,v10)", Y, v2);
- Y = v10;
- vnl_fastops::inc_X_by_AtB(Y, m2x10, v2);
- TEST("vnl_fastops::inc_X_by_AtB(X, m2x10,v2)", Y, m10x2*v2+v10);
- vnl_fastops::dec_X_by_AtB(Y, m2x10, v2);
- TEST("vnl_fastops::dec_X_by_AtB(X, m2x10,v2)", Y, v10);
-}
-
-TESTMAIN(test_fastops);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_file_matrix.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_file_matrix.cxx
deleted file mode 100644
index 255062f0837ef1402ebb9ef111d1e535ef95b659..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_file_matrix.cxx
+++ /dev/null
@@ -1,28 +0,0 @@
-/*
- fsm
-*/
-#include <vcl_iostream.h>
-#include <testlib/testlib_root_dir.h>
-
-#include <testlib/testlib_test.h>
-#include <vnl/vnl_file_matrix.h>
-#include <vnl/vnl_matlab_print.h>
-
-void test_file_matrix()
-{
- vnl_file_matrix<double> H((testlib_root_dir()+
- "/core/vnl/tests/data_3x3_matrix").c_str());
-
- vnl_matlab_print(vcl_cout, H, "H");
- TEST("file_matrix 3x3", H.rows(), 3);
- TEST("file_matrix 3x3", H.cols(), 3);
-
- testlib_test_assert_near("data(1,2)", H(1,2), 0.0185);
-
- H /= H[0][0];
-
- vnl_matlab_print(vcl_cout, H, "H");
- testlib_test_assert_near("file_matrix 3x3", H(0,0), 1.0);
-}
-
-TESTMAIN(test_file_matrix);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_finite.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_finite.cxx
deleted file mode 100644
index 6406028441b61fce5848762a985f9b24fd0e1856..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_finite.cxx
+++ /dev/null
@@ -1,293 +0,0 @@
-//:
-// \file
-// Tests for vnl_finite.h, written by Peter Vanroose, 6 May 2002.
-
-#include <vcl_iostream.h>
-#include <vcl_cstdlib.h> // for atoi()
-#include <testlib/testlib_test.h>
-#include <vnl/vnl_finite.h>
-
-template <int N>
-void test_finite_int(vnl_finite_int<N>)
-{
- vcl_cout << "\n --- Testing vnl_finite_int<" << N << "> ---\n";
-
- vcl_cout << "Phi(" << N << ") = " << vnl_finite_int<N>::totient() << '\n';
- vnl_finite_int<N> g = vnl_finite_int<N>::smallest_generator();
- if (g != 1) {
- vcl_cout << "Smallest multiplicative generator of Z_" << N << " is " << g << '\n';
- TEST("g^(Phi(N)/2) == -1", g.pow(vnl_finite_int<N>::totient()/2), -1);
- }
- if (N <= 1000) { // calculating multiplicative order is time consuming
- unsigned int m = vnl_finite_int<N>(2).multiplicative_order();
- vcl_cout << "Order of 2 in Z_" << N << " is ";
- if (m==(unsigned int)(-1)) vcl_cout << "invalid\n"; else vcl_cout << m << '\n';
- }
-
- vcl_cout << "\nStarting constructor tests:\n";
-
- {vnl_finite_int<N> b(0); TEST("vnl_finite_int<N> b(0);", b, 0);}
- {vnl_finite_int<N> b(1); TEST("vnl_finite_int<N> b(1);", b, 1);}
- {vnl_finite_int<N> b(-1); TEST("vnl_finite_int<N> b(-1);", b, -1);}
- {vnl_finite_int<N> b(-1); TEST("b == N-1;", b, N-1);}
- {vnl_finite_int<N> b(111); TEST("vnl_finite_int<N> b(111);", b, 111);}
- {vnl_finite_int<N> b(-99); TEST("vnl_finite_int<N> b(-99);", b, -99);}
-
- vcl_cout << "\nStarting assignment tests:\n";
- vnl_finite_int<N> b1; b1 = 2;
- TEST("vnl_finite_int<N> b1; b1 = 2;", b1, 2);
- b1 = 10;
- TEST("vnl_finite_int<N> b1; b1 = 10;", b1, 10-N);
- b1 = -77;
- TEST("vnl_finite_int<N> b1; b1 = -77;", b1, 11*N-77);
-
- vnl_finite_int<N> b5 = 4321; b1 = b5;
- TEST("b1 = b5", b1, b5);
-
- vcl_cout << "b1 = " << b1 << vcl_endl
- << "b5 = " << b5 << vcl_endl;
- TEST("<<", 1, 1);
-
- TEST("unary plus", +b5, b5);
-
- vcl_cout << "\nStarting logical comparison tests:\n";
- vnl_finite_int<N> b0=0; vcl_cout << "b0=" << b0 << '\n';
- b1=1; vcl_cout << "b1=" << b1 << '\n';
- vnl_finite_int<N> b2=2; vcl_cout << "b2=" << b2 << '\n';
- vnl_finite_int<N> b3=-2; vcl_cout << "b3=" << b3 << '\n';
-
- TEST("b0 == b0", b0 == b0, true);
- TEST("b0 == b1", b0 == b1, false);
- TEST("b0 == b2", b0 == b2, N==2);
- TEST("b0 == b3", b0 == b3, N==2);
- TEST("b1 == b2", b1 == b2, false);
- TEST("b1 == b3", b1 == b3, N==3);
- TEST("b2 == b3", b2 == b3, N==2 || N==4);
-
- TEST("b0 != b0", b0 != b0, false);
- TEST("b0 != b1", b0 != b1, true);
- TEST("b0 != b2", b0 != b2, N!=2);
- TEST("b0 != b3", b0 != b3, N!=2);
- TEST("b1 != b2", b1 != b2, true);
- TEST("b1 != b3", b1 != b3, N!=3);
- TEST("b2 != b3", b2 != b3, N!=2 && N!=4);
-
- TEST("b3 != b2", b3 != b2, N!=2 && N!=4);
- TEST("b3 != b3", b3 != b3, false);
-
- vcl_cout << "\nStarting addition, subtraction tests:\n";
-
- vnl_finite_int<N> bi,bj,bij;
- vcl_cout << " for (i = 1; i < 1000; i *= 3)\n"
- << " for (j = 1; j < 1000; j *= 3)\n ";
-
- for (int i = 1; i < 1000; i *= 3) {
- for (int j = 1; j < 1000; j *= 3) {
- bi = i; bj = j;
- bij = vnl_finite_int<N>(i+j);
- if (bi + bj != bij) {
- TEST("bi + bj == vnl_finite_int<N>(i + j)", false, true);
- vcl_cout << "i = "<<i<<", j = "<<j<<'\n';
- }
- bij = vnl_finite_int<N>(i-j);
- if (bi - bj != bij) {
- TEST("bi - bj == vnl_finite_int<N>(i - j)", false, true);
- vcl_cout << "i = "<<i<<", j = "<<j<<'\n';
- }
- }
- }
- vcl_cout << vcl_endl;
-
- vnl_finite_int<N> b1000(1000);
-
- TEST("-b0 == b0", -b0, b0);
- TEST("-b1000 == (-1)*b1000", -b1000, (-1)*b1000);
- TEST("-(-b1000) == b1000", -(-b1000), b1000);
- TEST("b0 + b1000 == b1000", b0 + b1000, b1000);
- TEST("b1000 + b0 == b1000", b1000 + b0, b1000);
- TEST("b0 + (-b1000) == -b1000", b0 + (-b1000), -b1000);
- TEST("-b1000 + b0 == -b1000", -b1000 + b0, -b1000);
- TEST("-b1000 + (-b1000) == 2*(-b1000))", -b1000 + (-b1000), 2*(-b1000));
- TEST("b1000 + (-b1000) == b0", b1000 + (-b1000), b0);
-
- TEST("b0 - b1000 == -b1000", b0 - b1000, -b1000);
- TEST("b1000 - b0 == b1000", b1000 - b0, b1000);
- TEST("b0 - (-b1000) == b1000", b0 - (-b1000), b1000);
- TEST("-b1000 - b0 == -b1000", -b1000 - b0, -b1000);
- TEST("-b1000 - (-b1000) == b0", -b1000 - (-b1000), b0);
- TEST("-b1000 - b1000 == -2*b1000", -b1000 - b1000, -2*b1000);
- TEST("b1000 - (-b1000) == 2*b1000", b1000 - (-b1000), 2*b1000);
-
- b2 = 1237; // should not be divisible by 2, 3, 5, 7, 11
- b3 = 4321;
- TEST("(b2+b3) - b2 = b3", (b2+b3) - b2, b3);
- TEST("(b2+b3) - b3 = b2", (b2+b3) - b3, b2);
-
- vcl_cout << "\nStarting multiplication tests:\n";
-
- TEST("b0*b0 == b0", b0*b0, b0);
- TEST("b0*b1000 == b0", b0*b1000, b0);
- TEST("b1000*b0 == b0", b1000*b0, b0);
- vnl_finite_int<N> b1000000(1000000);
- TEST("b1000*b1000 == b1000000", b1000*b1000, b1000000);
- TEST("b1000*b1000000 == b1000000*b1000", b1000*b1000000, b1000000*b1000);
-
- if (b1000.is_unit()) {
- vnl_finite_int<N> bb = 1;
- for (int phi = vnl_finite_int<N>::totient(); phi > 0; --phi) bb *= b1000;
- TEST("b1000^Phi(N) == 1", bb, 1);
- }
-
- vcl_cout << "\nStarting division tests:\n";
-
- TEST("b0/b1", b0/b1, 0);
- TEST("(-b1)/b1", (-b1)/b1, -1);
-
- TEST("(b2*b3) / b3 = b2", (b2*b3) / b3, b2);
- TEST("(b2*b3) / b2 = b3", (b2*b3) / b2, b3);
-
- // Do not continue when N is too large, since that would take too long
- if (N > 1000) return;
-
- vcl_cout << " for (i = 10000; i > 0; i /= 3)\n"
- << " for (j = 10000; j > 0; j /= 3)\n"
- << " for (k = 1; k < 17; ++k)\n"
- << " for (l = 1; l < 17; ++l)\n ";
- for (int i = 10000; i > 0; i /= 3) {
- for (int j = 10000; j > 0; j /= 3) {
- for (int k = 1; k < 17; ++k) {
- for (int l = 1; l < 17; ++l) {
- b1 = vnl_finite_int<N>(i+k);
- b2 = vnl_finite_int<N>(j+l);
- if (b2.is_zero_divisor()) continue; // division by zero divisors is undefined
- b3 = b1/b2;
- int r = int(b3); r = r*(j+l)-(i+k);
- if (r%N) {
- TEST("(vnl_finite_int<N>(i+k)/vnl_finite_int<N>(j+l))", false, true);
- vcl_cout<< "i="<<i<<", j="<<j<<", k="<<k<<", l="<<l<<'\n'
- << "b1="<<int(b1)<<", b2="<<int(b2)<<", b3="<<int(b3)<<'\n';
- }
- }
- }
- }
- }
- vcl_cout << vcl_endl;
-}
-
-template <int N, int M>
-void test_finite_poly(vnl_finite_int_poly<N,M>, vcl_string s)
-{
- vcl_cout << "\n --- Testing vnl_finite_int_poly<" << N << ',' << M << "> ---\n";
-
- vcl_cout << "\nStarting constructor tests:\n";
-
- vnl_finite_int_poly<N,M> b0; vcl_cout << b0 << '\n';
- TEST("vnl_finite_int_poly<N,M> b0;", b0, 0);
- vcl_vector<vnl_finite_int<N> > p(1); p[0]=1;
- vnl_finite_int_poly<N,M> b(p); vcl_cout << b << '\n';
- TEST("vnl_finite_int_poly<N,M> b(p);", b, 1);
-
- vcl_cout << "\nStarting assignment tests:\n";
- vnl_finite_int<N> b1 = 2; b = b1;
- TEST("vnl_finite_int<N> b1; b = b1;", b, 2);
-
- TEST("unary plus", +b, b);
- TEST("unary minus", -b, N-2);
-
- vcl_cout << "\nStarting addition, subtraction tests:\n";
-
- vcl_cout << " for (i = 1; i < 1000; i *= 3)\n"
- << " for (j = 1; j < 1000; j *= 3)\n ";
-
- for (int i = 1000; i > 0; i /= 3) {
- for (int j = 1000; j > 0; j /= 3) {
- vcl_vector<vnl_finite_int<N> > v1(M), v2(M), v3(M);
- for (int m = 0; m < M; ++m) {
- v1[m] = i+m; v2[m] = j+m, v3[m] = i+j+2*m;
- }
- vnl_finite_int_poly<N,M> p1(v1);
- vnl_finite_int_poly<N,M> p2(v2);
- vnl_finite_int_poly<N,M> p3(v3);
-#ifdef DEBUG
- vcl_cout << p3 << "\n ";
-#endif
- if (p1 + p2 != p3) {
- TEST("p1 + p2", false, true);
- vcl_cout << "i = "<<i<<", j = "<<j<<'\n';
- }
- if (p3 - p2 != p1) {
- TEST("p3 - p2", false, true);
- vcl_cout << "i = "<<i<<", j = "<<j<<'\n';
- }
- }
- }
-
- vcl_cout << "\nStarting multiplication tests:\n";
-
- vcl_vector<vnl_finite_int<N> > mod_p(M+1);
- for (int m=0; m<=M; ++m)
- mod_p[m] = vcl_atoi(s.c_str()+2*m);
-
- mod_p = vnl_finite_int_poly<N,M>::modulo_polynomial(mod_p);
- TEST("Setting modulo polynomial", 1, 1);
-
- mod_p.pop_back();
- vnl_finite_int_poly<N,M> irred = mod_p;
- vcl_cout << "X^" << M << " = " << irred << '\n';
-
- vcl_vector<vnl_finite_int<N> > v(M);
- for (int m = 0; m < M; ++m) v[m] = m+1+m*m;
- vnl_finite_int_poly<N,M> x(v);
- vcl_cout << "x = " << x << '\n';
- for (int m = 0; m < M; ++m) v[m] = m+1-m*m;
- vnl_finite_int_poly<N,M> y(v);
- vcl_cout << "y = " << y << '\n';
- y *= x;
- TEST("multiplying y with x", 1, 1);
- vcl_cout << "y * x = " << y << '\n';
-
- // Is irred indeed a polynomial of maximal multiplicative order?
- vnl_finite_int_poly<N,M> t = vnl_finite_int<N>(1);
- unsigned int order = 1;
- do t *= irred; while (t != vnl_finite_int<N>(1) && ++order < t.cardinality());
- TEST("multiplicative order", order != 0 && order < t.cardinality(), true);
- vcl_cout << "Multiplicative order of " << irred << " is " << order << '\n';
- TEST("multiplicative order", irred.multiplicative_order(), order);
- if (order+1 == t.cardinality())
- vcl_cout << "This is a Galois field of order " << order+1 << '\n';
- TEST("Field?", t.is_field(), order+1 == t.cardinality());
-
- vcl_cout << vcl_endl;
-}
-
-void test_finite()
-{
- test_finite_int(vnl_finite_int<2>(0));
- test_finite_int(vnl_finite_int<3>(0));
- test_finite_int(vnl_finite_int<4>(0)); // not a field
- vnl_finite_int<4> b4 = 2; TEST("2*2=0 mod 4", b4*b4, 0); // zero divisor
- test_finite_int(vnl_finite_int<5>(0)); // Fermat prime
- test_finite_int(vnl_finite_int<6>(0));
- vnl_finite_int<6> b6 = 2; TEST("2*3=0 mod 6", b6*3, 0); // zero divisor
- test_finite_int(vnl_finite_int<7>(0)); // Mersenne prime
- test_finite_int(vnl_finite_int<8>(0));
- test_finite_int(vnl_finite_int<9>(0));
- test_finite_int(vnl_finite_int<10>(0));
- test_finite_int(vnl_finite_int<17>(0)); // Fermat prime
- test_finite_int(vnl_finite_int<31>(0)); // Mersenne prime
- test_finite_int(vnl_finite_int<100>(0)); // non-prime square
- vnl_finite_int<100> b100 = 20; TEST("25*20=0 mod 100", 25*b100, 0); // zero divisor
- test_finite_int(vnl_finite_int<243>(0)); // high prime power
- test_finite_int(vnl_finite_int<256>(0)); // high power of 2
- test_finite_int(vnl_finite_int<432>(0)); // high combined power of 2 and 3
- vnl_finite_int<432> b432 = 180; TEST("180*12=0 mod 432", b432*12, 0); // zero divisor
- test_finite_int(vnl_finite_int<257>(0)); // Fermat prime
- test_finite_int(vnl_finite_int<0x10001>(0)); // Fermat prime
-
- test_finite_poly(vnl_finite_int_poly<2,5>(0), "1 0 1 0 0 1"); // this is GF(32)
- test_finite_poly(vnl_finite_int_poly<3,3>(0), "1 2 0 1"); // this is GF(27)
- test_finite_poly(vnl_finite_int_poly<3,3>(0), "1 1 0 1"); // not a field
- test_finite_poly(vnl_finite_int_poly<6,2>(0), "1 0 1");
-}
-
-TESTMAIN(test_finite);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_gamma.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_gamma.cxx
deleted file mode 100644
index 275149e9b0e08f35fd0fc7794ea2bcf3ccb99043..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_gamma.cxx
+++ /dev/null
@@ -1,43 +0,0 @@
-// This is core/vnl/tests/test_gamma.cxx
-#include <vnl/vnl_gamma.h>
-#include <vnl/vnl_erf.h>
-#include <testlib/testlib_test.h>
-
-static void test_gamma()
-{
- TEST_NEAR("vnl_log_gamma(1)", vnl_log_gamma(1), 0, 1e-8);
- TEST_NEAR("vnl_gamma(1))", vnl_gamma(1), 1, 1e-8);
-
- // `true' values obtained from http://www.efunda.com/math/gamma/findgamma.cfm
- TEST_NEAR("vnl_gamma(0.5))", vnl_gamma(0.5), 1.77245385091, 1e-10);
- TEST_NEAR("vnl_gamma(1.5))", vnl_gamma(1.5), 0.88622692545, 1e-10);
- TEST_NEAR("vnl_gamma(10.7))", vnl_gamma(10.7), 1799844.07893, 1e-5);
-
- TEST_NEAR("vnl_gamma_p(2,0)", vnl_gamma_p(2,0), 0, 1e-8);
- TEST_NEAR("vnl_gamma_p(2,inf)", vnl_gamma_p(2,1e9), 1.0, 1e-8);
-
- // Values from MATLAB
- TEST_NEAR("vnl_gamma_p(2.5,1.5)", vnl_gamma_p(2.5,1.5), 0.300014164, 1e-8);
- TEST_NEAR("vnl_gamma_p(2.5,0.5)", vnl_gamma_p(2.5,0.5), 0.037434227, 1e-8);
- // Next one not so accurate?
- TEST_NEAR("vnl_gamma_p(10,10)", vnl_gamma_p(10,10), 0.542070286, 1e-6);
-
- TEST_NEAR("vnl_gamma_q(2,0)", vnl_gamma_q(2,0), 1.0, 1e-8);
- TEST_NEAR("vnl_gamma_q(2,inf)", vnl_gamma_q(2,1e9), 0, 1e-8);
- TEST_NEAR("vnl_erf(0)", vnl_erf(0), 0, 1e-8);
- TEST_NEAR("vnl_erf(inf)", vnl_erf(1e9), 1.0, 1e-8);
- TEST_NEAR("vnl_erf(-inf)", vnl_erf(-1e9), -1.0, 1e-8);
- TEST("vnl_erfc(0)", vnl_erfc(0.0), 1.0);
- TEST_NEAR("vnl_erfc(0.2) = 1-vnl_erf(0.2)", vnl_erfc(0.2), 1.0-vnl_erf(0.2), 1e-8);
- TEST_NEAR("vnl_erfc(1.2) = 1-vnl_erf(1.2)", vnl_erfc(1.2), 1.0-vnl_erf(1.2), 1e-6);
- TEST_NEAR("vnl_erfc(2)", vnl_erfc(2), 0.00467773498105, 1e-8);
- TEST_NEAR_REL("vnl_erfc(6)", vnl_erfc(6), 2.15197367125e-17,1e-8);
- TEST_NEAR("vnl_erfc(inf)", vnl_erfc(1e9), 0.0, 1e-8);
- TEST_NEAR("vnl_erfc(-inf)", vnl_erfc(-1e9), 2.0, 1e-8);
-
- TEST_NEAR("vnl_scaled_erfc(6)", vnl_scaled_erfc(6.), vcl_exp(36.)*vnl_erfc(6.), 0.01);
- TEST_NEAR("vnl_scaled_erfc(100)", vnl_scaled_erfc(100.), 0.0056, 0.01);
- TEST_NEAR("vnl_scaled_erfc(-inf)", vnl_scaled_erfc(-1e9), 0.0, 1e-8);
-}
-
-TESTMAIN(test_gamma);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_hungarian_algorithm.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_hungarian_algorithm.cxx
deleted file mode 100644
index c95165dcc9c61839da47541fd053227550f2d45c..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_hungarian_algorithm.cxx
+++ /dev/null
@@ -1,127 +0,0 @@
-#include <vnl/vnl_hungarian_algorithm.h>
-#include <testlib/testlib_test.h>
-
-// not used? #include <vcl_iostream.h>
-#include <vcl_limits.h>
-#include <vnl/vnl_matrix.h>
-
-static void test_hungarian_algorithm( int, char*[] )
-{
- {
- double cost_val[3][3] = { { 1, 2, 3 },
- { 2, 4, 6 },
- { 3, 6, 9 } };
-
- vnl_matrix<double> cost( &cost_val[0][0], 3, 3 );
-
- testlib_test_begin( "Test 3x3 cost matrix" );
- vcl_vector<unsigned> assign = vnl_hungarian_algorithm( cost );
- testlib_test_perform( assign.size()==3 &&
- assign[0]==2 &&
- assign[1]==1 &&
- assign[2]==0 );
- }
-
- {
- double cost_val[4][4] = { { 2.0, 1.0, 5.0, 3.0 },
- { 0.5, 6.0, 3.0, 0.5 },
- { 5.0, 2.0, 1.0, 6.0 },
- { 7.0, 1.0, 3.0, 0.1 } };
- vnl_matrix<double> cost( &cost_val[0][0], 4, 4 );
-
- testlib_test_begin( "Test 4x4 cost matrix" );
- vcl_vector<unsigned> assign = vnl_hungarian_algorithm( cost );
- testlib_test_perform( assign.size()==4 &&
- assign[0]==1 &&
- assign[1]==0 &&
- assign[2]==2 &&
- assign[3]==3 );
- }
-
- {
- double cost_val[3][4] = { { 2.0, 1.0, 5.0, 3.0 },
- { 0.5, 6.0, 3.0, 0.5 },
- { 7.0, 1.0, 3.0, 0.1 } };
- vnl_matrix<double> cost( &cost_val[0][0], 3, 4 );
-
- testlib_test_begin( "Test 3x4 cost matrix" );
- vcl_vector<unsigned> assign = vnl_hungarian_algorithm( cost );
- testlib_test_perform( assign.size()==3 &&
- assign[0]==1 &&
- assign[1]==0 &&
- assign[2]==3 );
- }
-
- {
- double cost_val[4][3] = { { 2.0, 0.5, 7.0 },
- { 1.0, 6.0, 1.0 },
- { 5.0, 3.0, 3.0 },
- { 3.0, 0.5, 0.1 } };
-
- vnl_matrix<double> cost( &cost_val[0][0], 4, 3 );
-
- testlib_test_begin( "Test 4x3 cost matrix" );
- vcl_vector<unsigned> assign = vnl_hungarian_algorithm( cost );
- testlib_test_perform( assign.size()==4 &&
- assign[0]==1 &&
- assign[1]==0 &&
- assign[2]==(unsigned int)(-1) &&
- assign[3]==2 );
- }
-
- {
- double cost_val[5][3] = { { 2.0, 0.5, 7.0 },
- { 1.1, 6.0, 1.0 },
- { 1.0, 2.0, 1.0 },
- { 5.0, 3.0, 3.0 },
- { 3.0, 0.5, 0.1 } };
-
- vnl_matrix<double> cost( &cost_val[0][0], 5, 3 );
-
- testlib_test_begin( "Test 5x3 cost matrix" );
- vcl_vector<unsigned> assign = vnl_hungarian_algorithm( cost );
- testlib_test_perform( assign.size()==5 &&
- assign[0]==1 &&
- assign[1]==(unsigned int)(-1) &&
- assign[2]==0 &&
- assign[3]==(unsigned int)(-1) &&
- assign[4]==2 );
-
- testlib_test_begin( "Test 3x5 cost matrix" );
- vcl_vector<unsigned> assign2 = vnl_hungarian_algorithm( cost.transpose() );
- testlib_test_perform( assign2.size()==3 &&
- assign2[0]==2 &&
- assign2[1]==0 &&
- assign2[2]==4 );
- }
-
- double Inf = vcl_numeric_limits<double>::infinity();
-
- {
- double cost_val[5][3] = { { 2.0, 0.5, 7.0 },
- { 1.1, 6.0, 1.0 },
- { 1.0, 2.0, 1.0 },
- { Inf, 3.0, 3.0 },
- { 3.0, 0.5, 0.1 } };
-
- vnl_matrix<double> cost( &cost_val[0][0], 5, 3 );
-
- testlib_test_begin( "Test 5x3 cost matrix with Inf" );
- vcl_vector<unsigned> assign = vnl_hungarian_algorithm( cost );
- testlib_test_perform( assign.size()==5 &&
- assign[0]==1 &&
- assign[1]==(unsigned int)(-1) &&
- assign[2]==0 &&
- assign[3]==(unsigned int)(-1) &&
- assign[4]==2 );
-
- testlib_test_begin( "Test 3x5 cost matrix with Inf" );
- vcl_vector<unsigned> assign2 = vnl_hungarian_algorithm( cost.transpose() );
- testlib_test_perform( assign2.size()==3 &&
- assign2[0]==2 &&
- assign2[1]==0 &&
- assign2[2]==4 );
- }
-}
-
-TESTMAIN_ARGS( test_hungarian_algorithm )
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_include.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_include.cxx
deleted file mode 100644
index 4cbbd95d3d2049b5c91c611973f90b488af98557..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_include.cxx
+++ /dev/null
@@ -1,117 +0,0 @@
-#include <vnl/vnl_fwd.h>
-
-#include <vnl/vnl_T_n.h>
-#include <vnl/vnl_alloc.h>
-#include <vnl/vnl_analytic_integrant.h>
-#include <vnl/vnl_bessel.h>
-#include <vnl/vnl_bignum.h>
-#include <vnl/vnl_bignum_traits.h>
-#include <vnl/vnl_block.h>
-#include <vnl/vnl_c_vector.h>
-#include <vnl/vnl_complex.h>
-#include <vnl/vnl_complexify.h>
-#include <vnl/vnl_complex_traits.h>
-#include <vnl/vnl_copy.h>
-#include <vnl/vnl_cross.h>
-#include <vnl/vnl_cost_function.h>
-#include <vnl/vnl_cross_product_matrix.h>
-#include <vnl/vnl_definite_integral.h>
-#include <vnl/vnl_det.h>
-#include <vnl/vnl_diag_matrix.h>
-#include <vnl/vnl_double_1x1.h>
-#include <vnl/vnl_double_1x2.h>
-#include <vnl/vnl_double_1x3.h>
-#include <vnl/vnl_double_2.h>
-#include <vnl/vnl_double_2x1.h>
-#include <vnl/vnl_double_2x2.h>
-#include <vnl/vnl_double_2x3.h>
-#include <vnl/vnl_double_3.h>
-#include <vnl/vnl_double_3x1.h>
-#include <vnl/vnl_double_3x2.h>
-#include <vnl/vnl_double_3x3.h>
-#include <vnl/vnl_double_3x4.h>
-#include <vnl/vnl_double_4.h>
-#include <vnl/vnl_double_4x3.h>
-#include <vnl/vnl_double_4x4.h>
-#include <vnl/vnl_erf.h>
-#include <vnl/vnl_error.h>
-#include <vnl/vnl_fastops.h>
-#include <vnl/vnl_file_matrix.h>
-#include <vnl/vnl_file_vector.h>
-#include <vnl/vnl_finite.h>
-#include <vnl/vnl_float_1x1.h>
-#include <vnl/vnl_float_1x2.h>
-#include <vnl/vnl_float_1x3.h>
-#include <vnl/vnl_float_2.h>
-#include <vnl/vnl_float_2x1.h>
-#include <vnl/vnl_float_2x2.h>
-#include <vnl/vnl_float_3.h>
-#include <vnl/vnl_float_3x1.h>
-#include <vnl/vnl_float_3x3.h>
-#include <vnl/vnl_float_3x4.h>
-#include <vnl/vnl_float_4.h>
-#include <vnl/vnl_float_4x3.h>
-#include <vnl/vnl_float_4x4.h>
-#include <vnl/vnl_fortran_copy.h>
-#include <vnl/vnl_gamma.h>
-#include <vnl/vnl_hungarian_algorithm.h>
-#include <vnl/vnl_identity.h>
-#include <vnl/vnl_identity_3x3.h>
-#include <vnl/vnl_imag.h>
-#include <vnl/vnl_int_1x1.h>
-#include <vnl/vnl_int_2.h>
-#include <vnl/vnl_int_2x2.h>
-#include <vnl/vnl_int_3.h>
-#include <vnl/vnl_int_4.h>
-#include <vnl/vnl_int_matrix.h>
-#include <vnl/vnl_integrant_fnct.h>
-#include <vnl/vnl_inverse.h>
-#include <vnl/vnl_least_squares_cost_function.h>
-#include <vnl/vnl_least_squares_function.h>
-#include <vnl/vnl_linear_operators_3.h>
-#include <vnl/vnl_linear_system.h>
-#include <vnl/vnl_math.h>
-#include <vnl/vnl_matlab_filewrite.h>
-#include <vnl/vnl_matlab_header.h>
-#include <vnl/vnl_matlab_print.h>
-#include <vnl/vnl_matlab_print2.h>
-#include <vnl/vnl_matlab_print_format.h>
-#include <vnl/vnl_matlab_print_scalar.h>
-#include <vnl/vnl_matlab_read.h>
-#include <vnl/vnl_matlab_write.h>
-#include <vnl/vnl_matops.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_matrix_exp.h>
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/vnl_matrix_ref.h>
-#include <vnl/vnl_matrix_fixed_ref.h>
-#include <vnl/vnl_nonlinear_minimizer.h>
-#include <vnl/vnl_numeric_traits.h>
-#include <vnl/vnl_operators.h>
-#include <vnl/vnl_quaternion.h>
-#include <vnl/vnl_rank.h>
-#include <vnl/vnl_random.h>
-#include <vnl/vnl_rational.h>
-#include <vnl/vnl_rational_traits.h>
-#include <vnl/vnl_real.h>
-#include <vnl/vnl_real_npolynomial.h>
-#include <vnl/vnl_real_polynomial.h>
-#include <vnl/vnl_rotation_matrix.h>
-#include <vnl/vnl_sample.h>
-#include <vnl/vnl_scalar_join_iterator.h>
-#include <vnl/vnl_sparse_matrix.h>
-#include <vnl/vnl_sparse_matrix_linear_system.h>
-#include <vnl/vnl_sym_matrix.h>
-#include <vnl/vnl_tag.h>
-#include <vnl/vnl_trace.h>
-#include <vnl/vnl_transpose.h>
-#include <vnl/vnl_unary_function.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_vector_fixed.h>
-#include <vnl/vnl_vector_ref.h>
-#include <vnl/vnl_vector_fixed_ref.h>
-
-// Put vnl_config.h at the end, to verify that none of the above implicitly depend on it
-#include <vnl/vnl_config.h>
-
-int main() { return 0; }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_integrant.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_integrant.cxx
deleted file mode 100644
index 07599d820456f3ede8e1ccd77d422c037903ab39..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_integrant.cxx
+++ /dev/null
@@ -1,18 +0,0 @@
-// not used? #include <vcl_iostream.h>
-#include <vnl/vnl_integrant_fnct.h>
-#include <testlib/testlib_test.h>
-
-class my_test_integrant : public vnl_integrant_fnct
-{
- public:
- double f_(double x) { return x/(1+x*x); }
-};
-
-void test_integrant()
-{
- my_test_integrant f;
-
- TEST_NEAR("test integrant f = x/(1+x^2) when x=1, f is ", f.f_(1), 0.5, 1e-13);
-}
-
-TESTMAIN(test_integrant);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_inverse.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_inverse.cxx
deleted file mode 100644
index 5cfa746d8f03736af8edf701e6c91198db6bacc6..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_inverse.cxx
+++ /dev/null
@@ -1,182 +0,0 @@
-#include <vnl/vnl_inverse.h>
-#include <vnl/vnl_double_2x2.h>
-#include <vnl/vnl_double_3x3.h>
-#include <vnl/vnl_double_4x4.h>
-#include <vnl/vnl_random.h>
-
-#include <testlib/testlib_test.h>
-
-static void test_inverse()
-{
- double eps = 1e-11;
- vnl_random rng(9667566ul);
- vnl_double_2x2 residue2, id2; id2.set_identity();
- vnl_double_3x3 residue3, id3; id3.set_identity();
- vnl_double_4x4 residue4, id4; id4.set_identity();
- vnl_matrix<double> M, Mi;
-
- // 2x2 inverse of a specific matrix
- vnl_double_2x2 id2i = vnl_inverse(id2);
- TEST("vnl_inverse of 2x2 Id", id2i, id2);
- id2i = vnl_inverse_transpose(id2);
- TEST("vnl_inverse_transpose of 2x2 Id", id2i, id2);
-
- double M2[4] = {
- 0.60684258354179, 0.89129896614890,
- 0.48598246870930, 0.76209683302739
- };
- vnl_double_2x2 m2(M2);
- vnl_double_2x2 m2i = vnl_inverse(m2);
- residue2 = m2*m2i - id2;
- TEST_NEAR("2x2 vnl_inverse", residue2.array_inf_norm(), 0.0, eps);
- residue2 = m2i*m2 - id2;
- TEST_NEAR("2x2 vnl_inverse", residue2.array_inf_norm(), 0.0, eps);
-
- m2i = vnl_inverse_transpose(m2);
- residue2 = m2.transpose()*m2i - id2;
- TEST_NEAR("2x2 vnl_inverse_transpose", residue2.array_inf_norm(), 0.0, eps);
- residue2 = m2i.transpose()*m2 - id2;
- TEST_NEAR("2x2 vnl_inverse_transpose", residue2.array_inf_norm(), 0.0, eps);
-
- M = m2;
- Mi = vnl_inverse(M);
- residue2 = m2*Mi - id2;
- TEST_NEAR("2x2 vnl_inverse", residue2.array_inf_norm(), 0.0, eps);
-
- Mi = vnl_inverse_transpose(M).transpose();
- residue2 = m2*Mi - id2;
- TEST_NEAR("2x2 vnl_inverse_transpose", residue2.array_inf_norm(), 0.0, eps);
-
- // 2x2 inverse of random matrix
- for (int i=0; i<4; ++i) M2[i] = rng.drand32(-1.0,1.0);
- vnl_double_2x2 m2r(M2);
- m2i = vnl_inverse(m2r);
- residue2 = m2r*m2i - id2;
- TEST_NEAR("rand 2x2 vnl_inverse", residue2.array_inf_norm(), 0.0, eps);
- residue2 = m2i*m2r - id2;
- TEST_NEAR("rand 2x2 vnl_inverse", residue2.array_inf_norm(), 0.0, eps);
-
- m2i = vnl_inverse_transpose(m2r);
- residue2 = m2r.transpose()*m2i - id2;
- TEST_NEAR("rand 2x2 vnl_inverse_transpose", residue2.array_inf_norm(), 0.0, eps);
- residue2 = m2i.transpose()*m2r - id2;
- TEST_NEAR("rand 2x2 vnl_inverse_transpose", residue2.array_inf_norm(), 0.0, eps);
-
- // 3x3 inverse of a specific matrix
- vnl_double_3x3 id3i = vnl_inverse(id3);
- TEST("vnl_inverse of 3x3 Id", id3i, id3);
- id3i = vnl_inverse_transpose(id3);
- TEST("vnl_inverse_transpose of 3x3 Id", id3i, id3);
-
- double M3[9] = {
- 0.45646766516834, 0.44470336435319, 0.92181297074480,
- 0.01850364324822, 0.61543234810009, 0.73820724581067,
- 0.82140716429525, 0.79193703742704, 0.17626614449462
- };
- vnl_double_3x3 m3(M3);
- vnl_double_3x3 m3i = vnl_inverse(m3);
- residue3 = m3*m3i - id3;
- TEST_NEAR("3x3 vnl_inverse", residue3.array_inf_norm(), 0.0, eps);
- residue3 = m3i*m3 - id3;
- TEST_NEAR("3x3 vnl_inverse", residue3.array_inf_norm(), 0.0, eps);
-
- m3i = vnl_inverse_transpose(m3);
- residue3 = m3.transpose()*m3i - id3;
- TEST_NEAR("3x3 vnl_inverse_transpose", residue3.array_inf_norm(), 0.0, eps);
- residue3 = m3i.transpose()*m3 - id3;
- TEST_NEAR("3x3 vnl_inverse_transpose", residue3.array_inf_norm(), 0.0, eps);
-
- M = m3;
- Mi = vnl_inverse(M);
- residue3 = m3*Mi - id3;
- TEST_NEAR("3x3 vnl_inverse", residue3.array_inf_norm(), 0.0, eps);
-
- Mi = vnl_inverse_transpose(M).transpose();
- residue3 = m3*Mi - id3;
- TEST_NEAR("3x3 vnl_inverse_transpose", residue3.array_inf_norm(), 0.0, eps);
-
- // 3x3 inverse of random matrix
- for (int i=0; i<9; ++i) M3[i] = rng.drand32(-1.0,1.0);
- vnl_double_3x3 m3r(M3);
- m3i = vnl_inverse(m3r);
- residue3 = m3r*m3i - id3;
- TEST_NEAR("3x3 vnl_inverse", residue3.array_inf_norm(), 0.0, eps);
- residue3 = m3i*m3r - id3;
- TEST_NEAR("3x3 vnl_inverse", residue3.array_inf_norm(), 0.0, eps);
-
- m3i = vnl_inverse_transpose(m3r);
- residue3 = m3r.transpose()*m3i - id3;
- TEST_NEAR("rand 3x3 vnl_inverse_transpose", residue3.array_inf_norm(), 0.0, eps);
- residue3 = m3i.transpose()*m3r - id3;
- TEST_NEAR("rand 3x3 vnl_inverse_transpose", residue3.array_inf_norm(), 0.0, eps);
-
- // 4x4 inverse of a specific matrix
- vnl_double_4x4 id4i = vnl_inverse(id4);
- TEST("vnl_inverse of 4x4 Id", id4i, id4);
- id4i = vnl_inverse_transpose(id4);
- TEST("vnl_inverse_transpose of 4x4 Id", id4i, id4);
-
- double M4[16] = {
- 0.40570621306210, 0.89364953091353, 0.00986130066092, 0.60379247919382,
- 0.93546969910761, 0.05789130478427, 0.13889088195695, 0.27218792496996,
- 0.91690443991341, 0.35286813221700, 0.20276521856027, 0.19881426776106,
- 0.41027020699095, 0.81316649730376, 0.19872174266149, 0.01527392702904
- };
- vnl_double_4x4 m4(M4);
- vnl_double_4x4 m4i = vnl_inverse(m4);
- residue4 = m4*m4i - id4;
- TEST_NEAR("4x4 vnl_inverse", residue4.array_inf_norm(), 0.0, eps);
- residue4 = m4i*m4 - id4;
- TEST_NEAR("4x4 vnl_inverse", residue4.array_inf_norm(), 0.0, eps);
-
- m4i = vnl_inverse_transpose(m4);
- residue4 = m4.transpose()*m4i - id4;
- TEST_NEAR("4x4 vnl_inverse_transpose", residue4.array_inf_norm(), 0.0, eps);
- residue4 = m4i.transpose()*m4 - id4;
- TEST_NEAR("4x4 vnl_inverse_transpose", residue4.array_inf_norm(), 0.0, eps);
-
- M = m4;
- Mi = vnl_inverse(M);
- residue4 = m4*Mi - id4;
- TEST_NEAR("4x4 vnl_inverse", residue4.array_inf_norm(), 0.0, eps);
-
- Mi = vnl_inverse_transpose(M).transpose();
- residue4 = m4*Mi - id4;
- TEST_NEAR("4x4 vnl_inverse_transpose", residue4.array_inf_norm(), 0.0, eps);
-
- // 4x4 inverse of random matrix
- for (int i=0; i<16; ++i) M4[i] = rng.drand32(-1.0,1.0);
- vnl_double_4x4 m4r(M4);
- m4i = vnl_inverse(m4r);
- residue4 = m4r*m4i - id4;
- TEST_NEAR("4x4 vnl_inverse", residue4.array_inf_norm(), 0.0, eps);
- residue4 = m4i*m4r - id4;
- TEST_NEAR("4x4 vnl_inverse", residue4.array_inf_norm(), 0.0, eps);
-
- m4i = vnl_inverse_transpose(m4r);
- residue4 = m4r.transpose()*m4i - id4;
- TEST_NEAR("rand 4x4 vnl_inverse_transpose", residue4.array_inf_norm(), 0.0, eps);
- residue4 = m4i.transpose()*m4r - id4;
- TEST_NEAR("rand 4x4 vnl_inverse_transpose", residue4.array_inf_norm(), 0.0, eps);
-
- // 4x4 inverse of a specific sparse matrix
- double M4s[16] = {
- 0.9998, 0.0, 0.02, 0.059,
- 0.0, 1.0, 0.0, 0.0,
- -0.02, 0.0, 0.9998, 0.0,
- 0.0, 0.0, 0.0, 1.0
- };
- vnl_double_4x4 m4s(M4s);
- m4i = vnl_inverse(m4s);
- residue4 = m4s*m4i - id4;
- TEST_NEAR("4x4 vnl_inverse", residue4.array_inf_norm(), 0.0, eps);
- residue4 = m4i*m4s - id4;
- TEST_NEAR("4x4 vnl_inverse", residue4.array_inf_norm(), 0.0, eps);
- m4i = vnl_inverse_transpose(m4s);
- residue4 = m4s.transpose()*m4i - id4;
- TEST_NEAR("4x4 vnl_inverse_transpose", residue4.array_inf_norm(), 0.0, eps);
- residue4 = m4i.transpose()*m4s - id4;
- TEST_NEAR("4x4 vnl_inverse_transpose", residue4.array_inf_norm(), 0.0, eps);
-}
-
-TESTMAIN(test_inverse);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_math.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_math.cxx
deleted file mode 100644
index 32db802e1f3e22bf98e6a6de12a62794e3e6cb5c..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_math.cxx
+++ /dev/null
@@ -1,312 +0,0 @@
-#include <vcl_iostream.h>
-#include <vcl_iomanip.h>
-#include <vcl_limits.h> // for infinity()
-#include <vnl/vnl_math.h>
-#include <vnl/vnl_complex.h>
-#include <testlib/testlib_test.h>
-
-
-static
-void check_pointer( const void *)
-{
-}
-
-static
-void test_static_const_definition()
-{
- // The Intel compiler has problems resolving static consts with this test
- // as it stands
-#if !defined(__INTEL_COMPILER)
- check_pointer( &vnl_math::e );
- check_pointer( &vnl_math::log2e );
- check_pointer( &vnl_math::log10e );
- check_pointer( &vnl_math::ln2 );
- check_pointer( &vnl_math::ln10 );
- check_pointer( &vnl_math::pi );
- check_pointer( &vnl_math::pi_over_2 );
- check_pointer( &vnl_math::pi_over_4 );
- check_pointer( &vnl_math::one_over_pi );
- check_pointer( &vnl_math::two_over_pi );
- check_pointer( &vnl_math::two_over_sqrtpi );
- check_pointer( &vnl_math::sqrt2 );
- check_pointer( &vnl_math::sqrt1_2 );
- check_pointer( &vnl_math::eps );
- check_pointer( &vnl_math::sqrteps );
-#endif
-}
-
-void test_math()
-{
- // Call it to avoid compiler warnings
- test_static_const_definition();
-
- int n = -11;
- float f = -7.5;
- double d = -vnl_math::pi;
- vcl_complex<double> i(0,1);
- vcl_complex<double> z(-1,2);
- vcl_complex<double> e_ipi = vcl_exp(d*i);
-
- vcl_cout << "n = " << n << vcl_endl
- << "f = " << f << vcl_endl
- << "d = " << d << vcl_endl
- << "i = " << i << vcl_endl
- << "z = " << z << vcl_endl
- << "exp(d*i) = " << e_ipi << vcl_endl
- << vcl_endl
-
- << "abs(n) = " << vnl_math_abs(n) << vcl_endl
- << "abs(f) = " << vnl_math_abs(f) << vcl_endl
- << "abs(d) = " << vnl_math_abs(d) << vcl_endl
- << "abs(i) = " << vnl_math_abs(i) << vcl_endl
- << "abs(z) = " << vnl_math_abs(z) << vcl_endl
- <<"norm(z) = " << vnl_math_squared_magnitude(z) << vcl_endl
- << vcl_endl;
-
- testlib_test_assert("abs(n) == 11", vnl_math_abs(n) == 11);
- testlib_test_assert("abs(f) == 7.5", vnl_math_abs(f) == 7.5);
- testlib_test_assert("abs(d) == pi", vnl_math_abs(d) == vnl_math::pi);
- testlib_test_assert("abs(i) == 1", vnl_math_abs(i) == 1.0);
- testlib_test_assert_near("abs(-1+2i)~=sqrt(5)",vnl_math_abs(z),vcl_sqrt(5.0));
- testlib_test_assert_near("norm(-1+2i) ~= 5", vnl_math_squared_magnitude(z),5);
- testlib_test_assert_near("exp(d*i) ~= -1", vnl_math_abs(e_ipi+1.0), 0);
- vcl_cout << vcl_endl;
-
- testlib_test_assert("rnd(-8.4999) == -8 ", vnl_math_rnd(-8.4999) == -8);
- testlib_test_assert("rnd(-8.4999f) == -8 ", vnl_math_rnd(-8.4999f) == -8);
- testlib_test_assert("rnd(-8.50) == -8/9", vnl_math_rnd(-8.50)/2 == -4);
- testlib_test_assert("rnd(-8.50f) == -8/9", vnl_math_rnd(-8.50f)/2 == -4);
- testlib_test_assert("rnd(-8.5001) == -9 ", vnl_math_rnd(-8.5001) == -9);
- testlib_test_assert("rnd(-8.5001f) == -9 ", vnl_math_rnd(-8.5001f) == -9);
- testlib_test_assert("rnd(8.4999) == 8 ", vnl_math_rnd(8.4999) == 8);
- testlib_test_assert("rnd(8.4999f) == 8 ", vnl_math_rnd(8.4999f) == 8);
- testlib_test_assert("rnd(8.50) == 8/9", vnl_math_rnd(8.50)/2 == 4);
- testlib_test_assert("rnd(8.50f) == 8/9", vnl_math_rnd(8.50f)/2 == 4);
- testlib_test_assert("rnd(8.5001) == 9 ", vnl_math_rnd(8.5001) == 9);
- testlib_test_assert("rnd(8.5001f) == 9 ", vnl_math_rnd(8.5001f) == 9);
-
- testlib_test_assert("rnd(-9.4999) == -9 ", vnl_math_rnd(-9.4999) == -9);
- testlib_test_assert("rnd(-9.4999f) == -9 ", vnl_math_rnd(-9.4999f) == -9);
- testlib_test_assert("rnd(-9.50) == -9/10", (vnl_math_rnd(-9.50)+1)/2 == -4);
- testlib_test_assert("rnd(-9.50f) == -9/10", (vnl_math_rnd(-9.50f)+1)/2 == -4);
- testlib_test_assert("rnd(-9.5001) == -10 ", vnl_math_rnd(-9.5001) == -10);
- testlib_test_assert("rnd(-9.5001f) == -10 ", vnl_math_rnd(-9.5001f) == -10);
- testlib_test_assert("rnd(9.4999) == 9 ", vnl_math_rnd(9.4999) == 9);
- testlib_test_assert("rnd(9.4999f) == 9 ", vnl_math_rnd(9.4999f) == 9);
- testlib_test_assert("rnd(9.50) == 9/10", (vnl_math_rnd(9.50)-1)/2 == 4);
- testlib_test_assert("rnd(9.50f) == 9/10", (vnl_math_rnd(9.50f)-1)/2 == 4);
- testlib_test_assert("rnd(9.5001) == 10 ", vnl_math_rnd(9.5001) == 10);
- testlib_test_assert("rnd(9.5001f) == 10 ", vnl_math_rnd(9.5001f) == 10);
-
- testlib_test_assert("rnd_halfinttoeven(-8.4999) == -8", vnl_math_rnd_halfinttoeven(-8.4999) == -8);
- testlib_test_assert("rnd_halfinttoeven(-8.4999f) == -8", vnl_math_rnd_halfinttoeven(-8.4999f)== -8);
- testlib_test_assert("rnd_halfinttoeven(-8.50) == -8", vnl_math_rnd_halfinttoeven(-8.50) == -8);
- testlib_test_assert("rnd_halfinttoeven(-8.50f) == -8", vnl_math_rnd_halfinttoeven(-8.50f) == -8);
- testlib_test_assert("rnd_halfinttoeven(-8.5001) == -9", vnl_math_rnd_halfinttoeven(-8.5001) == -9);
- testlib_test_assert("rnd_halfinttoeven(-8.5001f) == -9", vnl_math_rnd_halfinttoeven(-8.5001f)== -9);
- testlib_test_assert("rnd_halfinttoeven(8.4999) == 8", vnl_math_rnd_halfinttoeven(8.4999) == 8);
- testlib_test_assert("rnd_halfinttoeven(8.4999f) == 8", vnl_math_rnd_halfinttoeven(8.4999f)== 8);
- testlib_test_assert("rnd_halfinttoeven(8.50) == 9", vnl_math_rnd_halfinttoeven(8.50) == 8);
- testlib_test_assert("rnd_halfinttoeven(8.50f) == 9", vnl_math_rnd_halfinttoeven(8.50f) == 8);
- testlib_test_assert("rnd_halfinttoeven(8.5001) == 9", vnl_math_rnd_halfinttoeven(8.5001) == 9);
- testlib_test_assert("rnd_halfinttoeven(8.5001f) == 9", vnl_math_rnd_halfinttoeven(8.5001f)== 9);
-
- testlib_test_assert("rnd_halfinttoeven(-9.4999) == -9 ", vnl_math_rnd_halfinttoeven(-9.4999) == -9);
- testlib_test_assert("rnd_halfinttoeven(-9.4999f) == -9 ", vnl_math_rnd_halfinttoeven(-9.4999f)== -9);
- testlib_test_assert("rnd_halfinttoeven(-9.50) == -9 ", vnl_math_rnd_halfinttoeven(-9.50) == -10);
- testlib_test_assert("rnd_halfinttoeven(-9.50f) == -9 ", vnl_math_rnd_halfinttoeven(-9.50f) == -10);
- testlib_test_assert("rnd_halfinttoeven(-9.5001) == -10", vnl_math_rnd_halfinttoeven(-9.5001) == -10);
- testlib_test_assert("rnd_halfinttoeven(-9.5001f) == -10", vnl_math_rnd_halfinttoeven(-9.5001f)== -10);
- testlib_test_assert("rnd_halfinttoeven(9.4999) == 9 ", vnl_math_rnd_halfinttoeven(9.4999) == 9);
- testlib_test_assert("rnd_halfinttoeven(9.4999f) == 9 ", vnl_math_rnd_halfinttoeven(9.4999f)== 9);
- testlib_test_assert("rnd_halfinttoeven(9.50) == 10", vnl_math_rnd_halfinttoeven(9.50) == 10);
- testlib_test_assert("rnd_halfinttoeven(9.50f) == 10", vnl_math_rnd_halfinttoeven(9.50f) == 10);
- testlib_test_assert("rnd_halfinttoeven(9.5001) == 10", vnl_math_rnd_halfinttoeven(9.5001) == 10);
- testlib_test_assert("rnd_halfinttoeven(9.5001f) == 10", vnl_math_rnd_halfinttoeven(9.5001f)== 10);
-
- testlib_test_assert("rnd_halfintup(-8.4999) == -8", vnl_math_rnd_halfintup(-8.4999) == -8);
- testlib_test_assert("rnd_halfintup(-8.4999f) == -8", vnl_math_rnd_halfintup(-8.4999f)== -8);
- testlib_test_assert("rnd_halfintup(-8.50) == -8", vnl_math_rnd_halfintup(-8.50) == -8);
- testlib_test_assert("rnd_halfintup(-8.50f) == -8", vnl_math_rnd_halfintup(-8.50f) == -8);
- testlib_test_assert("rnd_halfintup(-8.5001) == -9", vnl_math_rnd_halfintup(-8.5001) == -9);
- testlib_test_assert("rnd_halfintup(-8.5001f) == -9", vnl_math_rnd_halfintup(-8.5001f)== -9);
- testlib_test_assert("rnd_halfintup(8.4999) == 8", vnl_math_rnd_halfintup(8.4999) == 8);
- testlib_test_assert("rnd_halfintup(8.4999f) == 8", vnl_math_rnd_halfintup(8.4999f)== 8);
- testlib_test_assert("rnd_halfintup(8.50) == 9", vnl_math_rnd_halfintup(8.50) == 9);
- testlib_test_assert("rnd_halfintup(8.50f) == 9", vnl_math_rnd_halfintup(8.50f) == 9);
- testlib_test_assert("rnd_halfintup(8.5001) == 9", vnl_math_rnd_halfintup(8.5001) == 9);
- testlib_test_assert("rnd_halfintup(8.5001f) == 9", vnl_math_rnd_halfintup(8.5001f)== 9);
-
- testlib_test_assert("rnd_halfintup(-9.4999) == -9 ", vnl_math_rnd_halfintup(-9.4999) == -9);
- testlib_test_assert("rnd_halfintup(-9.4999f) == -9 ", vnl_math_rnd_halfintup(-9.4999f)== -9);
- testlib_test_assert("rnd_halfintup(-9.50) == -9 ", vnl_math_rnd_halfintup(-9.50) == -9);
- testlib_test_assert("rnd_halfintup(-9.50f) == -9 ", vnl_math_rnd_halfintup(-9.50f) == -9);
- testlib_test_assert("rnd_halfintup(-9.5001) == -10", vnl_math_rnd_halfintup(-9.5001) == -10);
- testlib_test_assert("rnd_halfintup(-9.5001f) == -10", vnl_math_rnd_halfintup(-9.5001f)== -10);
- testlib_test_assert("rnd_halfintup(9.4999) == 9 ", vnl_math_rnd_halfintup(9.4999) == 9);
- testlib_test_assert("rnd_halfintup(9.4999f) == 9 ", vnl_math_rnd_halfintup(9.4999f)== 9);
- testlib_test_assert("rnd_halfintup(9.50) == 10", vnl_math_rnd_halfintup(9.50) == 10);
- testlib_test_assert("rnd_halfintup(9.50f) == 10", vnl_math_rnd_halfintup(9.50f) == 10);
- testlib_test_assert("rnd_halfintup(9.5001) == 10", vnl_math_rnd_halfintup(9.5001) == 10);
- testlib_test_assert("rnd_halfintup(9.5001f) == 10", vnl_math_rnd_halfintup(9.5001f)== 10);
-
- testlib_test_assert("floor(8.0) == 8", vnl_math_floor(8.0) == 8);
- testlib_test_assert("floor(8.0f) == 8", vnl_math_floor(8.0f) == 8);
- testlib_test_assert("floor(8.9999) == 8", vnl_math_floor(8.9999) == 8);
- testlib_test_assert("floor(8.9999f) == 8", vnl_math_floor(8.9999f) == 8);
- testlib_test_assert("floor(8.0001) == 8", vnl_math_floor(8.0001) == 8);
- testlib_test_assert("floor(8.0001f) == 8", vnl_math_floor(8.0001f) == 8);
- testlib_test_assert("floor(-8.0) == -8", vnl_math_floor(-8.0) == -8);
- testlib_test_assert("floor(-8.0f) == -8", vnl_math_floor(-8.0f) == -8);
- testlib_test_assert("floor(-8.9999) == -9", vnl_math_floor(-8.9999) == -9);
- testlib_test_assert("floor(-8.9999f) == -9", vnl_math_floor(-8.9999f) == -9);
- testlib_test_assert("floor(-8.0001) == -9", vnl_math_floor(-8.0001) == -9);
- testlib_test_assert("floor(-8.0001f) == -9", vnl_math_floor(-8.0001f) == -9);
-
- testlib_test_assert("floor(9.0) == 9", vnl_math_floor(9.0) == 9);
- testlib_test_assert("floor(9.0f) == 9", vnl_math_floor(9.0f) == 9);
- testlib_test_assert("floor(9.9999) == 9", vnl_math_floor(9.9999) == 9);
- testlib_test_assert("floor(9.9999f) == 9", vnl_math_floor(9.9999f) == 9);
- testlib_test_assert("floor(9.0001) == 9", vnl_math_floor(9.0001) == 9);
- testlib_test_assert("floor(9.0001f) == 9", vnl_math_floor(9.0001f) == 9);
- testlib_test_assert("floor(-9.0) == -9", vnl_math_floor(-9.0) == -9);
- testlib_test_assert("floor(-9.0f) == -9", vnl_math_floor(-9.0f) == -9);
- testlib_test_assert("floor(-9.9999) == -10", vnl_math_floor(-9.9999) == -10);
- testlib_test_assert("floor(-9.9999f) == -10", vnl_math_floor(-9.9999f) == -10);
- testlib_test_assert("floor(-9.0001) == -10", vnl_math_floor(-9.0001) == -10);
- testlib_test_assert("floor(-9.0001f) == -10", vnl_math_floor(-9.0001f) == -10);
-
- testlib_test_assert("ceil(8.0) == 8", vnl_math_ceil(8.0) == 8);
- testlib_test_assert("ceil(8.0f) == 8", vnl_math_ceil(8.0f) == 8);
- testlib_test_assert("ceil(8.9999) == 9", vnl_math_ceil(8.9999) == 9);
- testlib_test_assert("ceil(8.9999f) == 9", vnl_math_ceil(8.9999f) == 9);
- testlib_test_assert("ceil(8.0001) == 9", vnl_math_ceil(8.0001) == 9);
- testlib_test_assert("ceil(8.0001f) == 9", vnl_math_ceil(8.0001f) == 9);
- testlib_test_assert("ceil(-8.0) == -8", vnl_math_ceil(-8.0) == -8);
- testlib_test_assert("ceil(-8.0f) == -8", vnl_math_ceil(-8.0f) == -8);
- testlib_test_assert("ceil(-8.9999) == -8", vnl_math_ceil(-8.9999) == -8);
- testlib_test_assert("ceil(-8.9999f) == -8", vnl_math_ceil(-8.9999f) == -8);
- testlib_test_assert("ceil(-8.0001) == -8", vnl_math_ceil(-8.0001) == -8);
- testlib_test_assert("ceil(-8.0001f) == -8", vnl_math_ceil(-8.0001f) == -8);
-
- testlib_test_assert("ceil(9.0) == 9", vnl_math_ceil(9.0) == 9);
- testlib_test_assert("ceil(9.0f) == 9", vnl_math_ceil(9.0f) == 9);
- testlib_test_assert("ceil(9.9999) == 10", vnl_math_ceil(9.9999) == 10);
- testlib_test_assert("ceil(9.9999f) == 10", vnl_math_ceil(9.9999f) == 10);
- testlib_test_assert("ceil(9.0001) == 10", vnl_math_ceil(9.0001) == 10);
- testlib_test_assert("ceil(9.0001f) == 10", vnl_math_ceil(9.0001f) == 10);
- testlib_test_assert("ceil(-9.0) == -9", vnl_math_ceil(-9.0) == -9);
- testlib_test_assert("ceil(-9.0f) == -9", vnl_math_ceil(-9.0f) == -9);
- testlib_test_assert("ceil(-9.9999) == -9", vnl_math_ceil(-9.9999) == -9);
- testlib_test_assert("ceil(-9.9999f) == -9", vnl_math_ceil(-9.9999f) == -9);
- testlib_test_assert("ceil(-9.0001) == -9", vnl_math_ceil(-9.0001) == -9);
- testlib_test_assert("ceil(-9.0001f) == -9", vnl_math_ceil(-9.0001f) == -9);
-
- testlib_test_assert(" isfinite(f) ", vnl_math_isfinite(f));
- testlib_test_assert(" isfinite(d) ", vnl_math_isfinite(d));
- testlib_test_assert(" isfinite(i) ", vnl_math_isfinite(i));
- testlib_test_assert(" isfinite(z) ", vnl_math_isfinite(z));
-
-
- // There is an assumption in this code that vcl_numeric_limits<float/double>::has_infinity==true
-
- testlib_test_assert("vcl_numeric_limits<float>::has_infinity==true assumption",vcl_numeric_limits<float>::has_infinity);
- testlib_test_assert("vcl_numeric_limits<double>::has_infinity==true assumption",vcl_numeric_limits<double>::has_infinity);
- testlib_test_assert("vcl_numeric_limits<ldouble>::has_infinity==true assumption",vcl_numeric_limits<long double>::has_infinity);
- if (! vcl_numeric_limits<float>::has_infinity && ! vcl_numeric_limits<double>::has_infinity)
- {
- vcl_cout << "Your platform doesn't appear to have an infinity. VXL is in places relatively\n"
- << "dependent on the existence of an infinity. There are two solutions.\n"
- << "A. If your platform really doesn't have an infinity, VXL's configuration code\n"
- << " can be modified to correctly detect and use the infinity.\n"
- << "B. Fix VXL so that it can cope with the lack of an infinity.\n" << vcl_endl;
- }
- testlib_test_assert("vcl_numeric_limits<float>::has_quiet_NaN==true assumption",vcl_numeric_limits<float>::has_quiet_NaN);
- testlib_test_assert("vcl_numeric_limits<double>::has_quiet_NaN==true assumption",vcl_numeric_limits<double>::has_quiet_NaN);
- testlib_test_assert("vcl_numeric_limits<ldouble>::has_quiet_NaN==true assumption",vcl_numeric_limits<long double>::has_quiet_NaN);
- if (! vcl_numeric_limits<float>::has_quiet_NaN && ! vcl_numeric_limits<double>::has_quiet_NaN)
- {
- vcl_cout << "Your platform doesn't appear to have a quiet NaN. VXL is in places relatively\n"
- << "dependent on the existence of a quiet NaN. There are two solutions.\n"
- << "A. If your platform really doesn't have a quiet NaN, VXL's configuration code\n"
- << " can be modified to correctly detect and use the NaN.\n"
- << "B. Fix VXL so that it can cope with the lack of a quiet NaN.\n" << vcl_endl;
- }
- // Create Inf and -Inf:
- float pinf_f = vcl_numeric_limits<float>::infinity();
- float ninf_f = - vcl_numeric_limits<float>::infinity();
- double pinf_d = vcl_numeric_limits<double>::infinity();
- double ninf_d = - vcl_numeric_limits<double>::infinity();
- long double pinf_q = vcl_numeric_limits<long double>::infinity();
- long double ninf_q = - vcl_numeric_limits<long double>::infinity();
-
- // Create NaN
- float qnan_f = vcl_numeric_limits<float>::quiet_NaN();
- double qnan_d = vcl_numeric_limits<double>::quiet_NaN();
- long double qnan_q = vcl_numeric_limits<long double>::quiet_NaN();
-
-#define print_hex(p) \
- vcl_hex<<vcl_setfill('0')<<vcl_setw(sizeof(unsigned char))<<*reinterpret_cast<unsigned char*>(&p); \
- for (int i=1; i*sizeof(unsigned char)<sizeof(p); ++i) \
- vcl_cout<<vcl_setfill('0')<<vcl_setw(sizeof(unsigned char))<<(reinterpret_cast<unsigned char*>(&p))[i]; \
- vcl_cout<<vcl_dec
-#if 0
- vcl_cout << "pinf_f = " << pinf_f << " = " << print_hex(pinf_f) << vcl_endl
- << "ninf_f = " << ninf_f << " = " << print_hex(ninf_f) << vcl_endl
- << "pinf_d = " << pinf_d << " = " << print_hex(pinf_d) << vcl_endl
- << "ninf_d = " << ninf_d << " = " << print_hex(ninf_d) << vcl_endl
- << "pinf_q = " << pinf_q << " = " << print_hex(pinf_q) << vcl_endl
- << "ninf_q = " << ninf_q << " = " << print_hex(ninf_q) << vcl_endl
- << "qnan_f = " << qnan_f << " = " << print_hex(qnan_f) << vcl_endl
- << "qnan_d = " << qnan_d << " = " << print_hex(qnan_d) << vcl_endl
- << "qnan_q = " << qnan_q << " = " << print_hex(qnan_q) << vcl_endl
- << vcl_endl;
-#endif
-
-#undef print_hex
-
-#ifndef __alpha__ // on alpha, infinity() == max()
- testlib_test_assert("!isfinite(pinf_f)", !vnl_math_isfinite(pinf_f));
- testlib_test_assert("!isfinite(ninf_f)", !vnl_math_isfinite(ninf_f));
- testlib_test_assert(" isinf(pinf_f) ", vnl_math_isinf(pinf_f));
- testlib_test_assert(" isinf(ninf_f) ", vnl_math_isinf(ninf_f));
-#endif
- testlib_test_assert("!isnan(pinf_f) ", !vnl_math_isnan(pinf_f));
- testlib_test_assert("!isnan(ninf_f) ", !vnl_math_isnan(ninf_f));
- testlib_test_assert("!isfinite(qnan_f)", !vnl_math_isfinite(qnan_f));
- testlib_test_assert("!isinf(qnan_f) ", !vnl_math_isinf(qnan_f));
- testlib_test_assert(" isnan(qnan_f) ", vnl_math_isnan(qnan_f));
-
-#ifndef __alpha__ // on alpha, infinity() == max()
- testlib_test_assert("!isfinite(pinf_d)", !vnl_math_isfinite(pinf_d));
- testlib_test_assert("!isfinite(ninf_d)", !vnl_math_isfinite(ninf_d));
- testlib_test_assert(" isinf(pinf_d) ", vnl_math_isinf(pinf_d));
- testlib_test_assert(" isinf(ninf_d) ", vnl_math_isinf(ninf_d));
-#endif
- testlib_test_assert("!isnan(pinf_d) ", !vnl_math_isnan(pinf_d));
- testlib_test_assert("!isnan(ninf_d) ", !vnl_math_isnan(ninf_d));
- testlib_test_assert("!isfinite(qnan_d)", !vnl_math_isfinite(qnan_d));
- testlib_test_assert("!isinf(qnan_d) ", !vnl_math_isinf(qnan_d));
- testlib_test_assert(" isnan(qnan_d) ", vnl_math_isnan(qnan_d));
-
-#ifndef __ICC // "long double" has no standard internal representation on different platforms/compilers
-#ifndef __alpha__ // on alpha, infinity() == max()
- testlib_test_assert("!isfinite(pinf_q)", !vnl_math_isfinite(pinf_q));
- testlib_test_assert("!isfinite(ninf_q)", !vnl_math_isfinite(ninf_q));
- testlib_test_assert(" isinf(pinf_q) ", vnl_math_isinf(pinf_q));
- testlib_test_assert(" isinf(ninf_q) ", vnl_math_isinf(ninf_q));
-#endif
- testlib_test_assert("!isnan(pinf_q) ", !vnl_math_isnan(pinf_q));
- testlib_test_assert("!isnan(ninf_q) ", !vnl_math_isnan(ninf_q));
- testlib_test_assert("!isfinite(qnan_q)", !vnl_math_isfinite(qnan_q));
-#if 0 // even more nonstandard ...
- testlib_test_assert("!isinf(qnan_q) ", !vnl_math_isinf(qnan_q));
- testlib_test_assert(" isnan(qnan_q) ", vnl_math_isnan(qnan_q));
-#endif // 0
-#endif // __ICC
-
- testlib_test_assert("!isfinite(huge_val(double))", !vnl_math_isfinite(vnl_huge_val(double())));
- testlib_test_assert("!isfinite(huge_val(float))", !vnl_math_isfinite(vnl_huge_val(float())));
-}
-
-TESTMAIN(test_math);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matlab.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matlab.cxx
deleted file mode 100644
index e5314dd134ccd0ef055ab24f0bb89b45b4f897cc..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matlab.cxx
+++ /dev/null
@@ -1,157 +0,0 @@
-// This is core/vnl/tests/test_matlab.cxx
-/*
- fsm
-*/
-#include <vcl_cstring.h>
-#include <vcl_fstream.h>
-
-#include <vpl/vpl.h>
-
-#include <vul/vul_temp_filename.h>
-
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_vector_fixed.h>
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/vnl_matlab_print.h>
-#include <vnl/vnl_matlab_write.h>
-#include <vnl/vnl_matlab_read.h>
-#include <vnl/vnl_matlab_header.h>
-#include <testlib/testlib_test.h>
-
-#if VXL_LITTLE_ENDIAN // #ifdef i386
-# define NONnative_BYTE_ORDER vnl_matlab_header::vnl_BIG_ENDIAN
-#else
-# define NONnative_BYTE_ORDER vnl_matlab_header::vnl_LITTLE_ENDIAN
-#endif
-
-//
-// this duplicates code from vnl_matlab_write, but it's the only way to
-// get a byte-swapped file, short of reading in a native file and swapping it
-// and writing it back out, and that isn't any easier.
-void matlab_write_swapped(vcl_ostream &f,
- float *array,
- unsigned size,
- char const *name)
-{
- vnl_matlab_header hdr;
- hdr.type = NONnative_BYTE_ORDER
- + vnl_matlab_header::vnl_COLUMN_WISE
- + vnl_matlab_header::vnl_SINGLE_PRECISION;
- hdr.rows = (long)size;
- hdr.cols = 1;
- hdr.imag = 0; // not complex
- hdr.namlen = (unsigned long)vcl_strlen(name)+1L;
- byteswap::swap32(&hdr.type);
- byteswap::swap32(&hdr.rows);
- byteswap::swap32(&hdr.cols);
- byteswap::swap32(&hdr.imag);
- byteswap::swap32(&hdr.namlen);
- f.write((char const *)&hdr, sizeof(hdr));
- f.write((char const *)name, vcl_strlen(name)+1);
- for(unsigned i = 0; i < size; ++i)
- {
- float dummy = array[i];
- byteswap::swap32(&dummy);
- f.write((char const *)&dummy,sizeof(dummy));
- }
-}
-
-static void fsm_assert_(int lineno, bool pass, char const *expr)
-{
- vcl_cout << __FILE__ " : " << lineno << vcl_endl;
- testlib_test_assert(expr, pass);
-}
-#define fsm_assert(c) fsm_assert_(__LINE__, c, #c);
-
-static void test_matlab()
-{
- vnl_vector<float> v(4);
- vnl_vector_fixed<float,4> vf;
- for (unsigned i=0; i<v.size(); ++i)
- vf[i] = v[i] = 0.1f*i;
-
- vnl_matrix<double> M(3,4);
- vnl_matrix_fixed<double,3,4> Mf;
- for (unsigned i=0; i<M.rows(); ++i)
- for (unsigned j=0; j<M.cols(); ++j)
- Mf(i,j) = M(i,j) = 0.1*i*j;
-
- { // vnl_matlab_print
- vcl_cout << v << vcl_endl;
- vnl_matlab_print(vcl_cout, v, "v");
-
- vcl_cout << vf << vcl_endl;
- vnl_matlab_print(vcl_cout, vf, "vf");
-
- vcl_cout << M << vcl_endl;
- vnl_matlab_print(vcl_cout, M, "M") << vcl_endl;
-
- vcl_cout << Mf << vcl_endl;
- vnl_matlab_print(vcl_cout, Mf, "Mf") << vcl_endl;
- }
-
- // vnl_matlab_write, vnl_matlab_read
- {
- vcl_string tmp_nam = vul_temp_filename(),
- tmp_nam2 = vul_temp_filename();
- char const *file = tmp_nam!="" ? tmp_nam.c_str() : "smoo.mat";
- char const *file2 = tmp_nam2!="" ? tmp_nam2.c_str() : "smoo2.mat";
- {
- vcl_ofstream f(file);
-#ifdef LEAVE_IMAGES_BEHIND
- vpl_chmod(file, 0666); // -rw-rw-rw-
-#endif
- vnl_matlab_write(f, v.begin(), v.size(), "v");
- vnl_matlab_write(f, (double const * const *)M.data_array(), M.rows(), M.cols(), (char const *)"M");
- //
- // write swapped matlab file
- vcl_ofstream f2(file2);
- matlab_write_swapped(f2, v.begin(), v.size(), "v");
- }
- {
- vcl_ifstream f(file);
- vnl_matlab_readhdr vh(f);
- fsm_assert( vh?true:false );
- fsm_assert( vh.is_single());
- fsm_assert( vh.rows() == (int)v.size());
- fsm_assert( vh.cols() == 1);
- fsm_assert(!vh.is_complex());
- fsm_assert(vcl_strcmp(vh.name(), "v")==0);
- vnl_vector<float> v_(v.size());
- fsm_assert( vh.read_data(v_.begin()));
- fsm_assert(v_ == v);
-
- vcl_ifstream f2(file2);
- vnl_matlab_readhdr vh2(f2);
- fsm_assert( vh2?true:false );
- fsm_assert( vh2.is_single());
- fsm_assert( vh2.rows() == (int)v.size());
- fsm_assert( vh2.cols() == 1);
- fsm_assert(!vh2.is_complex());
- fsm_assert(vcl_strcmp(vh2.name(), "v")==0);
- vnl_vector<float> v_2(v.size());
- fsm_assert( vh2.read_data(v_2.begin()));
- fsm_assert(v_2 == v);
-
- vnl_matlab_readhdr Mh(f);
- fsm_assert( Mh?true:false );
- fsm_assert(!Mh.is_single());
- fsm_assert( Mh.rows() == (int)M.rows());
- fsm_assert( Mh.cols() == (int)M.cols());
- fsm_assert( Mh.is_rowwise());
- fsm_assert(!Mh.is_complex());
- fsm_assert(vcl_strcmp(Mh.name(), "M")==0);
- vnl_matrix<double> M_( M.rows(), M.cols());
- fsm_assert( Mh.read_data(M_.data_array()));
- fsm_assert(M_ == M);
- //vnl_matlab_print(cout, M, "M");
- //vnl_matlab_print(cout, M_, "M_");
- }
-#ifndef LEAVE_IMAGES_BEHIND
- vpl_unlink(file);
-#endif
- }
-}
-
-TESTMAIN(test_matlab);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix.cxx
deleted file mode 100644
index 013b3af0346cb399b1fa4f1ed13fb2991e641be4..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix.cxx
+++ /dev/null
@@ -1,449 +0,0 @@
-// This is core/vnl/tests/test_matrix.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_matrix.h>
-#include <testlib/testlib_test.h>
-#include <vcl_cmath.h> // sqrt()
-
-static
-void test_int()
-{
- vcl_cout << "***********************\n"
- << "Testing vnl_matrix<int>\n"
- << "***********************\n";
- vnl_matrix<int> m0(2,2);
- TEST("vnl_matrix<int> m0(2,2)", (m0.rows()==2 && m0.columns()==2), true);
- vnl_matrix<int> m1(3,4);
- TEST("vnl_matrix<int> m1(3,4)", (m1.rows()==3 && m1.columns()==4), true);
- vnl_matrix<int> m2(2,2,2);
- TEST("vnl_matrix<int> m2(2,2,2)",
- (m2.get(0,0)==2 && m2.get(0,1)==2 && m2.get(1,0)==2 && m2.get(1,1)==2), true);
- TEST("m2 = vnl_matrix<int>(2,2, 2)",
- (m2 = vnl_matrix<int>(2,2, 2),
- (m2.get(0,0)==2 && m2.get(0,1)==2 && m2.get(1,0)==2 && m2.get(1,1)==2)), true);
- const vnl_matrix<int> ma = m2;
- TEST("(const vnl_matrix)(i,j)",
- (ma(0,0)==2 && ma(0,1)==2 && ma(1,0)==2 && ma(1,1)==2), true);
- vnl_matrix<int> mb = m2;
- TEST("(vnl_matrix)(i,j)",
- (mb(0,0) = 0,
- mb(0,0)==0 && mb(0,1)==2 && mb(1,0)==2 && mb(1,1)==2), true);
- int mcvalues[4] = {1, 2, 3};
- vnl_matrix<int> mc(2,2, 4, mcvalues);
- TEST("vnl_matrix<int> mc(2,2, 4,int[])",
- (mc(0,0)==1 && mc(0,1)==2 && mc(1,0)==3 && mc(1,1)==0), true);
- TEST("m0=2",
- (m0=2,
- (m0.get(0,0)==2 && m0.get(0,1)==2 && m0.get(1,0)==2 && m0.get(1,1)==2)), true);
- TEST("m0 == m2", (m0 == m2), true);
- TEST("(m0 == m2)", (m0 == m2), true);
- TEST("m2.put(1,1,3)", (m2.put(1,1,3),m2.get(1,1)), 3);
- TEST("m2.get(1,1)", m2.get(1,1), 3);
- TEST("m0 == m2", (m0 == m2), false);
- TEST("m0 != m2", (m0 != m2), true);
- TEST("(m0 == m2)", (m0 == m2), false);
- TEST("m1.fill(3)",
- (m1.fill(3),
- (m1.get(0,0)==3 && m1.get(1,1)==3 && m1.get(2,2)==3 && m1.get(2,3)==3)), true);
- TEST("m2.fill(2)",
- (m2.fill(2),
- (m2.get(0,0)==2 && m2.get(0,1)==2 && m2.get(1,0)==2 && m2.get(1,1)==2)), true);
- int m3values [] = {1,2,3};
- vnl_matrix<int> m3(1,3,3, m3values);
- TEST("m3(1,3,3,{1,2,3})",
- (m3.get(0,0)==1 && m3.get(0,1)==2 && m3.get(0,2)==3), true);
- vnl_matrix<int> m4(m3);
- TEST("vnl_matrix<int> m4(m3)", (m3==m4), true);
- TEST("m0=m2", (m0=m2, (m0==m2)), true);
-
- // test additions and subtractions
- TEST("m0=m2+3",
- ((m0=m2+3),
- (m0.get(0,0)==5 && m0.get(0,1)==5 && m0.get(1,0)==5 && m0.get(1,1)==5)), true);
- TEST("m0=3+m2",
- ((m0=3+m2),
- (m0.get(0,0)==5 && m0.get(0,1)==5 && m0.get(1,0)==5 && m0.get(1,1)==5)), true);
- TEST("m0+=(-3)",
- (m0+=(-3),
- (m0.get(0,0)==2 && m0.get(0,1)==2 && m0.get(1,0)==2 && m0.get(1,1)==2)), true);
- TEST("m0-=(-3)",
- (m0-=(-3),
- (m0.get(0,0)==5 && m0.get(0,1)==5 && m0.get(1,0)==5 && m0.get(1,1)==5)), true);
- TEST("m0=m2-3",
- ((m0=m2-3),
- (m0.get(0,0)==-1 && m0.get(0,1)==-1 && m0.get(1,0)==-1 && m0.get(1,1)==-1)), true);
- TEST("m0=3-m2",
- ((m0=3-m2),
- (m0.get(0,0)==1 && m0.get(0,1)==1 && m0.get(1,0)==1 && m0.get(1,1)==1)), true);
- TEST("m0= -m2",
- (m0= -m2,
- (m0.get(0,0)==-2 && m0.get(0,1)==-2 && m0.get(1,0)==-2 && m0.get(1,1)==-2)), true);
-
- vnl_matrix<int> m5(2,2);
- m0 = m2;
- TEST("m5=m0+m2",
- ((m5=m0+m2),
- (m5.get(0,0)==4 && m5.get(0,1)==4 && m5.get(1,0)==4 && m5.get(1,1)==4)), true);
- TEST("m5=m0-m2",
- ((m5=m0-m2),
- (m5.get(0,0)==0 && m5.get(0,1)==0 && m5.get(1,0)==0 && m5.get(1,1)==0)), true);
- TEST("m0+=m2",
- ((m0+=m2),
- (m0.get(0,0)==4 && m0.get(0,1)==4 && m0.get(1,0)==4 && m0.get(1,1)==4)), true);
- TEST("m0-=m2",
- ((m0-=m2),
- (m0.get(0,0)==2 && m0.get(0,1)==2 && m0.get(1,0)==2 && m0.get(1,1)==2)), true);
-
- /// test multiplications and divisions
- TEST("m4=m3*5",
- ((m4=m3*5),
- (m4.get(0,0)==5 && m4.get(0,1)==10 && m4.get(0,2)==15)), true);
- TEST("m4=5*m3",
- ((m4=5*m3),
- (m4.get(0,0)==5 && m4.get(0,1)==10 && m4.get(0,2)==15)), true);
- TEST("m3*=5",((m3*=5), (m3== m4)), true);
- TEST("m4=m3/5",
- ((m4=m3/5),
- (m4.get(0,0)==1 && m4.get(0,1)==2 && m4.get(0,2)==3)), true);
- TEST("m3/=5", ((m3/=5), (m3==m4)), true);
-
- int m6values [] = {1,2,3,4};
- vnl_matrix<int> m6(2,2,4,m6values);
- TEST("vnl_matrix<int> m6(2,2,4,{1,2,3,4})", m6.get(1,1), 4);
- int m7values [] = {5,6,7,8};
- vnl_matrix<int> m7(2,2,4,m7values);
- TEST("vnl_matrix<int> m7(2,2,4,{5,6,7,8})", m7.get(1,1), 8);
- TEST("m5=m6*m7",
- ((m5=m6*m7),
- (m5.get(0,0)==19 && m5.get(0,1)==22 && m5.get(1,0)==43 && m5.get(1,1)==50)), true);
- TEST("m6*=m7",
- ((m6*=m7),
- (m6.get(0,0)==19 && m6.get(0,1)==22 && m6.get(1,0)==43 && m6.get(1,1)==50)), true);
- int c0values [] = {1,0};
- vnl_matrix<int> c0(2,1,2,c0values);
- vnl_matrix<int> c1;
- TEST("c1=m6*c0",
- ((c1=m6*c0),
- c1.rows()==c0.rows() && c1.columns()==c0.columns() &&
- c1.get(0,0)==19 && c1.get(1,0)==43), true);
- int r0values [] = {1,0};
- vnl_matrix<int> r0(1,2,2,r0values);
- vnl_matrix<int> r1;
- TEST("r1=r0*m6",
- ((r1=r0*m6),
- r1.rows()==r0.rows() && r1.columns()==r0.columns() &&
- r1.get(0,0)==19 && r1.get(0,1)==22), true);
- TEST("r0*=m6",
- ((r0*=m6), r0==r1), true);
- TEST("m6*=c0",
- ((m6*=c0), c1==m6), true);
-
-
- // additional tests
- int mvalues [] = {0,-2,2,0};
- vnl_matrix<int> m(2,2,4,mvalues);
- m0 = m; m1 = m;
- TEST("m(i,j)",
- (m(0,0)==0 && m(0,1)==-2 && m(1,0)==2 && m(1,1)==0), true);
- TEST("m.transpose()",
- ((m1 = m.transpose()),
- (m1(0,0)==0 && m1(0,1)==2 && m1(1,0)==-2 && m1(1,1)==0)), true);
-#if 0
- TEST("m.abs()",
- ((m1 = m.abs()),
- (m1(0,0)==0 && m1(0,1)==2 && m1(1,0)==2 && m1(1,1)==0)), true);
- TEST("m.sign()",
- ((m1 = m.sign()),
- (m1(0,0)==0 && m1(0,1)==-1 && m1(1,0)==1 && m1(1,1)==0)), true);
-#endif // 0
- TEST("element_product(m,m)",
- ((m1 = element_product(m,m)),
- (m1(0,0)==0 && m1(0,1)==4 && m1(1,0)==4 && m1(1,1)==0)), true);
- TEST("element_quotient(m,[2])",
- ((m2 = 2),
- (m1 = element_quotient(m,m2)),
- (m1(0,0)==0 && m1(0,1)==-1 && m1(1,0)==1 && m1(1,1)==0)), true);
-#if 0
- TEST("m.update(m.abs())",
- ((m1 = m.abs()),
- (m2.update(m1)),
- (m2==m1)), true);
-#endif // 0
- TEST("m.extract(1,1,1,1)",
- ((m1 = m.extract(1,1,1,1)),
- (m1.rows()==1 && m1.columns()==1 && m1(0,0)==m(1,1))), true);
- TEST("m.update([4],1,1)",
- ((m1=4),
- (m.update(m1,1,1)),
- (m(0,0)==0 && m(0,1)==-2 && m(1,0)==2 && m(1,1)==4)), true);
-
- int vvalues[] = {1,0,0,0};
- vnl_matrix<int> v (4,1,4,vvalues);
-#if 0
- TEST("v(i)",
- (v(0,0)==v.x() && v.x()==1 &&
- v(1,0)==v.y() && v.y()==0 &&
- v(2,0)==v.z() && v.z()==0 &&
- v(3,0)==v.t() && v.t()==0), true);
-#endif // 0
- int v1values [] = {1,0,0};
- int v2values [] = {0,1,0};
- int v3values [] = {0,0,1};
- vnl_matrix<int> v1(3,1,3,v1values);
- vnl_matrix<int> v2(3,1,3,v2values);
- vnl_matrix<int> v3(3,1,3,v3values);
- TEST("dot_product(v1,v2)",
- (dot_product(v1,v2)==0 && dot_product(v1,v3)==0 && dot_product(v2,v3)==0), true);
- v = v3;
- TEST("4d-v=3d-v", (v.rows()==3 && v.columns()==1 && v==v3), true);
-
- // Zero-size
- {
- vnl_matrix<int> m1(0,3);
- vnl_matrix<int> m2(3,4);
- vnl_matrix<int> m3(4,0);
- vnl_matrix<int> m = m1 * (m2 * m3);
- TEST("zero-size mult rows", m.rows(), 0);
- TEST("zero-size mult cols", m.columns(), 0);
-
- m = (m1 * m2) * m3;
- TEST("zero-size mult rows", m.rows(), 0);
- TEST("zero-size mult cols", m.columns(), 0);
-
- m2.clear();
- TEST("zero-size after clear()", m2.rows(), 0);
- TEST("zero-size after clear()", m2.columns(), 0);
- }
-}
-
-
-void test_float()
-{
- vcl_cout << "*************************\n"
- << "Testing vnl_matrix<float>\n"
- << "*************************\n";
- vnl_matrix<float> d0(2,2);
- TEST("vnl_matrix<float> d0(2,2)", (d0.rows()==2 && d0.columns()==2), true);
- vnl_matrix<float> d1(3,4);
- TEST("vnl_matrix<float> d1(3,4)", (d1.rows()==3 && d1.columns()==4), true);
- vnl_matrix<float> d2(2,2,2.0);
- TEST("vnl_matrix<float> d2(2,2,2.0)",
- (d2.get(0,0)==2.0 && d2.get(0,1)==2.0 && d2.get(1,0)==2.0 && d2.get(1,1)==2.0), true);
- TEST("d0=2.0", (d0=2.0,
- (d0.get(0,0)==2.0 && d0.get(0,1)==2.0 && d0.get(1,0)==2.0 && d0.get(1,1)==2.0)), true);
- TEST("d0 == d2", (d0 == d2), true);
- TEST("(d0 == d2)", (d0==d2), true);
- TEST("d2.put(1,1,3.0)", (d2.put(1,1,(float)3.0),d2.get(1,1)), (float)3.0);
- TEST("d2.get(1,1)", d2.get(1,1), (float)3.0);
- TEST("d0 == d2", (d0 == d2), false);
- TEST("d0 != d2", (d0 != d2), true);
- TEST("(d0 == d2)", (d0==d2), false);
- TEST("d1.fill(3.0)",
- (d1.fill(3.0),
- (d1.get(0,0)==3.0 && d1.get(1,1)==3.0 && d1.get(2,2)==3.0 && d1.get(2,3)==3.0)), true);
- TEST("d2.fill(2.0)",
- (d2.fill(2.0),
- (d2.get(0,0)==2.0 && d2.get(0,1)==2.0 && d2.get(1,0)==2.0 && d2.get(1,1)==2.0)), true);
- float d3values [] = {1.0,2.0,3.0};
- vnl_matrix<float> d3(1,3,3,d3values);
- TEST("d3(1,3,3,{1.0,2.0,3.0})",
- (d3.get(0,0)==1.0 && d3.get(0,1)==2.0 && d3.get(0,2)==3.0), true);
- vnl_matrix<float> d4(d3);
- TEST("vnl_matrix<float> d4(d3)", d3, d4);
- TEST("d0=d2", (d0=d2, (d0==d2)), true);
- TEST("d0=d2+3.0",
- ((d0=d2+(float)3.0),
- (d0.get(0,0)==5.0 && d0.get(0,1)==5.0 && d0.get(1,0)==5.0 && d0.get(1,1)==5.0)), true);
- TEST("d0+=(-3.0)",
- (d0+=(-3.0),
- (d0.get(0,0)==2.0 && d0.get(0,1)==2.0 && d0.get(1,0)==2.0 && d0.get(1,1)==2.0)), true);
- vnl_matrix<float> d5(2,2);
- TEST("d5=d0+d2",
- ((d5=d0+d2),
- (d5.get(0,0)==4.0 && d5.get(0,1)==4.0 && d5.get(1,0)==4.0 && d5.get(1,1)==4.0)), true);
- TEST("d0+=d2",
- ((d0+=d2),
- (d0.get(0,0)==4.0 && d0.get(0,1)==4.0 && d0.get(1,0)==4.0 && d0.get(1,1)==4.0)), true);
- TEST("d4=d3*5.0",((d4=d3*5.0),(d4.get(0,0)==5.0 && d4.get(0,1)==10.0 && d4.get(0,2)==15.0)), true);
- TEST("d3*=5.0",((d3*=5.0), (d3== d4)), true);
- float d6values [] = {1.0,2.0,
- 3.0,4.0};
- vnl_matrix<float> d6(2,2,4,d6values);
- TEST("vnl_matrix<float> d6(2,2,4,{1.0,2.0,3.0,4.0})", d6.get(1,1), 4.0);
- float d7values [] = {5.0,6.0,
- 7.0,8.0};
- vnl_matrix<float> d7(2,2,4,d7values);
- TEST("vnl_matrix<float> d7(2,2,4,{5.0,6.0,7.0,8.0})", d7.get(1,1), 8.0);
- TEST("d5=d6*d7", ((d5=d6*d7),
- (d5.get(0,0)==19.0 && d5.get(0,1)==22.0 && d5.get(1,0)==43.0 && d5.get(1,1)==50.0)), true);
- TEST("d6*=d7", ((d6*=d7),
- (d6.get(0,0)==19.0 && d6.get(0,1)==22.0 && d6.get(1,0)==43.0 && d6.get(1,1)==50.0)), true);
-
- // additional tests
- vnl_matrix<float> m0, m1, m2;
- float mvalues [] = {0,-2,2,0};
- vnl_matrix<float> m(2,2,4,mvalues);
- m0 = m; m1 = m; m2 = m;
- TEST("m(i,j)",
- (m(0,0)==0 && m(0,1)==-2 && m(1,0)==2 && m(1,1)==0), true);
- TEST("m.transpose()",
- ((m1 = m.transpose()),
- (m1(0,0)==0 && m1(0,1)==2 && m1(1,0)==-2 && m1(1,1)==0)), true);
-#if 0
- TEST("m.abs()",
- ((m1 = m.abs()),
- (m1(0,0)==0 && m1(0,1)==2 && m1(1,0)==2 && m1(1,1)==0)), true);
- TEST("m.sign()",
- ((m1 = m.sign()),
- (m1(0,0)==0 && m1(0,1)==-1 && m1(1,0)==1 && m1(1,1)==0)), true);
-#endif
- TEST("element_product(m,m)",
- ((m1 = element_product(m,m)),
- (m1(0,0)==0 && m1(0,1)==4 && m1(1,0)==4 && m1(1,1)==0)), true);
- TEST("element_quotient(m,[2])",
- ((m2 = 2),
- (m1 = element_quotient(m,m2)),
- (m1(0,0)==0 && m1(0,1)==-1 && m1(1,0)==1 && m1(1,1)==0)), true);
-#if 0
- TEST("m.update(m.abs())",
- ((m1 = m.abs()),
- (m2.update(m1)),
- (m2==m1)), true);
-#endif
- TEST("m.extract(1,1,1,1)",
- ((m1 = m.extract(1,1,1,1)),
- (m1.rows()==1 && m1.columns()==1 && m1(0,0)==m(1,1))), true);
- TEST("m.update([4],1,1)",
- ((m1=4),
- (m.update(m1,1,1)),
- (m(0,0)==0 && m(0,1)==-2 && m(1,0)==2 && m(1,1)==4)), true);
-
- float vvalues[] = {1,0,0,0};
- vnl_matrix<float> v (4,1,4,vvalues);
-#if 0
- TEST("v(i)",
- (v(0,0)==v.x() && v.x()==1 &&
- v(1,0)==v.y() && v.y()==0 &&
- v(2,0)==v.z() && v.z()==0 &&
- v(3,0)==v.t() && v.t()==0), true);
-#endif
- float v1values [] = {1,0,0};
- float v2values [] = {0,1,0};
- float v3values [] = {0,0,1};
- vnl_matrix<float> v1(3,1,3,v1values);
- vnl_matrix<float> v2(3,1,3,v2values);
- vnl_matrix<float> v3(3,1,3,v3values);
- TEST("dot_product(v1,v2)",
- (dot_product(v1,v2)==0 && dot_product(v1,v3)==0 && dot_product(v2,v3)==0), true);
- v = v3;
- TEST("4d-v=3d-v", (v.rows()==3 && v.columns()==1 && v==v3), true);
-
- v.clear();
- TEST("zero-size after clear()", v.rows(), 0);
- TEST("zero-size after clear()", v.columns(), 0);
-}
-
-void test_double()
-{
- vcl_cout << "**************************\n"
- << "Testing vnl_matrix<double>\n"
- << "**************************\n";
- vnl_matrix<double> d0(2,2);
- TEST("vnl_matrix<double> d0(2,2)", (d0.rows()==2 && d0.columns()==2), true);
- vnl_matrix<double> d1(3,4);
- TEST("vnl_matrix<double> d1(3,4)", (d1.rows()==3 && d1.columns()==4), true);
- vnl_matrix<double> d2(2,2,2.0);
- TEST("vnl_matrix<double> d2(2,2,2.0)",
- (d2.get(0,0)==2.0 && d2.get(0,1)==2.0 && d2.get(1,0)==2.0 && d2.get(1,1)==2.0), true);
- TEST("d0=2.0", (d0=2.0,
- (d0.get(0,0)==2.0 && d0.get(0,1)==2.0 && d0.get(1,0)==2.0 && d0.get(1,1)==2.0)), true);
- TEST("d0 == d2", (d0 == d2), true);
- TEST("(d0 == d2)", (d0==d2), true);
- TEST("d2.put(1,1,3.0)", (d2.put(1,1,3.0),d2.get(1,1)), 3.0);
- TEST("d2.get(1,1)", d2.get(1,1), 3.0);
- TEST("d0 == d2", (d0 == d2), false);
- TEST("d0 != d2", (d0 != d2), true);
- TEST("(d0 == d2)", (d0==d2), false);
- TEST("d1.fill(3.0)",
- (d1.fill(3.0),
- (d1.get(0,0)==3.0 && d1.get(1,1)==3.0 && d1.get(2,2)==3.0 && d1.get(2,3)==3.0)), true);
- TEST("d2.fill(3.0)",
- (d2.fill(2.0),
- (d2.get(0,0)==2.0 && d2.get(0,1)==2.0 && d2.get(1,0)==2.0 && d2.get(1,1)==2.0)), true);
- double d3values [] = {1.0,2.0,3.0};
- vnl_matrix<double> d3(1,3,3,d3values);
- TEST("d3(1,3,3,{1.0,2.0,3.0})",
- (d3.get(0,0)==1.0 && d3.get(0,1)==2.0 && d3.get(0,2)==3.0), true);
- vnl_matrix<double> d4(d3);
- TEST("vnl_matrix<double> d4(d3)", (d3 == d4), true);
- TEST("d0=d2", (d0=d2, (d0==d2)), true);
- TEST("d0=d2+3.0",
- ((d0=d2+3.0),
- (d0.get(0,0)==5.0 && d0.get(0,1)==5.0 && d0.get(1,0)==5.0 && d0.get(1,1)==5.0)), true);
- TEST("d0+=(-3.0)",
- (d0+=(-3.0),
- (d0.get(0,0)==2.0 && d0.get(0,1)==2.0 && d0.get(1,0)==2.0 && d0.get(1,1)==2.0)), true);
- vnl_matrix<double> d5(2,2);
- TEST("d5=d0+d2",
- ((d5=d0+d2),
- (d5.get(0,0)==4.0 && d5.get(0,1)==4.0 && d5.get(1,0)==4.0 && d5.get(1,1)==4.0)), true);
- TEST("d0+=d2",
- ((d0+=d2),
- (d0.get(0,0)==4.0 && d0.get(0,1)==4.0 && d0.get(1,0)==4.0 && d0.get(1,1)==4.0)), true);
- TEST("d4=d3*5.0",((d4=d3*5.0),(d4.get(0,0)==5.0 && d4.get(0,1)==10.0 && d4.get(0,2)==15.0)), true);
- TEST("d3*=5.0",((d3*=5.0), (d3== d4)), true);
- double d6values [] = {1.0,2.0,
- 3.0,4.0};
- vnl_matrix<double> d6(2,2,4,d6values);
- TEST("vnl_matrix<double> d6(2,2,4,{1.0,2.0,3.0,4.0})", d6.get(1,1), 4.0);
- double d7values [] = {5.0,6.0,
- 7.0,8.0};
- vnl_matrix<double> d7(2,2,4,d7values);
- TEST("vnl_matrix<double> d7(2,2,4,{5.0,6.0,7.0,8.0})", d7.get(1,1), 8.0);
- TEST("d5=d6*d7", ((d5=d6*d7),
- (d5.get(0,0)==19.0 && d5.get(0,1)==22.0 && d5.get(1,0)==43.0 && d5.get(1,1)==50.0)), true);
- TEST("d6*=d7", ((d6*=d7),
- (d6.get(0,0)==19.0 && d6.get(0,1)==22.0 && d6.get(1,0)==43.0 && d6.get(1,1)==50.0)), true);
-
- d0.clear();
- TEST("zero-size after clear()", d0.rows(), 0);
- TEST("zero-size after clear()", d0.columns(), 0);
-
- // apply sqrt to every element
- double d8values [] = {0.0, 1.0, 9.0, 16.0};
- vnl_matrix<double> d8(2,2,4,d8values);
- d8 = d8.apply(vcl_sqrt);
- TEST("apply(sqrt)", d8[0][0]==0 && d8[0][1]==1 && d8[1][0]==3 && d8[1][1]==4, true);
-
- // normalizations
- d8.normalize_rows();
- TEST("normalize_rows()", d8[0][0]==0 && d8[0][1]==1, true);
- TEST_NEAR("normalize_rows()", d8[1][0], 0.6, 1e-12);
- TEST_NEAR("normalize_rows()", d8[1][1], 0.8, 1e-12);
- d8.normalize_columns();
- TEST("normalize_columns()", d8[0][0]==0 && d8[1][0]==1, true);
-}
-
-#ifdef LEAK
-static
-void test_leak() // use top4.1 to watch memory usage.
-{
- for (;;) { // remember to kill process.
- test_int();
- test_float();
- test_double();
- }
-}
-#endif
-
-static
-void test_matrix()
-{
- test_int();
- test_float();
- test_double();
-#ifdef LEAK
- test_leak();
-#endif
-}
-
-TESTMAIN(test_matrix);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix_exp.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix_exp.cxx
deleted file mode 100644
index 9a8d8b4b421da2f95b9e5117f39653d9e9967f68..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix_exp.cxx
+++ /dev/null
@@ -1,33 +0,0 @@
-// @author fsm
-
-#include <vcl_iostream.h>
-#include <vcl_cmath.h> // for vcl_abs()
-
-#include <vnl/vnl_double_3.h>
-#include <vnl/vnl_double_3x3.h>
-#include <vnl/vnl_matrix_exp.h>
-#include <vnl/vnl_matlab_print.h>
-#include <vnl/vnl_rotation_matrix.h>
-#include <vnl/vnl_cross_product_matrix.h>
-#include <testlib/testlib_test.h>
-
-void test_matrix_exp()
-{
- vnl_double_3 v(1.233,-0.572,0.777);
-
- vnl_double_3x3 X = vnl_cross_product_matrix(v);
- vnl_matlab_print(vcl_cout, X, "[v]");
-
- vnl_double_3x3 expX = vnl_matrix_exp(X);
- vnl_matlab_print(vcl_cout, expX, "matrix exp([v])");
- testlib_test_assert("expX(0,0)", vcl_abs(expX(0,0)-0.6221833130) < 1e-10);
- testlib_test_assert("expX(0,1)", vcl_abs(expX(0,1)+0.7825192869) < 1e-10);
- testlib_test_assert("expX(1,1)", vcl_abs(expX(1,1)-0.1379544126) < 1e-10);
- testlib_test_assert("expX(2,2)", vcl_abs(expX(2,2)-0.2501918781) < 1e-10);
-
- vnl_double_3x3 rotv = vnl_rotation_matrix(v);
- vnl_matlab_print(vcl_cout, rotv, "rotate exp([v])");
- testlib_test_assert("rotv == expX", (rotv-expX).fro_norm() < 1e-10);
-}
-
-TESTMAIN(test_matrix_exp);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix_fixed.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix_fixed.cxx
deleted file mode 100644
index e73bb2bf552af6efde32c12e786bf1e853488f82..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix_fixed.cxx
+++ /dev/null
@@ -1,486 +0,0 @@
-// This is core/vnl/tests/test_matrix_fixed.cxx
-#ifdef TEST_MALLOC // see note below, at the other #ifdef TEST_MALLOC
-# include <vcl_new.h>
-#endif
-#include <vcl_cstdlib.h>
-#include <vcl_cstddef.h> // for vcl_size_t
-#include <vcl_cmath.h> // for sqrt
-
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/vnl_vector_fixed.h>
-#include <vnl/vnl_double_3x3.h>
-#include <vnl/vnl_double_3.h>
-#include <vnl/vnl_double_2x2.h>
-#include <vnl/vnl_float_2x2.h>
-#include <vnl/vnl_int_2x2.h>
-
-#include <testlib/testlib_test.h>
-
-#undef printf // to work around a bug in libintl.h
-#include <vcl_cstdio.h> // do not use iostream within operator new - it causes infinite recursion
-
-bool verbose_malloc = false;
-int malloc_count = 0;
-
-// FIXME: Win32 will have different operator new in vnl dll from
-// the one generated here, so this test fails - RWMC.
-// The test also fails for gcc 3.0 - PVr
-# define reset_count malloc_count = 0
-#if !defined(VCL_WIN32) && !defined(GNU_LIBSTDCXX_V3)
-# define check_count TEST("mallocs",malloc_count<=1,true)
-#else
-# define check_count TEST("mallocs (no test)",true,true)
-#endif
-
-static
-void
-test_size()
-{
- vnl_matrix_fixed<double,3,4> m;
- TEST( "memory footprint", sizeof(m), sizeof(double[12]) );
-}
-
-static
-void
-test_multiply()
-{
- double data_m1[6] = {
- 1, 2,
- 3, 4,
- 5, 6
- };
- double data_m2[8] = {
- 2, 3, 4, 5,
- 6, 7, 8, 9
- };
- double data_v1[2] = {
- 7,
- 8
- };
-
- vnl_matrix_fixed<double,3,2> m1( data_m1 );
- vnl_matrix_fixed<double,2,4> m2( data_m2 );
- vnl_vector_fixed<double,2> v1( data_v1 );
-
- testlib_test_begin( "Matrix-matrix multiply" );
- vnl_matrix_fixed<double,3,4> mr = m1*m2;
- testlib_test_perform( mr(0,0) == 14 && mr(0,1) == 17 && mr(0,2) == 20 && mr(0,3) == 23 &&
- mr(1,0) == 30 && mr(1,1) == 37 && mr(1,2) == 44 && mr(1,3) == 51 &&
- mr(2,0) == 46 && mr(2,1) == 57 && mr(2,2) == 68 && mr(2,3) == 79 );
-
- testlib_test_begin( "Matrix-vector multiply" );
- vnl_vector_fixed<double,3> vr = m1*v1;
- testlib_test_perform( vr(0) == 23 && vr(1) == 53 && vr(2) == 83 );
-}
-
-static
-void test_int()
-{
- vnl_matrix_fixed<int,2,2> m0;
- TEST("vnl_matrix_fixed<int,2,2> m0", (m0.rows()==2 && m0.columns()==2), true);
- vnl_matrix_fixed<int,3,4> m1;
- TEST("vnl_matrix_fixed<int,3,4> m1", (m1.rows()==3 && m1.columns()==4), true);
- vnl_int_2x2 m2(2);
- TEST("vnl_int_2x2 m2(2)",
- (m2.get(0,0)==2 && m2.get(0,1)==2 && m2.get(1,0)==2 && m2.get(1,1)==2), true);
- TEST("m2 = vnl_int_2x2(2)",
- (m2 = vnl_int_2x2(2),
- (m2.get(0,0)==2 && m2.get(0,1)==2 && m2.get(1,0)==2 && m2.get(1,1)==2)), true);
- const vnl_int_2x2 ma = m2;
- TEST("(const vnl_matrix_fixed)(i,j)",
- (ma(0,0)==2 && ma(0,1)==2 && ma(1,0)==2 && ma(1,1)==2), true);
- vnl_int_2x2 mb = m2;
- TEST("(vnl_matrix_fixed)(i,j)",
- (mb(0,0) = 0,
- mb(0,0)==0 && mb(0,1)==2 && mb(1,0)==2 && mb(1,1)==2), true);
- int mcvalues[4] = {1, 2, 3};
- vnl_int_2x2 mc(mcvalues);
- TEST("vnl_int_2x2 mc(int[])",
- (mc(0,0)==1 && mc(0,1)==2 && mc(1,0)==3 && mc(1,1)==0), true);
- TEST("m0=2",
- (m0=2,
- (m0.get(0,0)==2 && m0.get(0,1)==2 && m0.get(1,0)==2 && m0.get(1,1)==2)), true);
- TEST("m0 == m2", (m0 == m2), true);
- TEST("(m0 == m2)", (m0 == m2), true);
- TEST("m2.put(1,1,3)", (m2.put(1,1,3),m2.get(1,1)), 3);
- TEST("m2.get(1,1)", m2.get(1,1), 3);
- TEST("m0 == m2", (m0 == m2), false);
- TEST("m0 != m2", (m0 != m2), true);
- TEST("(m0 == m2)", (m0 == m2), false);
- TEST("m1.fill(3)",
- (m1.fill(3),
- (m1.get(0,0)==3 && m1.get(1,1)==3 && m1.get(2,2)==3 && m1.get(2,3)==3)), true);
- TEST("m2.fill(2)",
- (m2.fill(2),
- (m2.get(0,0)==2 && m2.get(0,1)==2 && m2.get(1,0)==2 && m2.get(1,1)==2)), true);
- TEST("m0=m2", (m0=m2, (m0==m2)), true);
-
- // test additions and subtractions
- TEST("m0=m2+3",
- ((m0=m2+3),
- (m0.get(0,0)==5 && m0.get(0,1)==5 && m0.get(1,0)==5 && m0.get(1,1)==5)), true);
- TEST("m0=3+m2",
- ((m0=3+m2),
- (m0.get(0,0)==5 && m0.get(0,1)==5 && m0.get(1,0)==5 && m0.get(1,1)==5)), true);
- TEST("m0+=(-3)",
- (m0+=(-3),
- (m0.get(0,0)==2 && m0.get(0,1)==2 && m0.get(1,0)==2 && m0.get(1,1)==2)), true);
- TEST("m0-=(-3)",
- (m0-=(-3),
- (m0.get(0,0)==5 && m0.get(0,1)==5 && m0.get(1,0)==5 && m0.get(1,1)==5)), true);
- TEST("m0=m2-3",
- ((m0=m2-3),
- (m0.get(0,0)==-1 && m0.get(0,1)==-1 && m0.get(1,0)==-1 && m0.get(1,1)==-1)), true);
- TEST("m0=3-m2",
- ((m0=3-m2),
- (m0.get(0,0)==1 && m0.get(0,1)==1 && m0.get(1,0)==1 && m0.get(1,1)==1)), true);
- TEST("m0= -m2",
- (m0= -m2,
- (m0.get(0,0)==-2 && m0.get(0,1)==-2 && m0.get(1,0)==-2 && m0.get(1,1)==-2)), true);
-
- vnl_int_2x2 m5;
- m0 = m2;
- TEST("m5=m0+m2",
- ((m5=m0+m2),
- (m5.get(0,0)==4 && m5.get(0,1)==4 && m5.get(1,0)==4 && m5.get(1,1)==4)), true);
- TEST("m5=m0-m2",
- ((m5=m0-m2),
- (m5.get(0,0)==0 && m5.get(0,1)==0 && m5.get(1,0)==0 && m5.get(1,1)==0)), true);
- TEST("m0+=m2",
- ((m0+=m2),
- (m0.get(0,0)==4 && m0.get(0,1)==4 && m0.get(1,0)==4 && m0.get(1,1)==4)), true);
- TEST("m0-=m2",
- ((m0-=m2),
- (m0.get(0,0)==2 && m0.get(0,1)==2 && m0.get(1,0)==2 && m0.get(1,1)==2)), true);
-
- // test multiplications and divisions
- m2(0,0) = 1; m2(0,1) = 2; m2(1,0) = 3;
- TEST("m0=m2*5",
- ((m0=m2*5),
- (m0.get(0,0)==5 && m0.get(0,1)==10 && m0.get(1,0)==15)), true);
- TEST("m0=5*m2",
- ((m0=5*m2),
- (m0.get(0,0)==5 && m0.get(0,1)==10 && m0.get(1,0)==15)), true);
- TEST("m2*=5",((m2*=5), (m2== m0)), true);
- TEST("m0=m2/5",
- ((m0=m2/5),
- (m0.get(0,0)==1 && m0.get(0,1)==2 && m0.get(1,0)==3)), true);
- TEST("m2/=5", ((m2/=5), (m2==m0)), true);
-
- int m6values [] = {1,2,3,4};
- vnl_int_2x2 m6(m6values);
- TEST("vnl_int_2x2 m6({1,2,3,4})", m6.get(1,1), 4);
- int m7values [] = {5,6,7,8};
- vnl_int_2x2 m7(m7values);
- TEST("vnl_int_2x2 m7({5,6,7,8})", m7.get(1,1), 8);
- TEST("m5=m6*m7",
- ((m5=m6*m7),
- (m5.get(0,0)==19 && m5.get(0,1)==22 && m5.get(1,0)==43 && m5.get(1,1)==50)), true);
- TEST("m6*=m7",
- ((m6*=m7),
- (m6.get(0,0)==19 && m6.get(0,1)==22 && m6.get(1,0)==43 && m6.get(1,1)==50)), true);
-
- // additional tests
- int mvalues [] = {0,-2,2,0};
- vnl_int_2x2 m(mvalues); m0 = m;
- vnl_matrix<int> m3;
- TEST("m(i,j)",
- (m(0,0)==0 && m(0,1)==-2 && m(1,0)==2 && m(1,1)==0), true);
- TEST("m.transpose()",
- ((m0 = m.transpose()),
- (m0(0,0)==0 && m0(0,1)==2 && m0(1,0)==-2 && m0(1,1)==0)), true);
- TEST("element_product(m,m)",
- ((m0 = element_product(m,m)),
- (m0(0,0)==0 && m0(0,1)==4 && m0(1,0)==4 && m0(1,1)==0)), true);
- TEST("element_quotient(m,[2])",
- ((m2 = 2),
- (m0 = element_quotient(m,m2)),
- (m0(0,0)==0 && m0(0,1)==-1 && m0(1,0)==1 && m0(1,1)==0)), true);
- TEST("m.extract(1,1,1,1)",
- ((m3 = m.extract(1,1,1,1)),
- (m3.rows()==1 && m3.columns()==1 && m3(0,0)==m(1,1))), true);
- TEST("m.update([4],1,1)",
- ((m3=4),
- (m.update(m3,1,1)),
- (m(0,0)==0 && m(0,1)==-2 && m(1,0)==2 && m(1,1)==4)), true);
-}
-
-static
-void test_float()
-{
- vnl_matrix_fixed<float,2,2> d0;
- TEST("vnl_matrix_fixed<float,2,2> d0", (d0.rows()==2 && d0.columns()==2), true);
- vnl_matrix_fixed<float,3,4> d1;
- TEST("vnl_matrix_fixed<float,3,4> d1", (d1.rows()==3 && d1.columns()==4), true);
- vnl_float_2x2 d2(2.0);
- TEST("vnl_float_2x2 d2(2.0)",
- (d2.get(0,0)==2.0 && d2.get(0,1)==2.0 && d2.get(1,0)==2.0 && d2.get(1,1)==2.0), true);
- TEST("d0=2.0", (d0=2.0,
- (d0.get(0,0)==2.0 && d0.get(0,1)==2.0 && d0.get(1,0)==2.0 && d0.get(1,1)==2.0)), true);
- TEST("d0 == d2", (d0 == d2), true);
- TEST("(d0 == d2)", (d0==d2), true);
- TEST("d2.put(1,1,3.0)", (d2.put(1,1,(float)3.0),d2.get(1,1)), (float)3.0);
- TEST("d2.get(1,1)", d2.get(1,1), (float)3.0);
- TEST("d0 == d2", (d0 == d2), false);
- TEST("d0 != d2", (d0 != d2), true);
- TEST("(d0 == d2)", (d0==d2), false);
- TEST("d1.fill(3.0)",
- (d1.fill(3.0),
- (d1.get(0,0)==3.0 && d1.get(1,1)==3.0 && d1.get(2,2)==3.0 && d1.get(2,3)==3.0)), true);
- TEST("d2.fill(2.0)",
- (d2.fill(2.0),
- (d2.get(0,0)==2.0 && d2.get(0,1)==2.0 && d2.get(1,0)==2.0 && d2.get(1,1)==2.0)), true);
- TEST("d0=d2", (d0=d2, (d0==d2)), true);
-
- // test additions and subtractions
- TEST("d0=d2+3.0",
- ((d0=d2+(float)3.0),
- (d0.get(0,0)==5.0 && d0.get(0,1)==5.0 && d0.get(1,0)==5.0 && d0.get(1,1)==5.0)), true);
- TEST("d0+=(-3.0)",
- (d0+=(-3.0),
- (d0.get(0,0)==2.0 && d0.get(0,1)==2.0 && d0.get(1,0)==2.0 && d0.get(1,1)==2.0)), true);
- vnl_float_2x2 d5;
- TEST("d5=d0+d2",
- ((d5=d0+d2),
- (d5.get(0,0)==4.0 && d5.get(0,1)==4.0 && d5.get(1,0)==4.0 && d5.get(1,1)==4.0)), true);
- TEST("d0+=d2",
- ((d0+=d2),
- (d0.get(0,0)==4.0 && d0.get(0,1)==4.0 && d0.get(1,0)==4.0 && d0.get(1,1)==4.0)), true);
-
- // test multiplications and divisions
- d2(0,0) = 1; d2(0,1) = 2; d2(1,0) = 3;
- TEST("d0=d2*5.0f",
- ((d0=d2*5.0f),
- (d0.get(0,0)==5 && d0.get(0,1)==10 && d0.get(1,0)==15)), true);
- TEST("d0=5.0f*d2",
- ((d0=5.0f*d2),
- (d0.get(0,0)==5 && d0.get(0,1)==10 && d0.get(1,0)==15)), true);
- TEST("d2*=5.0f",((d2*=5.0f), (d2== d0)), true);
- TEST("d0=d2/5.0f",
- ((d0=d2/5.0f),
- (d0.get(0,0)==1 && d0.get(0,1)==2 && d0.get(1,0)==3)), true);
- TEST("d2/=5.0f", ((d2/=5.0f), (d2==d0)), true);
- float d6values [] = {1.0f,2.0f,
- 3.0f,4.0f};
- vnl_float_2x2 d6(d6values);
- TEST("vnl_float_2x2 d6({1.0,2.0,3.0,4.0})", d6.get(1,1), 4.0);
- float d7values [] = {5.0,6.0,
- 7.0,8.0};
- vnl_float_2x2 d7(d7values);
- TEST("vnl_float_2x2 d7({5.0,6.0,7.0,8.0})", d7.get(1,1), 8.0);
- TEST("d5=d6*d7", ((d5=d6*d7),
- (d5.get(0,0)==19.0 && d5.get(0,1)==22.0 && d5.get(1,0)==43.0 && d5.get(1,1)==50.0)), true);
- TEST("d6*=d7", ((d6*=d7),
- (d6.get(0,0)==19.0 && d6.get(0,1)==22.0 && d6.get(1,0)==43.0 && d6.get(1,1)==50.0)), true);
-
- // additional tests
- vnl_float_2x2 m1, m2;
- float mvalues [] = {0,-2,2,0};
- vnl_float_2x2 m(mvalues);
- m1 = m; m2 = m;
- vnl_matrix<float> m3;
- TEST("m(i,j)",
- (m(0,0)==0 && m(0,1)==-2 && m(1,0)==2 && m(1,1)==0), true);
- TEST("m.transpose()",
- ((m1 = m.transpose()),
- (m1(0,0)==0 && m1(0,1)==2 && m1(1,0)==-2 && m1(1,1)==0)), true);
- TEST("element_product(m,m)",
- ((m1 = element_product(m,m)),
- (m1(0,0)==0 && m1(0,1)==4 && m1(1,0)==4 && m1(1,1)==0)), true);
- TEST("element_quotient(m,[2])",
- ((m2 = 2),
- (m1 = element_quotient(m,m2)),
- (m1(0,0)==0 && m1(0,1)==-1 && m1(1,0)==1 && m1(1,1)==0)), true);
- TEST("m.extract(1,1,1,1)",
- ((m3 = m.extract(1,1,1,1)),
- (m3.rows()==1 && m3.columns()==1 && m3(0,0)==m(1,1))), true);
- TEST("m.update([4],1,1)",
- ((m3=4),
- (m.update(m3,1,1)),
- (m(0,0)==0 && m(0,1)==-2 && m(1,0)==2 && m(1,1)==4)), true);
-}
-
-static
-void test_double()
-{
- vnl_matrix_fixed<double,2,2> d0;
- TEST("vnl_matrix_fixed<double,2,2> d0", (d0.rows()==2 && d0.columns()==2), true);
- vnl_matrix_fixed<double,3,4> d1;
- TEST("vnl_matrix_fixed<double,3,4> d1", (d1.rows()==3 && d1.columns()==4), true);
- vnl_double_2x2 d2(2.0);
- TEST("vnl_double_2x2 d2(2.0)",
- (d2.get(0,0)==2.0 && d2.get(0,1)==2.0 && d2.get(1,0)==2.0 && d2.get(1,1)==2.0), true);
- TEST("d0=2.0", (d0=2.0,
- (d0.get(0,0)==2.0 && d0.get(0,1)==2.0 && d0.get(1,0)==2.0 && d0.get(1,1)==2.0)), true);
- TEST("d0 == d2", (d0 == d2), true);
- TEST("(d0 == d2)", (d0==d2), true);
- TEST("d2.put(1,1,3.0)", (d2.put(1,1,3.0),d2.get(1,1)), 3.0);
- TEST("d2.get(1,1)", d2.get(1,1), 3.0);
- TEST("d0 == d2", (d0 == d2), false);
- TEST("d0 != d2", (d0 != d2), true);
- TEST("(d0 == d2)", (d0==d2), false);
- TEST("d1.fill(3.0)",
- (d1.fill(3.0),
- (d1.get(0,0)==3.0 && d1.get(1,1)==3.0 && d1.get(2,2)==3.0 && d1.get(2,3)==3.0)), true);
- TEST("d2.fill(3.0)",
- (d2.fill(2.0),
- (d2.get(0,0)==2.0 && d2.get(0,1)==2.0 && d2.get(1,0)==2.0 && d2.get(1,1)==2.0)), true);
- TEST("d0=d2", (d0=d2, (d0==d2)), true);
-
- // test additions and subtractions
- TEST("d0=d2+3.0",
- ((d0=d2+3.0),
- (d0.get(0,0)==5.0 && d0.get(0,1)==5.0 && d0.get(1,0)==5.0 && d0.get(1,1)==5.0)), true);
- TEST("d0+=(-3.0)",
- (d0+=(-3.0),
- (d0.get(0,0)==2.0 && d0.get(0,1)==2.0 && d0.get(1,0)==2.0 && d0.get(1,1)==2.0)), true);
- vnl_double_2x2 d5;
- TEST("d5=d0+d2",
- ((d5=d0+d2),
- (d5.get(0,0)==4.0 && d5.get(0,1)==4.0 && d5.get(1,0)==4.0 && d5.get(1,1)==4.0)), true);
- TEST("d0+=d2",
- ((d0+=d2),
- (d0.get(0,0)==4.0 && d0.get(0,1)==4.0 && d0.get(1,0)==4.0 && d0.get(1,1)==4.0)), true);
-
- // test multiplications and divisions
- d2(0,0) = 1; d2(0,1) = 2; d2(1,0) = 3;
- TEST("d0=d2*5.0",
- ((d0=d2*5.0),
- (d0.get(0,0)==5 && d0.get(0,1)==10 && d0.get(1,0)==15)), true);
- TEST("d0=5.0*d2",
- ((d0=5.0*d2),
- (d0.get(0,0)==5 && d0.get(0,1)==10 && d0.get(1,0)==15)), true);
- TEST("d2*=5.0",((d2*=5.0), (d2== d0)), true);
- TEST("d0=d2/5.0",
- ((d0=d2/5.0),
- (d0.get(0,0)==1 && d0.get(0,1)==2 && d0.get(1,0)==3)), true);
- TEST("d2/=5.0", ((d2/=5.0), (d2==d0)), true);
- double d6values [] = {1.0,2.0,
- 3.0,4.0};
- vnl_double_2x2 d6(d6values);
- TEST("vnl_double_2x2 d6({1.0,2.0,3.0,4.0})", d6.get(1,1), 4.0);
- double d7values [] = {5.0,6.0,
- 7.0,8.0};
- vnl_double_2x2 d7(d7values);
- TEST("vnl_double_2x2 d7({5.0,6.0,7.0,8.0})", d7.get(1,1), 8.0);
- TEST("d5=d6*d7", ((d5=d6*d7),
- (d5.get(0,0)==19.0 && d5.get(0,1)==22.0 && d5.get(1,0)==43.0 && d5.get(1,1)==50.0)), true);
- TEST("d6*=d7", ((d6*=d7),
- (d6.get(0,0)==19.0 && d6.get(0,1)==22.0 && d6.get(1,0)==43.0 && d6.get(1,1)==50.0)), true);
-
- // apply sqrt to every element
- double d8values [] = {0.0, 1.0, 9.0, 16.0};
- vnl_double_2x2 d8(d8values);
- d8 = d8.apply(vcl_sqrt);
- TEST("apply(sqrt)", d8[0][0]==0 && d8[0][1]==1 && d8[1][0]==3 && d8[1][1]==4, true);
-
- // normalizations
- d8.normalize_rows();
- TEST("normalize_rows()", d8[0][0]==0 && d8[0][1]==1, true);
- TEST_NEAR("normalize_rows()", d8[1][0], 0.6, 1e-12);
- TEST_NEAR("normalize_rows()", d8[1][1], 0.8, 1e-12);
- d8.normalize_columns();
- TEST("normalize_columns()", d8[0][0]==0 && d8[1][0]==1, true);
-}
-
-void test_matrix_fixed()
-{
- verbose_malloc = true;
- double datablock[9] = {
- 11, 12, 13,
- 21, 22, 23,
- 31, 32, 33,
- };
-
- vcl_printf("Calling ctor -- should be no mallocs\n");
- reset_count;
- vnl_double_3x3 X(datablock);
- check_count;
- vcl_printf("X = [ %g %g %g\n %g %g %g\n %g %g %g ]\n",
- X(0,0),X(0,1),X(0,2),X(1,0),X(1,1),X(1,2),X(2,0),X(2,1),X(2,2));
-
- reset_count;
- vnl_double_3 v(10,11,12);
- check_count;
- vcl_printf("v = [ %g %g %g ]\n", v(0), v(1), v(2));
-
- reset_count;
- vnl_double_3 splork = X * (v + v);
- check_count;
- vcl_printf("splork = [ %g %g %g ]\n", splork(0), splork(1), splork(2));
-
- // This shouldn't compile...
-#if 0
- vnl_matrix<double>* base = new vnl_double_3x3(datablock);
-#endif
-
- vcl_printf("Now watch the mallocs\n");
- vnl_matrix_ref<double> CX = X;
- vnl_vector_ref<double> cv = v;
- vnl_vector<double> Xv = CX * (cv + cv);
- vcl_printf("X v = [ %g %g %g ]\n", Xv[0], Xv[1], Xv[2]);
-
- verbose_malloc = false;
-
- // test that vnl_double_3x3's can be multiplied
- vnl_double_3x3 A(datablock);
- vnl_double_3x3 B = A * A;
-
- // test that vnl_double_3x3's can be added and subtracted
- B = A + B;
- B -= A;
-
- B.fill(1.0);
- TEST("fill(1)", B(0,0)==1 && B(0,1)==1 && B(1,2)==1 && B(2,2)==1, true);
- B.fill_diagonal(4.0);
- TEST("fill_diagonal(4)", B(0,0)==4 && B(0,1)==1 && B(1,2)==1 && B(2,2)==4, true);
-
- // apply sqrt to every element
- B = B.apply(vcl_sqrt);
- TEST("apply(sqrt)", B(1,1)==2 && B(0,2)==1 && B(2,1)==1 && B(2,2)==2, true);
-
- test_multiply();
- test_size();
-
- test_int();
- test_float();
- test_double();
-}
-
-#ifdef TEST_MALLOC
- // BAD-BAD-BAD these operators new/delete are picked up by *all* tests!!!
- // The problem is that they don't provide new[] and delete[]. - PVr
-
-// with gcc 3.0, formatted stream output uses operator
-// new so printing to cout here causes stack overflow.
-
-void* operator new(vcl_size_t s)
- // [18.4.1] lib.new.delete
-#if defined(VCL_SUNPRO_CC_5) || defined(GNU_LIBSTDCXX_V3) || defined(VCL_KAI)
- throw(std::bad_alloc)
-#endif
-{
- void *r = vcl_malloc(s);
-
- ++malloc_count;
-
- if (verbose_malloc)
- vcl_printf("malloc: %08lX for %d\n", (unsigned long)r, int(s));
-
- return r;
-}
-
-void operator delete(void* s)
-#if defined(GNU_LIBSTDCXX_V3) || defined(VCL_SUNPRO_CC_5)
- throw()
-#endif
-{
- if (verbose_malloc)
- vcl_printf("delete: %08lX\n", (unsigned long)s);
-
- vcl_free(s);
-}
-
-#endif // TEST_MALLOC
-
-TESTMAIN(test_matrix_fixed);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix_fixed_ref.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix_fixed_ref.cxx
deleted file mode 100644
index 473ea8a5a4f860aadd7786341a3858c3ed863649..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_matrix_fixed_ref.cxx
+++ /dev/null
@@ -1,155 +0,0 @@
-// This is core/vnl/tests/test_matrix_fixed_ref.cxx
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/vnl_matrix_fixed_ref.h>
-#include <vnl/vnl_vector_fixed.h>
-
-#include <vcl_algorithm.h> // for vcl_generate()
-#include <vcl_cstdlib.h> // for vcl_rand()
-#include <testlib/testlib_test.h>
-
-void test_matrix_fixed_ref()
-{
- enum{rows = 3};
- enum{cols = 4};
- typedef vnl_matrix_fixed<double,rows,cols> mf;
- typedef vnl_matrix_fixed_ref<double,rows,cols> mfr;
- typedef vnl_matrix_fixed_ref_const<double,rows,cols> mfrc;
-
- int i,j;
- mf mat; // copy in
- for (i=0;i<rows;++i)
- for (j=0;j<cols;++j)
- mat(i,j) = 10 * i + j;
-
- // matrix fixed_ref tests
-
-
- // fixed_ref_const
- const mf & cmf = mat;
- mfrc cref(cmf);
- // check address
- for (i=0;i<rows;++i)
- {
- for (j=0;j<cols;++j)
- {
- TEST("const_address",&cref(i,j),&mat(i,j));
- }
- }
-
- // wrap around const mf
- // get_row
- for (i=0;i<rows;++i)
- {
- vnl_vector_fixed<double,cols> row_copy = cmf.get_row(i);
- vnl_vector_fixed<double,cols> row_copy2 = mat.get_row(i);
- TEST("get_row", row_copy,row_copy2);
- }
- // get_col
- for (j=0;j<cols;++j)
- {
- vnl_vector_fixed<double,rows> col_copy = cmf.get_column(j);
- vnl_vector_fixed<double,rows> col_copy2 = mat.get_column(j);
- TEST("get_column", col_copy,col_copy2);
- }
-
- // fixed_ref (non-const)
- // wrap around mat
- mfr ref(mat);
- // check address
- for (i=0;i<rows;++i)
- {
- for (j=0;j<cols;++j)
- {
- TEST("nonconst_address",&ref(i,j),&mat(i,j));
- }
- }
- // set_row
- for (i=0;i<rows;++i)
- {
- vnl_vector_fixed<double,cols> new_row;
- vcl_generate(new_row.begin(),new_row.end(),vcl_rand);
-
- ref.set_row(i,new_row);
- vnl_vector_fixed<double,cols> row_copy = mat.get_row(i);
- TEST("set_row", new_row, row_copy);
- }
- // set_col
- for (j=0;j<cols;++j)
- {
- vnl_vector_fixed<double,rows> new_col;
- vcl_generate(new_col.begin(),new_col.end(),vcl_rand);
-
- ref.set_column(j,new_col);
- vnl_vector_fixed<double,rows> col_copy = mat.get_column(j);
- TEST("set_col", new_col, col_copy);
- }
-
- // assign from mat
- mf other;
- vcl_generate(other.begin(),other.end(),vcl_rand);
-#if 0 // cannot assign to a vnl_matrix_fixed_ref_const
- ref = other;
- TEST("assign_mf", ref, other);
- // test different adresses
- TEST("assign_mf", (ref.begin() != other.begin()), true);
-#endif // 0
-
- {
- // assign from const mfr
- vcl_generate(other.begin(),other.end(),vcl_rand);
- mfrc cref(other);
- ref = cref;
- TEST("assign_const_ref", ref, other);
- // test different adresses
- TEST("assign_const_ref", (ref.begin() != other.begin()), true);
- }
-
- {
-#if 0 // cannot assign to a vnl_matrix_fixed_ref_const
- // assign from mfr
- vcl_generate(other.begin(),other.end(),vcl_rand);
- mfr ref2(other);
- ref = ref2;
- TEST("assign_ref", ref, other);
- // test different adresses
- TEST("assign_ref", (ref.begin() != other.begin()), true);
-#endif // 0
- }
- // arithmetic
- {
- // plus
- mf a,b;
- vcl_generate(a.begin(),a.end(),vcl_rand);
- vcl_generate(b.begin(),b.end(),vcl_rand);
- mfrc arefc(a), brefc(b);
- mf mc = arefc + brefc;
-
- mfr aref(a), bref(b);
- mf m = aref + bref;
-
- mf m2 = arefc + bref;
- mf m3 = arefc + brefc;
- TEST("plus", mc, m);
- TEST("plus", mc, m2);
- TEST("plus", mc, m3);
- }
- {
- // times
- mf a,b;
- vcl_generate(a.begin(),a.end(),vcl_rand);
- vcl_generate(b.begin(),b.end(),vcl_rand);
- mfrc arefc(a), brefc(b);
- mf mc = arefc + brefc;
-
- mfr aref(a), bref(b);
- mf m = aref + bref;
-
- mf m2 = arefc + bref;
- mf m3 = arefc + brefc;
- TEST("plus", mc, m);
- TEST("plus", mc, m2);
- TEST("plus", mc, m3);
- }
-}
-
-TESTMAIN(test_matrix_fixed_ref);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_numeric_traits.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_numeric_traits.cxx
deleted file mode 100644
index 7cef7812b6918b2b618a64d130a08fdc408dcf5d..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_numeric_traits.cxx
+++ /dev/null
@@ -1,229 +0,0 @@
-// This is core/vnl/tests/test_numeric_traits.cxx
-#include <vnl/vnl_numeric_traits.h>
-#include <testlib/testlib_test.h>
-#include <vcl_complex.h>
-#include <vcl_iostream.h>
-#include <vxl_config.h> // for VXL_BIG_ENDIAN
-
-static
-void check_pointer( const void* )
-{
-}
-
-static
-void test_static_const_definition()
-{
-#define ONE_ZERO( Type ) \
- do {\
- check_pointer( &vnl_numeric_traits< Type >::zero );\
- check_pointer( &vnl_numeric_traits< Type >::one );\
- check_pointer( &vnl_numeric_traits< const Type >::zero );\
- check_pointer( &vnl_numeric_traits< const Type >::one );\
- } while (false)
-#define ALL( Type ) \
- ONE_ZERO( Type ); \
- do {\
- check_pointer( &vnl_numeric_traits< Type >::maxval );\
- check_pointer( &vnl_numeric_traits< const Type >::maxval );\
- } while (false)
- // The Intel compiler has problems resolving static consts with this test
- // as it stands
-#if !defined(__INTEL_COMPILER)
- ALL(bool);
- ALL(char);
- ALL(unsigned char);
- ALL(signed char);
- ALL(short);
- ALL(unsigned short);
- ALL(int);
- ALL(unsigned int);
- ALL(long);
- ALL(unsigned long);
- ALL(float);
- ALL(double);
- ALL(long double);
- ONE_ZERO( vcl_complex<float> );
- ONE_ZERO( vcl_complex<double> );
- ONE_ZERO( vcl_complex<long double> );
-#endif
-
-#undef ONE_ZERO
-#undef ALL
-}
-
-extern "C" { long increment(long x) { return x+1; } }
-
-void test_numeric_traits()
-{
- // call it to avoid compiler warnings
- test_static_const_definition();
-
- TEST("vnl_numeric_traits<bool>::zero", vnl_numeric_traits<bool>::zero, false);
- TEST("vnl_numeric_traits<bool>::one", vnl_numeric_traits<bool>::one, true);
- TEST("vnl_numeric_traits<char>::zero", vnl_numeric_traits<char>::zero, '\0');
- TEST("vnl_numeric_traits<char>::one", vnl_numeric_traits<char>::one, 1);
- TEST("vnl_numeric_traits<unsigned char>::zero", vnl_numeric_traits<unsigned char>::zero, '\0');
- TEST("vnl_numeric_traits<unsigned char>::one", vnl_numeric_traits<unsigned char>::one, 1);
- TEST("vnl_numeric_traits<signed char>::zero", vnl_numeric_traits<signed char>::zero, '\0');
- TEST("vnl_numeric_traits<signed char>::one", vnl_numeric_traits<signed char>::one, 1);
- TEST("vnl_numeric_traits<short>::zero", vnl_numeric_traits<short>::zero, 0);
- TEST("vnl_numeric_traits<short>::one", vnl_numeric_traits<short>::one, 1);
- TEST("vnl_numeric_traits<unsigned short>::zero", vnl_numeric_traits<unsigned short>::zero, 0);
- TEST("vnl_numeric_traits<unsigned short>::one", vnl_numeric_traits<unsigned short>::one, 1);
- TEST("vnl_numeric_traits<signed short>::zero", vnl_numeric_traits<signed short>::zero, 0);
- TEST("vnl_numeric_traits<signed short>::one", vnl_numeric_traits<signed short>::one, 1);
- TEST("vnl_numeric_traits<int>::zero", vnl_numeric_traits<int>::zero, 0);
- TEST("vnl_numeric_traits<int>::one", vnl_numeric_traits<int>::one, 1);
- TEST("vnl_numeric_traits<signed int>::zero", vnl_numeric_traits<signed int>::zero, 0);
- TEST("vnl_numeric_traits<signed int>::one", vnl_numeric_traits<signed int>::one, 1);
- TEST("vnl_numeric_traits<unsigned int>::zero", vnl_numeric_traits<unsigned int>::zero, 0);
- TEST("vnl_numeric_traits<unsigned int>::one", vnl_numeric_traits<unsigned int>::one, 1);
- TEST("vnl_numeric_traits<long>::zero", vnl_numeric_traits<long>::zero, 0L);
- TEST("vnl_numeric_traits<long>::one", vnl_numeric_traits<long>::one, 1L);
- TEST("vnl_numeric_traits<signed long>::zero", vnl_numeric_traits<signed long>::zero, 0L);
- TEST("vnl_numeric_traits<signed long>::one", vnl_numeric_traits<signed long>::one, 1L);
- TEST("vnl_numeric_traits<unsigned long>::zero", vnl_numeric_traits<unsigned long>::zero, 0L);
- TEST("vnl_numeric_traits<unsigned long>::one", vnl_numeric_traits<unsigned long>::one, 1L);
- TEST("vnl_numeric_traits<float>::zero", vnl_numeric_traits<float>::zero, 0.0f);
- TEST("vnl_numeric_traits<float>::one", vnl_numeric_traits<float>::one, 1.0f);
- TEST("vnl_numeric_traits<double>::zero", vnl_numeric_traits<double>::zero, 0.0);
- TEST("vnl_numeric_traits<double>::one", vnl_numeric_traits<double>::one, 1.0);
- TEST("vnl_numeric_traits<long double>::zero", vnl_numeric_traits<long double>::zero, 0.0);
- TEST("vnl_numeric_traits<long double>::one", vnl_numeric_traits<long double>::one, 1.0);
- TEST("vnl_numeric_traits<vcl_complex<float> >::zero",
- vnl_numeric_traits<vcl_complex<float> >::zero, vcl_complex<float>(0.0f));
- TEST("vnl_numeric_traits<vcl_complex<float> >::one",
- vnl_numeric_traits<vcl_complex<float> >::one, vcl_complex<float>(1.0f));
- TEST("vnl_numeric_traits<vcl_complex<double> >::zero",
- vnl_numeric_traits<vcl_complex<double> >::zero, vcl_complex<double>(0.0));
- TEST("vnl_numeric_traits<vcl_complex<double> >::one",
- vnl_numeric_traits<vcl_complex<double> >::one, vcl_complex<double>(1.0));
- TEST("vnl_numeric_traits<vcl_complex<long double> >::zero",
- vnl_numeric_traits<vcl_complex<long double> >::zero, vcl_complex<long double>(0.0));
- TEST("vnl_numeric_traits<vcl_complex<long double> >::one",
- vnl_numeric_traits<vcl_complex<long double> >::one, vcl_complex<long double>(1.0));
-
- // Testing maxval values
-
- char cm = vnl_numeric_traits<char>::maxval;
- signed char scm = vnl_numeric_traits<signed char>::maxval;
- unsigned char ucm = vnl_numeric_traits<unsigned char>::maxval;
- short sm = vnl_numeric_traits<short>::maxval;
- unsigned short usm = vnl_numeric_traits<unsigned short>::maxval;
- int im = vnl_numeric_traits<int>::maxval;
- unsigned int uim = vnl_numeric_traits<unsigned int>::maxval;
- long lm = vnl_numeric_traits<long>::maxval;
- unsigned long ulm = vnl_numeric_traits<unsigned long>::maxval;
- float fm = vnl_numeric_traits<float>::maxval;
- double dm = vnl_numeric_traits<double>::maxval;
- long double ldm = vnl_numeric_traits<long double>::maxval;
-
- vcl_cout << " vnl_numeric_traits<bool>::maxval = " << vnl_numeric_traits<bool>::maxval << '\n'
- << " vnl_numeric_traits<char>::maxval = " << (int)cm << '\n'
- << " vnl_numeric_traits<signed char>::maxval = " << (int)scm << '\n'
- << " vnl_numeric_traits<unsigned char>::maxval = " << (int)ucm << '\n'
- << " vnl_numeric_traits<short>::maxval = " << sm << '\n'
- << " vnl_numeric_traits<unsigned short>::maxval = " << usm << '\n'
- << " vnl_numeric_traits<int>::maxval = " << im << '\n'
- << " vnl_numeric_traits<unsigned int>::maxval = " << uim << '\n'
- << " vnl_numeric_traits<long>::maxval = " << lm << '\n'
- << " vnl_numeric_traits<unsigned long>::maxval = " << ulm << '\n'
- << " vnl_numeric_traits<float>::maxval = " << fm << '\n'
- << " vnl_numeric_traits<double>::maxval = " << dm << '\n'
- << " vnl_numeric_traits<long double>::maxval = " << ldm << '\n';
-
- // Verify that these values are positive and satisfy certain constraints:
- TEST("vnl_numeric_traits<char>::maxval must be at least 127", cm >= 127, true);
- TEST("vnl_numeric_traits<signed char>::maxval must be at least 127", scm >= 127, true);
- TEST("vnl_numeric_traits<unsigned char>::maxval must be larger than that", ucm>scm, true);
- TEST("vnl_numeric_traits<short>::maxval must be larger than that", sm>ucm, true);
- TEST("vnl_numeric_traits<int>::maxval must be at least as large", im>=sm, true);
- TEST("vnl_numeric_traits<unsigned short>::maxval must be larger than <short>", usm>sm, true);
- TEST("vnl_numeric_traits<unsigned int>::maxval must be at least as large", uim>=usm && uim>(unsigned int)im, true);
- TEST("vnl_numeric_traits<long>::maxval must be at least equal to <int>", lm>=im, true);
- TEST("vnl_numeric_traits<unsigned long>::maxval must be larger than that", ulm>(unsigned long)lm, true);
- TEST("vnl_numeric_traits<float>::maxval must be at least 1e33", fm>1e33, true);
- TEST("vnl_numeric_traits<double>::maxval must be larger than that", dm>fm, true);
- TEST("vnl_numeric_traits<long double>::maxval must be at least as large", ldm>=dm, true);
-
- // Verify that there is nothing larger than these maxval values:
- ++cm; TEST("vnl_numeric_traits<char>::maxval must be the largest possible", cm<=0, true);
- if (cm > 0) vcl_cout << cm << " is larger\n";
- ++scm; TEST("vnl_numeric_traits<signed char>::maxval must be the largest possible", scm<0, true);
- if (scm > 0) vcl_cout << scm << " is larger\n";
- ++ucm; TEST("vnl_numeric_traits<unsigned char>::maxval must be the largest possible", ucm==0, true);
- if (ucm > 0) vcl_cout << ucm << " is larger\n";
- ++sm; TEST("vnl_numeric_traits<short>::maxval must be the largest possible", sm<0, true);
- if (sm > 0) vcl_cout << sm << " is larger\n";
- ++usm; TEST("vnl_numeric_traits<unsigned short>::maxval must be the largest possible", usm==0, true);
- if (usm > 0) vcl_cout << usm << " is larger\n";
- im = increment(im); TEST("vnl_numeric_traits<int>::maxval must be the largest possible", im<0, true);
- if (im > 0) vcl_cout << im << " is larger\n";
- ++uim; TEST("vnl_numeric_traits<unsigned int>::maxval must be the largest possible", uim==0, true);
- if (uim > 0) vcl_cout << uim << " is larger\n";
- lm=increment(lm); TEST("vnl_numeric_traits<long>::maxval must be the largest possible", lm<0, true);
- if (lm > 0) vcl_cout << lm << " is larger\n";
- ++ulm; TEST("vnl_numeric_traits<unsigned long>::maxval must be the largest possible", ulm==0, true);
- if (ulm > 0) vcl_cout << ulm << " is larger\n";
-
- unsigned char* x = (unsigned char*)(&fm);
- int nr_of_ones = 0;
- vcl_cout << "vnl_numeric_traits<float>::maxval has internal representation ";
-#if VXL_BIG_ENDIAN
- for (unsigned int i=0; i<sizeof(float); ++i)
-#else
- for (int i=sizeof(float)-1; i>=0; --i)
-#endif
- for (int j=7; j>=0; --j) {
- int n = int(((x[i])>>j)&1);
- nr_of_ones += n;
- vcl_cout << n;
- }
- vcl_cout << '\n';
- // there should only be 2 zeros in the representation: the sign bits of mantissa and of exponent:
- TEST("vnl_numeric_traits<float>::maxval must be the largest possible", nr_of_ones, 8*sizeof(float)-2);
-
- x = (unsigned char*)(&dm);
- nr_of_ones = 0;
- vcl_cout << "vnl_numeric_traits<double>::maxval has internal representation ";
-#if VXL_BIG_ENDIAN
- for (unsigned int i=0; i<sizeof(double); ++i)
-#else
- for (int i=sizeof(double)-1; i>=0; --i)
-#endif
- for (int j=7; j>=0; --j) {
- int n = int(((x[i])>>j)&1);
- nr_of_ones += n;
- vcl_cout << n;
- }
- vcl_cout << '\n';
- // there should only be 2 zeros in the representation: the sign bits of mantissa and of exponent:
- TEST("vnl_numeric_traits<double>::maxval must be the largest possible", nr_of_ones, 8*sizeof(double)-2);
-
- x = (unsigned char*)(&ldm);
-#if 0
- // See TODO below. Do not set if not used.
- nr_of_ones = 0;
-#endif
- vcl_cout << "vnl_numeric_traits<long double>::maxval has internal representation ";
-#if VXL_BIG_ENDIAN
- for (unsigned int i=0; i<sizeof(long double); ++i)
-#else
- for (int i=sizeof(long double)-1; i>=0; --i)
-#endif
- for (int j=7; j>=0; --j) {
- int n = int(((x[i])>>j)&1);
-#if 0
- // See TODO below. Do not set if not used.
- nr_of_ones += n;
-#endif
- vcl_cout << n;
- }
- vcl_cout << '\n';
-#if 0 // TODO - long double has non-standard length on differnet platforms
- // there should only be 2 zeros in the representation: the sign bits of mantissa and of exponent:
- TEST("vnl_numeric_traits<long double>::maxval must be the largest possible", nr_of_ones, 8*sizeof(long double)-2);
-#endif
-}
-
-TESTMAIN(test_numeric_traits);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_quaternion.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_quaternion.cxx
deleted file mode 100644
index 8162fe35c872ec5f09ae79d3c89e70177175ba4f..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_quaternion.cxx
+++ /dev/null
@@ -1,231 +0,0 @@
-#include <vcl_iostream.h>
-// not used? #include <vcl_iomanip.h>
-#include <vcl_limits.h>
-#include <testlib/testlib_test.h>
-#include <vnl/vnl_math.h>
-#include <vnl/vnl_random.h>
-#include <vnl/vnl_quaternion.h>
-#include <vnl/vnl_vector_fixed.h>
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/vnl_rotation_matrix.h>
-
-// Tolerance between doubles. This was inferred by trial and error.
-// Could be derived mathematically?
-const double dtol = 16*vcl_numeric_limits<double>::epsilon();
-
-
-static void test_operators()
-{
- vnl_quaternion<double> a(0,0,0,1), b(2,2,2,2), c, d(2,2,2,3), e(1,2,3,4);
- TEST("!=", a!=b, true);
- TEST("==", a==a, true);
- c = a + b; TEST("+", c, d);
- TEST(".x()", e.x(), 1.0);
- TEST(".y()", e.y(), 2.0);
- TEST(".z()", e.z(), 3.0);
- TEST(".r()", e.r(), 4.0);
- vcl_cout << vcl_endl;
-}
-
-
-static void test_random_round_trip()
-{
- vnl_random rng(13241ul);
- unsigned errcount=0;
- double avg_sqr_error = 0.0;
- for (unsigned i=0;i<1000;++i)
- {
- // Need to be careful abount wrap around - don't test with angles that are too big
- vnl_vector_fixed<double,3> euler(rng.normal()*vnl_math::pi/18.0,
- rng.normal()*vnl_math::pi/18.0, rng.normal()*vnl_math::pi/18.0);
- vnl_quaternion<double> quat(euler(0), euler(1), euler(2));
- vnl_vector_fixed<double,3> out = quat.rotation_euler_angles();
- double err = vnl_vector_ssd(euler, out);
- avg_sqr_error+=err;
- if (err > 1e-16)
- {
- errcount++;
- vcl_cout << "ERROR: " << euler << vcl_endl;
- }
- }
- TEST("1000*Random euler -> quaternion -> euler consistent", errcount, 0);
- vcl_cout << "Average squared error: " << avg_sqr_error << vcl_endl;
-}
-
-static void test_random_euler_near_zero()
-{
- vnl_random rng(13241ul);
- unsigned errcount=0;
- double avg_sqr_error = 0.0;
- for (unsigned i=0;i<1000;++i)
- {
- // Need to be careful abount wrap around - don't test with angles that are too big
- vnl_vector_fixed<double,3> euler(rng.normal()*vnl_math::pi/180.0,
- rng.normal()*vnl_math::pi/180.0, rng.normal()*vnl_math::pi/180.0);
- vnl_quaternion<double> quat(euler(0), euler(1), euler(2));
- if (quat.angle() > vnl_math::pi/36.0)
- {
- errcount++;
- vcl_cout << "ERROR: should be small: " << euler << ": " << quat << vcl_endl;
- }
- quat *= -1.0;
- vnl_vector_fixed<double,3> out = quat.rotation_euler_angles();
- double err = vnl_vector_ssd(euler, out);
- avg_sqr_error+=err;
- if (err > 1e-16)
- {
- errcount++;
- vcl_cout << "ERROR: -quat -> euler == quat -> euler" << euler << ": " << out << vcl_endl;
- }
- }
- TEST("1000*Random small euler -> small quaternion angle", errcount, 0);
- vcl_cout << "Average squared error: " << avg_sqr_error << vcl_endl;
-}
-
-static void test_random_quat_near_zero()
-{
- vnl_random rng(13241ul);
- unsigned errcount=0;
- for (unsigned i=0;i<1000;++i)
- {
- vnl_quaternion<double> quat(rng.normal()/1000.0, rng.normal()/1000.0, rng.normal()/1000.0,
- vnl_math_sgn0(rng.normal()) * (1.0+rng.normal()/1000.0) );
- quat.normalize();
-
- vnl_vector_fixed<double,3> euler = quat.rotation_euler_angles();
-
- if (euler.magnitude() > 0.01)
- {
- errcount++;
- vcl_cout << "ERROR: should be small: " << quat << ": " << euler << vcl_endl;
- }
- }
- TEST("1000*Random small quat -> small euler values", errcount, 0);
-}
-
-
-// Test whether the rotation matrix and Euler angles are correct.
-// Do this by checking consistency with vnl_rotation_matrix().
-static void test_rotation_matrix_and_euler_angles()
-{
- bool success = true;
- vnl_random rng(13241ul);
- const unsigned ntrials=100;
- for (unsigned i=0; i<ntrials; ++i)
- {
- bool this_trial_ok = true;
- double x = rng.drand32(-1.0, 1.0);
- double y = rng.drand32(-1.0, 1.0);
- double z = rng.drand32(-1.0, 1.0);
- vnl_vector_fixed<double,3> axis(x,y,z);
- axis.normalize();
- double ang = rng.drand32(-4*vnl_math::pi, 4*vnl_math::pi);
-
- // Construct the quaternion from this axis and angle,
- // and extract both euler_angles and rotation matrix.
- vnl_quaternion<double> q(axis, ang);
- vnl_vector_fixed<double,3> eu = q.rotation_euler_angles();
- vnl_matrix_fixed<double,3,3> R = (q.rotation_matrix_transpose()).transpose();
-
- // Use vnl_rotation_matrix() with axis+angle form
- {
- vnl_vector_fixed<double,3> axis_ang = axis * ang;
- vnl_matrix_fixed<double,3,3> M = vnl_rotation_matrix(axis_ang);
- vnl_matrix_fixed<double,3,3> D = R - M;
- double max_err = D.absolute_value_max();
- this_trial_ok = this_trial_ok && (max_err<=dtol);
-#ifndef NDEBUG
- if (max_err>dtol)
- {
- vcl_cout << "Warning (a+a): max_err=" << max_err
- << " dtol=" << dtol << vcl_endl;
- }
-#endif
- }
-
- // Use vnl_rotation_matrix() with euler angles.
- {
- vnl_vector<double> ex(3), ey(3), ez(3);
- ex[0]=1.0; ex[1]=0.0; ex[2]=0.0;
- ey[0]=0.0; ey[1]=1.0; ey[2]=0.0;
- ez[0]=0.0; ez[1]=0.0; ez[2]=1.0;
- ex *= eu[0];
- ey *= eu[1];
- ez *= eu[2];
- vnl_matrix<double> Rx = vnl_rotation_matrix(ex);
- vnl_matrix<double> Ry = vnl_rotation_matrix(ey);
- vnl_matrix<double> Rz = vnl_rotation_matrix(ez);
- vnl_matrix<double> M = Rz * Ry * Rx;
- vnl_matrix<double> D = R - M;
- double max_err = D.absolute_value_max();
- this_trial_ok = this_trial_ok && (max_err<=dtol);
-#ifndef NDEBUG
- if (max_err>dtol)
- {
- vcl_cout << "Warning (ea): max_err=" << max_err
- << " dtol=" << dtol << vcl_endl;
- }
-#endif
- }
-
- success = success && this_trial_ok;
- }
- TEST("test_rotation_matrix_and_euler_angles() for many trials", success, true);
-}
-
-
-static void test_rotations()
-{
- vnl_vector_fixed<double,3> p1(2,2,2), p2(1,0,0), p3(0,1,0);
- vnl_vector_fixed<double,3> e0(0,0,0);
- vnl_quaternion<double> q0(0,0,0,0);
- TEST_NEAR("rotate p1 using q0", vnl_vector_ssd(q0.rotate(p1),p1), 0.0, 1e-8);
- TEST_NEAR("rotate p2 using q0", vnl_vector_ssd(q0.rotate(p2),p2), 0.0, 1e-8);
- vnl_quaternion<double> q0_b(0,0,0,1);
- TEST_NEAR("rotate p1 using q0_b", vnl_vector_ssd(q0_b.rotate(p1),p1), 0.0, 1e-8);
- TEST_NEAR("rotate p2 using q0_b", vnl_vector_ssd(q0_b.rotate(p2),p2), 0.0, 1e-8);
- TEST_NEAR("q0_b -> Euler angles", vnl_vector_ssd(q0_b.rotation_euler_angles(),e0), 0.0, 1e-8);
- vcl_cout << "q0_b -> Euler angles: " << q0_b.rotation_euler_angles() << vcl_endl;
- vnl_quaternion<double> q0_c(0,0,0,-4);
- TEST_NEAR("rotate p1 using q0_c", vnl_vector_ssd(q0_c.rotate(p1),p1), 0.0, 1e-8);
- TEST_NEAR("rotate p2 using q0_c", vnl_vector_ssd(q0_c.rotate(p2),p2), 0.0, 1e-8);
- vnl_quaternion<double> q0_d(0,0,0);
- TEST_NEAR("rotate p1 using q0_d", vnl_vector_ssd(q0_d.rotate(p1),p1), 0.0, 1e-8);
- TEST_NEAR("rotate p2 using q0_d", vnl_vector_ssd(q0_d.rotate(p2),p2), 0.0, 1e-8);
-
- // The axis replacing rotation - i.e. 120 degrees about (1,1,1)
- vnl_vector_fixed<double,3> e1(vnl_math::pi/2, 0, vnl_math::pi/2);
- vnl_quaternion<double> q1(p1/p1.magnitude(), vnl_math::pi * 2.0 / 3.0);
- TEST_NEAR("rotate p1 using q1", vnl_vector_ssd(q1.rotate(p1),p1), 0.0, 1e-8);
- TEST_NEAR("rotate p2 using q1", vnl_vector_ssd(q1.rotate(p2),p3), 0.0, 1e-8);
- vnl_vector_fixed<double,3> e1_b = q1.rotation_euler_angles();
- TEST_NEAR("q1 -> Euler angles", vnl_vector_ssd(e1_b,e1), 0.0, 1e-8);
- vnl_quaternion<double> q1_c = -q1;
- vnl_vector_fixed<double,3> e1_c = q1_c.rotation_euler_angles();
- TEST_NEAR("-q1 -> Euler angles", vnl_vector_ssd(e1_c,e1), 0.0, 1e-8);
-
- vcl_cout << "q1 -> Euler angles: " << e1 << vcl_endl;
- vnl_quaternion<double> q1_b(e1(0), e1(1), e1(2));
- vcl_cout << "q1 -> Euler angles: " << q1_b << vcl_endl;
- TEST_NEAR("Euler angles -> q1",
- vnl_vector_ssd(q1_b, q1), 0.0, 1e-8);
-
- vcl_cout << "Euler angles -> q1: " << q1_b << vcl_endl;
-
- test_random_round_trip();
- test_random_quat_near_zero();
- test_random_euler_near_zero();
-
- test_rotation_matrix_and_euler_angles();
-}
-
-
-// Main testing function
-void test_quaternion()
-{
- test_operators();
- test_rotations();
-}
-
-
-TESTMAIN(test_quaternion);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_random.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_random.cxx
deleted file mode 100644
index 8bbe24a9c08c9dc3538270055267f50fd3db755f..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_random.cxx
+++ /dev/null
@@ -1,53 +0,0 @@
-// This is core/vnl/tests/test_random.cxx
-#include <vcl_iostream.h>
-#include <vcl_cmath.h> // for vcl_sqrt()
-#include <vnl/vnl_random.h>
-#include <testlib/testlib_test.h>
-
-void test_random()
-{
- vcl_cout << "********************\n"
- << " Testing vnl_random\n"
- << "********************\n";
-
- vnl_random mz_random;
- mz_random.reseed(123456);
-
- TEST("lrand32",mz_random.lrand32(),3501493769ul);
- TEST("lrand32(0,10)",mz_random.lrand32(0,10),9);
- double d1 = mz_random.drand32(0,1);
- TEST_NEAR("drand32(0,1)", d1, 0.6158541, 1e-7);
- double d2 = mz_random.drand64(0,1);
- TEST_NEAR("drand64(0,1)", d2, 0.2257411, 1e-7);
-
- double sum = 0.0;
- double sum_sq = 0.0;
- int n = 10000;
- for (int i=0;i<n;++i)
- {
- double r = mz_random.normal();
- sum += r;
- sum_sq += r*r;
- }
-
- double mean = sum/n;
- double var = vcl_sqrt(sum_sq/n-mean*mean);
- TEST_NEAR("normal() mean near zero",mean, 0.0, 0.01);
- TEST_NEAR("normal() var near one",var, 1.0, 0.02);
-
- sum = 0.0;
- sum_sq = 0.0;
- for (int i=0;i<n;++i)
- {
- double r = mz_random.normal64();
- sum += r;
- sum_sq += r*r;
- }
-
- mean = sum/n;
- var = vcl_sqrt(sum_sq/n-mean*mean);
- TEST_NEAR("normal64() mean near zero",mean, 0.0, 0.01);
- TEST_NEAR("normal64() var near one",var, 1.0, 0.01);
-}
-
-TESTMAIN(test_random);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_rational.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_rational.cxx
deleted file mode 100644
index 06b22a5ec2347df73f1ca6a693ecdc47756353be..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_rational.cxx
+++ /dev/null
@@ -1,204 +0,0 @@
-#include <vcl_iostream.h>
-#include <vcl_iomanip.h>
-#include <vnl/vnl_rational.h>
-#include <vnl/vnl_rational_traits.h>
-#include <vcl_complex.h>
-#ifdef NEED_COMPLEX_RATIONAL
-# include <vnl/vnl_complex.h>
-#endif
-#include <testlib/testlib_test.h>
-#include <vnl/vnl_math.h>
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/vnl_det.h>
-
-inline vnl_rational vnl_sqrt(vnl_rational x) { return vnl_rational(vcl_sqrt(double(x))); }
-
-static void test_operators()
-{
- vnl_rational a(-5L), b(7,-1), c, d(3,7), e(2,0);
- TEST("==", a==-5L, true);
- TEST("==", 5L==-a, true);
- TEST("==", b==-7, true);
- TEST("==", -7==b, true);
- c = a + b; TEST("+", c, -12L);
- c = a - b; TEST("-", c, 2L);
- c = a * b; TEST("*", c, 35L);
- c = a / b; TEST("/", c, vnl_rational(5,7));
- c = c % d; TEST("%", c, vnl_rational(2,7));
- c = a % b; TEST("%", c, -5L);
- c = a % d; TEST("%", c, vnl_rational(-2,7));
- c = d % a; TEST("%", c, d);
- c = a + 5L; TEST("+", c, 0L);
- c = a - 5L; TEST("-", c, -10L);
- c = a * 5L; TEST("*", c, -25L);
- c = a / 5L; TEST("/", c, -1L);
- c = a % 5L; TEST("%", c, 0L);
- c = 5L + a; TEST("+", c, 0L);
- c = 5L - a; TEST("-", c, 10L);
- c = 5L * a; TEST("*", c, -25L);
- c = 5L / a; TEST("/", c, -1L);
- c = 5L % a; TEST("%", c, 0L);
- c = 5 + a; TEST("+", c, 0L);
- c = 5 - a; TEST("-", c, 10L);
- c = 5 * a; TEST("*", c, -25L);
- c = 5 / a; TEST("/", c, -1L);
- c = 5 % a; TEST("%", c, 0L);
- c = a + 5; TEST("+", c, 0L);
- c = a - 5; TEST("-", c, -10L);
- c = a * 5; TEST("*", c, -25L);
- c = a / 5; TEST("/", c, -1L);
- TEST("<", a<d, true);
- TEST("<", a<1L, true);
- TEST("<", a<-4.9, true);
- TEST(">", -b>d, true);
- TEST(">", b>-8, true);
- TEST(">", b>-7.1, true);
- TEST("<=", c<=e, true);
- TEST(">=", b>=-7L, true);
- TEST("<=", 2L<=e, true);
- TEST(">=", 1>=d, true);
- TEST("truncate", truncate(1L+d), 1L);
- TEST("truncate", truncate(-d-1L), -1L);
- TEST("round", round(1L+d), 1L);
- TEST("round", round(-d-1L), -1L);
- TEST("round", round(1L-d), 1L);
- TEST("round", round(d-1L), -1L);
- TEST("floor", floor(1L+d), 1L);
- TEST("floor", floor(-d-1L), -2L);
- TEST("ceil", ceil(1L+d), 2L);
- TEST("ceil", ceil(-d-1L), -1L);
- TEST("abs", vnl_math_abs(d), d);
- TEST("abs", vnl_math_abs(b), -b);
- TEST("sqr mag", vnl_math_squared_magnitude(d), vnl_rational(9,49));
- a += b;
- a -= b;
- a *= b;
- a /= b;
- a %= b;
- vcl_cout << vcl_setprecision(20)
- << "a=" << a << "=" << (double)a << vcl_endl
- << "b=" << b << "=" << (double)b << vcl_endl
- << "c=" << c << "=" << (double)c << vcl_endl
- << "d=" << d << "=" << (double)d << vcl_endl
- << "e=" << e << vcl_endl; // (double)d ==> floating exception
- d = -7;
- d = -7L;
- vcl_cout << vcl_endl;
-}
-
-static void test_infinite()
-{
- vnl_rational Inf(1,0); ++Inf;
- TEST("Inf+1", Inf.numerator() == 1 && Inf.denominator() == 0, true);
- Inf = -Inf;
- TEST("-Inf", Inf.numerator() == -1 && Inf.denominator() == 0, true);
- TEST("vnl_math_isfinite", vnl_math_isfinite(Inf), false);
- TEST("vnl_math_isnan", vnl_math_isnan(Inf), false);
-}
-
-static void test_frac()
-{
- vnl_rational r(-15,-20);
- TEST("vnl_math_isfinite", vnl_math_isfinite(r), true);
- TEST("vnl_math_isnan", vnl_math_isnan(r), false);
- TEST("simplify", r.numerator() == 3 && r.denominator() == 4, true);
-}
-
-static void test_approx()
-{
- vnl_rational d ( 1.0/3.0 ); // explicit constructor from double
- TEST("construct from double", d, vnl_rational(1,3));
- d = vnl_rational(-5.0/7);
- TEST("construct from double", d, vnl_rational(-5,7));
- d = vnl_rational(0.42857142857);
- TEST("construct from double", d, vnl_rational(3,7));
- d = vnl_rational(-1.23456);
- TEST("construct from double", d, vnl_rational(-123456,100000));
- vnl_rational pi = vnl_rational(vnl_math::pi);
- double pi_a = double(pi);
- TEST("pi", pi_a-vnl_math::pi < 1e-18 && vnl_math::pi-pi_a < 1e-18, true);
- vcl_cout << "Best rational approximation of pi: " << pi << " = "
- << pi_a << vcl_endl
- << "Compare this with pi in 20 decimals: "
- << vnl_math::pi << vcl_endl;
-}
-
-static void test_determinant()
-{
- vnl_matrix_fixed<vnl_rational,3,3> m;
- m[0][0] = vnl_rational(1,3);
- m[0][1] = vnl_rational(2,7);
- m[0][2] = vnl_rational(2,5);
- m[1][0] = vnl_rational(-1,2);
- m[1][1] = vnl_rational(1,4);
- m[1][2] = vnl_rational(6,7);
- m[2][0] = vnl_rational(2,3);
- m[2][1] = vnl_rational(1,5);
- m[2][2] = vnl_rational(5,2);
- vcl_cout << "rational matrix:\n" << m
- << "determinant = " << vnl_det(m[0], m[1], m[2]) << vcl_endl;
- TEST("determinant", vnl_det(m[0], m[1], m[2]), vnl_rational(16609,29400));
-}
-
-static void test_sqrt()
-{
- vnl_rational d(16,9);
- TEST("sqrt", vnl_sqrt(d), vnl_rational(4,3));
- d = vnl_sqrt(vnl_rational(2L));
- double sqrt2 = vcl_sqrt(2.0), sqrt_2 = double(d);
- vcl_cout << "Best rational approximation of sqrt(2): " << d << " = "
- << sqrt_2 << vcl_endl
- << "Compare this with sqrt(2) in 20 decimals: "
- << sqrt2 << vcl_endl;
- TEST("sqrt(2)", sqrt2-sqrt_2 < 1e-18 && sqrt_2-sqrt2 < 1e-18, true);
-}
-
-static void test_zero_one()
-{
- vnl_rational n = vnl_numeric_traits<vnl_rational>::zero;
- vcl_cout << "zero = " << n << '\n';
- TEST("zero", n, 0L);
- vnl_rational u = vnl_numeric_traits<vnl_rational>::one;
- vcl_cout << "one = " << u << '\n';
- TEST("one", u, 1L);
-}
-
-#ifdef NEED_COMPLEX_RATIONAL // see vnl_complex.h
-static void test_complex()
-{
- vcl_complex<vnl_rational> c(0L,1L);
- vnl_rational cc(-1L);
- TEST("complex square", c*c, cc);
- TEST("complex abs", vnl_math_abs(c), 1);
- TEST("complex sqr mag", vnl_math_squared_magnitude(c), 1);
- TEST("complex vnl_math_isfinite", vnl_math_isfinite(c), true);
- TEST("complex vnl_math_isnan", vnl_math_isnan(c), false);
-}
-
-static void test_complex_zero_one()
-{
- vcl_complex<vnl_rational> n = vnl_numeric_traits<vcl_complex<vnl_rational> >::zero;
- vcl_cout << "zero = " << n << '\n';
- TEST("zero", n, vcl_complex<vnl_rational>(0L,0L));
- vcl_complex<vnl_rational> u = vnl_numeric_traits<vcl_complex<vnl_rational> >::one;
- vcl_cout << "one = " << u << '\n';
- TEST("one", u, vcl_complex<vnl_rational>(1L,0L));
-}
-#endif // NEED_COMPLEX_RATIONAL
-
-void test_rational()
-{
- test_operators();
- test_infinite();
- test_frac();
- test_approx();
- test_determinant();
- test_sqrt();
- test_zero_one();
-#ifdef NEED_COMPLEX_RATIONAL // see vnl_complex.h
- test_complex();
- test_complex_zero_one();
-#endif
-}
-
-TESTMAIN(test_rational);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_real_npolynomial.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_real_npolynomial.cxx
deleted file mode 100644
index 237e343b32ef8ccf1298f41dac23daf73d6aa4b6..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_real_npolynomial.cxx
+++ /dev/null
@@ -1,74 +0,0 @@
-#include <vcl_iostream.h>
-
-#include <testlib/testlib_test.h>
-#include <vnl/vnl_real_npolynomial.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_matrix.h>
-
-void test_real_npolynomial()
-{
- vnl_vector<double> coef_0(3), coef_1(3), coef_2(4);
- for (unsigned int i=0;i<3;++i) coef_0(i)=i+1.0; // f0 = X + 2Y + 3Z
- for (unsigned int i=0;i<3;++i) coef_1(i)=i+1.0; // f1 = X^2 + 2XY^3 + 3
- for (unsigned int i=0;i<4;++i) coef_2(i)=2*i+1.0; // f2 = X^3 + 3X^2Y + 5XY^2 + 7Y^3
-
- vnl_matrix<unsigned int> expo_0(3,3, 0U), expo_1(3,2, 0U), expo_2(4,2, 0U);
- for (unsigned int i=0;i<3;++i) expo_0(i,i)=1;
- expo_1(0,0)=2; expo_1(1,0)=1; expo_1(1,1)=3;
- for (unsigned int i=0;i<4;++i) expo_2(i,1)=expo_2(3-i,0)=i;
-
- vnl_real_npolynomial f0(coef_0,expo_0), f1(coef_1,expo_1), f2(coef_2,expo_2);
-
- vcl_cout << "f0 = " << f0 << "f1 = " << f1 << "f2 = " << f2;
- TEST("f0 has total degree 1", f0.degree(), 1);
- TEST("f0 has maximal degree 1", f0.maxdegree(), 1);
- TEST("f0 has degree 1 in X", f0.degrees()[0], 1);
- TEST("f0 has degree 1 in Y", f0.degrees()[1], 1);
- TEST("f0 has degree 1 in Z", f0.degrees()[2], 1);
-
- TEST("f1 has total degree 4", f1.degree(), 4);
- TEST("f1 has maximal degree 3", f1.maxdegree(), 3);
- TEST("f1 has degree 2 in X", f1.degrees()[0], 2);
- TEST("f1 has degree 3 in Y", f1.degrees()[1], 3);
-
- TEST("f2 has total degree 3", f2.degree(), 3);
- TEST("f2 has maximal degree 3", f2.maxdegree(), 3);
- TEST("f2 has degree 3 in X", f2.degrees()[0], 3);
- TEST("f2 has degree 3 in Y", f2.degrees()[1], 3);
-
- vnl_vector<double> vec3(2); vec3(0)=vec3(1)=2.5;
-
- vnl_real_npolynomial f3 = f1+f2;
- vcl_cout << "f1+f2 = " << f3;
- TEST("f1+f2=f3",f1.eval(vec3)+f2.eval(vec3), f3.eval(vec3));
-
- TEST("f3 has total degree 4", f3.degree(), 4);
- TEST("f3 has maximal degree 3", f3.maxdegree(), 3);
- TEST("f3 has degree 3 in X", f3.degrees()[0], 3);
- TEST("f3 has degree 3 in Y", f3.degrees()[1], 3);
-
- vnl_real_npolynomial f4 = f1-f2;
- vcl_cout << "f1-f2 = " << f4;
- TEST("f1-f2=f4",f1.eval(vec3)-f2.eval(vec3), f4.eval(vec3));
-
- TEST("f4 has total degree 4", f4.degree(), 4);
- TEST("f4 has maximal degree 3", f4.maxdegree(), 3);
- TEST("f4 has degree 3 in X", f4.degrees()[0], 3);
- TEST("f4 has degree 3 in Y", f4.degrees()[1], 3);
-
- vnl_real_npolynomial f5 = f1*f2;
- vcl_cout << "f1*f2 = " << f5;
- TEST("f1*f2=f5",f1.eval(vec3)*f2.eval(vec3), f5.eval(vec3));
-
- TEST("f5 has total degree 7", f5.degree(), 7);
- TEST("f5 has maximal degree 6", f5.maxdegree(), 6);
- TEST("f5 has degree 5 in X", f5.degrees()[0], 5);
- TEST("f5 has degree 6 in Y", f5.degrees()[1], 6);
-
- TEST("f1*f2 has correct total degree",f5.degree(), f1.degree()+f2.degree());
- TEST("f1*f2 has correct maximal degree",f5.maxdegree(), f1.maxdegree()+f2.maxdegree());
- TEST("f1*f2 has correct degree in X",f5.degrees()[0], f1.degrees()[0]+f2.degrees()[0]);
- TEST("f1*f2 has correct degree in Y",f5.degrees()[1], f1.degrees()[1]+f2.degrees()[1]);
-}
-
-TESTMAIN(test_real_npolynomial);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_real_polynomial.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_real_polynomial.cxx
deleted file mode 100644
index 7caba6beb6c1e3914b7a479151225eb54101ccc8..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_real_polynomial.cxx
+++ /dev/null
@@ -1,53 +0,0 @@
-#include <vcl_iostream.h>
-
-#include <testlib/testlib_test.h>
-#include <vnl/vnl_real_polynomial.h>
-#include <vnl/vnl_double_3.h>
-
-void test_real_polynomial()
-{
- vnl_real_polynomial f1(3),f2(4);
-
- for (int i=0;i<=f1.degree();++i) f1[i]=i+1; // f1 = X^2 + 2X + 3
- f1.print(vcl_cout); vcl_cout << vcl_endl;
- for (int i=0;i<=f2.degree();++i) f2[i]=2*i+1; // f2 = X^3 + 3X^2 + 5X + 7
- f2.print(vcl_cout); vcl_cout << vcl_endl;
-
- vnl_real_polynomial f3 = f1+f2;
- f3.print(vcl_cout); vcl_cout << vcl_endl;
- TEST("f1+f2=f3",f1.evaluate(2.5)+f2.evaluate(2.5), f3.evaluate(2.5));
- // Evaluating in 2.5 is exact, since 2.5 is exactly representable (binary 10.1)
-
- vnl_real_polynomial f4 = f1-f2;
- f4.print(vcl_cout); vcl_cout << vcl_endl;
- TEST("f1-f2=f4",f1.evaluate(2.5)-f2.evaluate(2.5), f4.evaluate(2.5));
-
- vnl_real_polynomial f5 = f1*f2;
- f5.print(vcl_cout); vcl_cout << vcl_endl;
-
- TEST("f1*f2 has correct degree",f5.degree()==(f1.degree()+f2.degree()),true);
-
- TEST("f1*f2=f5",f1.evaluate(2.5)*f2.evaluate(2.5), f5.evaluate(2.5));
-
- vnl_real_polynomial f1d = f1.derivative();
- f1d.print(vcl_cout); vcl_cout << vcl_endl;
- vnl_real_polynomial f2d = f2.derivative();
- f2d.print(vcl_cout); vcl_cout << vcl_endl;
-
- TEST("Derivative", f5.derivative(), f1d*f2+f2d*f1);
-
- vnl_real_polynomial f5p = (f1d*f2+f2d*f1).primitive();
- f5p.print(vcl_cout); vcl_cout << vcl_endl;
-
- TEST("Primitive", f5p, f5-f5.evaluate(0.0));
-
- TEST_NEAR("Integral", f1.evaluate_integral(2.0), 70.0/3, 1e-9);
-
- TEST("Polynomial of degree 0", vnl_real_polynomial(1.0).evaluate(0.5),1.0);
- TEST("Vector initialisation",
- vnl_real_polynomial(vnl_double_3(3.0,2.0,1.0)).evaluate(2.0),17.0);
-
- TEST_NEAR("RMS difference(f1,f2)",vnl_rms_difference(f1,f1,0,1),0.0,1e-9);
-}
-
-TESTMAIN(test_real_polynomial);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_resize.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_resize.cxx
deleted file mode 100644
index 74e7e1aad4dca693b5bd89f5d72740b81eaee3f9..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_resize.cxx
+++ /dev/null
@@ -1,47 +0,0 @@
-// This is core/vnl/tests/test_resize.cxx
-#include <testlib/testlib_test.h>
-// \author fsm
-#include <vcl_iostream.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_matrix.h>
-
-static void test_size()
-{
- vnl_vector<double> X(3);
-
- X.fill(2);
- TEST("fill 2", X(0)+X(1)+X(2), 6.0);
- vcl_cout << "X = " << X << vcl_endl;
-
- X.set_size(5);
- TEST("size", X.size(), 5);
-#if 0
- // After resize, old data is lost, so the following test must fail:
- TEST("resize", X(0)+X(1)+X(2)+X(3)+X(4), 6.0);
-#endif
-}
-
-static void test_rows_cols()
-{
- vnl_matrix<double> M(3, 4);
-
- M.fill(2);
- TEST("fill 2", M(0,0)+M(1,1)+M(2,2)+M(2,3), 8.0);
- vcl_cout << "M =\n" << M << vcl_endl;
-
- M.set_size(5,7);
- TEST("size: rows", M.rows(), 5);
- TEST("size: cols", M.cols(), 7);
-#if 0
- // After resize, old data is lost, so the following test must fail:
- TEST("resize", M(0,0)+M(1,1)+M(2,2)+M(3,3)+M(4,4), 6.0);
-#endif
-}
-
-static void test_resize()
-{
- test_size();
- test_rows_cols();
-}
-
-TESTMAIN(test_resize);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_rotation_matrix.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_rotation_matrix.cxx
deleted file mode 100644
index 1146407d7733d498073c6235056746b75d19e1d7..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_rotation_matrix.cxx
+++ /dev/null
@@ -1,160 +0,0 @@
-//:
-// \file
-// \author Kevin de Souza
-// \date 10 January 2007
-// \brief Program to test vnl_rotation_matrix() functions
-
-
-#include <vcl_iostream.h>
-// not used? #include <vcl_iomanip.h>
-#include <vcl_limits.h>
-
-#include <testlib/testlib_test.h>
-
-#include <vnl/vnl_math.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/vnl_rotation_matrix.h>
-#include <vnl/vnl_random.h>
-
-
-//: Tolerance between doubles. This was inferred by trial and error.
-// Could be derived mathematically?
-const double dtol = 4*vcl_numeric_limits<double>::epsilon();
-
-
-//: Local enum to indicate choice of x,y or z-axis.
-enum CartAxis
-{
- x_axis,
- y_axis,
- z_axis
-};
-
-
-//: Random number generator
-vnl_random randgen(9667566);
-
-
-//: Compute the 3x3 rotation matrix corresponding to a single Euler angle rotation
-// (i.e., a rotation of angle phi about one of the Cartesian axes).
-// By convention, a positive angle indicates a clockwise rotation about an
-// axis when viewing the axis from the origin towards the positive direction.
-static void get_rotation_matrix_euler_angle(
- const double phi,
- const CartAxis axis,
- vnl_matrix_fixed<double, 3, 3>& R)
-{
- R.set_identity();
-
- if (vcl_fabs(phi)<vcl_numeric_limits<double>::epsilon())
- return;
-
- double cos_phi = vcl_cos(phi);
- double sin_phi = vcl_sin(phi);
-
- switch (axis)
- {
- case x_axis:
- R[1][1] = cos_phi;
- R[1][2] = -sin_phi;
- R[2][1] = sin_phi;
- R[2][2] = cos_phi;
- break;
-
- case y_axis: // NB This appears different to x and z but I think it's right!
- R[0][0] = cos_phi;
- R[0][2] = sin_phi;
- R[2][0] = -sin_phi;
- R[2][2] = cos_phi;
- break;
-
- case z_axis:
- R[0][0] = cos_phi;
- R[0][1] = -sin_phi;
- R[1][0] = sin_phi;
- R[1][1] = cos_phi;
- break;
-
- default:
- break;
- }
-}
-
-
-//: Test the function vnl_rotation_matrix() for a specified \a axis (inc. angle) and true answer \a M.
-static bool calc_and_test_matrix(const vnl_vector<double>& axis,
- const vnl_matrix_fixed<double,3,3>& M)
-{
- vnl_matrix<double> R = vnl_rotation_matrix(axis);
-
- // Check that rotation matrix is 3x3
- bool success = (3==R.rows() && 3==R.cols());
- if (!success) return false;
-
- vnl_matrix<double> D = R - M;
- double max_err = D.absolute_value_max();
-
- // Check that rotation matrix is correct within a tolerance
- success = success && (max_err<=dtol);
-
-#ifndef NDEBUG
- if (max_err>dtol)
- {
- vcl_cout << "Warning: max_err=" << max_err
- << " eps=" << vcl_numeric_limits<double>::epsilon()
- << vcl_endl;
- }
-#endif
-
- return success;
-}
-
-
-//: Test for the special cases of Euler-angle rotations
-// (i.e. rotations about a single Cartesian axis).
-// Many trials are performed with randomly-chosen rotation angles.
-static void test_euler_rotations()
-{
- bool success = true;
- const unsigned ntrials=100;
- for (unsigned i=0; i<ntrials; ++i)
- {
- bool this_trial_ok = true;
- double ang = randgen.drand32(-4*vnl_math::pi, 4*vnl_math::pi);
-
- vnl_vector<double> axis(3); // The magnitude of this vector indicates the angle of rotation
- vnl_matrix_fixed<double,3,3> M; // True answer
-
- //--- rotations about x-axis ---
- get_rotation_matrix_euler_angle(ang, x_axis, M);
- axis[0]=1.0; axis[1]=0.0; axis[2]=0.0;
- axis *= ang;
- this_trial_ok = this_trial_ok && calc_and_test_matrix(axis, M);
-
- //--- rotations about y-axis ---
- get_rotation_matrix_euler_angle(ang, y_axis, M);
- axis[0]=0.0; axis[1]=1.0; axis[2]=0.0;
- axis *= ang;
- this_trial_ok = this_trial_ok && calc_and_test_matrix(axis, M);
-
- //--- rotations about z-axis ---
- get_rotation_matrix_euler_angle(ang, z_axis, M);
- axis[0]=0.0; axis[1]=0.0; axis[2]=1.0;
- axis *= ang;
- this_trial_ok = this_trial_ok && calc_and_test_matrix(axis, M);
-
- success = success && this_trial_ok;
- }
-
- TEST("test_euler_rotations() for many trials", success, true);
-}
-
-
-void test_rotation_matrix()
-{
- test_euler_rotations();
-}
-
-TESTMAIN(test_rotation_matrix);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_sample.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_sample.cxx
deleted file mode 100644
index 8531e5ae66b79b461f747d8019a9ac9f9daffaa2..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_sample.cxx
+++ /dev/null
@@ -1,44 +0,0 @@
-#include <vcl_iostream.h>
-#include <testlib/testlib_test.h>
-#include <vnl/vnl_math.h>
-#include <vnl/vnl_sample.h>
-#include <vcl_ctime.h>
-
-void test_sample()
-{
- unsigned const N = 100000;
- double mu = 1.552;
- double sigma = 3.729;
- vnl_sample_reseed( static_cast<int>(vcl_time(0))); // for quasi-random initialization
-
- double X[N];
- for (unsigned i=0; i<N; ++i)
- X[i] = vnl_sample_normal(mu, sigma);
-
- // sample mean
- double X_bar = 0;
- for (unsigned i=0; i<N; ++i)
- X_bar += X[i];
- X_bar /= N;
- TEST_NEAR("sample mean", X_bar, mu, 0.1);
-
- // sample standard deviation
- double sigma_bar = 0;
- for (unsigned i=0; i<N; ++i)
- sigma_bar += vnl_math_sqr(X[i] - X_bar);
- sigma_bar = vcl_sqrt(sigma_bar / (N-1));
- TEST_NEAR("sample stddev", sigma_bar, sigma, 0.1);
-
- int seed = static_cast<int>(vcl_time(0));
- vcl_cout << "seed is " << seed << vcl_endl;
- vnl_sample_reseed(seed);
- double nval0 = vnl_sample_normal(0.0, 1.0);
- double uval0 = vnl_sample_uniform(0.0, 1.0);
- vnl_sample_reseed(seed);
- double nval1 = vnl_sample_normal(0.0, 1.0);
- double uval1 = vnl_sample_uniform(0.0, 1.0);
- TEST_NEAR("seed repeat normal", nval0, nval1, 0);
- TEST_NEAR("seed repeat uniform", uval0, uval1, 0);
-}
-
-TESTMAIN(test_sample);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_sym_matrix.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_sym_matrix.cxx
deleted file mode 100644
index 803af718709856933c4fa66a1690660e4f2475c7..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_sym_matrix.cxx
+++ /dev/null
@@ -1,75 +0,0 @@
-// This is core/vnl/tests/test_sym_matrix.cxx
-#include <vcl_iostream.h>
-#include <vnl/vnl_sym_matrix.h>
-#include <testlib/testlib_test.h>
-
-static
-void test_int()
-{
- vcl_cout << "*****************************\n"
- << "Testing Symmetric Matrix<int>\n"
- << "*****************************\n";
- vnl_sym_matrix<int> sm1(2);
- TEST("\n\nvnl_sym_matrix<int> m1(2)", (sm1.rows()==2 && sm1.columns()==2), true);
- vnl_sym_matrix<int> sm2(2,2);
- TEST("\n\nvnl_sym_matrix<int> sm2(2,2)",
- (sm2(0,0)==2 && sm2(0,1)==2 && sm2(1,0)==2 && sm2(1,1)==2), true);
- const vnl_matrix<int> ma1(2, 2, 3);
- const vnl_sym_matrix<int> sm3(ma1);
- TEST("\n\n(const vnl_sym_matrix) sm3",
- (sm3(0,0)==3 && sm3(0,1)==3 && sm3(1,0)==3 && sm3(1,1)==3), true);
- vcl_cout << "sm3\n" << sm3 <<vcl_endl << vcl_endl;
-
- int td[] = {1, 2, 3};
- vnl_sym_matrix<int> sm4(td, 2);
- vcl_cout << "sm4\n" << sm4 << vcl_endl << vcl_endl;
- vnl_matrix<int> ma2 = sm4.as_matrix();
- TEST("(const vnl_matrix) ma2",
- (ma2(0,0)==1 && ma2(0,1)==2 && ma2(1,0)==2 && ma2(1,1)==3), true);
- vcl_cout << "ma2\n" << ma2 << vcl_endl << vcl_endl;
- TEST("operator== ", ma2==sm4 && !(ma2==sm3), true);
- vcl_cout << "sm3\n" << sm3 << vcl_endl << vcl_endl;
-
- int td5[] = {0, 0, 0};
- vnl_sym_matrix<int> sm5(td5, 2);
- swap(sm5, sm4);
- TEST("swap",
- (sm4(0,0)==0 && sm4(0,1)==0 && sm4(1,0)==0 && sm4(1,1)==0) &&
- (sm5(0,0)==1 && sm5(0,1)==2 && sm5(1,0)==2 && sm5(1,1)==3), true);
-
- vnl_sym_matrix<int> sm6(3, 0);
- sm6.update(sm5,1);
- TEST("update",
- (sm6(0,0)==0 && sm6(0,1)==0 && sm6(0,2)==0 &&
- sm6(1,0)==0 && sm6(1,1)==1 && sm6(1,2)==2 &&
- sm6(2,0)==0 && sm6(2,1)==2 && sm6(2,2)==3), true);
- vcl_cout << "sm6\n" << sm6 << vcl_endl << vcl_endl;
-
- sm5 = sm6;
- TEST("operator =",
- (sm5(0,0)==0 && sm5(0,1)==0 && sm5(0,2)==0 &&
- sm5(1,0)==0 && sm5(1,1)==1 && sm5(1,2)==2 &&
- sm5(2,0)==0 && sm5(2,1)==2 && sm5(2,2)==3), true);
- vcl_cout << "sm5\n" << sm5 << vcl_endl << vcl_endl;
-
- TEST("operator ==",
- (sm5==sm6 && !(sm5==sm4) && !(sm4==sm3)), true);
- vcl_cout << "sm4 sm3\n" << sm4 << vcl_endl << sm3 << vcl_endl << vcl_endl;
-
- vnl_vector<int> v1(2,5);
- sm5.set_half_row(v1, 1);
- TEST("set_half_row",
- (sm5(0,0)==0 && sm5(0,1)==5 && sm5(0,2)==0 &&
- sm5(1,0)==5 && sm5(1,1)==5 && sm5(1,2)==2 &&
- sm5(2,0)==0 && sm5(2,1)==2 && sm5(2,2)==3), true);
- vcl_cout << "sm5\n" << sm5 << vcl_endl << vcl_endl;
-}
-
-
-static
-void test_sym_matrix()
-{
- test_int();
-}
-
-TESTMAIN(test_sym_matrix);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_transpose.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_transpose.cxx
deleted file mode 100644
index 6f9f0064b56979d57c6f468bb4845273006218ca..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_transpose.cxx
+++ /dev/null
@@ -1,31 +0,0 @@
-#include <vcl_iostream.h>
-
-#include <testlib/testlib_test.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_matlab_print.h>
-
-void test_transpose()
-{
- vnl_matrix<double> X(10, 2);
- for (unsigned int i=0; i<X.rows(); ++i)
- for (unsigned int j=0; j<X.cols(); ++j)
- X[i][j] = (i+1)*3 + (j+1)*(j+i);
-
- vnl_matrix<double> old_X(X);
-
- vnl_matlab_print(vcl_cout, X, "X");
-
- X.inplace_transpose();
-
- vnl_matlab_print(vcl_cout, X, "X");
-
- TEST ("X == old_X.transpose()", X == old_X.transpose(), true);
-
- X.inplace_transpose();
-
- vnl_matlab_print(vcl_cout, X, "X");
-
- TEST ("X == old_X", X == old_X, true);
-}
-
-TESTMAIN(test_transpose);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_vector.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_vector.cxx
deleted file mode 100644
index 378e4bf14d53c1c21cadad366ca9cd68bde08827..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_vector.cxx
+++ /dev/null
@@ -1,592 +0,0 @@
-// This is core/vnl/tests/test_vector.cxx
-#include <vcl_iostream.h>
-#include <vcl_sstream.h>
-#include <vnl/vnl_math.h>
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_float_3.h>
-#include <vnl/vnl_float_4.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/vnl_cross.h>
-#include <testlib/testlib_test.h>
-
-void vnl_vector_test_int()
-{
- vcl_cout << "***********************\n"
- << "Testing vnl_vector<int>\n"
- << "***********************\n";
- //// test constructors, accessors
- vnl_vector<int> v0;
- TEST("vnl_vector<int> v0()", v0.size(), 0);
- vnl_vector<int> v1(2);
- TEST("vnl_vector<int> v1(2)", v1.size(), 2);
- vnl_vector<int> v2(2,2);
- TEST("vnl_vector<int> v2(2,2)", (v2.get(0)==2 && v2.get(1)==2), true);
-// TEST("v0.set_compare", (v0.set_compare(int_equal), true), true);
- int vcvalues[] = {1,0};
- vnl_vector<int> vc(2,2,vcvalues);
- TEST("vnl_vector<int> vc(2,2,int[])", (vc(0)==1 && vc(1)==0), true);
- TEST("v1=2", (v1=2, (v1.get(0)==2 && v1.get(1)==2)), true);
- TEST("v1 == v2", (v1 == v2), true);
- TEST("v0 = v2", ((v0 = v2), (v0 == v2)), true);
- TEST("v2.put(1,3)", (v2.put(1,3),v2.get(1)), 3);
- TEST("v2.get(1)", v2.get(1), 3);
- TEST("v0 == v2", (v0 == v2), false);
- TEST("v0 != v2", (v0 != v2), true);
- TEST("(v0 == v2)", (v0 == v2), false);
- TEST("v1.fill(3)", (v1.fill(3), (v1.get(0)==3 && v1.get(1)==3)), true);
- TEST("v2.fill(2)", (v2.fill(2), (v2.get(0)==2 && v2.get(1)==2)), true);
- int v3values [] = {1,2,3};
- vnl_vector<int> v3(3,3,v3values);
- TEST("v3(3,3,{1,2,3})",(v3.get(0)==1 && v3.get(1)==2 && v3.get(2)==3), true);
- vnl_vector<int> v4(v3);
- TEST("vnl_vector<int> v4(v3)", v3, v4);
- TEST("v0=v2", (v0=v2, v0), v2);
-
- //// test additions and subtractions
- TEST("v0=v2+3", ((v0=v2+3), (v0.get(0)==5 && v0.get(1)==5)), true);
- TEST("v0=3+v2", ((v0=3+v2), (v0.get(0)==5 && v0.get(1)==5)), true);
- TEST("v0+=(-3)", (v0+=(-3), (v0.get(0)==2 && v0.get(1)==2)), true);
- TEST("v0-=(-3)", (v0-=(-3), (v0.get(0)==5 && v0.get(1)==5)), true);
- TEST("v0=v2-3", ((v0=v2-3), (v0.get(0)==-1 && v0.get(1)==-1)), true);
- TEST("v0=3-v2", ((v0=3-v2), (v0.get(0)==1 && v0.get(1)==1)), true);
- TEST("v0= -v2", (v0= -v2, (v0.get(0)==-2 && v0.get(1)==-2)), true);
-
- vnl_vector<int> v5(2);
- v0 = v2;
- TEST("v5=v0+v2", ((v5=v0+v2), (v5.get(0)==4 && v5.get(1)==4)), true);
- TEST("v5=v0-v2", ((v5=v0-v2), (v5.get(0)==0 && v5.get(1)==0)), true);
- TEST("v0+=v2", ((v0+=v2), (v0.get(0)==4 && v0.get(1)==4)), true);
- TEST("v0-=v2", ((v0-=v2), (v0.get(0)==2 && v0.get(1)==2)), true);
-
- //// test multiplications and divisions
- TEST("v4=v3*5", ((v4=v3*5), (v4.get(0)==5 && v4.get(1)==10 && v4.get(2)==15)), true);
-
- TEST("v4=5*v3", ((v4=5*v3), (v4.get(0)==5 && v4.get(1)==10 && v4.get(2)==15)), true);
- TEST("v3*=5",((v3*=5), (v3== v4)), true);
- TEST("v4=v3/5", ((v4=v3/5), (v4.get(0)==1 && v4.get(1)==2 && v4.get(2)==3)), true);
- TEST("v3/=5", ((v3/=5), (v3==v4)), true);
-
- //// additional tests
- int vvalues [] = {0,-2,2,0};
- vnl_vector<int> v(4,4,vvalues);
- v0 = v; v1 = v; v2 = v;
- TEST("v(i)", (v(0)==0 && v(1)==-2 && v(2)==2 && v(3)==0), true);
-#if 0
- TEST("v.abs()",
- ((v1 = v.abs()),
- (v1(0)==0 && v1(1)==2 && v1(2)==2 && v1(3)==0)), true);
- TEST("v.sign()",
- ((v1 = v.sign()),
- (v1(0)==0 && v1(1)==-1 && v1(2)==1 && v1(3)==0)), true);
-#endif
- TEST("element_product(v,v)",
- ((v1 = element_product(v,v)),
- (v1(0)==0 && v1(1)==4 && v1(2)==4 && v1(3)==0)), true);
- TEST("element_quotient(v,[2])",
- ((v2 = 2),
- (v1 = element_quotient(v,v2)),
- (v1(0)==0 && v1(1)==-1 && v1(2)==1 && v1(3)==0)), true);
-#if 0
- TEST("v.update(v.abs())",
- ((v1 = v.abs()),
- (v2.update(v1)),
- (v2==v1)), true);
-#endif
- TEST("v.extract(1,3)",
- ((v1 = v.extract(1,3)),
- (v1.size()==1 && v1(0)==v(3))), true);
- TEST("v.update([4],3)",
- ((v1=4),
- (v.update(v1,3)),
- (v(0)==0 && v(1)==-2 && v(2)==2 && v(3)==4)), true);
-
- { // new scope to reuse variables
- int vvalues [] = {1,0,0,0};
- vnl_vector<int> v (4,4,vvalues);
- int v1values [] = {1,0,0};
- int v2values [] = {0,1,0};
- int v3values [] = {0,0,1};
- vnl_vector<int> v1(3,3,v1values);
- vnl_vector<int> v2(3,3,v2values);
- vnl_vector<int> v3(3,3,v3values);
- TEST("dot_product(v1,v2)",
- (dot_product(v1,v2)==0 && dot_product(v1,v3)==0 && dot_product(v2,v3)==0), true);
- TEST("dot_product(v1,v1)",
- (dot_product(v1,v1)==1 && dot_product(v2,v2)==1 && dot_product(v3,v3)==1), true);
- TEST("4d-v=3d-v", ((v = v3), v.size()==3 && v==v3), true);
- TEST("vnl_cross_3d(v1,v2)", vnl_cross_3d(v1,v2), v3);
- TEST("vnl_cross_3d(v2,v3)", vnl_cross_3d(v2,v3), v1);
- TEST("vnl_cross_3d(v1,v3)", vnl_cross_3d(v1,v3), -v2);
- vnl_vector<int> vv(2,0);
- v1 = vv; v1[0]=1;
- v2 = vv; v2[1]=1;
- TEST("vnl_cross_2d(v1,v2)", vnl_cross_2d(v1,v2)==1, true);
- }
-
- {
- int vvalues [] = {1, 2, 3};
- vnl_vector<int> v (3, 3, vvalues);
- vnl_matrix<int> m = outer_product(v, v);
- TEST("outer_product",
- (m(0,0)==1 && m(0,1)==2 && m(0,2)==3 &&
- m(1,0)==2 && m(1,1)==4 && m(1,2)==6 &&
- m(2,0)==3 && m(2,1)==6 && m(2,2)==9), true);
- }
- {
- int vvalues [] = {1,0,0,0};
- vnl_vector<int> v (4,4,vvalues);
- TEST("v.squared_magnitude", (v.squared_magnitude()==1), true);
- TEST("v.magnitude", (v.magnitude()==1), true);
- // normalize not sensible for ints
- //TEST("v.normalize", (v1 = 3 * v, v1.normalize(), v1), v);
- }
-}
-
-
-bool float_equal(const float& f1, const float& f2)
-{
- return vcl_fabs(f1 - f2) < 1.0e-6;
-}
-
-void vnl_vector_test_float()
-{
- vcl_cout << "*************************\n"
- << "Testing vnl_vector<float>\n"
- << "*************************\n";
- //// test constructors, accessors
- vnl_vector<float> v0;
- TEST("vnl_vector<float> v0()", v0.size(), 0);
- vnl_vector<float> v1(2);
- TEST("vnl_vector<float> v1(2)", v1.size(), 2);
- vnl_vector<float> v2(2,2);
- TEST("vnl_vector<float> v2(2,2)", (v2.get(0)==2 && v2.get(1)==2), true);
-#if 0
- TEST("v0.set_compare", (v0.set_compare(float_equal), true), true);
-#endif
-
- float vcvalues[2] = {1};
- vnl_vector<float> vc(2,2,vcvalues);
- TEST("vnl_vector<float> vc(2,2,float[])", (vc(0)==1 && vc(1)==0), true);
- TEST("v1=2", (v1=2, (v1.get(0)==2 && v1.get(1)==2)), true);
- TEST("v1 == v2", (v1 == v2), true);
- TEST("v0 = v2", ((v0 = v2), (v0 == v2)), true);
- TEST("v2.put(1,3)", (v2.put(1,3),v2.get(1)), 3);
- TEST("v2.get(1)", v2.get(1), 3);
- TEST("v0 == v2", (v0 == v2), false);
- TEST("v0 != v2", (v0 != v2), true);
- TEST("(v0 == v2)", (v0 == v2), false);
- TEST("v1.fill(3)", (v1.fill(3), (v1.get(0)==3 && v1.get(1)==3)), true);
- TEST("v2.fill(2)", (v2.fill(2), (v2.get(0)==2 && v2.get(1)==2)), true);
- vnl_vector<float> v3 = vnl_float_3(1.f,2.f,3.f).as_vector();
- TEST("v3(3)",(v3.get(0)==1 && v3.get(1)==2 && v3.get(2)==3), true);
- vnl_vector<float> v4(v3);
- TEST("vnl_vector<float> v4(v3)", v3, v4);
- TEST("v0=v2", (v0=v2, (v0==v2)), true);
- vcl_cout << &v0 << " == " << v0 << vcl_endl;
- TEST("<<", 1, 1);
-
- //// test additions and subtractions
- TEST("v0=v2+3", ((v0=v2+3), (v0.get(0)==5 && v0.get(1)==5)), true);
- TEST("v0=3+v2", ((v0=3.0f+v2), (v0.get(0)==5 && v0.get(1)==5)), true);
- TEST("v0+=(-3)", (v0+=(-3), (v0.get(0)==2 && v0.get(1)==2)), true);
- TEST("v0-=(-3)", (v0-=(-3), (v0.get(0)==5 && v0.get(1)==5)), true);
- TEST("v0=v2-3", ((v0=v2-3), (v0.get(0)==-1 && v0.get(1)==-1)), true);
- TEST("v0=3-v2", ((v0=3.0f-v2), (v0.get(0)==1 && v0.get(1)==1)), true);
- TEST("v0= -v2", (v0= -v2, (v0.get(0)==-2 && v0.get(1)==-2)), true);
-
- vnl_vector<float> v5(2);
- v0 = v2;
- TEST("v5=v0+v2", ((v5=v0+v2), (v5.get(0)==4 && v5.get(1)==4)), true);
- TEST("v5=v0-v2", ((v5=v0-v2), (v5.get(0)==0 && v5.get(1)==0)), true);
- TEST("v0+=v2", ((v0+=v2), (v0.get(0)==4 && v0.get(1)==4)), true);
- TEST("v0-=v2", ((v0-=v2), (v0.get(0)==2 && v0.get(1)==2)), true);
-
- //// test multiplications and divisions
- TEST("v4=v3*5", ((v4=v3*5), (v4.get(0)==5 && v4.get(1)==10 && v4.get(2)==15)), true);
-
- TEST("v4=5*v3", ((v4=5.0f*v3), (v4.get(0)==5 && v4.get(1)==10 && v4.get(2)==15)), true);
- TEST("v3*=5",((v3*=5), (v3== v4)), true);
- TEST("v4=v3/5", ((v4=v3/5), (v4.get(0)==1 && v4.get(1)==2 && v4.get(2)==3)), true);
- TEST("v3/=5", ((v3/=5), (v3==v4)), true);
-
- //// additional tests
-// vnl_vector<float> v(4,4,0,-2,2,0); no var args with floats
- float vvalues [] = {0,-2,2,0};
- vnl_vector<float> v(4,4,vvalues);
- v[0] = 0;
- v[1] = -2;
- v[2] = 2;
- v[3] = 0;
- v0 = v; v1 = v; v2 = v;
- TEST("v(i)", (v(0)==0 && v(1)==-2 && v(2)==2 && v(3)==0), true);
-#if 0
- TEST("v.abs()",
- ((v1 = v.abs()),
- (v1(0)==0 && v1(1)==2 && v1(2)==2 && v1(3)==0)), true);
- TEST("v.sign()",
- ((v1 = v.sign()),
- (v1(0)==0 && v1(1)==-1 && v1(2)==1 && v1(3)==0)), true);
-#endif
- TEST("element_product(v,v)",
- ((v1 = element_product(v,v)),
- (v1(0)==0 && v1(1)==4 && v1(2)==4 && v1(3)==0)), true);
- TEST("element_quotient(v,[2])",
- ((v2 = 2),
- (v1 = element_quotient(v,v2)),
- (v1(0)==0 && v1(1)==-1 && v1(2)==1 && v1(3)==0)), true);
-#if 0
- TEST("v.update(v.abs())",
- ((v1 = v.abs()),
- (v2.update(v1)),
- (v2==v1)), true);
-#endif
- TEST("v.extract(1,3)",
- ((v1 = v.extract(1,3)),
- (v1.size()==1 && v1(0)==v(3))), true);
- TEST("v.update([4],3)",
- ((v1=4),
- (v.update(v1,3)),
- (v(0)==0 && v(1)==-2 && v(2)==2 && v(3)==4)), true);
-
- { // new scope to reuse variables
- float vvalues [] = {1,0,0,0};
- vnl_vector<float> v (4,4,vvalues);
- v[0] = 1;
- v[1] = 0;
- v[2] = 0;
- v[3] = 0;
- TEST("v(i)",
- (v(0)==v[0] && v[0]==1 &&
- v(1)==v[1] && v[1]==0 &&
- v(2)==v[2] && v[2]==0 &&
- v(3)==v[3] && v[3]==0), true);
- vnl_vector<float> v1(3,0.f); v1[0] = 1.f;
- vnl_vector<float> v2(3,0.f); v2[1] = 1.f;
- vnl_vector<float> v3(3,0.f); v3[2] = 1.f;
- TEST("dot_product(v1,v2)",
- (dot_product(v1,v2)==0 && dot_product(v1,v3)==0 && dot_product(v2,v3)==0), true);
- TEST("4d-v=3d-v", ((v = v3), v.size()==3 && v==v3), true);
- TEST("vnl_cross_3d(v1,v2)", vnl_cross_3d(v1,v2), v3);
- TEST("vnl_cross_3d(v2,v3)", vnl_cross_3d(v2,v3), v1);
- TEST("vnl_cross_3d(v1,v3)", vnl_cross_3d(v1,v3), -v2);
- vnl_vector<float> vv(2,0);
- v1 = vv; v1[0]=1;
- v2 = vv; v2[1]=1;
- TEST("vnl_cross_2d(v1,v2)", vnl_cross_2d(v1,v2), 1);
- }
-
- {
- vnl_float_3 v(1.f,2.f,3.f);
- vnl_float_4 v2(1.f,2.f,3.f,4.f);
- vnl_matrix_fixed<float,3,4> m = outer_product(v, v2);
- TEST("outer_product -> fixed 3 x fixed 4",
- (m(0,0)==1 && m(0,1)==2 && m(0,2)==3 && m(0,3) == 4 &&
- m(1,0)==2 && m(1,1)==4 && m(1,2)==6 && m(1,3) == 8 &&
- m(2,0)==3 && m(2,1)==6 && m(2,2)==9 && m(2,3) == 12), true);
- }
- {
- vnl_float_3 v(1.f,2.f,3.f);
- TEST("vnl_float_3 v(1.f,2.f,3.f)", v.size(), 3);
- v[0] = 1.f; v[1] = 2.f; v[2] = 3.f;
- TEST("v[0]=1 and v[0]", v[0], 1);
- TEST("v[1]=2 and v[1]", v[1], 2);
- TEST("v[2]=3 and v[2]", v[2], 3);
- vnl_vector<float> v1(3, 0.f); v1[0]=1.f;
- vcl_cout << "v1 = " << v1 << vcl_endl;
- vnl_vector<float> v2(3, 0.f); v2[1]=1.f;
- vcl_cout << "v2 = " << v2 << vcl_endl;
- vnl_vector<float> v3(3, 0.f); v3[0]=-0.5f; v3[2]=0.5f;
- vcl_cout << "v3 = " << v3 << vcl_endl
- << "v1 - v2 = " << v1 - v2 << vcl_endl;
- double ang = angle(v1,v2);
- vcl_cout << "angle(v1,v2) = " << ang << vcl_endl;
- ang *= 180*vnl_math::one_over_pi;
- vcl_cout << "angle(v1,v2) in degrees = " << ang << vcl_endl
- << "v1.size()=" << v1.size() << vcl_endl
- << "v2.size()=" << v2.size() << vcl_endl
- << "vnl_cross_2d(v1,v2) = " << vnl_cross_2d(v1,v2) << vcl_endl
- << "vnl_cross_3d(v1,v2) = " << vnl_cross_3d(v1,v2) << vcl_endl;
- TEST_NEAR("angle(v1,v2)", ang, 90.0, 1e-15);
- double ang2 = angle(v1,v3);
- vcl_cout << "angle(v1,v3) = " << ang << vcl_endl;
- ang2 *= 180*vnl_math::one_over_pi;
- vcl_cout << "angle(v1,v3) in degrees = " << ang2 << vcl_endl;
- TEST_NEAR("angle(v1,v3)", ang2, 135.0, 1e-6);
-#if 0
- TEST("squared_distance_2d", squared_distance_2d(v1,v2), 2);
- TEST("squared_distance_3d", squared_distance_3d(v1,v2), 2);
-#endif
- TEST_NEAR("mean", vnl_c_vector<float>::mean(v.begin(), v.size()), 2.0, 1e-6);
- TEST_NEAR("std", vnl_c_vector<float>::std(v.begin(), v.size()), 1.0, 1e-6);
- }
-
- {
- double vvalues [] = {1,0,0,0};
- vnl_vector<double> vd (4);
- vnl_vector<double> v (4,4,vvalues);
- v[0] = 1;
- v[1] = 0;
- v[2] = 0;
- v[3] = 0;
- TEST("v.squared_magnitude", v.squared_magnitude(), 1);
- TEST("v.magnitude", v.magnitude(), 1);
-// Trying to track down test failure in Intel 10.0 compiler
- vd = 4.0 * v;
- vcl_cout << "vd.normalize() is " << vd.normalize() << " and v is " << v << "\n" << vcl_flush;
- vcl_cout << "vd.normalize() - v is " << vd.normalize() - v << "\n" << vcl_flush;
- TEST("v.normalize", (vd = 4.0 * v, vd.normalize(), vd), v);
- }
-
- TEST("vnl_vector_ssd",
- vnl_vector_ssd(vnl_vector<float>(4, 0.0f), vnl_vector<float>(4, 1.0f)),
- 4.0);
-}
-
-void vnl_vector_test_matrix()
-{
- int mvalues[] = {1,2,3,
- 4,5,6}; // product with matrices
- vnl_matrix<int> m(2,3,6, mvalues);
-
- int v2values [] = {1,0};
- int v3values [] = {1,0,0};
- vnl_vector<int> v, v2(2,2,v2values), v3(3,3,v3values);
- TEST("v.pre_multiply(m)",
- ((v = v3),
- (v.pre_multiply(m)),
- (v.size()==2 && v(0)==1 && v(1)==4)), true);
- TEST("v.post_multiply(m)",
- ((v = v2),
- (v.post_multiply(m)),
- (v.size()==3 && v(0)==1 && v(1)==2 && v(2)==3)), true);
- TEST("v*=m",
- ((v = v2),
- (v *= m),
- (v.size()==3 && v(0)==1 && v(1)==2 && v(2)==3)), true);
- TEST("v2*m",
- ((v = v2 * m),
- (v.size()==3 && v(0)==1 && v(1)==2 && v(2)==3)), true);
- TEST("m*v3",
- ((v = m * v3),
- (v.size()==2 && v(0)==1 && v(1)==4)), true);
-}
-
-void vnl_vector_test_conversion()
-{
- bool check;
- {
- // convert from a vnl_vector to a block array:
- int v1values[] = {1,2,3, 4,5,6, 7,8,9, 10,11,12};
- vnl_vector<int> v1 (12, 12, v1values);
- const int* data = v1.data_block();
- {
- check = true;
- for (int d = 0; d < 12; d++)
- if (data[d] != d+1)
- check = false;
- }
- TEST("(const int*) m.data_block", check, true);
-
- typedef int block [12];
- const block& v2 = *((const block*) data);
- {
- check = true;
- for (int i = 0; i < 12; i++)
- if (v1(i) != v2[i])
- check = false;
- }
- TEST("matrix(i)==block[i]", check, true);
-
- // convert from a block array to a vnl_vector:
- block b1;
- for (int i = 0; i < 12; i++)
- b1[i] = i;
- data = ((const int*) b1);
- {
- check = true;
- for (int d = 0; d < 12; d++)
- if (data[d] != d)
- check = false;
- }
- TEST("(const int*) block", check, true);
- vnl_vector<int> b2(data, 12);
- {
- check = true;
- for (int i = 0; i < 12; i++)
- if (b1[i] != b2(i))
- check = false;
- }
- TEST("block[i]==matrix(i)", check, true);
- }
-#if 0
- {
- // convert from a vnl_vector to a block array:
- vnl_vector<double> v1 (12, 12,
- 1.0,2.0,3.0, 4.0,5.0,6.0,
- 7.0,8.0,9.0, 10.0,11.0,12.0);
- const double* data = v1.data_block();
- {
- check = true;
- for (int d = 0; d < 12; d++)
- if (data[d] != d+1)
- check = false;
- }
- TEST("(const double*) m.data_block", check, true);
-
- typedef double block [12];
- block& v2 = *((block*) data);
- {
- check = true;
- for (int i = 0; i < 12; i++)
- if (v1(i) != v2[i])
- check = false;
- }
- TEST("matrix(i)==block[i]", check, true);
-
- // convert from a block array to a vnl_vector:
- block b1;
- for (int i = 0; i < 12; i++)
- b1[i] = i;
- data = ((const double*) b1); // & in ((const double*) &b1)
- { // is not needed
- check = true;
- for (int d = 0; d < 12; d++)
- if (data[d] != d)
- check = false;
- }
- TEST("(const double*) block", check, true);
- vnl_vector<double> b2(data, 12);
- {
- check = true;
- for (int i = 0; i < 12; i++)
- if (b1[i] != b2(i))
- check = false;
- }
- TEST("block[i]==matrix(i)", check, true);
- }
-#endif
-}
-
-static void vnl_vector_test_io()
-{
- {
- vcl_stringstream ss;
- ss << "";
- vnl_vector<double> p;
- ss >> p;
- TEST("number of values read from stream, empty", p.size(), 0);
- }
- {
- vcl_stringstream ss;
- ss << " \n ";
- vnl_vector<double> p;
- ss >> p;
- TEST("number of values read from stream, just WS", p.size(), 0);
- }
- {
- vcl_stringstream ss;
- ss << "1 2 3.0";
- vnl_vector<double> p;
- ss >> p;
- TEST("number of values read from stream, no newline", p.size(), 3);
- }
- {
- vcl_stringstream ss;
- ss << "1 2 3.0\n";
- vnl_vector<double> p;
- ss >> p;
- TEST("number of values read from stream, newline", p.size(), 3);
- }
- {
- vcl_stringstream ss;
- ss << "1 2 3.0\n ";
- vnl_vector<double> p;
- ss >> p;
- TEST("number of values read from stream, newline + WS", p.size(), 3);
- }
-}
-
-#ifndef TIMING
-#define TIMING 0
-#endif
-
-#if TIMING
-#include <vul/vul_timer.h>
-void vnl_vector_test_two_nrm2_timing(unsigned size, unsigned long num)
-{
- vnl_vector<double> a(size);
- for (unsigned i= 0; i < size; i++)
- a(i) = i / size;
-
- double c=0;
- vul_timer t;
- for (unsigned i = 0; i <num;i++)
- c+= vnl_c_vector<double>::two_nrm2(a.begin(), size);
- double time = t.real();
- vcl_cout <<" Time for finding the two_nrm2 of " << size
- <<"-D vectors " << num << "times = " << time / 1000.0 << "s.\n";
-}
-
-void vnl_vector_test_euclid_dist_sq_timing(unsigned size, unsigned long num)
-{
- vnl_vector<double> a(size);
- vnl_vector<double> b(size);
- for (unsigned i= 0; i < size; i++)
- {
- a(i) = i / size;
- b(i) = i * i / size;
- }
-
- double c=0;
- vul_timer t;
- for (unsigned i = 0; i <num;i++)
- c+= vnl_c_vector<double>::euclid_dist_sq(a.begin(), b.begin(), size);
- double time = t.real();
- vcl_cout <<" Time for finding the euclid_dist_sq of " << size
- <<"-D vectors " << num << "times = " << time / 1000.0 << "s.\n";
-}
-
-void vnl_vector_test_timing()
-{
- vnl_vector_test_two_nrm2_timing(20000,20000ul);
- vnl_vector_test_two_nrm2_timing(1000,400000ul);
- vnl_vector_test_two_nrm2_timing(100,4000000ul);
- vnl_vector_test_two_nrm2_timing(4,100000000ul);
- vnl_vector_test_euclid_dist_sq_timing(40000,10000ul);
- vnl_vector_test_euclid_dist_sq_timing(1000,400000ul);
- vnl_vector_test_euclid_dist_sq_timing(100,4000000ul);
- vnl_vector_test_euclid_dist_sq_timing(4,100000000ul);
-}
-#endif
-
-void vnl_vector_test_leak() // use top4.1 to watch for memory.
-{ // remember to kill process.
- while (true) {
- vnl_vector_test_int();
- vnl_vector_test_matrix();
- vnl_vector_test_conversion();
- }
-}
-
-#ifndef LEAK
-#define LEAK 0
-#endif
-
-void test_vector()
-{
- vnl_vector_test_int();
- vnl_vector_test_float();
- vnl_vector_test_matrix();
- vnl_vector_test_conversion();
- vnl_vector_test_io();
-#if TIMING
- vnl_vector_test_timing();
-#endif
-#if LEAK
- vnl_vector_test_leak();
-#endif
-}
-
-
-TESTMAIN(test_vector);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_vector_fixed_ref.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_vector_fixed_ref.cxx
deleted file mode 100644
index b1489e32cc04052f230ef45a231effa0e3a112aa..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/core/vnl/tests/test_vector_fixed_ref.cxx
+++ /dev/null
@@ -1,118 +0,0 @@
-// This is core/vnl/tests/test_vector_fixed_ref.cxx
-#include <vnl/vnl_vector_fixed.h>
-#include <vnl/vnl_vector_fixed_ref.h>
-
-#include <vcl_algorithm.h> // for vcl_generate()
-#include <vcl_cstdlib.h> // for vcl_rand()
-#include <testlib/testlib_test.h>
-
-void test_vector_fixed_ref()
-{
- enum{size = 4};
- typedef vnl_vector_fixed<double,size> vf;
- typedef vnl_vector_fixed_ref<double,size> vfr;
- typedef vnl_vector_fixed_ref_const<double,size> vfrc;
-
- int i;
- vf vec; // copy in
- for (i=0;i<size;++i)
- {
- vec(i) = i;
- }
-
- // vector fixed_ref tests
-
-
- // fixed_ref_const
- const vf & cvf = vec;
- vfrc cref(cvf);
- // check address
- for (i=0;i<size;++i)
- {
- TEST("const_address",&cref(i),&vec(i));
- }
-
-
- // fixed_ref (non-const)
- // wrap around vec
- vfr ref(vec);
- // check address
- for (i=0;i<size;++i)
- {
- TEST("nonconst_address",&ref(i),&vec(i));
- }
-
-
- // assign from vec
- vf other;
- vcl_generate(other.begin(),other.end(),vcl_rand);
-#if 0 // assignment is ambiguous
- ref = other;
- TEST("assign_vf", ref, other);
- // test different adresses
- TEST("assign_vf address", (ref.begin() != other.begin()), true);
-#endif // 0
-
- {
- // assign from const vfr
- vcl_generate(other.begin(),other.end(),vcl_rand);
- vfrc cref(other);
- ref = cref;
- TEST("assign_const_ref", ref, other);
- // test different adresses
- TEST("assign_const_ref address", (ref.begin() != other.begin()), true);
- }
-
- {
-#if 0 // cannot assign to a vnl_vector_fixed_ref_const
- // assign from vfr
- vcl_generate(other.begin(),other.end(),vcl_rand);
- vfr ref2(other);
- ref = ref2;
- TEST("assign_ref", ref, other);
- // test different adresses
- TEST("assign_ref address", (ref.begin() != other.begin()), true);
-#endif // 0
- }
-
- // arithmetic
- {
- // plus
- vf a,b;
- vcl_generate(a.begin(),a.end(),vcl_rand);
- vcl_generate(b.begin(),b.end(),vcl_rand);
- vfrc arefc(a), brefc(b);
- vf mc = arefc + brefc;
-
- vfr aref(a), bref(b);
- vf m = aref + bref;
-
- vf m2 = arefc + bref;
- vf m3 = arefc + brefc;
- TEST("plus", mc, m);
- TEST("plus", mc, m2);
- TEST("plus", mc, m3);
- }
- {
- // times
- vf a,b;
- vcl_generate(a.begin(),a.end(),vcl_rand);
- vcl_generate(b.begin(),b.end(),vcl_rand);
- vfrc arefc(a), brefc(b);
- vf mc = arefc + brefc;
-
- vfr aref(a), bref(b);
- vf m = aref + bref;
-
- vf m2 = arefc + bref;
- vf m3 = arefc + brefc;
- TEST("plus", mc, m);
- TEST("plus", mc, m2);
- TEST("plus", mc, m3);
-
- aref.is_zero();
- arefc.is_zero();
- }
-}
-
-TESTMAIN(test_vector_fixed_ref)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_alloc.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_alloc.cxx
index 3efbab2fa110dfba45315077c6ff31f1c4a7590b..c5a65e43f6a7b402a4dbf38b2f57eb1791bdb4b7 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_alloc.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_alloc.cxx
@@ -43,7 +43,7 @@ vnl_alloc::chunk_alloc(vcl_size_t size, int& nobjs)
// Try to make do with what we have. That can't
// hurt. We do not try smaller requests, since that tends
// to result in disaster on multi-process machines.
- for (unsigned int i = size; i <= VNL_ALLOC_MAX_BYTES; i += VNL_ALLOC_ALIGN)
+ for (vcl_size_t i = size; i <= VNL_ALLOC_MAX_BYTES; i += VNL_ALLOC_ALIGN)
{
my_free_list = free_list + FREELIST_INDEX(i);
p = *my_free_list;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_analytic_integrant.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_analytic_integrant.h
index 3f43606834b530c7d95630d232705e9e621c5427..4264bcc477d771a4799ad733c832ecdf16d5a6ee 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_analytic_integrant.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_analytic_integrant.h
@@ -1,20 +1,19 @@
-#ifndef VNL_ANALYTIC_INTEGRANT
-#define VNL_ANALYTIC_INTEGRANT
-
+#ifndef VNL_ANALYTIC_INTEGRANT_
+#define VNL_ANALYTIC_INTEGRANT_
// :
// \author Kongbin Kang
// \date Jan 13, 2005
-// \brief a class to represent an analytic integrant
+// \brief a class to represent an analytic integrand
#include "vnl_integrant_fnct.h"
-class vnl_analytic_integrant : public vnl_integrant_fnct
+class vnl_analytic_integrant : public vnl_integrant_fnct
{
public:
vnl_analytic_integrant() {}
~vnl_analytic_integrant() {}
- // the function every derived class has to implement, which is evalutate
+ // the function every derived class has to implement, which is to evaluate
// the function value at point x
virtual double f_(double /*x*/) = 0;
};
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_beta.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_beta.h
new file mode 100644
index 0000000000000000000000000000000000000000..6c21bf188464114611010f895e5f926ea5816bd5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_beta.h
@@ -0,0 +1,28 @@
+// This is core/vnl/vnl_beta.h
+#ifndef vnl_beta_h_
+#define vnl_beta_h_
+//:
+// \file
+// \brief implementation of the beta function, also called the Euler integral of the first kind
+// \author Gamze Tunali
+
+#include "vnl_gamma.h"
+
+#if 1 // implementation via vnl_log_gamma
+//: Computation of beta function in terms of gamma function.
+// Actually, this implementation refers to vnl_log_gamma,
+// since this involves just a single call to std::exp instead of three.
+template <class T>
+inline double vnl_beta(T x, T y) {return vcl_exp(vnl_log_gamma(x)+vnl_log_gamma(y)-vnl_log_gamma(x+y)); }
+#else // implementation via vnl_gamma; less efficient since it needs 3x vcl_exp
+//: Computation of beta function in terms of gamma function.
+template <class T>
+inline double vnl_beta(T x, T y) {return (vnl_gamma(x)*vnl_gamma(y))/vnl_gamma(x+y); }
+#endif
+
+//: Computation of the log beta function in terms of the log gamma function.
+// vnl_log_beta is just the std::log (natural logarithm) of the beta function.
+template <class T>
+inline double vnl_log_beta(T x, T y) {return vnl_log_gamma(x)+vnl_log_gamma(y)-vnl_log_gamma(x+y); }
+
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_bignum.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_bignum.cxx
index 7a35d9a207bb62dd88dae74533ede2babce74369..1373ff7dbd9b99e733d961ec805c22c264fb8c9c 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_bignum.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_bignum.cxx
@@ -3,7 +3,6 @@
//:
// \file
-#include <vcl_cctype.h> // Include character macros
#include <vcl_cstdlib.h> // for vcl_atol
#include <vcl_cstring.h> // for vcl_strlen
#include <vcl_cmath.h> // for vcl_fmod
@@ -19,14 +18,14 @@ typedef unsigned short Data;
//: Creates a zero vnl_bignum.
-vnl_bignum::vnl_bignum ()
+vnl_bignum::vnl_bignum()
: count(0), sign(1), data(0)
{
}
//: Creates a vnl_bignum from a long integer.
-vnl_bignum::vnl_bignum (long l)
+vnl_bignum::vnl_bignum(long l)
: count(0), sign(1), data(0)
{
if (l < 0) { // Get correct sign
@@ -50,10 +49,10 @@ vnl_bignum::vnl_bignum (long l)
//: Creates a vnl_bignum from an integer.
-vnl_bignum::vnl_bignum (int l)
+vnl_bignum::vnl_bignum(int l)
: count(0), sign(1), data(0)
{
- if (l < 0) { // Get correct sign
+ if (l < 0) { // Get correct sign
l = -l; // Get absolute value of l
this->sign = -1;
}
@@ -62,7 +61,7 @@ vnl_bignum::vnl_bignum (int l)
while (l) { // While more bits in l
assert(i < sizeof(l)); // no more buffer space
buf[i] = Data(l); // Peel off lower order bits
- l >>= 16; // Shift next bits into place
+ l >>= 16; // Shift next bits into place
i++;
}
if (i > 0)
@@ -74,7 +73,7 @@ vnl_bignum::vnl_bignum (int l)
//: Creates a vnl_bignum from an unsigned long integer.
-vnl_bignum::vnl_bignum (unsigned long l)
+vnl_bignum::vnl_bignum(unsigned long l)
: count(0), sign(1), data(0)
{
Data buf[sizeof(l)]; // Temp buffer to store l in
@@ -94,7 +93,7 @@ vnl_bignum::vnl_bignum (unsigned long l)
//: Creates a vnl_bignum from an unsigned integer.
-vnl_bignum::vnl_bignum (unsigned int l)
+vnl_bignum::vnl_bignum(unsigned int l)
: count(0), sign(1), data(0)
{
Data buf[sizeof(l)]; // Temp buffer to store l in
@@ -114,7 +113,7 @@ vnl_bignum::vnl_bignum (unsigned int l)
//: Creates a vnl_bignum from a single-precision floating point number.
-vnl_bignum::vnl_bignum (float f)
+vnl_bignum::vnl_bignum(float f)
: count(0), sign(1), data(0)
{
double d = f;
@@ -129,7 +128,8 @@ vnl_bignum::vnl_bignum (float f)
this->count = 1;
this->data = new Data[1];
this->data[0] = 0;
- } else if (d >= 1.0) {
+ }
+ else if (d >= 1.0) {
// Note: 0x10000L == 1 >> 16: the (assumed) size of unsigned short is 16 bits.
vcl_vector<Data> buf;
while (d >= 1.0) {
@@ -138,14 +138,14 @@ vnl_bignum::vnl_bignum (float f)
}
// Allocate and copy into permanent buffer
this->data = buf.size()>0 ? new Data[buf.size()] : 0;
- this->count = buf.size();
+ this->count = (unsigned short)(buf.size());
vcl_copy( buf.begin(), buf.end(), data );
}
}
//: Creates a vnl_bignum from a double floating point number.
-vnl_bignum::vnl_bignum (double d)
+vnl_bignum::vnl_bignum(double d)
: count(0), sign(1), data(0)
{
if (d < 0.0) { // Get sign of d
@@ -159,7 +159,8 @@ vnl_bignum::vnl_bignum (double d)
this->count = 1;
this->data = new Data[1];
this->data[0] = 0;
- } else if (d >= 1.0) {
+ }
+ else if (d >= 1.0) {
// Note: 0x10000L == 1 >> 16: the (assumed) size of unsigned short is 16 bits.
vcl_vector<Data> buf;
while (d >= 1.0) {
@@ -168,14 +169,14 @@ vnl_bignum::vnl_bignum (double d)
}
// Allocate and copy into permanent buffer
this->data = buf.size()>0 ? new Data[buf.size()] : 0;
- this->count = buf.size();
+ this->count = (unsigned short)(buf.size());
vcl_copy( buf.begin(), buf.end(), data );
}
}
//: Creates a vnl_bignum from a "long double" floating point number.
-vnl_bignum::vnl_bignum (long double d)
+vnl_bignum::vnl_bignum(long double d)
: count(0), sign(1), data(0)
{
if (d < 0.0) { // Get sign of d
@@ -189,7 +190,8 @@ vnl_bignum::vnl_bignum (long double d)
this->count = 1;
this->data = new Data[1];
this->data[0] = 0;
- } else if (d >= 1.0) {
+ }
+ else if (d >= 1.0) {
// Note: 0x10000L == 1 >> 16: the (assumed) size of unsigned short is 16 bits.
vcl_vector<Data> buf;
while (d >= 1.0) {
@@ -198,7 +200,7 @@ vnl_bignum::vnl_bignum (long double d)
}
// Allocate and copy into permanent buffer
this->data = (buf.size()>0 ? new Data[buf.size()] : 0);
- this->count = buf.size();
+ this->count = (unsigned short)(buf.size());
vcl_copy( buf.begin(), buf.end(), data );
}
}
@@ -371,7 +373,7 @@ static bool is_minus_inf(const char* s, vcl_istream** is = 0)
//: Creates a vnl_bignum from the character string representation.
-vnl_bignum::vnl_bignum (const char *s)
+vnl_bignum::vnl_bignum(const char *s)
: count(0), sign(1), data(0)
{
// decimal: "^ *[-+]?[1-9][0-9]*$"
@@ -381,7 +383,7 @@ vnl_bignum::vnl_bignum (const char *s)
// infinity: "^ *[-+]?Inf(inity)?$"
if (is_plus_inf(s))
- sign=1,count=1,data=new Data[1],data[0]=0;
+ count=1,data=new Data[1],data[0]=0;
else if (is_minus_inf(s))
sign=-1,count=1,data=new Data[1],data[0]=0;
else if (is_decimal(s)) // If string is decimal
@@ -399,7 +401,7 @@ vnl_bignum::vnl_bignum (const char *s)
//: Reads a vnl_bignum from a stream
-vcl_istream& operator>> (vcl_istream& is, vnl_bignum& x)
+vcl_istream& operator>>(vcl_istream& is, vnl_bignum& x)
{
// decimal: "^ *[-+]?[1-9][0-9]*$"
// exponential: "^ *[-+]?[1-9][0-9]*[eE][+]?[0-9]+$"
@@ -408,11 +410,12 @@ vcl_istream& operator>> (vcl_istream& is, vnl_bignum& x)
vcl_istream* isp = &is;
rt[0] = '\0';
+ x = 0L;
if (is_plus_inf(rt,&isp))
x.sign=1,x.count=1,x.data=new Data[1],x.data[0]=0;
else if (is_minus_inf(rt,&isp))
x.sign=-1,x.count=1,x.data=new Data[1],x.data[0]=0;
- if (is_exponential(rt,&isp)) // If input stream string is exponential
+ else if (is_exponential(rt,&isp)) // If input stream string is exponential
x.exptoBigNum(rt); // convert exp. to vnl_bignum
else if (is_decimal(rt,&isp)) // If string is decimal
x.dtoBigNum(rt); // convert decimal to vnl_bignum
@@ -422,14 +425,13 @@ vcl_istream& operator>> (vcl_istream& is, vnl_bignum& x)
x.otoBigNum(rt); // convert octal to vnl_bignum
else { // Otherwise
vcl_cerr << "Cannot convert string " << rt << " to vnl_bignum\n";
- x = 0L;
}
return is; // FIXME - should probably push back read characters to istream
}
//: Copies the contents of vnl_bignum b.
-vnl_bignum::vnl_bignum (const vnl_bignum& b)
+vnl_bignum::vnl_bignum(const vnl_bignum& b)
: count(b.count), sign(b.sign)
{
this->data = b.data ? new Data[b.count] : 0; // Allocate data if necessary
@@ -440,17 +442,17 @@ vnl_bignum::vnl_bignum (const vnl_bignum& b)
//: Frees space for vnl_bignum.
-vnl_bignum::~vnl_bignum ()
+vnl_bignum::~vnl_bignum()
{
delete [] this->data; this->count = 0; // Delete any allocated data
}
//: Copies rhs vnl_bignum to lhs vnl_bignum.
-vnl_bignum& vnl_bignum::operator= (const vnl_bignum& rhs)
+vnl_bignum& vnl_bignum::operator=(const vnl_bignum& rhs)
{
if (this != &rhs) { // Avoid self-assignment
- delete [] this->data; // Delete existing data
+ delete[] this->data; // Delete existing data
this->count = rhs.count; // Copy rhs's count
this->data = rhs.data ? new Data[rhs.count] : 0; // Allocate data if necessary
for (Counter i = 0; i < rhs.count; ++i) // Copy rhs's data
@@ -462,7 +464,7 @@ vnl_bignum& vnl_bignum::operator= (const vnl_bignum& rhs)
//: Returns the negation of a vnl_bignum.
-vnl_bignum vnl_bignum::operator- () const
+vnl_bignum vnl_bignum::operator-() const
{
vnl_bignum neg(*this);
if (neg.count) // So long as this is non-zero
@@ -473,7 +475,7 @@ vnl_bignum vnl_bignum::operator- () const
//: Prefix increment. Increments a vnl_bignum by 1, and returns it.
-vnl_bignum& vnl_bignum::operator++ ()
+vnl_bignum& vnl_bignum::operator++()
{
if (this->is_infinity()) return *this;
if (this->count==0)
@@ -493,7 +495,7 @@ vnl_bignum& vnl_bignum::operator++ ()
//: Prefix decrement. Decrements a vnl_bignum by 1, and returns it.
-vnl_bignum& vnl_bignum::operator-- ()
+vnl_bignum& vnl_bignum::operator--()
{
if (this->is_infinity()) return *this;
if (this->count==0)
@@ -542,7 +544,7 @@ vnl_bignum vnl_bignum::operator+(const vnl_bignum& b) const
//: Multiplies this with a vnl_bignum
-vnl_bignum& vnl_bignum::operator*= (const vnl_bignum& b)
+vnl_bignum& vnl_bignum::operator*=(const vnl_bignum& b)
{
// Infinity arithmetic:
assert (! b.is_infinity() || this->count != 0 ); // multiplication 0*Inf
@@ -553,7 +555,7 @@ vnl_bignum& vnl_bignum::operator*= (const vnl_bignum& b)
if (b.count == 0 || this->count == 0)
return (*this)=0L;
vnl_bignum prod;
- prod.data = new Data[prod.count = this->count + b.count]; // allocate data for product
+ prod.resize(this->count + b.count); // allocate data for product
for (Counter i = 0; i < b.count; i++) // multiply each b "digit"
multiply_aux(*this, b.data[i], prod, i); // times b1 and add to total
prod.sign = this->sign * b.sign; // determine correct sign
@@ -564,7 +566,7 @@ vnl_bignum& vnl_bignum::operator*= (const vnl_bignum& b)
//: Divides this by a vnl_bignum
-vnl_bignum& vnl_bignum::operator/= (const vnl_bignum& b)
+vnl_bignum& vnl_bignum::operator/=(const vnl_bignum& b)
{
// Infinity arithmetic:
assert (! b.is_infinity() || ! this->is_infinity() ); // division Inf/Inf
@@ -581,7 +583,7 @@ vnl_bignum& vnl_bignum::operator/= (const vnl_bignum& b)
//: Divides this by a vnl_bignum and replaces this by remainder.
-vnl_bignum& vnl_bignum::operator%= (const vnl_bignum& b)
+vnl_bignum& vnl_bignum::operator%=(const vnl_bignum& b)
{
// Infinity arithmetic:
assert (! b.is_infinity() || ! this->is_infinity() ); // division Inf/Inf
@@ -598,7 +600,7 @@ vnl_bignum& vnl_bignum::operator%= (const vnl_bignum& b)
//: Shifts bignum to the left l digits.
-vnl_bignum vnl_bignum::operator<< (int l) const
+vnl_bignum vnl_bignum::operator<<(int l) const
{
// Infinity arithmetic:
if (this->is_infinity()) return *this;
@@ -614,7 +616,7 @@ vnl_bignum vnl_bignum::operator<< (int l) const
//: Shifts bignum to the right l digits.
-vnl_bignum vnl_bignum::operator>> (int l) const
+vnl_bignum vnl_bignum::operator>>(int l) const
{
// Infinity arithmetic:
if (this->is_infinity()) return *this;
@@ -630,7 +632,7 @@ vnl_bignum vnl_bignum::operator>> (int l) const
//: Two vnl_bignums are equal if and only if they have the same integer representation.
-bool vnl_bignum::operator== (const vnl_bignum& rhs) const
+bool vnl_bignum::operator==(const vnl_bignum& rhs) const
{
if (this != &rhs) { // Check address
if (this->sign != rhs.sign) return false; // Different sign implies !=
@@ -644,7 +646,7 @@ bool vnl_bignum::operator== (const vnl_bignum& rhs) const
//: Compares two vnl_bignums.
-bool vnl_bignum::operator< (const vnl_bignum& rhs) const
+bool vnl_bignum::operator<(const vnl_bignum& rhs) const
{
if (this->sign < rhs.sign) return true; // Different signs?
if (this->sign > rhs.sign) return false;
@@ -657,7 +659,7 @@ bool vnl_bignum::operator< (const vnl_bignum& rhs) const
//: Formatted output for bignum.
-vcl_ostream& operator<< (vcl_ostream& os, const vnl_bignum& b)
+vcl_ostream& operator<<(vcl_ostream& os, const vnl_bignum& b)
{
vnl_bignum d = b; // Copy the input vnl_bignum
if (d.sign == -1) { // If it's negative
@@ -682,7 +684,7 @@ vcl_ostream& operator<< (vcl_ostream& os, const vnl_bignum& b)
}
//: Convert the number to a decimal representation in a string.
-vcl_string& vnl_bignum_to_string (vcl_string& s, const vnl_bignum& b)
+vcl_string& vnl_bignum_to_string(vcl_string& s, const vnl_bignum& b)
{
s.erase();
vcl_string::size_type insert_point = 0; // keep record of location of first number.
@@ -705,7 +707,7 @@ vcl_string& vnl_bignum_to_string (vcl_string& s, const vnl_bignum& b)
}
//: Convert the number from a decimal representation in a string.
-vnl_bignum& vnl_bignum_from_string (vnl_bignum& b, const vcl_string& s)
+vnl_bignum& vnl_bignum_from_string(vnl_bignum& b, const vcl_string& s)
{
// decimal: "^ *[-+]?[1-9][0-9]*$"
// Infinity: "^ *[-+]?Inf(inity)?$"
@@ -721,71 +723,69 @@ vnl_bignum& vnl_bignum_from_string (vnl_bignum& b, const vcl_string& s)
//: Implicit conversion from a vnl_bignum to a short.
-vnl_bignum::operator short () const
+vnl_bignum::operator short() const
{
- short s = 0;
- for (Counter i = this->count; i > 0; )
- s = short(s*0x10000 + this->data[--i]);
- return this->sign*s;
+ int j = this->operator int();
+ return (short)j;
}
//: Implicit conversion from a vnl_bignum to an int.
-vnl_bignum::operator int () const
+vnl_bignum::operator int() const
{
int j = 0;
for (Counter i = this->count; i > 0; )
j = int(j*0x10000 + this->data[--i]);
- return this->sign*j;
+ return (this->sign < 0) ? -j : j;
}
//: Implicit conversion from a vnl_bignum to a long.
-vnl_bignum::operator long () const
+vnl_bignum::operator long() const
{
long l = 0;
for (Counter i = this->count; i > 0; )
l = l*0x10000L + this->data[--i];
- return this->sign*l;
+ return (this->sign < 0) ? -l : l;
}
//: Implicit conversion from a vnl_bignum to a float.
-vnl_bignum::operator float () const
+vnl_bignum::operator float() const
{
float f = 0.0f;
for (Counter i = this->count; i > 0; )
f = f*0x10000 + this->data[--i];
if (this->is_infinity()) f = vcl_numeric_limits<float>::infinity();
- return this->sign*f;
+ return (this->sign < 0) ? -f : f;
}
//: Implicit conversion from a vnl_bignum to a double.
-vnl_bignum::operator double () const
+vnl_bignum::operator double() const
{
double d = 0.0;
for (Counter i = this->count; i > 0; )
d = d*0x10000 + this->data[--i];
if (this->is_infinity()) d = vcl_numeric_limits<double>::infinity();
- return this->sign*d;
+ return (this->sign < 0) ? -d : d;
}
//: Implicit conversion from a vnl_bignum to a long double.
-vnl_bignum::operator long double () const
+vnl_bignum::operator long double() const
{
long double d = 0.0;
for (Counter i = this->count; i > 0; )
d = d*0x10000 + this->data[--i];
if (this->is_infinity()) d = vcl_numeric_limits<long double>::infinity();
- return this->sign*d;
+ return (this->sign < 0) ? -d : d;
}
//: dump the contents of a vnl_bignum to a stream, default cout.
-void vnl_bignum::dump (vcl_ostream& os) const
+void vnl_bignum::dump(vcl_ostream& os) const
{
os << "{count=" << this->count // output count field
<< ", sign=" << this->sign // output sign field
@@ -797,9 +797,15 @@ void vnl_bignum::dump (vcl_ostream& os) const
// {'%','0',char(2*2 + '0'),'X','%','s'};
// format_str[2] = char(2*2 + '0');
if (this->count > 0) { // output data array
- for (Counter i = this->count; i > 1; i--)
- os << (this->data[i - 1]) << ',';
- os << (this->data[0]);
+ os << vcl_hex << (this->data[this->count-1]);
+ for (Counter i = this->count - 1; i > 0; --i) {
+ os << ',';
+ if (this->data[i-1] < 0x10) os << '0';
+ if (this->data[i-1] < 0x100) os << '0';
+ if (this->data[i-1] < 0x1000) os << '0';
+ os << this->data[i-1];
+ }
+ os << vcl_dec;
}
os << "}}\n"; // close brackets
}
@@ -807,26 +813,28 @@ void vnl_bignum::dump (vcl_ostream& os) const
//: Converts decimal string to a vnl_bignum.
-int vnl_bignum::dtoBigNum (const char *s)
+int vnl_bignum::dtoBigNum(const char *s)
{
- this->resize(0); sign = 1; // Reset number to 0.
+ this->resize(0); this->sign = 1; // Reset number to 0.
Counter len = 0; // No chars converted yet
+ vnl_bignum sum;
while (*s == ' ' || *s == '\t' || *s == '\n' || *s == '\r') ++s; // skip whitespace
- if (s[0] == '-' || s[0] == '+') len++;// Skip over leading +,-
- while (vcl_isdigit(s[len])) { // If current char is digit
- (*this) = ((*this) * 10L) + // Shift vnl_bignum left a decimal
- vnl_bignum(long(s[len++] - '0')); // digit and add new digit
+ if (*s == '-' || *s == '+') ++len; // Skip over leading +,-
+ while (s[len]>='0' && s[len]<='9') { // While current char is digit
+ *this *= vnl_bignum(10L), // Shift vnl_bignum left a decimal
+ add(*this,vnl_bignum(long(s[len++]-'0')),sum), // digit and add new digit
+ *this = sum;
}
- if (s[0] == '-') this->sign = -1; // If s had leading -, note it
+ if (*s == '-') this->sign = -1; // If s had leading -, note it
return len; // Return # of chars processed
}
//: convert exponential string to a vnl_bignum
-void vnl_bignum::exptoBigNum (const char *s)
+void vnl_bignum::exptoBigNum(const char *s)
{
while (*s == ' ' || *s == '\t' || *s == '\n' || *s == '\r') ++s; // skip whitespace
- Counter pos = this->dtoBigNum(s) + 1; // Convert the base, skip [eE]
+ Counter pos = Counter(this->dtoBigNum(s) + 1); // Convert the base, skip [eE]
long pow = vcl_atol(s + pos); // Convert the exponent to long
while (pow-- > 0) // Raise vnl_bignum to the given
*this = (*this) * 10L; // power
@@ -837,7 +845,7 @@ void vnl_bignum::exptoBigNum (const char *s)
// - Inputs: character representation of a hex number
// - Outputs: integer value of the hex number
-unsigned int ctox (int c)
+unsigned int ctox(int c)
{
if ('0' <= c && c <= '9')
return c - '0';
@@ -848,11 +856,11 @@ unsigned int ctox (int c)
//: convert hex string to vnl_bignum
-void vnl_bignum::xtoBigNum (const char *s)
+void vnl_bignum::xtoBigNum(const char *s)
{
this->resize(0); sign = 1; // Reset number to 0.
while (*s == ' ' || *s == '\t' || *s == '\n' || *s == '\r') ++s; // skip whitespace
- Counter size = vcl_strlen(s);
+ Counter size = Counter(vcl_strlen(s));
Counter len = 2; // skip leading "0x"
while (len < size) { // While there are more chars
(*this) = ((*this) * 16L) + // Shift vnl_bignum left one hex
@@ -863,11 +871,11 @@ void vnl_bignum::xtoBigNum (const char *s)
//: convert octal string to vnl_bignum
-void vnl_bignum::otoBigNum (const char *s)
+void vnl_bignum::otoBigNum(const char *s)
{
this->resize(0); sign = 1; // Reset number to 0.
while (*s == ' ' || *s == '\t' || *s == '\n' || *s == '\r') ++s; // skip whitespace
- Counter size = vcl_strlen(s);
+ Counter size = Counter(vcl_strlen(s));
Counter len = 0; // No chars converted yet
while (len < size) { // While there are more chars
(*this) = ((*this) * 8L) + // Shift vnl_bignum left 1 oct dig.
@@ -877,7 +885,7 @@ void vnl_bignum::otoBigNum (const char *s)
//: change the data allotment for a vnl_bignum
-void vnl_bignum::resize (short new_count)
+void vnl_bignum::resize(short new_count)
{
assert(new_count >= 0);
if (new_count == this->count) return;
@@ -903,7 +911,7 @@ void vnl_bignum::resize (short new_count)
//: trim non-infinite vnl_bignum of excess data allotment
-vnl_bignum& vnl_bignum::trim ()
+vnl_bignum& vnl_bignum::trim()
{
Counter i = this->count;
for (; i > 0; i--) // Skip over high-order words
@@ -922,7 +930,7 @@ vnl_bignum& vnl_bignum::trim ()
//: add two non-infinite vnl_bignum values and save their sum
-void add (const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& sum)
+void add(const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& sum)
{
const vnl_bignum *bmax, *bmin; // Determine which of the two
if (b1.count >= b2.count) { // addends has the most
@@ -933,8 +941,7 @@ void add (const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& sum)
bmax = &b2;
bmin = &b1;
}
- sum.data = (sum.count = bmax->count) > 0 ? // Allocate data for their sum
- new Data[sum.count] : 0;
+ sum.resize(bmax->count); // Allocate data for their sum
unsigned long temp, carry = 0;
Counter i = 0;
while (i < bmin->count) { // Add, element by element.
@@ -957,7 +964,7 @@ void add (const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& sum)
}
//: Add 1 to bnum (unsigned, non-infinite)
-void increment (vnl_bignum& bnum)
+void increment(vnl_bignum& bnum)
{
Counter i = 0;
unsigned long carry = 1;
@@ -977,9 +984,9 @@ void increment (vnl_bignum& bnum)
//: subtract bmin from bmax (unsigned, non-infinite), result in diff
-void subtract (const vnl_bignum& bmax, const vnl_bignum& bmin, vnl_bignum& diff)
+void subtract(const vnl_bignum& bmax, const vnl_bignum& bmin, vnl_bignum& diff)
{
- diff.data = new Data[diff.count = bmax.count];// Allocate data for difference
+ diff.resize(bmax.count); // Allocate data for difference
unsigned long temp;
int borrow = 0;
Counter i = 0;
@@ -998,19 +1005,19 @@ void subtract (const vnl_bignum& bmax, const vnl_bignum& bmin, vnl_bignum& diff)
}
-//: Subtract 1 to bnum (unsigned, non-infinite, non-zero)
-void decrement (vnl_bignum& bnum)
+//: Subtract 1 from bnum (unsigned, non-infinite, non-zero)
+void decrement(vnl_bignum& bnum)
{
Counter i = 0;
unsigned long borrow = 1;
- while (i < bnum.count && borrow) { // decrement, element by element.
+ while (i < bnum.count && borrow) { // decrement, element by element.
unsigned long temp = (unsigned long)bnum.data[i] + 0x10000L - borrow;
- borrow = (temp/0x10000L == 0); // Did we have to borrow?
+ borrow = (temp/0x10000L == 0); // Did we have to borrow?
bnum.data[i] = (Data)temp; // Reduce modulo radix and save
++i;
}
bnum.trim(); // Done. Now trim excess data
- if (bnum.count==0) bnum.sign=+1; // Re-establish sign invariant
+ if (bnum.count==0) bnum.sign=+1; // Re-establish sign invariant
}
@@ -1019,7 +1026,7 @@ void decrement (vnl_bignum& bnum)
// 0 if abs(b1) == abs(b2)
// +1 if abs(b1) > abs(b2)
-int magnitude_cmp (const vnl_bignum& b1, const vnl_bignum& b2)
+int magnitude_cmp(const vnl_bignum& b1, const vnl_bignum& b2)
{
if (b1.is_infinity()) return b2.is_infinity() ? 0 : 1;
if (b2.is_infinity()) return -1;
@@ -1041,7 +1048,7 @@ int magnitude_cmp (const vnl_bignum& b1, const vnl_bignum& b2)
// - Inputs: vnl_bignum reference, single word multiplier, reference to the product,
// and index of starting storage location to use in product
-void multiply_aux (const vnl_bignum& b, Data d, vnl_bignum& prod, Counter i)
+void multiply_aux(const vnl_bignum& b, Data d, vnl_bignum& prod, Counter i)
{
// this function works just like normal multiplication by hand, in that the
// top number is multiplied by the first digit of the bottom number, then the
@@ -1073,14 +1080,15 @@ void multiply_aux (const vnl_bignum& b, Data d, vnl_bignum& prod, Counter i)
//: normalize two vnl_bignums
// (Refer to Knuth, V.2, Section 4.3.1, Algorithm D for details.
// A digit here is one data element in the radix 2**2.)
-// - Inputs: references to two vnl_bignums b1, b2, and their normalized counterparts
-// - Outputs: the integral normalization factor used
+// - Inputs: references to two vnl_bignums b1, b2
+// - Outputs: their normalized counterparts u and v,
+// and the integral normalization factor used
-Data normalize (const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& u, vnl_bignum& v)
+Data normalize(const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& u, vnl_bignum& v)
{
- Data d = Data(0x10000L/(long(b2.data[b2.count - 1]) + 1)); // Calculate normalization factor.
- u.data = new Data[u.count = b1.count + 1]; // Get data for u (plus extra)
- v.data = new Data[v.count = b2.count]; // Get data for v
+ Data d = Data(0x10000L/((unsigned long)(b2.data[b2.count - 1]) + 1L)); // Calculate normalization factor.
+ u.resize(b1.count + 1); // Get data for u (plus extra)
+ v.resize(b2.count); // Get data for v
u.data[b1.count] = 0; // Set u's leading digit to 0
multiply_aux(b1,d,u,0); // u = b1 * d
multiply_aux(b2,d,v,0); // v = b2 * d
@@ -1094,7 +1102,7 @@ Data normalize (const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& u, vnl_b
// - Inputs: reference to vnl_bignum dividend, single digit divisor d, vnl_bignum
// quotient, and single digit remainder r
-void divide_aux (const vnl_bignum& b1, Data d, vnl_bignum& q, Data& r)
+void divide_aux(const vnl_bignum& b1, Data d, vnl_bignum& q, Data& r)
{
r = 0; // init remainder to zero
unsigned long temp;
@@ -1115,7 +1123,7 @@ void divide_aux (const vnl_bignum& b1, Data d, vnl_bignum& q, Data& r)
// - Inputs: reference to vnl_bignum dividend and divisor and starting digit j
// - Outputs: estimated number of times v goes into u
-Data estimate_q_hat (const vnl_bignum& u, const vnl_bignum& v, Counter j)
+Data estimate_q_hat(const vnl_bignum& u, const vnl_bignum& v, Counter j)
{
Data q_hat,
v1 = v.data[v.count - 1], // localize frequent data
@@ -1125,7 +1133,7 @@ Data estimate_q_hat (const vnl_bignum& u, const vnl_bignum& v, Counter j)
u2 = u.data[u.count - 3 - j];
// Initial Knuth estimate, usually correct
- q_hat = (u0 == v1 ? Data(0xffff) : Data(long(u0 * 0x10000L + u1) / long(v1)));
+ q_hat = (u0 == v1 ? Data(0xffff) : Data(((unsigned long)u0 * 0x10000L + (unsigned long)u1) / (unsigned long)v1));
// high speed test to determine most of the cases in which initial
// estimate is too large. Eliminates most cases in which q_hat is one too
@@ -1137,23 +1145,15 @@ Data estimate_q_hat (const vnl_bignum& u, const vnl_bignum& v, Counter j)
// true, decrease q_hat again.
unsigned long lhs, rhs; // lhs, rhs of Knuth inequality
for (Counter i = 0; i < 2; i++) { // loop at most twice
- lhs = v2 * q_hat; // Calculate left-hand side of ineq.
- rhs = u0 * 0x10000L + u1;// Calculate part of right-hand side
- rhs -= (q_hat * v1); // Now subtract off part
-
- // DML: My attempt to fix the overflow testing bug..
- double temp_rhs = double(rhs);
- double temp_radix_s = double(0x10000);
- // OLD WAY: if (rhs > rhs * 0x10000)// if multiplication causes overflow
- // NEW WAY: see if result won't fit into a long.
- if ( temp_rhs * temp_radix_s > double(0x7fffffffL) )
+ lhs = (unsigned long)v2 * (unsigned long)q_hat; // Calculate left-hand side of ineq.
+ rhs = (unsigned long)u0 * 0x10000L +(unsigned long)u1;// Calculate part of right-hand side
+ rhs -= ((unsigned long)q_hat * (unsigned long)v1); // Now subtract off part
+
+ if ( rhs >= 0x10000L ) // if multiplication with 0x10000L causes overflow
break; // then rhs > lhs, so test fails
rhs *= 0x10000L; // No overflow: ok to multiply
- temp_rhs = double(rhs);
- double temp_u2 = double(u2);
- // OLD WAY: if (rhs > rhs + u2) // if addition yields overflow
- if ( temp_rhs + temp_u2 > double(0x7fffffffL) ) // NEW WAY.
+ if (rhs > rhs + (unsigned long)u2) // if addition yields overflow
break; // then rhs > lhs, so test fails
rhs += u2; // No overflow: ok to add.
if (lhs <= rhs) // if lhs <= rhs
@@ -1171,7 +1171,7 @@ Data estimate_q_hat (const vnl_bignum& u, const vnl_bignum& v, Counter j)
// into jth digit of dividend
// - Outputs: true number of times v goes into u
-Data multiply_subtract (vnl_bignum& u, const vnl_bignum& v, Data q_hat, Counter j)
+Data multiply_subtract(vnl_bignum& u, const vnl_bignum& v, Data q_hat, Counter j)
{
// At this point it has been estimated that v goes into the jth and higher
// digits of u about q_hat times, and in fact that q_hat is either the
@@ -1180,28 +1180,27 @@ Data multiply_subtract (vnl_bignum& u, const vnl_bignum& v, Data q_hat, Counter
if (q_hat == 0) return q_hat; // if q_hat 0, nothing to do
vnl_bignum rslt; // create a temporary vnl_bignum
Counter tmpcnt;
- rslt.data = // allocate data for it
- new Data[rslt.count = v.count + 1];
+ rslt.resize(v.count + 1u); // allocate data for it
// simultaneous computation of u - v*q_hat
unsigned long prod, diff;
Data carry = 0, borrow = 0;
Counter i = 0;
- for (; i < v.count; i++) {
+ for (; i < v.count; ++i) {
// for each digit of v, multiply it by q_hat and subtract the result
prod = (unsigned long)v.data[i] * (unsigned long)q_hat + carry;
- diff = (unsigned long)u.data[u.count - v.count - 1 - j + i] + 0x10000L - borrow;
+ diff = (unsigned long)u.data[u.count - v.count - 1 - j + i] + (0x10000L - (unsigned long)borrow);
diff -= (unsigned long)Data(prod); // form proper digit of u
rslt.data[i] = Data(diff); // save the result
- borrow = (diff/0x10000L == 0); // keep track of any borrows
+ borrow = (diff/0x10000L == 0) ? 1 : 0; // keep track of any borrows
carry = Data(prod/0x10000L); // keep track of carries
}
- tmpcnt = u.count - v.count - 1 - j + i;
- diff = (unsigned long)u.data[tmpcnt] // special case for the last
- + 0x10000L - borrow; // digit
- diff -= carry;
+ tmpcnt = Counter(u.count - v.count + i - j - 1);
+ diff = (unsigned long)u.data[tmpcnt] // special case for the last digit
+ + (0x10000L - (unsigned long)borrow);
+ diff -= (unsigned long)carry;
rslt.data[i] = Data(diff);
- borrow = (diff/0x10000L == 0);
+ borrow = (diff/0x10000L == 0) ? 1 : 0;
// A leftover borrow indicates that u - v*q_hat is negative, i.e., that
// q_hat was one too large. So to get correct result, decrement q_hat and
@@ -1210,16 +1209,16 @@ Data multiply_subtract (vnl_bignum& u, const vnl_bignum& v, Data q_hat, Counter
q_hat--;
carry = 0;
unsigned long sum;
- for (i = 0; i < v.count; i++) {
+ for (i = 0; i < v.count; ++i) {
sum = (unsigned long)rslt.data[i] + (unsigned long)v.data[i] + carry;
carry = Data(sum/0x10000L);
- u.data[u.count - v.count - 1 - j + i] = Data(sum);
+ u.data[u.count - v.count + i - 1 - j] = Data(sum);
}
- u.data[u.count - v.count - 1 - j + i] = rslt.data[i] + carry;
+ u.data[u.count - v.count + i - 1 - j] = rslt.data[i] + carry;
}
else { // otherwise, result is ok
- for (i = 0; i < rslt.count; i++) // store result back into u
- u.data[u.count - v.count - 1 - j + i] = rslt.data[i];
+ for (i = 0; i < rslt.count; ++i) // store result back into u
+ u.data[u.count - v.count + i - 1 - j] = rslt.data[i];
}
return q_hat; // return corrected q_hat
}
@@ -1228,10 +1227,10 @@ Data multiply_subtract (vnl_bignum& u, const vnl_bignum& v, Data q_hat, Counter
//: divide b2 into b1, getting quotient q and remainder r.
// (Refer to Knuth, V.2, Section 4.3.1, Algorithm D for details.
// This function implements Algorithm D.)
-// - Inputs: references to a vnl_bignum dividend b1, divisor b2, quotient q, and
-// remainder r.
+// - Inputs: references to a vnl_bignum dividend b1, divisor b2, quotient q, and
+// remainder r.
-void divide (const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& q, vnl_bignum& r)
+void divide(const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& q, vnl_bignum& r)
{
// Note that q or r may *not* be identical to either b1 or b2 !
assert(&b1 != &q && &b2 != &q && &b1 != &r && &b2 != &r);
@@ -1244,24 +1243,41 @@ void divide (const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& q, vnl_bign
else if (mag == 0) // if abs(b1) == abs(b2)
q = 1L; // quotient is 1, remainder is 0
else { // otherwise abs(b1) > abs(b2), so divide
- q.data = new Data[q.count = b1.count - b2.count + 1]; // Allocate quotient
- r.data = new Data[r.count = b2.count]; // Allocate remainder
+ q.resize(b1.count + 1u - b2.count); // Allocate quotient
+ r.resize(b2.count); // Allocate remainder
if (b2.count == 1) { // Single digit divisor?
divide_aux(b1,b2.data[0],q,r.data[0]); // Do single digit divide
}
else { // Else full-blown divide
vnl_bignum u,v;
- Data d = normalize(b1,b2,u,v); // Set u = b1/d, v = b2/d
- Data q_hat; // Multiplier
+#ifdef DEBUG
+ vcl_cerr << "\nvnl_bignum::divide: b1 ="; b1.dump(vcl_cerr);
+ vcl_cerr << "vnl_bignum::divide: b2 ="; b2.dump(vcl_cerr);
+#endif
+ Data d = normalize(b1,b2,u,v); // Set u = b1*d, v = b2*d
+#ifdef DEBUG
+ vcl_cerr << "vnl_bignum::divide: d = " << d << vcl_hex << " (0x" << d << ")\n" << vcl_dec;
+ vcl_cerr << "vnl_bignum::divide: u = "; u.dump(vcl_cerr);
+ vcl_cerr << "vnl_bignum::divide: v = "; v.dump(vcl_cerr);
+#endif
Counter j = 0;
while (j <= b1.count - b2.count) { // Main division loop
- q_hat = estimate_q_hat(u,v,j); // Estimate # times v divides
+ Data q_hat = estimate_q_hat(u,v,j); // Estimate # times v divides u
q.data[q.count - 1 - j] = // Do division, get true answ.
multiply_subtract(u,v,q_hat,j);
j++;
+#ifdef DEBUG
+ vcl_cerr << "vnl_bignum::divide: q_hat = " << q_hat << vcl_hex << " (0x" << q_hat << ")\n" << vcl_dec;
+ vcl_cerr << "vnl_bignum::divide: u = "; u.dump(vcl_cerr);
+#endif
}
static Data dufus; // dummy variable
divide_aux(u,d,r,dufus); // Unnormalize u for remainder
+
+#ifdef DEBUG
+ vcl_cerr << "vnl_bignum::divide: q = "; q.dump(vcl_cerr);
+ vcl_cerr << "vnl_bignum::divide: r = "; r.dump(vcl_cerr);
+#endif
}
q.trim(); // Trim leading zeros of quot.
r.trim(); // Trim leading zeros of rem.
@@ -1274,7 +1290,7 @@ void divide (const vnl_bignum& b1, const vnl_bignum& b2, vnl_bignum& q, vnl_bign
// - Inputs: reference to vnl_bignum, positive shift value
// - Outputs: vnl_bignum, multiplied by the corresponding power of two
-vnl_bignum left_shift (const vnl_bignum& b1, int l)
+vnl_bignum left_shift(const vnl_bignum& b1, int l)
{
// to carry out this arithmetic left shift, we cheat. Instead of physically
// shifting the data array l bits to the left, we shift just enough to get
@@ -1284,11 +1300,10 @@ vnl_bignum left_shift (const vnl_bignum& b1, int l)
rslt.sign = b1.sign; // result follows sign of input
Counter growth = Counter(l / 16); // # of words rslt will grow by
Data shift = Data(l % 16); // amount to actually shift
- Data rshift = 16 - shift; // amount to shift next word by
- Data carry = // value that will be shifted
- b1.data[b1.count - 1] >> (16 - shift); // out end of current array
- rslt.data = // allocate new data array
- new Data[rslt.count = b1.count + growth + (carry != 0 ? 1 : 0)];
+ Data rshift = Data(16 - shift); // amount to shift next word by
+ Data carry = Data( // value that will be shifted
+ b1.data[b1.count - 1] >> (16 - shift));// out end of current array
+ rslt.resize(b1.count + growth + (carry ? 1u : 0u)); // allocate new data array
Counter i = 0;
while (i < growth) // zero out padded elements
rslt.data[i++] = 0;
@@ -1314,28 +1329,27 @@ vnl_bignum left_shift (const vnl_bignum& b1, int l)
// - Inputs: reference to vnl_bignum, positive shift value
// - Outputs: vnl_bignum, divided by the corresponding power of two
-vnl_bignum right_shift (const vnl_bignum& b1, int l)
+vnl_bignum right_shift(const vnl_bignum& b1, int l)
{
vnl_bignum rslt; // result of shift
Counter shrinkage = Counter(l / 16); // # of words rslt will shrink
Data shift = Data(l % 16); // amount to actually shift
- Data dregs = (b1.data[b1.count-1] >> shift); // high end data to save
+ Data dregs = Data(b1.data[b1.count-1] >> shift);// high end data to save
if (shrinkage + (dregs == 0) < b1.count) { // if not all data shifted out
rslt.sign = b1.sign; // rslt follows sign of input
- // allocate new data
- rslt.data = new Data[rslt.count = b1.count - shrinkage - (dregs == 0 ? 1 : 0)];
- Data lshift = 16 - shift; // amount to shift high word
+ rslt.resize(b1.count - shrinkage - (dregs == 0 ? 1 : 0)); // allocate new data
+ Data lshift = Data(16 - shift); // amount to shift high word
Counter i = 0;
while (i < rslt.count - 1) { // shift current word
rslt.data[i] = (b1.data[i + shrinkage] >> shift) + // propagate adjacent
- (b1.data[i + shrinkage + 1] << lshift); // word into current word
+ (b1.data[i + shrinkage + 1u] << lshift); // word into current word
i++;
}
if (dregs) // don't lose dregs
rslt.data[i] = dregs;
else {
rslt.data[i] = (b1.data[i + shrinkage] >> shift) +
- (b1.data[i + shrinkage + 1] << lshift);
+ (b1.data[i + shrinkage + 1u] << lshift);
}
}
vnl_bignum& result = *((vnl_bignum*) &rslt); // same physical object
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_bignum.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_bignum.h
index 59bd20926791e47eae9614b775792fd33b8ca7f3..ed40595e07be631c50943843f994f9a44b73210c 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_bignum.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_bignum.h
@@ -61,6 +61,8 @@
// Peter Vanroose, 24 January 2002: ported to vnl from COOL
// Peter Vanroose, 7 September 2002: added "Infinity" (incl. all arithmetic)
// Ian Scott, 23 March 2004: made ++ and -- much more efficient.
+// Peter Vanroose, March 2008: try to fix divide bug: partially succeeded
+// Peter Vanroose, June 2009: finally fixed this long standing divide bug
// \endverbatim
#include <vcl_iostream.h>
@@ -85,11 +87,11 @@ void decrement (vnl_bignum& bnum);
void increment (vnl_bignum& bnum);
//: formatted output
-// \relates vnl_bignum
+// \relatesalso vnl_bignum
vcl_ostream& operator<<(vcl_ostream& s, vnl_bignum const& r);
//: simple input
-// \relates vnl_bignum
+// \relatesalso vnl_bignum
vcl_istream& operator>>(vcl_istream& s, vnl_bignum& r);
//: Infinite precision integers
@@ -260,15 +262,15 @@ class vnl_bignum
//: Convert the number to a decimal representation in a string.
-// \relates vnl_bignum
+// \relatesalso vnl_bignum
vcl_string& vnl_bignum_to_string (vcl_string& s, const vnl_bignum& b);
//: Convert the number from a decimal representation in a string.
-// \relates vnl_bignum
+// \relatesalso vnl_bignum
vnl_bignum& vnl_bignum_from_string (vnl_bignum& b, const vcl_string& s);
//: Returns the sum of two bignum numbers.
-// \relates vnl_bignum
+// \relatesalso vnl_bignum
inline vnl_bignum operator+(vnl_bignum const& r1, long r2) { return r1+vnl_bignum(r2); }
inline vnl_bignum operator+(vnl_bignum const& r1, int r2) { return r1+long(r2); }
inline vnl_bignum operator+(vnl_bignum const& r1, double r2) { return r1+vnl_bignum(r2); }
@@ -279,7 +281,7 @@ inline vnl_bignum operator+(double r2, vnl_bignum const& r1) { return r1 + r2; }
inline vnl_bignum operator+(long double r2, vnl_bignum const& r1) { return r1 + r2; }
//: Returns the difference of two bignum numbers.
-// \relates vnl_bignum
+// \relatesalso vnl_bignum
inline vnl_bignum operator-(vnl_bignum const& r1, vnl_bignum const& r2) { return r1 + (-r2); }
inline vnl_bignum operator-(vnl_bignum const& r1, long r2) { return r1 + (-r2); }
inline vnl_bignum operator-(vnl_bignum const& r1, int r2) { return r1 + (-r2); }
@@ -291,7 +293,7 @@ inline vnl_bignum operator-(double r2, vnl_bignum const& r1) { return -(r1 + (-r
inline vnl_bignum operator-(long double r2, vnl_bignum const& r1) { return -(r1 + (-r2)); }
//: Returns the product of two bignum numbers.
-// \relates vnl_bignum
+// \relatesalso vnl_bignum
inline vnl_bignum operator*(vnl_bignum const& r1, vnl_bignum const& r2)
{
vnl_bignum result(r1); return result *= r2;
@@ -338,7 +340,7 @@ inline vnl_bignum operator*(long double r2, vnl_bignum const& r1)
}
//: Returns the division of two bignum numbers.
-// \relates vnl_bignum
+// \relatesalso vnl_bignum
inline vnl_bignum operator/(vnl_bignum const& r1, vnl_bignum const& r2)
{
vnl_bignum result(r1); return result /= r2;
@@ -385,7 +387,7 @@ inline vnl_bignum operator/(long double r1, vnl_bignum const& r2)
}
//: Returns the remainder of r1 divided by r2.
-// \relates vnl_bignum
+// \relatesalso vnl_bignum
inline vnl_bignum operator%(vnl_bignum const& r1, vnl_bignum const& r2)
{
vnl_bignum result(r1); return result %= r2;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_block.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_block.h
index 9cfd86aafe8ff22cd55c2accfc9a82b358b32b2e..b2a56bf266dc4735f8bfbc5dd8f9d3ffe17e1f3b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_block.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_block.h
@@ -7,7 +7,12 @@
//:
// \file
// \author fsm
-
+//
+// \verbatim
+// Modifications
+// 2009-03-30 Peter Vanroose - Added arg_min() & arg_max() and reimplemented min_value() & max_value()
+// \endverbatim
+//
#include <vcl_compiler.h>
void vnl_block_raise_exception(char const *FILE, int LINE, char const *why);
@@ -42,30 +47,58 @@ T vnl_block_product(T const x[], unsigned n)
//: return smallest value.
template <class T> inline
-T vnl_block_min_value(T const x[], unsigned n)
+T vnl_block_min_value(T const *x, unsigned n)
{
if (n == 0)
vnl_block_raise_exception(__FILE__, __LINE__, "n is 0");
- T ans = x[0];
- for (unsigned i=1; i<n; ++i)
- if (ans > x[i])
- ans = x[i];
+ T ans = *x;
+ while (--n > 0)
+ if (ans > *++x)
+ ans = *x;
return ans;
}
//: return largest value.
template <class T> inline
-T vnl_block_max_value(T const x[], unsigned n)
+T vnl_block_max_value(T const *x, unsigned n)
{
if (n == 0)
vnl_block_raise_exception(__FILE__, __LINE__, "n is 0");
- T ans = x[0];
- for (unsigned i=1; i<n; ++i)
- if (ans < x[i])
- ans = x[i];
+ T ans = *x;
+ while (--n > 0)
+ if (ans < *++x)
+ ans = *x;
return ans;
}
+//: return index of smallest value.
+template <class T> inline
+unsigned vnl_block_arg_min(T const x[], unsigned n)
+{
+ if (n == 0)
+ vnl_block_raise_exception(__FILE__, __LINE__, "n is 0");
+ T tmp = *x;
+ unsigned idx = 0;
+ for (unsigned i=1; i<n; ++i)
+ if (tmp > *++x)
+ tmp = *x, idx = i;
+ return idx;
+}
+
+//: return index of largest value.
+template <class T> inline
+unsigned vnl_block_arg_max(T const x[], unsigned n)
+{
+ if (n == 0)
+ vnl_block_raise_exception(__FILE__, __LINE__, "n is 0");
+ T tmp = *x;
+ unsigned idx = 0;
+ for (unsigned i=1; i<n; ++i)
+ if (tmp < *++x)
+ tmp = *x, idx = i;
+ return idx;
+}
+
//: y[i] = x[i]
template <class T> inline
void vnl_block_copy(T const x[], T y[], unsigned n)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_na_vector.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_na_vector.h
new file mode 100644
index 0000000000000000000000000000000000000000..5c4b5030aba89d2841ddf3879aee62e6bd455144
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_na_vector.h
@@ -0,0 +1,153 @@
+// This is core/vnl/vnl_c_na_vector.h
+#ifndef vnl_c_na_vector_h_
+#define vnl_c_na_vector_h_
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma interface
+#endif
+//:
+// \file
+// \brief Math on blocks of memory
+//
+// NA aware vnl_c_vector-like interfaces to lowlevel memory-block operations.
+//
+// \author Andrew W. Fitzgibbon, Ian Scott
+// \date 3 Nov 2010
+//
+// \verbatim
+// Modifications
+// \endverbatim
+//
+//-----------------------------------------------------------------------------
+
+#include <vcl_iosfwd.h>
+#include <vnl/vnl_numeric_traits.h>
+#include <vcl_cmath.h> // for vcl_sqrt
+
+// avoid messing about with aux_* functions for gcc 2.7 -- fsm
+#if 0
+template <class T, class S> void vnl_c_na_vector_inf_norm(T const *p, unsigned n, S *out);
+template <class T, class S> void vnl_c_na_vector_rms_norm(T const *p, unsigned n, S *out);
+#endif
+template <class T, class S> void vnl_c_na_vector_one_norm(T const *p, unsigned n, S *out);
+template <class T, class S> void vnl_c_na_vector_two_norm(T const *p, unsigned n, S *out);
+template <class T, class S> void vnl_c_na_vector_two_norm_squared(T const *p, unsigned n, S *out);
+
+//: vnl_c_na_vector interfaces to NA-aware lowlevel memory-block operations.
+export template <class T>
+class vnl_c_na_vector
+{
+ public:
+ typedef typename vnl_numeric_traits<T>::abs_t abs_t;
+ typedef typename vnl_numeric_traits<T>::real_t real_t;
+
+ static T sum(T const* v, unsigned n);
+ static inline abs_t squared_magnitude(T const *p, unsigned n)
+ { abs_t val; vnl_c_na_vector_two_norm_squared(p, n, &val); return val; }
+#if 0
+ static void normalize(T *, unsigned n);
+ static void apply(T const *, unsigned, T (*f)(T), T* v_out);
+ static void apply(T const *, unsigned, T (*f)(T const&), T* v_out);
+
+ //: y[i] = x[i]
+ static void copy (T const *x, T *y, unsigned);
+
+ //: y[i] = a*x[i]
+ static void scale (T const *x, T *y, unsigned, T const &);
+
+ //: z[i] = x[i] + y[i];
+ static void add (T const *x, T const *y, T *z, unsigned);
+
+ //: z[i] = x[i] + y;
+ static void add (T const *x, T const& y, T *z, unsigned);
+
+ //: z[i] = x[i] - y[i]
+ static void subtract(T const *x, T const *y, T *z, unsigned);
+
+ //: z[i] = x[i] - y[i]
+ static void subtract(T const *x, T const& y, T *z, unsigned);
+
+ //: z[i] = x[i] * y[i]
+ static void multiply(T const *x, T const *y, T *z, unsigned);
+
+ //: z[i] = x[i] * y[i]
+ static void multiply(T const *x, T const& y, T *z, unsigned);
+
+ //: z[i] = x[i] / y[i]
+ static void divide (T const *x, T const *y, T *z, unsigned);
+
+ //: z[i] = x[i] / y[i]
+ static void divide (T const *x, T const& y, T *z, unsigned);
+
+ //: y[i] = -x[i]
+ // Note that this is a no-op when T is an unsigned type.
+ static void negate (T const *x, T *y, unsigned);
+
+ //: y[i] = 1/x[i]
+ static void invert (T const *x, T *y, unsigned);
+
+ //: y[i] += a*x[i]
+ static void saxpy (T const &a, T const *x, T *y, unsigned);
+
+ //: x[i] = v
+ static void fill (T *x, unsigned, T const &v);
+
+
+ static void reverse (T *x, unsigned);
+ static T dot_product (T const *, T const *, unsigned);
+
+ //: conjugate second
+ static T inner_product(T const *, T const *, unsigned);
+ static void conjugate(T const *, T *, unsigned);
+
+ static T max_value(T const *, unsigned);
+ static T min_value(T const *, unsigned);
+ static unsigned arg_max(T const *, unsigned);
+ static unsigned arg_min(T const *, unsigned);
+#endif
+
+ static T mean(T const *p, unsigned n);
+
+#if 0
+ //: The standard deviation
+ // This method uses the 1/(n-1) normalisation, assuming that your
+ // data is a sample of a population.
+ static inline real_t std(T const *p, unsigned n) {
+ return vcl_sqrt(real_t(sum_sq_diff_means(p, n))/real_t(abs_t(n-1)));}
+
+ //: The sum of squared differences from the mean
+ static T sum_sq_diff_means(T const* v, unsigned n);
+#endif
+
+ //: one_norm : sum of abs values
+ static inline abs_t one_norm(T const *p, unsigned n)
+ { abs_t val; vnl_c_na_vector_one_norm(p, n, &val); return val; }
+
+ //: two_norm : sqrt of sum of squared abs values
+ static inline abs_t two_norm(T const *p, unsigned n)
+ { abs_t val; vnl_c_na_vector_two_norm(p, n, &val); return val; }
+
+ //: two_nrm2 : sum of squared abs values
+ static inline abs_t two_nrm2(T const *p, unsigned n)
+ { abs_t val; vnl_c_na_vector_two_norm_squared(p, n, &val); return val; }
+
+#if 0
+ //: inf_norm : max of abs values
+ static inline abs_t inf_norm(T const *p, unsigned n)
+ { abs_t val; vnl_c_na_vector_inf_norm(p, n, &val); return val; }
+
+ //: rms_norm : sqrt of mean sum of squared abs values
+ static inline abs_t rms_norm(T const *p, unsigned n)
+ { abs_t val; vnl_c_na_vector_rms_norm(p, n, &val); return val; }
+
+ //: Euclidean Distance between two vectors.
+ // Sum of Differences squared.
+ static T euclid_dist_sq(T const *, T const *, unsigned);
+#endif
+};
+
+//: Input & output
+// \relatesalso vnl_c_na_vector
+template <class T>
+vcl_ostream& print_na_vector(vcl_ostream&, T const*, unsigned);
+
+#endif // vnl_c_na_vector_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_na_vector.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_na_vector.txx
new file mode 100644
index 0000000000000000000000000000000000000000..ed73640d3d5427436cf5933e5eb98f9decca7ad3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_na_vector.txx
@@ -0,0 +1,180 @@
+// This is core/vnl/vnl_c_na_vector.txx
+#ifndef vnl_c_na_vector_txx_
+#define vnl_c_na_vector_txx_
+//:
+// \file
+// \author Andrew W. Fitzgibbon, Ian Scott
+// \date 3 Nov 2010
+//
+//-----------------------------------------------------------------------------
+
+#include "vnl_c_na_vector.h"
+#include <vcl_cmath.h> // vcl_sqrt()
+#include <vnl/vnl_math.h>
+#include <vnl/vnl_na.h>
+#include <vnl/vnl_complex_traits.h>
+#include <vnl/vnl_numeric_traits.h>
+
+
+template <class T>
+T vnl_c_na_vector<T>::sum(T const* v, unsigned n)
+{
+ T tot(0);
+ bool any_valid(false);
+ for (const T* end = v+n; v != end; v++)
+ {
+ if (!vnl_na_isna(*v))
+ {
+ tot += *v;
+ any_valid=true;
+ }
+ }
+ return any_valid ? tot : vnl_na(T());
+}
+
+template <class T>
+T vnl_c_na_vector<T>::mean(T const *p, unsigned n)
+{
+ T tot(0);
+ unsigned n_finite=0;
+ for (const T* end = p+n; p != end; p++)
+ if (!vnl_na_isna(*p))
+ {
+ tot += *p;
+ n_finite++;
+ }
+ return n_finite ? tot/abs_t(n_finite) : vnl_na(T());
+}
+
+
+//------------------------------------------------------------
+
+
+template <class T, class S>
+void vnl_c_na_vector_two_norm_squared(T const *p, unsigned n, S *out)
+{
+ S val = 0;
+ bool any_valid(false);
+ for(T const * end = p+n; p != end; p++)
+ {
+ if (!vnl_na_isna(*p))
+ {
+ val += S(vnl_math_squared_magnitude(*p));
+ any_valid=true;
+ }
+ }
+ *out = any_valid ? val : vnl_na(T());
+}
+
+template <class T, class S>
+void vnl_c_na_vector_rms_norm(T const *p, unsigned n, S *out)
+{
+ S val = 0;
+ unsigned n_finite=0;
+ for (T const* end = p+n; p != end; p++)
+ {
+ if (!vnl_na_isna(*p))
+ {
+ val += S(vnl_math_squared_magnitude(*p));
+ n_finite++;
+ }
+ }
+ typedef typename vnl_numeric_traits<S>::real_t real_t;
+ *out = n_finite ? S(vcl_sqrt(real_t(val/n_finite))) : vnl_na(T());
+}
+
+template <class T, class S>
+void vnl_c_na_vector_one_norm(T const *p, unsigned n, S *out)
+{
+ T val = 0;
+ bool any_valid(false);
+ for (T const* end = p+n; p != end; p++)
+ {
+ if (!vnl_na_isna(*p))
+ {
+ val += vnl_math_abs(*p++);
+ any_valid=true;
+ }
+ }
+ *out = any_valid ? val : vnl_na(T());
+}
+
+template <class T, class S>
+void vnl_c_na_vector_two_norm(T const *p, unsigned n, S *out)
+{
+ vnl_c_na_vector_two_norm_squared(p, n, out);
+ typedef typename vnl_numeric_traits<S>::real_t real_t;
+ *out = S(vcl_sqrt(real_t(*out)));
+}
+
+
+template <class T, class S>
+void vnl_c_na_vector_inf_norm(T const *p, unsigned n, S *out)
+{
+ T val = 0;
+ bool any_valid(false);
+ for (T const* end = p+n; p != end; p++)
+ {
+ S v = vnl_math_abs(*p);
+ if (v > val) // don't need to test for NA, because NA > x is always false.
+ {
+ v = val;
+ any_valid=true;
+ }
+ }
+ *out = any_valid ? val : vnl_na(T());
+}
+
+
+//---------------------------------------------------------------------------
+
+template<class T>
+vcl_ostream& print_na_vector(vcl_ostream& s, T const* v, unsigned size)
+{
+ if (size != 0) vnl_na_insert(s, *v++);
+ for (T const* end = v+size-1; v != end; v++)
+ {
+ s << ' ';
+ vnl_na_insert(s, *v); // Output data element
+ }
+ return s;
+}
+
+//---------------------------------------------------------------------------
+
+#define VNL_C_NA_VECTOR_INSTANTIATE_norm(T, S) \
+template void vnl_c_na_vector_two_norm_squared(T const *, unsigned, S *); \
+template void vnl_c_na_vector_two_norm(T const *, unsigned, S *); \
+template void vnl_c_na_vector_one_norm(T const *, unsigned, S *); \
+template void vnl_c_na_vector_rms_norm(T const *, unsigned, S *); \
+template void vnl_c_na_vector_inf_norm(T const *, unsigned, S *)
+
+#undef VNL_C_NA_VECTOR_INSTANTIATE_ordered
+#define VNL_C_NA_VECTOR_INSTANTIATE_ordered(T) \
+VNL_C_NA_VECTOR_INSTANTIATE_norm(T, vnl_c_na_vector<T >::abs_t); \
+template class vnl_c_na_vector<T >; \
+template vcl_ostream& print_na_vector(vcl_ostream &,T const *,unsigned)
+
+
+#undef VNL_C_NA_VECTOR_INSTANTIATE_unordered
+#define VNL_C_NA_VECTOR_INSTANTIATE_unordered(T)
+
+#if 0
+VCL_DO_NOT_INSTANTIATE(T vnl_c_na_vector<T >::max_value(T const *, unsigned), T(0)); \
+VCL_DO_NOT_INSTANTIATE(T vnl_c_na_vector<T >::min_value(T const *, unsigned), T(0)); \
+VCL_DO_NOT_INSTANTIATE(unsigned vnl_c_na_vector<T >::arg_max(T const *, unsigned), 0U); \
+VCL_DO_NOT_INSTANTIATE(unsigned vnl_c_na_vector<T >::arg_min(T const *, unsigned), 0U); \
+VNL_C_NA_VECTOR_INSTANTIATE_norm(T, vnl_c_na_vector<T >::abs_t); \
+template class vnl_c_na_vector<T >; \
+VCL_UNINSTANTIATE_SPECIALIZATION(T vnl_c_na_vector<T >::max_value(T const *, unsigned)); \
+VCL_UNINSTANTIATE_SPECIALIZATION(T vnl_c_na_vector<T >::min_value(T const *, unsigned)); \
+VCL_UNINSTANTIATE_SPECIALIZATION(unsigned vnl_c_na_vector<T >::arg_max(T const *, unsigned)); \
+VCL_UNINSTANTIATE_SPECIALIZATION(unsigned vnl_c_na_vector<T >::arg_min(T const *, unsigned))
+#endif
+
+#ifndef DOXYGEN_SHOULD_SKIP_THIS
+#undef VNL_C_NA_VECTOR_INSTANTIATE
+#define VNL_C_NA_VECTOR_INSTANTIATE(T) extern "no such macro; use e.g. VNL_C_NA_VECTOR_INSTANTIATE_ordered instead"
+#endif // DOXYGEN_SHOULD_SKIP_THIS
+
+#endif // vnl_c_na_vector_txx_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_vector.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_vector.h
index 5c01eaec8f8cf4f5be4f338e6188fe8012cd2462..6bb69af6c42f4e59bf35668a7bf197fb72e6ffce 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_vector.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_vector.h
@@ -5,24 +5,26 @@
#pragma interface
#endif
//:
-// \file
-// \brief Math on blocks of memory
+// \file
+// \brief Math on blocks of memory
//
-// vnl_c_vector interfaces to lowlevel memory-block operations.
+// vnl_c_vector interfaces to low-level memory-block operations.
//
// \author Andrew W. Fitzgibbon, Oxford RRG
-// \date 12 Feb 98
+// \date 12 Feb 1998
//
// \verbatim
-// Modifications
-// 980212 AWF Initial version.
-// LSB (Manchester) 26/3/01 Tidied documentation
+// Modifications
+// 1998-02-12 AWF Initial version.
+// 2001-03-26 LSB (Manchester) Tidied documentation
+// 2009-03-30 Peter Vanroose added arg_min() and arg_max()
// \endverbatim
//
//-----------------------------------------------------------------------------
#include <vcl_iosfwd.h>
#include <vnl/vnl_numeric_traits.h>
+#include <vcl_cstddef.h> // for vcl_size_t
#include <vcl_cmath.h> // for vcl_sqrt
// avoid messing about with aux_* functions for gcc 2.7 -- fsm
@@ -47,64 +49,65 @@ class vnl_c_vector
static void apply(T const *, unsigned, T (*f)(T), T* v_out);
static void apply(T const *, unsigned, T (*f)(T const&), T* v_out);
-
-//: y[i] = x[i]
+ //: y[i] = x[i]
static void copy (T const *x, T *y, unsigned);
-//: y[i] = a*x[i]
+ //: y[i] = a*x[i]
static void scale (T const *x, T *y, unsigned, T const &);
-//: z[i] = x[i] + y[i];
+ //: z[i] = x[i] + y[i];
static void add (T const *x, T const *y, T *z, unsigned);
-//: z[i] = x[i] + y;
+ //: z[i] = x[i] + y;
static void add (T const *x, T const& y, T *z, unsigned);
-//: z[i] = x[i] - y[i]
+ //: z[i] = x[i] - y[i]
static void subtract(T const *x, T const *y, T *z, unsigned);
-//: z[i] = x[i] - y[i]
+ //: z[i] = x[i] - y[i]
static void subtract(T const *x, T const& y, T *z, unsigned);
-//: z[i] = x[i] * y[i]
+ //: z[i] = x[i] * y[i]
static void multiply(T const *x, T const *y, T *z, unsigned);
-//: z[i] = x[i] * y[i]
+ //: z[i] = x[i] * y[i]
static void multiply(T const *x, T const& y, T *z, unsigned);
-//: z[i] = x[i] / y[i]
+ //: z[i] = x[i] / y[i]
static void divide (T const *x, T const *y, T *z, unsigned);
-//: z[i] = x[i] / y[i]
+ //: z[i] = x[i] / y[i]
static void divide (T const *x, T const& y, T *z, unsigned);
-//: y[i] = -x[i]
-// Note that this is a no-op when T is an unsigned type.
+ //: y[i] = -x[i]
+ // Note that this is a no-op when T is an unsigned type.
static void negate (T const *x, T *y, unsigned);
-//: y[i] = 1/x[i]
+ //: y[i] = 1/x[i]
static void invert (T const *x, T *y, unsigned);
-//: y[i] += a*x[i]
+ //: y[i] += a*x[i]
static void saxpy (T const &a, T const *x, T *y, unsigned);
-//: x[i] = v
+ //: x[i] = v
static void fill (T *x, unsigned, T const &v);
static void reverse (T *x, unsigned);
static T dot_product (T const *, T const *, unsigned);
-//: conjugate second
+ //: conjugate second
static T inner_product(T const *, T const *, unsigned);
static void conjugate(T const *, T *, unsigned);
static T max_value(T const *, unsigned);
static T min_value(T const *, unsigned);
+ static unsigned arg_max(T const *, unsigned);
+ static unsigned arg_min(T const *, unsigned);
+
+ static T mean(T const *p, unsigned n) { return T(sum(p,n)/abs_t(n)); }
- static T mean(T const *p, unsigned n) { return sum(p,n)/abs_t(n); }
-
- //: The standard deviation
+ //: The standard deviation
// This method uses the 1/(n-1) normalisation, assuming that your
// data is a sample of a population.
static inline real_t std(T const *p, unsigned n) {
@@ -138,14 +141,14 @@ class vnl_c_vector
static T euclid_dist_sq(T const *, T const *, unsigned);
//: Memory allocation
- static T** allocate_Tptr(int n);
- static T* allocate_T(int n);
- static void deallocate(T**, int n_when_allocated);
- static void deallocate(T*, int n_when_allocated);
+ static T** allocate_Tptr(vcl_size_t n);
+ static T* allocate_T(vcl_size_t n);
+ static void deallocate(T**, vcl_size_t n_when_allocated);
+ static void deallocate(T*, vcl_size_t n_when_allocated);
};
//: Input & output
-// \relates vnl_c_vector
+// \relatesalso vnl_c_vector
template <class T>
vcl_ostream& print_vector(vcl_ostream&, T const*, unsigned);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_vector.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_vector.txx
index 79133093f05e3f0f189fe950c394dad2221cfeb3..aa3b0da3cd62946a095f2eb1f9f4fd866c474e76 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_vector.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_c_vector.txx
@@ -4,7 +4,7 @@
//:
// \file
// \author Andrew W. Fitzgibbon, Oxford RRG
-// \date 12 Feb 98
+// \date 12 Feb 1998
//
//-----------------------------------------------------------------------------
@@ -15,7 +15,6 @@
#include <vnl/vnl_complex_traits.h>
#include <vnl/vnl_numeric_traits.h>
-#include <vnl/vnl_config.h>
#include <vnl/vnl_sse.h>
template <class T>
@@ -254,6 +253,22 @@ T vnl_c_vector<T>::min_value(T const *src, unsigned n)
return vnl_sse<T>::min(src,n);
}
+//: Returns location of max value of the vector.
+template<class T>
+unsigned vnl_c_vector<T>::arg_max(T const *src, unsigned n)
+{
+ assert(n!=0); // max value of an empty vector is undefined
+ return vnl_sse<T>::arg_max(src,n);
+}
+
+//: Returns location of min value of the vector.
+template<class T>
+unsigned vnl_c_vector<T>::arg_min(T const *src, unsigned n)
+{
+ assert(n!=0); // min value of an empty vector is undefined
+ return vnl_sse<T>::arg_min(src,n);
+}
+
//: Sum of Differences squared.
template<class T>
T vnl_c_vector<T>::euclid_dist_sq(T const *a, T const *b, unsigned n)
@@ -284,10 +299,10 @@ void vnl_c_vector_two_norm_squared(T const *p, unsigned n, S *out)
// IMS: MSVC's optimiser does much better with *p++ than with p[i];
// consistently about 30% better over vectors from 4 to 20000 dimensions.
// PVr: with gcc 3.0 on alpha this is even a factor 3 faster!
- S val =0;
+ S val = 0;
T const* end = p+n;
while (p != end)
- val += vnl_math_squared_magnitude(*p++);
+ val += S(vnl_math_squared_magnitude(*p++));
*out = val;
#else
*out = 0;
@@ -338,43 +353,43 @@ void vnl_c_vector_inf_norm(T const *p, unsigned n, S *out)
//---------------------------------------------------------------------------
-inline void* vnl_c_vector_alloc(int n, int size)
+inline void* vnl_c_vector_alloc(vcl_size_t n, unsigned size)
{
return vnl_sse_alloc(n,size);
}
-inline void vnl_c_vector_dealloc(void* v, int n, int size)
+inline void vnl_c_vector_dealloc(void* v, vcl_size_t n, unsigned size)
{
vnl_sse_dealloc(v,n,size);
}
template<class T>
-T** vnl_c_vector<T>::allocate_Tptr(int n)
+T** vnl_c_vector<T>::allocate_Tptr(vcl_size_t n)
{
return (T**)vnl_c_vector_alloc(n, sizeof (T*));
}
template<class T>
-void vnl_c_vector<T>::deallocate(T** v, int n)
+void vnl_c_vector<T>::deallocate(T** v, vcl_size_t n)
{
vnl_c_vector_dealloc(v, n, sizeof (T*));
}
// "T *" is POD, but "T" might not be.
#include <vcl_new.h>
-template <class T> inline void vnl_c_vector_construct(T *p, int n)
+template <class T> inline void vnl_c_vector_construct(T *p, vcl_size_t n)
{
- for (int i=0; i<n; ++i)
+ for (vcl_size_t i=0; i<n; ++i)
new (p+i) T();
}
-inline void vnl_c_vector_construct(float *, int) { }
-inline void vnl_c_vector_construct(double *, int) { }
-inline void vnl_c_vector_construct(long double *, int) { }
-inline void vnl_c_vector_construct(vcl_complex<float> *, int) { }
-inline void vnl_c_vector_construct(vcl_complex<double> *, int) { }
-inline void vnl_c_vector_construct(vcl_complex<long double> *, int) { }
+inline void vnl_c_vector_construct(float *, vcl_size_t) { }
+inline void vnl_c_vector_construct(double *, vcl_size_t) { }
+inline void vnl_c_vector_construct(long double *, vcl_size_t) { }
+inline void vnl_c_vector_construct(vcl_complex<float> *, vcl_size_t) { }
+inline void vnl_c_vector_construct(vcl_complex<double> *, vcl_size_t) { }
+inline void vnl_c_vector_construct(vcl_complex<long double> *, vcl_size_t) { }
#ifdef __BORLANDC__
// The compiler is confused
@@ -385,9 +400,9 @@ inline void vnl_c_vector_construct(vcl_complex<long double> *, int) { }
#endif
-template <class T> inline void vnl_c_vector_destruct(T *p, int n)
+template <class T> inline void vnl_c_vector_destruct(T *p, vcl_size_t n)
{
- for (int i=0; i<n; ++i)
+ for (vcl_size_t i=0; i<n; ++i)
(p+i)->~T();
}
@@ -396,15 +411,15 @@ template <class T> inline void vnl_c_vector_destruct(T *p, int n)
#endif
-inline void vnl_c_vector_destruct(float *, int) { }
-inline void vnl_c_vector_destruct(double *, int) { }
-inline void vnl_c_vector_destruct(long double *, int) { }
-inline void vnl_c_vector_destruct(vcl_complex<float> *, int) { }
-inline void vnl_c_vector_destruct(vcl_complex<double> *, int) { }
-inline void vnl_c_vector_destruct(vcl_complex<long double> *, int) { }
+inline void vnl_c_vector_destruct(float *, vcl_size_t) { }
+inline void vnl_c_vector_destruct(double *, vcl_size_t) { }
+inline void vnl_c_vector_destruct(long double *, vcl_size_t) { }
+inline void vnl_c_vector_destruct(vcl_complex<float> *, vcl_size_t) { }
+inline void vnl_c_vector_destruct(vcl_complex<double> *, vcl_size_t) { }
+inline void vnl_c_vector_destruct(vcl_complex<long double> *, vcl_size_t) { }
template<class T>
-T* vnl_c_vector<T>::allocate_T(int n)
+T* vnl_c_vector<T>::allocate_T(vcl_size_t n)
{
T *p = (T*)vnl_c_vector_alloc(n, sizeof (T));
vnl_c_vector_construct(p, n);
@@ -412,7 +427,7 @@ T* vnl_c_vector<T>::allocate_T(int n)
}
template<class T>
-void vnl_c_vector<T>::deallocate(T* p, int n)
+void vnl_c_vector<T>::deallocate(T* p, vcl_size_t n)
{
vnl_c_vector_destruct(p, n);
vnl_c_vector_dealloc(p, n, sizeof (T));
@@ -447,10 +462,14 @@ template vcl_ostream& print_vector(vcl_ostream &,T const *,unsigned)
#define VNL_C_VECTOR_INSTANTIATE_unordered(T) \
VCL_DO_NOT_INSTANTIATE(T vnl_c_vector<T >::max_value(T const *, unsigned), T(0)); \
VCL_DO_NOT_INSTANTIATE(T vnl_c_vector<T >::min_value(T const *, unsigned), T(0)); \
+VCL_DO_NOT_INSTANTIATE(unsigned vnl_c_vector<T >::arg_max(T const *, unsigned), 0U); \
+VCL_DO_NOT_INSTANTIATE(unsigned vnl_c_vector<T >::arg_min(T const *, unsigned), 0U); \
VNL_C_VECTOR_INSTANTIATE_norm(T, vnl_c_vector<T >::abs_t); \
template class vnl_c_vector<T >; \
VCL_UNINSTANTIATE_SPECIALIZATION(T vnl_c_vector<T >::max_value(T const *, unsigned)); \
-VCL_UNINSTANTIATE_SPECIALIZATION(T vnl_c_vector<T >::min_value(T const *, unsigned))
+VCL_UNINSTANTIATE_SPECIALIZATION(T vnl_c_vector<T >::min_value(T const *, unsigned)); \
+VCL_UNINSTANTIATE_SPECIALIZATION(unsigned vnl_c_vector<T >::arg_max(T const *, unsigned)); \
+VCL_UNINSTANTIATE_SPECIALIZATION(unsigned vnl_c_vector<T >::arg_min(T const *, unsigned))
#ifndef DOXYGEN_SHOULD_SKIP_THIS
#undef VNL_C_VECTOR_INSTANTIATE
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_complex_ops.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_complex_ops.txx
index 3c5370925d4622f480ed759d86130f90ae42a331..7ccad04ac0e2f50990f25cd91bd061b33585b8b9 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_complex_ops.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_complex_ops.txx
@@ -71,7 +71,7 @@ template <class T>
void vnl_real(vcl_complex<T> const* C, T* R, unsigned int n)
{
for (unsigned int i=0; i<n; ++i)
- R[i] = vcl_imag(C[i]);
+ R[i] = vcl_real(C[i]);
}
//: Vector of real parts of vnl_vector<vcl_complex<T> >.
@@ -102,7 +102,7 @@ template <class T>
void vnl_imag(vcl_complex<T> const* C, T* I, unsigned int n)
{
for (unsigned int i=0; i<n; ++i)
- I[i] = vcl_real(C[i]);
+ I[i] = vcl_imag(C[i]);
}
//: Vector of imaginary parts of vnl_vector<vcl_complex<T> >.
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_complexify.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_complexify.h
index 6e83b903e12f84d9c6e57ce87ec971c3dce04d8d..0396e800b1bf75c529adee1cc6451e51692e8aef 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_complexify.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_complexify.h
@@ -23,19 +23,19 @@ template <class T> void
vnl_complexify(T const* R, vcl_complex<T>* C, unsigned n);
//: Return complexified version of real vector R.
-// \relates vnl_vector
+// \relatesalso vnl_vector
template <class T> vnl_vector<vcl_complex<T> >
vnl_complexify(vnl_vector<T> const& R);
//: Return complex vector R+j*I from two real vectors R and I.
-// \relates vnl_vector
+// \relatesalso vnl_vector
template <class T> vnl_vector<vcl_complex<T> >
vnl_complexify(vnl_vector<T> const& R, vnl_vector<T> const& I);
//: Return complexified version of real matrix R.
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
template <class T> vnl_matrix<vcl_complex<T> >
vnl_complexify(vnl_matrix<T> const& R);
//: Return complex matrix R+j*I from two real matrices R and I.
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
template <class T> vnl_matrix<vcl_complex<T> >
vnl_complexify(vnl_matrix<T> const& R, vnl_matrix<T> const& I);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_copy.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_copy.cxx
index 9f1866f41848675d7770eba23b7188f0c70c00a4..e1f3a42576b94cc19c00e599ff6433182e4eaebf 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_copy.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_copy.cxx
@@ -42,7 +42,7 @@ VNL_COPY_INSTANTIATE0(double, long double);
VNL_COPY_INSTANTIATE0(long double, double);
#endif
-#define macro(S, D) \
+#define vnl_copy_macro(S, D) \
VCL_DEFINE_SPECIALIZATION \
void vnl_copy(vcl_complex<S> const *src, vcl_complex<D> *dst, unsigned n) \
{ \
@@ -50,11 +50,23 @@ void vnl_copy(vcl_complex<S> const *src, vcl_complex<D> *dst, unsigned n) \
dst[i] = vcl_complex<D>((D)vcl_real(src[i]), (D)vcl_imag(src[i])); \
}
-macro(float, double);
-macro(double, float);
-macro(double, long double);
-macro(long double, double);
-#undef macro
+vnl_copy_macro(float, double);
+vnl_copy_macro(double, float);
+vnl_copy_macro(double, long double);
+vnl_copy_macro(long double, double);
+#undef vnl_copy_macro
+
+#define vnl_copy_dumb(S) \
+VCL_DEFINE_SPECIALIZATION \
+void vnl_copy(S const *src, S *dst, unsigned n) \
+{ \
+ for (unsigned int i=0; i<n; ++i) \
+ dst[i] = src[i]; \
+}
+
+vnl_copy_dumb(float);
+vnl_copy_dumb(double);
+#undef vnl_copy_dumb
// vnl_* containers
#define VNL_COPY_INSTANTIATE(S, T) \
@@ -62,6 +74,9 @@ template void vnl_copy(vnl_vector<S > const &, vnl_vector<T > &); \
template void vnl_copy(vnl_matrix<S > const &, vnl_matrix<T > &); \
template void vnl_copy(vnl_diag_matrix<S > const &, vnl_diag_matrix<T > &)
+VNL_COPY_INSTANTIATE(float, float);
+VNL_COPY_INSTANTIATE(double, double);
+
#define VNL_COPY_INSTANTIATE_twoway(S, T) \
VNL_COPY_INSTANTIATE(S, T); \
VNL_COPY_INSTANTIATE(T, S)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_copy.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_copy.h
index 9f423bf39b3de73e95d3327bc8f358b9c5c8f291..728ee0dc4a78e08f0d54dee88b40f40c10baafaa 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_copy.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_copy.h
@@ -15,15 +15,15 @@
// \endverbatim
//: Easy conversion between vectors and matrices templated over different types.
-// \relates vnl_matrix
-// \relates vnl_vector
+// \relatesalso vnl_matrix
+// \relatesalso vnl_vector
template <class S, class T>
void vnl_copy(S const *src, T *dst, unsigned n);
//: Easy conversion between vectors and matrices templated over different types.
-// \relates vnl_matrix
-// \relates vnl_vector
+// \relatesalso vnl_matrix
+// \relatesalso vnl_vector
template <class S, class T>
void vnl_copy(S const &, T &);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cost_function.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cost_function.cxx
index 0f2b444d75a98269c6e31dc9bc45c25d231d5740..3efda85f70e283348bbb575fe32066930d5d16cc 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cost_function.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cost_function.cxx
@@ -5,7 +5,7 @@
//:
// \file
// \author Andrew W. Fitzgibbon, Oxford RRG
-// \date 23 Oct 97
+// \date 23 Oct 1997
//
//-----------------------------------------------------------------------------
@@ -14,9 +14,9 @@
static bool f_calling_compute;
-void vnl_cost_function::compute(vnl_vector<double> const& x, double *f, vnl_vector<double>* g)
+void vnl_cost_function::compute(vnl_vector<double> const& x, double *val, vnl_vector<double>* g)
{
- if (f) *f = this->f(x);
+ if (val) *val = this->f(x);
if (g) this->gradf(x, *g);
}
@@ -26,11 +26,11 @@ double vnl_cost_function::f(vnl_vector<double> const& x)
// if we get back here from compute, neither vf was implemented.
if (f_calling_compute)
assert(!"vnl_cost_function: RECURSION");
- double f;
+ double val;
f_calling_compute = true;
- this->compute(x, &f, 0);
+ this->compute(x, &val, 0);
f_calling_compute = false;
- return f;
+ return val;
}
//: Default implementation of gradf is to call compute
@@ -51,7 +51,6 @@ void vnl_cost_function::fdgradf(vnl_vector<double> const& x,
vnl_vector<double> tx = x;
double h = stepsize;
for (int i = 0; i < dim; ++i) {
-
double tplus = x[i] + h;
tx[i] = tplus;
double fplus = this->f(tx);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cross.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cross.h
index bf7db80e5a70aeceb42f0f82d9ef17d18373d209..aa62b6e47c112be45641382a1dc128531e932edf 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cross.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cross.h
@@ -14,7 +14,7 @@
#include <vcl_cassert.h>
//: Compute the 2-D cross product
-// \relates vnl_vector
+// \relatesalso vnl_vector
template<class T>
inline T
vnl_cross_2d( const vnl_vector<T>& v1, const vnl_vector<T>& v2 )
@@ -24,7 +24,7 @@ vnl_cross_2d( const vnl_vector<T>& v1, const vnl_vector<T>& v2 )
}
//: Compute the 2-D cross product
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T>
inline T
vnl_cross_2d( const vnl_vector_fixed<T,2>& v1, const vnl_vector_fixed<T,2>& v2 )
@@ -33,8 +33,8 @@ vnl_cross_2d( const vnl_vector_fixed<T,2>& v1, const vnl_vector_fixed<T,2>& v2 )
}
//: Compute the 2-D cross product
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T>
inline T
vnl_cross_2d(vnl_vector_fixed<T,2> const& v1, vnl_vector<T> const& v2)
@@ -44,8 +44,8 @@ vnl_cross_2d(vnl_vector_fixed<T,2> const& v1, vnl_vector<T> const& v2)
}
//: Compute the 2-D cross product
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T>
inline T
vnl_cross_2d(vnl_vector<T> const& v1, vnl_vector_fixed<T,2> const& v2)
@@ -55,7 +55,7 @@ vnl_cross_2d(vnl_vector<T> const& v1, vnl_vector_fixed<T,2> const& v2)
}
//: Compute the 3-D cross product
-// \relates vnl_vector
+// \relatesalso vnl_vector
template<class T>
inline vnl_vector<T>
vnl_cross_3d( const vnl_vector<T>& v1, const vnl_vector<T>& v2 )
@@ -69,7 +69,7 @@ vnl_cross_3d( const vnl_vector<T>& v1, const vnl_vector<T>& v2 )
}
//: Compute the 3-D cross product
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T>
inline vnl_vector_fixed<T,3>
vnl_cross_3d( const vnl_vector_fixed<T,3>& v1, const vnl_vector_fixed<T,3>& v2 )
@@ -82,8 +82,8 @@ vnl_cross_3d( const vnl_vector_fixed<T,3>& v1, const vnl_vector_fixed<T,3>& v2 )
}
//: Compute the 3-D cross product
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T,unsigned int n>
inline vnl_vector_fixed<T,n>
vnl_cross_3d( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
@@ -92,8 +92,8 @@ vnl_cross_3d( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
}
//: Compute the 3-D cross product
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T,unsigned int n>
inline vnl_vector_fixed<T,n>
vnl_cross_3d( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cross_product_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cross_product_matrix.h
index 0b6d4b2833a88eee40500aeda1d74ff43ac6aa48..d4cfc0af181cdd49d0d76fb0391492cdd8899012 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cross_product_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_cross_product_matrix.h
@@ -10,14 +10,16 @@
// \verbatim
// Modifications
// 4/4/01 LSB (Manchester) Tidied Documentation
-// 27 June 2003 - Peter Vanroose - made set() inlined and removed .cxx file.
+// 27 Jun 2003 - Peter Vanroose - made set() inlined and removed .cxx file.
+// 24 Oct 2010 - Peter Vanroose - mutators and setters now return *this
// \endverbatim
//
//-----------------------------------------------------------------------------
+#include <vnl/vnl_vector_fixed.h>
#include <vnl/vnl_double_3x3.h>
-//: Calculates the 3x3 skew symmetric cross product matrix from a vector.
+//: Calculates the 3x3 skew symmetric cross product matrix from a vector.
//
// vnl_cross_product_matrix(e) is the matrix [e]_ x:
// \verbatim
@@ -30,9 +32,10 @@ class vnl_cross_product_matrix : public vnl_double_3x3
public:
typedef vnl_double_3x3 base;
- vnl_cross_product_matrix(const vnl_vector<double>& v) { set(v.data_block()); }
+ vnl_cross_product_matrix(vnl_vector_fixed<double,3> const& v) { set(v.data_block()); }
+ vnl_cross_product_matrix(vnl_vector<double> const& v) { set(v.data_block()); }
vnl_cross_product_matrix(const double* v) { set(v); }
- vnl_cross_product_matrix(const vnl_cross_product_matrix& that): base(that) {}
+ vnl_cross_product_matrix(vnl_cross_product_matrix const& that): base(that) {}
~vnl_cross_product_matrix() {}
vnl_cross_product_matrix& operator=(const vnl_cross_product_matrix& that) {
@@ -42,7 +45,7 @@ class vnl_cross_product_matrix : public vnl_double_3x3
//: Construct a vnl_cross_product_matrix from a C-array of 3 doubles.
// Overrides a method in vnl_matrix.
- inline void set(const double* v)
+ inline vnl_cross_product_matrix& set(const double* v)
{
double const& e1 = v[0];
double const& e2 = v[1];
@@ -53,6 +56,8 @@ class vnl_cross_product_matrix : public vnl_double_3x3
E(0,0) = 0; E(0,1) = -e3; E(0,2) = e2;
E(1,0) = e3; E(1,1) = 0; E(1,2) = -e1;
E(2,0) = -e2; E(2,1) = e1; E(2,2) = 0;
+
+ return *this;
}
};
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_crs_index.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_crs_index.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..9ecd370e7e02c0d54b816e76c1547bd99016c328
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_crs_index.cxx
@@ -0,0 +1,82 @@
+// This is core/vnl/vnl_crs_index.cxx
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma implementation
+#endif
+//:
+// \file
+// \author Matt Leotta (Brown)
+// \date April 13, 2005
+
+#include "vnl_crs_index.h"
+
+//: Constructor - from a binary mask
+vnl_crs_index::vnl_crs_index(const vcl_vector<vcl_vector<bool> >& mask)
+ : num_cols_(mask[0].size()), col_idx_(), row_ptr_(mask.size()+1,0)
+{
+ int k=0;
+ for (unsigned int i=0; i<mask.size(); ++i){
+ const vcl_vector<bool>& col = mask[i];
+ row_ptr_[i] = k;
+ for (unsigned int j=0; j<num_cols_; ++j){
+ if (col[j]){
+ col_idx_.push_back(j);
+ ++k;
+ }
+ }
+ }
+ row_ptr_[mask.size()] = k;
+}
+
+
+//: return the index at location (i,j)
+// returns -1 if the entry is 0
+int
+vnl_crs_index::operator() (int i, int j) const
+{
+ int low = row_ptr_[i];
+ int high = row_ptr_[i+1]-1;
+
+ // binary search for finding the element at column j
+ while (low<=high){
+ if (j<col_idx_[low] || j>col_idx_[high])
+ return -1; // element is zero (no index)
+
+ int mid = (low+high)>>1; //(low+high)/2;
+ if (j<(int)col_idx_[mid])
+ high = mid-1;
+ else if (j>(int)col_idx_[mid])
+ low=mid+1;
+ else
+ return mid;
+ }
+
+ return -1; // element is zero (no index)
+}
+
+
+//: returns row \p i as a vector of index-column pairs
+vnl_crs_index::sparse_vector
+vnl_crs_index::sparse_row(int i) const
+{
+ sparse_vector row;
+ for (int j=row_ptr_[i]; j<row_ptr_[i+1]; ++j){
+ row.push_back(idx_pair(j,col_idx_[j]));
+ }
+ return row;
+}
+
+
+//: returns column \p j as a vector of index-row pairs
+// \note because of CRS this method is a bit less efficient than sparse_row
+vnl_crs_index::sparse_vector
+vnl_crs_index::sparse_col(int j) const
+{
+ sparse_vector col;
+ for (int i=0; i<num_rows(); ++i){
+ int idx = (*this)(i,j);
+ if (idx >= 0)
+ col.push_back(idx_pair(idx,i));
+ }
+
+ return col;
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_crs_index.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_crs_index.h
new file mode 100644
index 0000000000000000000000000000000000000000..14d7966f7c0955d59e1fe8aa2027ac1133e0f77c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_crs_index.h
@@ -0,0 +1,70 @@
+// This is core/vnl/vnl_crs_index.h
+#ifndef vnl_crs_index_h_
+#define vnl_crs_index_h_
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma interface
+#endif
+//:
+// \file
+// \brief Compressed Row Storage (CRS) indexing
+// \author Matt Leotta (Brown)
+// \date April 13, 2005
+//
+// \verbatim
+// Modifications
+// \endverbatim
+//
+#include <vcl_vector.h>
+#include <vcl_utility.h>
+
+
+//: Represents the configuration of a sparse matrix but not the data
+// This is essentially a sparse matrix of indices into a data vector
+// Compressed row storage is used for representation
+// This class is useful when working with several sparse matrices that
+// share a common sparse structure.
+class vnl_crs_index
+{
+ public:
+ typedef vcl_pair<int,int> idx_pair;
+ typedef vcl_vector<idx_pair> sparse_vector;
+
+ //: Constructor - default
+ vnl_crs_index() : num_cols_(0), col_idx_(), row_ptr_() {}
+
+ //: Constructor - from a binary mask
+ vnl_crs_index(const vcl_vector<vcl_vector<bool> >& mask);
+
+ //: Destructor
+ ~vnl_crs_index(){}
+
+ //: number of rows in the sparse matrix
+ int num_rows() const { return row_ptr_.size()-1; }
+
+ //: number of columns in the sparse matrix
+ int num_cols() const { return num_cols_; }
+
+ //: number of non-zero elements
+ int num_non_zero() const { return col_idx_.size(); }
+
+ //: returns row \p i as a vector of index-column pairs
+ sparse_vector sparse_row(int i) const;
+
+ //: returns column \p j as a vector of index-row pairs
+ // \note because of CRS this method is a bit less efficient than sparse_row
+ sparse_vector sparse_col(int j) const;
+
+ //: return the index at location (i,j)
+ // returns -1 if the entry is 0
+ int operator() (int i, int j) const;
+
+ private:
+ //: The number of columns in the matrix
+ unsigned int num_cols_;
+ //: The column for each non-zero element
+ vcl_vector<int> col_idx_;
+ //: The index of the first non-zero element in each row
+ vcl_vector<int> row_ptr_;
+};
+
+#endif // vnl_crs_index_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_definite_integral.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_definite_integral.cxx
index 7fcde253db6366e12759e28c1a0001eb315ab7c3..80e1aec4ef61eae408730c33aedddb9fa95478dd 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_definite_integral.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_definite_integral.cxx
@@ -1,5 +1,5 @@
-#include "vnl_integrant_fnct.h"
#include "vnl_definite_integral.h"
+#include <vnl/vnl_integrant_fnct.h>
-// initial the static memeber
+// initialize the static member
vnl_integrant_fnct* vnl_definite_integral::pfnct_ = 0;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_definite_integral.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_definite_integral.h
index c1aaddc1fc2e489c130fbd453d20a9048195c489..3e92d24fbf070064bb673eb68f2af2378d48dec2 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_definite_integral.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_definite_integral.h
@@ -4,29 +4,27 @@
// \file
// \author Kongbin Kang at Brown
// \date Jan 12, 2005
-// \brief the abstract 1D integrant function used for definite integral
+// \brief the abstract 1D integrand function used for definite integral
#include "vnl_integrant_fnct.h"
class vnl_definite_integral
{
- protected:
+ protected:
+ static vnl_integrant_fnct *pfnct_;
- static vnl_integrant_fnct *pfnct_;
-
- public:
+ public:
+ vnl_definite_integral() { pfnct_ = 0; }
- vnl_definite_integral() { pfnct_ = 0; }
-
- void set_fnct(vnl_integrant_fnct* f) { pfnct_ = f; }
+ void set_fnct(vnl_integrant_fnct* f) { pfnct_ = f; }
#if 0
- //: integration from a to b, in n steps
- virtual double integral(vnl_integrant_fnct *f, float a, float b, int n)=0;
-#endif
+ //: integration from a to b, in n steps
+ virtual double integral(vnl_integrant_fnct *f, float a, float b, int n)=0;
+#endif
- //: dector
- virtual ~vnl_definite_integral() { pfnct_ = 0; }
+ // destructor
+ virtual ~vnl_definite_integral() { pfnct_ = 0; }
};
#endif
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_det.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_det.h
index fc6fdf7b700f118b46d9967f2a5701c0d635ed28..82ee1152f29ed9da69c2fb92535df8bb48bf7936 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_det.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_det.h
@@ -30,22 +30,22 @@ template <class T> T vnl_det(T const *row0,
T const *row3);
//: Determinant of small size matrices
-// \relates vnl_matrix
+// \relatesalso vnl_matrix_fixed
template <class T>
inline T vnl_det(vnl_matrix_fixed<T,1,1> const& m) { return m[0][0]; }
//: Determinant of small size matrices
-// \relates vnl_matrix
+// \relatesalso vnl_matrix_fixed
template <class T>
inline T vnl_det(vnl_matrix_fixed<T,2,2> const& m) { return vnl_det(m[0],m[1]); }
//: Determinant of small size matrices
-// \relates vnl_matrix
+// \relatesalso vnl_matrix_fixed
template <class T>
inline T vnl_det(vnl_matrix_fixed<T,3,3> const& m) { return vnl_det(m[0],m[1],m[2]); }
//: Determinant of small size matrices
-// \relates vnl_matrix
+// \relatesalso vnl_matrix_fixed
template <class T>
inline T vnl_det(vnl_matrix_fixed<T,4,4> const& m) { return vnl_det(m[0],m[1],m[2],m[3]); }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_diag_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_diag_matrix.h
index 672506cdc630864638858bfe3d2022689efdca49..d1d7212b7946bf3e11702110a3960af8cbe26740 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_diag_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_diag_matrix.h
@@ -8,14 +8,16 @@
// \file
// \brief Contains class for diagonal matrices
// \author Andrew W. Fitzgibbon (Oxford RRG)
-// \date 5/8/96
+// \date 5 Aug 1996
//
// \verbatim
// Modifications
-// IMS (Manchester) 16/03/2001: Tidied up the documentation + added binary_io
+// IMS (Manchester) 16 Mar 2001: Tidied up the documentation + added binary_io
// Feb.2002 - Peter Vanroose - brief doxygen comment placed on single line
// Sep.2002 - Peter Vanroose - Added operator+, operator-, operator*
// Mar.2004 - Peter Vanroose - removed deprecated resize()
+// Oct.2010 - Peter Vanroose - mutators and setters now return *this
+// Jan.2011 - Peter Vanroose - added methods set_diagonal() & get_diagonal()
// \endverbatim
#include <vcl_cassert.h>
@@ -40,7 +42,7 @@ class vnl_diag_matrix
vnl_vector<T> diagonal_;
public:
- vnl_diag_matrix() {}
+ vnl_diag_matrix() : diagonal_() {}
//: Construct an empty diagonal matrix.
vnl_diag_matrix(unsigned nn) : diagonal_(nn) {}
@@ -67,7 +69,7 @@ class vnl_diag_matrix
// Computations--------------------------------------------------------------
- void invert_in_place();
+ vnl_diag_matrix& invert_in_place();
T determinant() const;
vnl_vector<T> solve(vnl_vector<T> const& b) const;
void solve(vnl_vector<T> const& b, vnl_vector<T>* out) const;
@@ -105,8 +107,17 @@ unsigned j
assert(r == c); assert (r<size()); return diagonal_[r];
}
+ //: Return a vector (copy) with the content of the (main) diagonal
+ inline vnl_vector<T> get_diagonal() const { return diagonal_; }
+
+ //: Return diagonal elements as a vector
+ inline vnl_vector<T> const& diagonal() const { return diagonal_; }
+
//: Set all diagonal elements of matrix to specified value.
- inline void fill_diagonal (T const& v) { diagonal_.fill(v); }
+ inline vnl_diag_matrix& fill_diagonal (T const& v) { diagonal_.fill(v); return *this; }
+
+ //: Sets the diagonal elements of this matrix to the specified list of values.
+ inline vnl_diag_matrix& set_diagonal(vnl_vector<T> const& v) { diagonal_ = v; return *this; }
// iterators
@@ -133,17 +144,14 @@ unsigned j
inline void set_size(int n) { diagonal_.set_size(n); }
inline void clear() { diagonal_.clear(); }
- inline void fill(T const &x) { diagonal_.fill(x); }
+ inline vnl_diag_matrix& fill(T const &x) { diagonal_.fill(x); return *this; }
//: Return pointer to the diagonal elements as a contiguous 1D C array;
inline T* data_block() { return diagonal_.data_block(); }
inline T const* data_block() const { return diagonal_.data_block(); }
- //: Return diagonal elements as a vector
- inline vnl_vector<T> const& diagonal() const { return diagonal_; }
-
//: Set diagonal elements using vector
- inline void set(vnl_vector<T> const& v) { diagonal_=v; }
+ inline vnl_diag_matrix& set(vnl_vector<T> const& v) { diagonal_=v; return *this; }
private:
#if VCL_NEED_FRIEND_FOR_TEMPLATE_OVERLOAD
@@ -152,7 +160,7 @@ unsigned j
};
//:
-// \relates vnl_diag_matrix
+// \relatesalso vnl_diag_matrix
template <class T>
vcl_ostream& operator<< (vcl_ostream&, vnl_diag_matrix<T> const&);
@@ -177,13 +185,14 @@ inline vnl_matrix<T> vnl_diag_matrix<T>::asMatrix() const
//: Invert a vnl_diag_matrix in-situ.
// Just replaces each element with its reciprocal.
template <class T>
-inline void vnl_diag_matrix<T>::invert_in_place()
+inline vnl_diag_matrix<T>& vnl_diag_matrix<T>::invert_in_place()
{
unsigned len = diagonal_.size();
T* d = data_block();
T one = T(1);
for (unsigned i = 0; i < len; ++i)
d[i] = one / d[i];
+ return *this;
}
//: Return determinant as product of diagonal values.
@@ -199,7 +208,7 @@ inline T vnl_diag_matrix<T>::determinant() const
}
//: Multiply two vnl_diag_matrices. Just multiply the diag elements - n flops
-// \relates vnl_diag_matrix
+// \relatesalso vnl_diag_matrix
template <class T>
inline vnl_diag_matrix<T> operator* (vnl_diag_matrix<T> const& A, vnl_diag_matrix<T> const& B)
{
@@ -211,8 +220,8 @@ inline vnl_diag_matrix<T> operator* (vnl_diag_matrix<T> const& A, vnl_diag_matri
}
//: Multiply a vnl_matrix by a vnl_diag_matrix. Just scales the columns - mn flops
-// \relates vnl_diag_matrix
-// \relates vnl_matrix
+// \relatesalso vnl_diag_matrix
+// \relatesalso vnl_matrix
template <class T>
inline vnl_matrix<T> operator* (vnl_matrix<T> const& A, vnl_diag_matrix<T> const& D)
{
@@ -225,8 +234,8 @@ inline vnl_matrix<T> operator* (vnl_matrix<T> const& A, vnl_diag_matrix<T> const
}
//: Multiply a vnl_diag_matrix by a vnl_matrix. Just scales the rows - mn flops
-// \relates vnl_diag_matrix
-// \relates vnl_matrix
+// \relatesalso vnl_diag_matrix
+// \relatesalso vnl_matrix
template <class T>
inline vnl_matrix<T> operator* (vnl_diag_matrix<T> const& D, vnl_matrix<T> const& A)
{
@@ -240,7 +249,7 @@ inline vnl_matrix<T> operator* (vnl_diag_matrix<T> const& D, vnl_matrix<T> const
}
//: Add two vnl_diag_matrices. Just add the diag elements - n flops
-// \relates vnl_diag_matrix
+// \relatesalso vnl_diag_matrix
template <class T>
inline vnl_diag_matrix<T> operator+ (vnl_diag_matrix<T> const& A, vnl_diag_matrix<T> const& B)
{
@@ -252,8 +261,8 @@ inline vnl_diag_matrix<T> operator+ (vnl_diag_matrix<T> const& A, vnl_diag_matri
}
//: Add a vnl_diag_matrix to a vnl_matrix. n adds, mn copies.
-// \relates vnl_diag_matrix
-// \relates vnl_matrix
+// \relatesalso vnl_diag_matrix
+// \relatesalso vnl_matrix
template <class T>
inline vnl_matrix<T> operator+ (vnl_matrix<T> const& A, vnl_diag_matrix<T> const& D)
{
@@ -267,8 +276,8 @@ inline vnl_matrix<T> operator+ (vnl_matrix<T> const& A, vnl_diag_matrix<T> const
}
//: Add a vnl_matrix to a vnl_diag_matrix. n adds, mn copies.
-// \relates vnl_diag_matrix
-// \relates vnl_matrix
+// \relatesalso vnl_diag_matrix
+// \relatesalso vnl_matrix
template <class T>
inline vnl_matrix<T> operator+ (vnl_diag_matrix<T> const& D, vnl_matrix<T> const& A)
{
@@ -276,7 +285,7 @@ inline vnl_matrix<T> operator+ (vnl_diag_matrix<T> const& D, vnl_matrix<T> const
}
//: Subtract two vnl_diag_matrices. Just subtract the diag elements - n flops
-// \relates vnl_diag_matrix
+// \relatesalso vnl_diag_matrix
template <class T>
inline vnl_diag_matrix<T> operator- (vnl_diag_matrix<T> const& A, vnl_diag_matrix<T> const& B)
{
@@ -288,8 +297,8 @@ inline vnl_diag_matrix<T> operator- (vnl_diag_matrix<T> const& A, vnl_diag_matri
}
//: Subtract a vnl_diag_matrix from a vnl_matrix. n adds, mn copies.
-// \relates vnl_diag_matrix
-// \relates vnl_matrix
+// \relatesalso vnl_diag_matrix
+// \relatesalso vnl_matrix
template <class T>
inline vnl_matrix<T> operator- (vnl_matrix<T> const& A, vnl_diag_matrix<T> const& D)
{
@@ -303,8 +312,8 @@ inline vnl_matrix<T> operator- (vnl_matrix<T> const& A, vnl_diag_matrix<T> const
}
//: Subtract a vnl_matrix from a vnl_diag_matrix. n adds, mn copies.
-// \relates vnl_diag_matrix
-// \relates vnl_matrix
+// \relatesalso vnl_diag_matrix
+// \relatesalso vnl_matrix
template <class T>
inline vnl_matrix<T> operator- (vnl_diag_matrix<T> const& D, vnl_matrix<T> const& A)
{
@@ -324,8 +333,8 @@ inline vnl_matrix<T> operator- (vnl_diag_matrix<T> const& D, vnl_matrix<T> const
}
//: Multiply a vnl_diag_matrix by a vnl_vector. n flops.
-// \relates vnl_diag_matrix
-// \relates vnl_vector
+// \relatesalso vnl_diag_matrix
+// \relatesalso vnl_vector
template <class T>
inline vnl_vector<T> operator* (vnl_diag_matrix<T> const& D, vnl_vector<T> const& A)
{
@@ -334,8 +343,8 @@ inline vnl_vector<T> operator* (vnl_diag_matrix<T> const& D, vnl_vector<T> const
}
//: Multiply a vnl_vector by a vnl_diag_matrix. n flops.
-// \relates vnl_diag_matrix
-// \relates vnl_vector
+// \relatesalso vnl_diag_matrix
+// \relatesalso vnl_vector
template <class T>
inline vnl_vector<T> operator* (vnl_vector<T> const& A, vnl_diag_matrix<T> const& D)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_diag_matrix_fixed.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_diag_matrix_fixed.h
new file mode 100644
index 0000000000000000000000000000000000000000..8265818c698dda397f9cb3af8aec7fca3fd3f2ca
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_diag_matrix_fixed.h
@@ -0,0 +1,327 @@
+// This is core/vnl/vnl_diag_matrix_fixed.h
+#ifndef vnl_diag_matrix_fixed_h_
+#define vnl_diag_matrix_fixed_h_
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma interface
+#endif
+//:
+// \file
+// \brief Contains class for diagonal matrices
+// \author Andrew W. Fitzgibbon (Oxford RRG)
+// \date 5 Aug 1996
+//
+// \verbatim
+// Modifications
+// IMS (Manchester) 16 Mar 2001: Tidied up the documentation + added binary_io
+// Feb.2002 - Peter Vanroose - brief doxygen comment placed on single line
+// Sep.2002 - Peter Vanroose - Added operator+, operator-, operator*
+// Mar.2004 - Peter Vanroose - removed deprecated resize()
+// Oct.2010 - Peter Vanroose - mutators and setters now return *this
+// Jan.2011 - Peter Vanroose - added methods set_diagonal() & get_diagonal()
+// \endverbatim
+
+#include <vcl_cassert.h>
+#include <vcl_iosfwd.h>
+#include <vnl/vnl_vector_fixed.h>
+#include <vnl/vnl_matrix_fixed.h>
+
+// forward declarations
+template <class T, unsigned int N> class vnl_diag_matrix_fixed;
+template <class T, unsigned int N> vnl_vector_fixed<T,N> operator*(vnl_diag_matrix_fixed<T,N> const&, vnl_vector_fixed<T,N> const&);
+
+//: stores a diagonal matrix as a single vector.
+// vnl_diag_matrix_fixed stores a diagonal matrix for time and space efficiency.
+// Specifically, only the diagonal elements are stored, and some matrix
+// operations (currently *, + and -) are overloaded to use more efficient
+// algorithms.
+
+export
+template <class T, unsigned int N>
+class vnl_diag_matrix_fixed
+{
+ vnl_vector_fixed<T,N> diagonal_;
+
+ public:
+ vnl_diag_matrix_fixed() : diagonal_() {}
+
+
+ //: Construct a diagonal matrix with diagonal elements equal to value.
+ vnl_diag_matrix_fixed(T const& value) : diagonal_(N, value) {}
+
+ //: Construct a diagonal matrix from a vnl_vector_fixed.
+ // The vector elements become the diagonal elements.
+ explicit vnl_diag_matrix_fixed(vnl_vector_fixed<T,N> const& that): diagonal_(that) {}
+ ~vnl_diag_matrix_fixed() {}
+
+ inline vnl_diag_matrix_fixed& operator=(vnl_diag_matrix_fixed<T,N> const& that) {
+ this->diagonal_ = that.diagonal_;
+ return *this;
+ }
+
+ // Operations----------------------------------------------------------------
+
+ //: In-place arithmetic operation
+ inline vnl_diag_matrix_fixed<T,N>& operator*=(T v) { diagonal_ *= v; return *this; }
+ //: In-place arithmetic operation
+ inline vnl_diag_matrix_fixed<T,N>& operator/=(T v) { diagonal_ /= v; return *this; }
+
+ // Computations--------------------------------------------------------------
+
+ inline vnl_diag_matrix_fixed& invert_in_place();
+ T determinant() const;
+ vnl_vector_fixed<T,N> solve(vnl_vector_fixed<T,N> const& b) const;
+ void solve(vnl_vector_fixed<T,N> const& b, vnl_vector_fixed<T,N>* out) const;
+
+ // Data Access---------------------------------------------------------------
+
+ inline T operator () (unsigned i, unsigned j) const {
+ return (i != j) ? T(0) : diagonal_[i];
+ }
+
+ inline T& operator () (unsigned i, unsigned j) {
+ assert(i == j);
+ return diagonal_[i];
+ }
+ inline T& operator() (unsigned i) { return diagonal_[i]; }
+ inline T const& operator() (unsigned i) const { return diagonal_[i]; }
+
+ inline T& operator[] (unsigned i) { return diagonal_[i]; }
+ inline T const& operator[] (unsigned i) const { return diagonal_[i]; }
+
+ //: set element with boundary checks.
+ inline void put (unsigned r, unsigned c, T const& v) {
+ assert(r == c); assert (r<size()); diagonal_[r] = v;
+ }
+
+ //: get element with boundary checks.
+ inline T get (unsigned r, unsigned c) const {
+ assert(r == c); assert (r<size()); return diagonal_[r];
+ }
+
+ //: Return a vector (copy) with the content of the (main) diagonal
+ inline vnl_vector_fixed<T,N> get_diagonal() const { return diagonal_; }
+
+ //: Return diagonal elements as a vector
+ inline vnl_vector_fixed<T,N> const& diagonal() const { return diagonal_; }
+
+ //: Set all diagonal elements of matrix to specified value.
+ inline vnl_diag_matrix_fixed& fill_diagonal (T const& v) { diagonal_.fill(v); return *this; }
+
+ //: Sets the diagonal elements of this matrix to the specified list of values.
+ inline vnl_diag_matrix_fixed& set_diagonal(vnl_vector_fixed<T,N> const& v) { diagonal_ = v; return *this; }
+
+ // iterators
+
+ typedef typename vnl_vector_fixed<T,N>::iterator iterator;
+ inline iterator begin() { return diagonal_.begin(); }
+ inline iterator end() { return diagonal_.end(); }
+ typedef typename vnl_vector_fixed<T,N>::const_iterator const_iterator;
+ inline const_iterator begin() const { return diagonal_.begin(); }
+ inline const_iterator end() const { return diagonal_.end(); }
+
+ inline unsigned size() const { return diagonal_.size(); }
+ inline unsigned rows() const { return diagonal_.size(); }
+ inline unsigned cols() const { return diagonal_.size(); }
+ inline unsigned columns() const { return diagonal_.size(); }
+
+ // Need this until we add a vnl_diag_matrix_fixed ctor to vnl_matrix;
+ inline vnl_matrix_fixed<T,N,N> as_matrix_fixed() const;
+
+ inline vnl_matrix_fixed<T,N,N> as_ref() const { return as_matrix_fixed(); }
+
+ // This is as good as a vnl_diag_matrix_fixed ctor for vnl_matrix_fixed:
+ inline operator vnl_matrix_fixed<T,N,N> () const { return as_matrix_fixed(); }
+
+ inline vnl_diag_matrix_fixed& fill(T const &x) { diagonal_.fill(x); return *this; }
+
+ //: Return pointer to the diagonal elements as a contiguous 1D C array;
+ inline T* data_block() { return diagonal_.data_block(); }
+ inline T const* data_block() const { return diagonal_.data_block(); }
+
+ //: Set diagonal elements using vector, then return *this
+ inline vnl_diag_matrix_fixed& set(vnl_vector_fixed<T,N> const& v) { diagonal_=v; return *this; }
+
+ private:
+ #if VCL_NEED_FRIEND_FOR_TEMPLATE_OVERLOAD
+ friend vnl_vector_fixed<T,N> operator*(vnl_diag_matrix_fixed<T,N> const&,vnl_vector_fixed<T,N> const&);
+ #endif
+};
+
+//:
+// \relatesalso vnl_diag_matrix_fixed
+template <class T, unsigned int N>
+vcl_ostream& operator<< (vcl_ostream&, vnl_diag_matrix_fixed<T,N> const&);
+
+//: Convert a vnl_diag_matrix_fixed to a Matrix.
+template <class T, unsigned int N>
+inline vnl_matrix_fixed<T,N,N> vnl_diag_matrix_fixed<T,N>::as_matrix_fixed() const
+{
+ vnl_matrix_fixed<T,N,N> ret;
+ for (unsigned i = 0; i < N; ++i)
+ {
+ unsigned j;
+ for (j = 0; j < i; ++j)
+ ret(i,j) = T(0);
+ for (j = i+1; j < N; ++j)
+ ret(i,j) = T(0);
+ ret(i,i) = diagonal_[i];
+ }
+ return ret;
+}
+
+//: Invert a vnl_diag_matrix_fixed in-situ, then returns *this.
+// Just replaces each element with its reciprocal.
+template <class T, unsigned int N>
+inline vnl_diag_matrix_fixed<T,N>& vnl_diag_matrix_fixed<T,N>::invert_in_place()
+{
+ T* d = data_block();
+ T one = T(1);
+ for (unsigned i = 0; i < N; ++i)
+ d[i] = one / d[i];
+ return *this;
+}
+
+//: Return determinant as product of diagonal values.
+template <class T, unsigned int N>
+inline T vnl_diag_matrix_fixed<T,N>::determinant() const
+{
+ T det = T(1);
+ T const* d = data_block();
+ for (unsigned i = 0; i < N; ++i)
+ det *= d[i];
+ return det;
+}
+
+//: Multiply two vnl_diag_matrices. Just multiply the diag elements - n flops
+// \relatesalso vnl_diag_matrix_fixed
+template <class T, unsigned int N>
+inline vnl_diag_matrix_fixed<T,N> operator* (vnl_diag_matrix_fixed<T,N> const& A, vnl_diag_matrix_fixed<T,N> const& B)
+{
+ vnl_diag_matrix_fixed<T,N> ret = A;
+ for (unsigned i = 0; i < N; ++i)
+ ret(i,i) *= B(i,i);
+ return ret;
+}
+
+//: Multiply a vnl_matrix by a vnl_diag_matrix_fixed. Just scales the columns - mn flops
+// \relatesalso vnl_diag_matrix_fixed
+// \relatesalso vnl_matrix
+template <class T, unsigned int R, unsigned int C>
+inline vnl_matrix_fixed<T,R,C> operator* (vnl_matrix_fixed<T,R,C> const& A, vnl_diag_matrix_fixed<T,C> const& D)
+{
+ vnl_matrix_fixed<T,R,C> ret;
+ for (unsigned i = 0; i < R; ++i)
+ for (unsigned j = 0; j < C; ++j)
+ ret(i,j) = A(i,j) * D(j,j);
+ return ret;
+}
+
+//: Multiply a vnl_diag_matrix_fixed by a vnl_matrix. Just scales the rows - mn flops
+// \relatesalso vnl_diag_matrix_fixed
+// \relatesalso vnl_matrix
+template <class T, unsigned int R, unsigned int C>
+inline vnl_matrix_fixed<T,R,C> operator* (vnl_diag_matrix_fixed<T,R> const& D, vnl_matrix_fixed<T,R,C> const& A)
+{
+ vnl_matrix_fixed<T,R,C> ret;
+ T const* d = D.data_block();
+ for (unsigned i = 0; i < R; ++i)
+ for (unsigned j = 0; j < C; ++j)
+ ret(i,j) = A(i,j) * d[i];
+ return ret;
+}
+
+//: Add two vnl_diag_matrices. Just add the diag elements - n flops
+// \relatesalso vnl_diag_matrix_fixed
+template <class T, unsigned int N>
+inline vnl_diag_matrix_fixed<T,N> operator+ (vnl_diag_matrix_fixed<T,N> const& A, vnl_diag_matrix_fixed<T,N> const& B)
+{
+ vnl_diag_matrix_fixed<T,N> ret = A;
+ for (unsigned i = 0; i < N; ++i)
+ ret(i,i) += B(i,i);
+ return ret;
+}
+
+//: Add a vnl_diag_matrix_fixed to a vnl_matrix. n adds, mn copies.
+// \relatesalso vnl_diag_matrix_fixed
+// \relatesalso vnl_matrix
+template <class T, unsigned int N>
+inline vnl_matrix_fixed<T,N,N> operator+ (vnl_matrix_fixed<T,N,N> const& A, vnl_diag_matrix_fixed<T,N> const& D)
+{
+ vnl_matrix_fixed<T,N,N> ret(A);
+ T const* d = D.data_block();
+ for (unsigned j = 0; j < N; ++j)
+ ret(j,j) += d[j];
+ return ret;
+}
+
+//: Add a vnl_matrix to a vnl_diag_matrix_fixed. n adds, mn copies.
+// \relatesalso vnl_diag_matrix_fixed
+// \relatesalso vnl_matrix
+template <class T, unsigned int N>
+inline vnl_matrix_fixed<T,N,N> operator+ (vnl_diag_matrix_fixed<T,N> const& D, vnl_matrix_fixed<T,N,N> const& A)
+{
+ return A + D;
+}
+
+//: Subtract two vnl_diag_matrices. Just subtract the diag elements - n flops
+// \relatesalso vnl_diag_matrix_fixed
+template <class T, unsigned int N>
+inline vnl_diag_matrix_fixed<T,N> operator- (vnl_diag_matrix_fixed<T,N> const& A, vnl_diag_matrix_fixed<T,N> const& B)
+{
+ vnl_diag_matrix_fixed<T,N> ret(A);
+ for (unsigned i = 0; i < N; ++i)
+ ret(i,i) -= B(i,i);
+ return ret;
+}
+
+//: Subtract a vnl_diag_matrix_fixed from a vnl_matrix. n adds, mn copies.
+// \relatesalso vnl_diag_matrix_fixed
+// \relatesalso vnl_matrix
+template <class T, unsigned int N>
+inline vnl_matrix_fixed<T,N,N> operator- (vnl_matrix_fixed<T,N,N> const& A, vnl_diag_matrix_fixed<T,N> const& D)
+{
+ vnl_matrix_fixed<T,N,N> ret(A);
+ T const* d = D.data_block();
+ for (unsigned j = 0; j < N; ++j)
+ ret(j,j) -= d[j];
+ return ret;
+}
+
+//: Subtract a vnl_matrix from a vnl_diag_matrix_fixed. n adds, mn copies.
+// \relatesalso vnl_diag_matrix_fixed
+// \relatesalso vnl_matrix
+template <class T, unsigned int N>
+inline vnl_matrix_fixed<T,N,N> operator- (vnl_diag_matrix_fixed<T,N> const& D, vnl_matrix_fixed<T,N,N> const& A)
+{
+ vnl_matrix_fixed<T,N,N> ret;
+ T const* d = D.data_block();
+ for (unsigned i = 0; i < N; ++i)
+ {
+ for (unsigned j = 0; j < i; ++j)
+ ret(i,j) = -A(i,j);
+ for (unsigned j = i+1; j < N; ++j)
+ ret(i,j) = -A(i,j);
+ ret(i,i) = d[i] - A(i,i);
+ }
+ return ret;
+}
+
+//: Multiply a vnl_diag_matrix_fixed by a vnl_vector_fixed. n flops.
+// \relatesalso vnl_diag_matrix_fixed
+// \relatesalso vnl_vector_fixed
+template <class T, unsigned int N>
+inline vnl_vector_fixed<T,N> operator* (vnl_diag_matrix_fixed<T,N> const& D, vnl_vector_fixed<T,N> const& A)
+{
+ return element_product(D.diagonal(), A);
+}
+
+//: Multiply a vnl_vector_fixed by a vnl_diag_matrix_fixed. n flops.
+// \relatesalso vnl_diag_matrix_fixed
+// \relatesalso vnl_vector_fixed
+template <class T, unsigned int N>
+inline vnl_vector_fixed<T,N> operator* (vnl_vector_fixed<T,N> const& A, vnl_diag_matrix_fixed<T,N> const& D)
+{
+ return element_product(D.diagonal(), A);
+}
+
+#endif // vnl_diag_matrix_fixed_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_diag_matrix_fixed.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_diag_matrix_fixed.txx
new file mode 100644
index 0000000000000000000000000000000000000000..d4ea7f605dc8af6e5240b84d541fc350a04818dc
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_diag_matrix_fixed.txx
@@ -0,0 +1,85 @@
+// This is core/vnl/vnl_diag_matrix_fixed.txx
+#ifndef vnl_diag_matrix_fixed_txx_
+#define vnl_diag_matrix_fixed_txx_
+//:
+// \file
+
+#include "vnl_diag_matrix_fixed.h"
+
+#include <vcl_iostream.h>
+
+
+//: Return inv(D) * b.
+template <class T, unsigned int N>
+vnl_vector_fixed<T,N> vnl_diag_matrix_fixed<T,N>::solve(vnl_vector_fixed<T,N> const& b) const
+{
+ vnl_vector_fixed<T,N> ret;
+ for (unsigned i = 0; i < N; ++i)
+ ret[i] = b[i] / diagonal_[i];
+ return ret;
+}
+
+//: Return inv(D) * b.
+template <class T, unsigned int N>
+void vnl_diag_matrix_fixed<T,N>::solve(vnl_vector_fixed<T,N> const& b, vnl_vector_fixed<T,N>* out) const
+{
+ for (unsigned i = 0; i < N; ++i)
+ (*out)[i] = b[i] / diagonal_[i];
+}
+
+//: Print in MATLAB diag([1 2 3]) form.
+template <class T, unsigned int N>
+vcl_ostream& operator<< (vcl_ostream& s, const vnl_diag_matrix_fixed<T,N>& D)
+{
+ s << "diag([ ";
+ for (unsigned i=0; i<N; ++i)
+ s << D(i,i) << ' ';
+ return s << "])";
+}
+
+#if 0
+//: Compares two matrices for component-wise equality within a small epsilon
+template <class T, unsigned int N>
+bool epsilon_equals (const vnl_diag_matrix_fixed<T>& m1, const vnl_diag_matrix_fixed<T>& m2,
+ double alt_epsilon)
+{
+ if (alt_epsilon < 0)
+ {
+ vcl_cerr << "Negative alt_epsilon passed to epsilon_equals: returning false\n";
+ return false;
+ }
+
+ if (m1.rows() != m2.rows())
+ return false; // different sizes.
+
+ double local_epsilon;
+ if (alt_epsilon == 0)
+ local_epsilon = comparison_epsilon<T>::epsilon;
+ else
+ local_epsilon = alt_epsilon;
+
+ for (unsigned long i = 0; i < N; i++) {
+#if 0
+ T result = m1(i,i) - m2(i,i);
+ if (result < 0)
+ result = 0 - result;
+ if (result > local_epsilon)
+ return false;
+#endif
+ if (m1(i,i) - m2(i,i) > local_epsilon ||
+ m2(i,i) - m1(i,i) > local_epsilon) // avoid using vcl_abs()
+ return false;
+ }
+ return true;
+}
+#endif
+
+
+#undef VNL_DIAG_MATRIX_FIXED_INSTANTIATE
+#define VNL_DIAG_MATRIX_FIXED_INSTANTIATE(T , N ) \
+template class vnl_diag_matrix_fixed<T , N >; \
+template vcl_ostream& operator<< (vcl_ostream& s, vnl_diag_matrix_fixed<T , N > const &)
+
+//template bool epsilon_equals (vnl_diag_matrix_fixed<T > const & , vnl_diag_matrix_fixed<T > const & , double)
+
+#endif // vnl_diag_matrix_fixed_txx_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_double_2.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_double_2.h
index e2cbabd75f2bf8e1ed91311114ee434a2a58fb90..869b7ee4974be7abbe41e6ff0d221606a839f914 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_double_2.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_double_2.h
@@ -23,6 +23,7 @@
vnl_T_n_impl(double,2);
//: Cross product of two 2-vectors
+// \relatesalso vnl_vector_fixed
inline
double vnl_cross_2d(vnl_double_2 const& v1, vnl_double_2 const& v2)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_double_3.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_double_3.h
index 8fdd4a0ee36763c0efabf6dc48eb455a7607894d..f1ce42e5ac79a3439e777af043fea9fc1b75531b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_double_3.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_double_3.h
@@ -23,6 +23,7 @@
vnl_T_n_impl(double,3);
//: Cross product of two 3-vectors
+// \relatesalso vnl_vector_fixed
inline
vnl_double_3 vnl_cross_3d(vnl_double_3 const& v1, vnl_double_3 const& v2)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_erf.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_erf.h
index a3b1bdfbef98dd32e7ba502ce108594f827f76f6..36661b67d5bf9c98301a8e40bc02fa085fadcc1f 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_erf.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_erf.h
@@ -13,7 +13,7 @@
// erf(x) = (2/sqrt(pi)) Integral from 0 to x (exp(-t^2) dt)
// \note the output ranges from -1 to 1, and vnl_erf(0) = 0.
inline double vnl_erf(double x)
-{ return (x<0)?-vnl_gamma_p(0.5,x*x):vnl_gamma_p(0.5,x*x); };
+{ return (x<0)?-vnl_gamma_p(0.5,x*x):vnl_gamma_p(0.5,x*x); }
//: The Complementary Error function.
// erfc(x) = 1 - erf(x) = 1 - (2/sqrt(pi)) Integral from 0 to x (exp(-t^2) dt)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_finite.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_finite.h
index 133bf34479de7d220e91373cb956a911e64604ab..9008e0b6eb2f19cc832f6fb1893af79be00f28f8 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_finite.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_finite.h
@@ -28,11 +28,13 @@
// 1 June 2002 - Peter Vanroose - added totient(), decompose(), is_unit(), order(), log(), exp().
// 4 June 2002 - Peter Vanroose - renamed class and file name
// 8 June 2002 - Peter Vanroose - added vnl_finite_int_poly<N,M>
+// 16 Dec 2007 - Peter Vanroose - more efficient implementation of Ntothe()
// \endverbatim
#include <vcl_iostream.h>
#include <vcl_cassert.h>
#include <vcl_vector.h>
+#include <vcl_cstddef.h>
//: finite modulo-N arithmetic
//
@@ -112,7 +114,7 @@ class vnl_finite_int
//: Return the Euler totient function, i.e., the number of units of this ring
// This number also equals the periodicity of the exponent: every unit,
// when raised to this power, yields 1.
- static inline unsigned int totient() {
+ static unsigned int totient() {
static unsigned int t_ = 0; // cached value
if (t_ != 0) return t_;
vcl_vector<unsigned int> d = decompose();
@@ -128,7 +130,7 @@ class vnl_finite_int
//: Multiplicative inverse.
// Uses exp() and log() for efficient computation, unless log() is not defined.
- inline Base reciproc() const {
+ Base reciproc() const {
assert(is_unit());
if (val_==1) return *this;
Base z = smallest_generator();
@@ -184,7 +186,7 @@ class vnl_finite_int
inline unsigned int additive_order() const { if (val_ == 0) return 1; return N/gcd(val_); }
//: The multiplicative order of x is the smallest r (>0) such that x^r == 1.
- inline unsigned int multiplicative_order() const {
+ unsigned int multiplicative_order() const {
if (mo_ != 0) return mo_;
if (gcd(val_) != 1) return -1; // should actually return infinity
Base y = val_;
@@ -223,7 +225,7 @@ class vnl_finite_int
}
//: Return the smallest nonnegative exponent r for which x=g^r, where g is the smallest generator.
- inline unsigned int log() const {
+ unsigned int log() const {
if (is_zero_divisor()) return -1; // should actually return minus infinity
if (lp1_ != 0) return lp1_-1;
Base z = smallest_generator();
@@ -260,7 +262,7 @@ class vnl_finite_int
};
//: formatted output
-// \relates vnl_finite_int
+// \relatesalso vnl_finite_int
template <int N>
inline vcl_ostream& operator<< (vcl_ostream& s, vnl_finite_int<N> const& r)
{
@@ -268,7 +270,7 @@ inline vcl_ostream& operator<< (vcl_ostream& s, vnl_finite_int<N> const& r)
}
//: simple input
-// \relates vnl_finite_int
+// \relatesalso vnl_finite_int
template <int N>
inline vcl_istream& operator>> (vcl_istream& s, vnl_finite_int<N>& r)
{
@@ -276,19 +278,23 @@ inline vcl_istream& operator>> (vcl_istream& s, vnl_finite_int<N>& r)
}
//: Returns the sum of two finite int numbers.
-// \relates vnl_finite_int
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator+ (vnl_finite_int<N> const& r1, vnl_finite_int<N> const& r2)
{
vnl_finite_int<N> result(r1); return result += r2;
}
+//: Returns the sum of two finite int numbers.
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator+ (vnl_finite_int<N> const& r1, int r2)
{
vnl_finite_int<N> result(r1); return result += r2;
}
+//: Returns the sum of two finite int numbers.
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator+ (int r2, vnl_finite_int<N> const& r1)
{
@@ -296,19 +302,23 @@ inline vnl_finite_int<N> operator+ (int r2, vnl_finite_int<N> const& r1)
}
//: Returns the difference of two finite int numbers.
-// \relates vnl_finite_int
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator- (vnl_finite_int<N> const& r1, vnl_finite_int<N> const& r2)
{
vnl_finite_int<N> result(r1); return result -= r2;
}
+//: Returns the difference of two finite int numbers.
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator- (vnl_finite_int<N> const& r1, int r2)
{
vnl_finite_int<N> result(r1); return result -= r2;
}
+//: Returns the difference of two finite int numbers.
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator- (int r2, vnl_finite_int<N> const& r1)
{
@@ -316,19 +326,23 @@ inline vnl_finite_int<N> operator- (int r2, vnl_finite_int<N> const& r1)
}
//: Returns the product of two finite int numbers.
-// \relates vnl_finite_int
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator* (vnl_finite_int<N> const& r1, vnl_finite_int<N> const& r2)
{
vnl_finite_int<N> result(r1); return result *= r2;
}
+//: Returns the product of two finite int numbers.
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator* (vnl_finite_int<N> const& r1, int r2)
{
vnl_finite_int<N> result(r1); return result *= r2;
}
+//: Returns the product of two finite int numbers.
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator* (int r2, vnl_finite_int<N> const& r1)
{
@@ -337,38 +351,56 @@ inline vnl_finite_int<N> operator* (int r2, vnl_finite_int<N> const& r1)
//: Returns the quotient of two finite int numbers.
// Uses r2.reciproc() for efficient computation.
-// \relates vnl_finite_int
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator/(vnl_finite_int<N> const& r1, vnl_finite_int<N> const& r2)
{
assert(r2.is_unit()); return r1 == 0 ? vnl_finite_int<N>(0) : r1*r2.reciproc();
}
+//: Returns the quotient of two finite int numbers.
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator/ (vnl_finite_int<N> const& r1, int r2)
{
vnl_finite_int<N> result(r1); return result /= r2;
}
+//: Returns the quotient of two finite int numbers.
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> operator/ (int r1, vnl_finite_int<N> const& r2)
{
vnl_finite_int<N> result(r1); return result /= r2;
}
+//:
+// \relatesalso vnl_finite_int
template <int N>
inline bool operator== (int r1, vnl_finite_int<N> const& r2) { return r2==r1; }
+
+//:
+// \relatesalso vnl_finite_int
template <int N>
inline bool operator!= (int r1, vnl_finite_int<N> const& r2) { return r2!=r1; }
//:
-// \relates vnl_finite_int
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> vnl_math_squared_magnitude(vnl_finite_int<N> const& x) { return x*x; }
+
+//:
+// \relatesalso vnl_finite_int
template <int N>
inline vnl_finite_int<N> vnl_math_sqr(vnl_finite_int<N> const& x) { return x*x; }
+
+//:
+// \relatesalso vnl_finite_int
template <int N>
inline bool vnl_math_isnan(vnl_finite_int<N> const& ){return false;}
+
+//:
+// \relatesalso vnl_finite_int
template <int N>
inline bool vnl_math_isfinite(vnl_finite_int<N> const& x){return true;}
@@ -394,8 +426,8 @@ class vnl_finite_int_poly
vcl_vector<Scalar> val_; //!< M-tuple (or degree M-1 polynomial) representing this
- // This essentially implements std::pow(int,int) which is not always available
- static unsigned int Ntothe(unsigned int m) { return m==0?1:N*Ntothe(m-1); }
+ // This essentially implements std::pow(N,int) which is not always available
+ static unsigned int Ntothe(unsigned int m) { return m==0?1:m==1?N:Ntothe(m/2)*Ntothe((m+1)/2); }
public:
//: The number of different finite_int polynomials of this type
static unsigned int cardinality() { return Ntothe(M); }
@@ -412,10 +444,10 @@ class vnl_finite_int_poly
inline ~vnl_finite_int_poly() {}
//: Formal degree of this polynomial
- inline unsigned int deg() const { return val_.size() - 1; }
+ inline vcl_size_t deg() const { return val_.size() - 1; }
//: Effective degree of this polynomial; equals -1 when this polynomial is 0.
- inline int degree() const { for (int i=deg(); i>=0; --i) if (val_[i]!=0) return i; return -1; }
+ int degree() const { for (int i=deg(); i>=0; --i) if (val_[i]!=0) return i; return -1; }
//: Access to individual coefficients
inline Scalar operator[](unsigned int i) const { assert(i<M); return i<=deg() ? val_[i] : Scalar(0); }
@@ -425,7 +457,7 @@ class vnl_finite_int_poly
inline Base& operator=(Scalar const& n) { val_ = vcl_vector<Scalar>(1); val_[0] = n; return *this; }
//: Comparison of finite int polys.
- inline bool operator==(Base const& x) const {
+ bool operator==(Base const& x) const {
for (unsigned int i=0; i<=deg(); ++i)
if (val_[i] != x[i]) return false;
for (unsigned int i=deg()+1; i<=x.deg(); ++i)
@@ -433,7 +465,7 @@ class vnl_finite_int_poly
return true;
}
inline bool operator!=(Base const& x) const { return !operator==(x); }
- inline bool operator==(Scalar const& x) const {
+ bool operator==(Scalar const& x) const {
if (x!=val_[0]) return false;
for (unsigned int i=1; i<=deg(); ++i) if (val_[i] != 0) return false;
return true;
@@ -441,21 +473,21 @@ class vnl_finite_int_poly
inline bool operator!=(Scalar const& x) const { return !operator==(x); }
//: Unary minus - returns the additive inverse
- inline Base operator-() const { vcl_vector<Scalar> p = val_; for (unsigned int i=0; i<p.size(); ++i) p[i]=-p[i]; return p; }
+ Base operator-() const { vcl_vector<Scalar> p = val_; for (unsigned int i=0; i<p.size(); ++i) p[i]=-p[i]; return p; }
//: Unary plus - returns the current polynomial
inline Base operator+() const { return *this; }
//: Unary not - returns true if finite int poly is equal to zero.
- inline bool operator!() const { for (unsigned int i=0; i<=deg(); ++i) if (val_[i] != 0) return false; return true; }
+ bool operator!() const { for (unsigned int i=0; i<=deg(); ++i) if (val_[i] != 0) return false; return true; }
//: Plus&assign: replace lhs by lhs + rhs
- inline Base& operator+=(Base const& r) {
+ Base& operator+=(Base const& r) {
for (unsigned int i=0; i<=r.deg(); ++i)
if (i<=deg()) val_[i] += r[i];
else val_.push_back(r[i]);
return *this;
}
//: Minus&assign: replace lhs by lhs - rhs
- inline Base& operator-=(Base const& r) {
+ Base& operator-=(Base const& r) {
for (unsigned int i=0; i<=r.deg(); ++i)
if (i<=deg()) val_[i] -= r[i];
else val_.push_back(-r[i]);
@@ -463,10 +495,10 @@ class vnl_finite_int_poly
}
//: Scalar multiple of this
- inline Base& operator*=(Scalar const& n) { for (unsigned int i=0; i<=deg(); ++i) val_[i] *= n; return *this; }
+ Base& operator*=(Scalar const& n) { for (unsigned int i=0; i<=deg(); ++i) val_[i] *= n; return *this; }
//: The additive order of x is the smallest positive r such that r*x == 0.
- inline unsigned int additive_order() const {
+ unsigned int additive_order() const {
unsigned int r = N;
for (unsigned int i=0; i<=deg(); ++i)
if (val_[i] != 0) r=Scalar::gcd(val_[i],r);
@@ -493,7 +525,7 @@ class vnl_finite_int_poly
}
//: Multiply&assign: replace lhs by lhs * rhs, modulo the "modulo" polynomial
- inline Base& operator*=(Base const& r) {
+ Base& operator*=(Base const& r) {
Base x = *this; *this = r; *this *= x[0];
while (val_.size() < M) val_.push_back(0);
for (int i=1; i<=x.degree(); ++i)
@@ -534,7 +566,7 @@ class vnl_finite_int_poly
private:
//: Add x to the i-th degree coefficient of val_, possibly reducing modulo the "modulo" poly.
- inline void add_modulo_poly(unsigned int m, Scalar const& x)
+ void add_modulo_poly(unsigned int m, Scalar const& x)
{
if (m < M) val_[m] += x;
else {
@@ -545,7 +577,7 @@ class vnl_finite_int_poly
};
//: Returns the sum of two finite int polynomials.
-// \relates vnl_finite_int_poly
+// \relatesalso vnl_finite_int_poly
template <int N, int M>
inline vnl_finite_int_poly<N,M> operator+ (vnl_finite_int_poly<N,M> const& r1, vnl_finite_int_poly<N,M> const& r2)
{
@@ -553,7 +585,7 @@ inline vnl_finite_int_poly<N,M> operator+ (vnl_finite_int_poly<N,M> const& r1, v
}
//: Returns the difference of two finite int polynomials.
-// \relates vnl_finite_int_poly
+// \relatesalso vnl_finite_int_poly
template <int N, int M>
inline vnl_finite_int_poly<N,M> operator- (vnl_finite_int_poly<N,M> const& r1, vnl_finite_int_poly<N,M> const& r2)
{
@@ -561,14 +593,17 @@ inline vnl_finite_int_poly<N,M> operator- (vnl_finite_int_poly<N,M> const& r1, v
}
//: Returns a scalar multiple of a finite int polynomial.
-// \relates vnl_finite_int
-// \relates vnl_finite_int_poly
+// \relatesalso vnl_finite_int
+// \relatesalso vnl_finite_int_poly
template <int N, int M>
inline vnl_finite_int_poly<N,M> operator* (vnl_finite_int_poly<N,M> const& r1, vnl_finite_int<N> const& r2)
{
vnl_finite_int_poly<N,M> result(r1); return result *= r2;
}
+//: Returns a scalar multiple of a finite int polynomial.
+// \relatesalso vnl_finite_int
+// \relatesalso vnl_finite_int_poly
template <int N, int M>
inline vnl_finite_int_poly<N,M> operator* (vnl_finite_int<N> const& r2, vnl_finite_int_poly<N,M> const& r1)
{
@@ -578,7 +613,7 @@ inline vnl_finite_int_poly<N,M> operator* (vnl_finite_int<N> const& r2, vnl_fini
//: Multiplies two finite int polynomials.
// NOTE: this requires the "modulo" polynomial to be set.
// Do this by calling modulo_polynomial(p), where p is a vector of length M+1.
-// \relates vnl_finite_int_poly
+// \relatesalso vnl_finite_int_poly
template <int N, int M>
inline vnl_finite_int_poly<N,M> operator* (vnl_finite_int_poly<N,M> const& r1, vnl_finite_int_poly<N,M> const& r2)
{
@@ -586,7 +621,7 @@ inline vnl_finite_int_poly<N,M> operator* (vnl_finite_int_poly<N,M> const& r1, v
}
//: formatted output
-// \relates vnl_finite_int_poly
+// \relatesalso vnl_finite_int_poly
template <int N, int M>
inline vcl_ostream& operator<< (vcl_ostream& s, vnl_finite_int_poly<N,M> const& r)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_float_2.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_float_2.h
index 4b7fd3e83ada10077db6a6059f23cdcf82b6c1fd..52d34c35d3d10504d2c13daf2128a229f3dfe02b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_float_2.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_float_2.h
@@ -23,6 +23,7 @@
vnl_T_n_impl(float,2);
//: Cross product of two 2-vectors
+// \relatesalso vnl_vector_fixed
inline
float vnl_cross_2d(vnl_float_2 const& v1, vnl_float_2 const& v2)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_float_3.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_float_3.h
index 499fce06f3f9d9a6bc9174fcfb613e580140136f..c198bf8923e62d647f644952ebc7b04bb28ac1b9 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_float_3.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_float_3.h
@@ -23,6 +23,7 @@
vnl_T_n_impl(float,3);
//: Cross product of two 3-vectors
+// \relatesalso vnl_vector_fixed
inline
vnl_float_3 vnl_cross_3d(vnl_float_3 const& v1, vnl_float_3 const& v2)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_fortran_copy_fixed.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_fortran_copy_fixed.h
new file mode 100644
index 0000000000000000000000000000000000000000..2ee4381a98a36957398405cedb2c7c6c86774697
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_fortran_copy_fixed.h
@@ -0,0 +1,46 @@
+// This is core/vnl/vnl_fortran_copy_fixed.h
+#ifndef vnl_fortran_copy_fixed_h_
+#define vnl_fortran_copy_fixed_h_
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma interface
+#endif
+//:
+// \file
+// \brief Convert row-stored matrix to column-stored
+// \author Andrew W. Fitzgibbon, Oxford RRG
+// \date 29 Aug 96
+//
+// convert C format (row-stored) matrix to fortran format (column-stored) matrix
+//
+// \verbatim
+// Modifications
+// LSB (Manchester) 23/3/01 Tidied documentation
+// Feb.2002 - Peter Vanroose - brief doxygen comment placed on single line
+// Oct.2009 - Converted for a stack-storage fixed-size version
+// \endverbatim
+//
+//-----------------------------------------------------------------------------
+
+#include <vnl/vnl_matrix_fixed.h>
+//: Convert row-stored matrix to column-stored.
+// Convert C format (row-stored) matrix to fortran format (column-stored) matrix.
+template <class T, unsigned R, unsigned C>
+class vnl_fortran_copy_fixed
+{
+ public:
+ // Constructors/Destructors--------------------------------------------------
+
+ vnl_fortran_copy_fixed(vnl_matrix_fixed<T, R, C> const & M);
+
+ // Operations----------------------------------------------------------------
+ operator T*() { return data; }
+
+ protected:
+ // Data Members--------------------------------------------------------------
+ T data[R*C];
+
+ private:
+ // Helpers-------------------------------------------------------------------
+};
+
+#endif // vnl_fortran_copy_fixed_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_fortran_copy_fixed.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_fortran_copy_fixed.txx
new file mode 100644
index 0000000000000000000000000000000000000000..afd0781b39e753169f69745f6744076fca2949ea
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_fortran_copy_fixed.txx
@@ -0,0 +1,28 @@
+// This is core/vnl/vnl_fortran_copy_fixed.txx
+#ifndef vnl_fortran_copy_fixed_txx_
+#define vnl_fortran_copy_fixed_txx_
+//:
+// \file
+// \author Andrew W. Fitzgibbon, Oxford RRG
+// \date 29 Aug 96
+//-----------------------------------------------------------------------------
+
+#include "vnl_fortran_copy_fixed.h"
+
+//: Generate a fortran column-storage matrix from the given matrix.
+template <class T, unsigned int R, unsigned int C>
+vnl_fortran_copy_fixed<T,R,C>::vnl_fortran_copy_fixed(vnl_matrix_fixed<T,R,C> const & M)
+{
+ T *d = data;
+ for (unsigned j = 0; j < C; ++j)
+ for (unsigned i = 0; i < R; ++i)
+ *d++ = M(i,j);
+}
+
+
+//--------------------------------------------------------------------------------
+
+#undef VNL_FORTRAN_COPY_FIXED_INSTANTIATE
+#define VNL_FORTRAN_COPY_FIXED_INSTANTIATE(T , R , C ) template class vnl_fortran_copy_fixed<T , R , C >
+
+#endif // vnl_fortran_copy_fixed_txx_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_gamma.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_gamma.cxx
index 4f998d076eade907c348e3226f10269ad6eae869..86b6de11580ffeb12dcfafd66cc0045bd0ae4976 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_gamma.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_gamma.cxx
@@ -55,7 +55,7 @@ static double vnl_gamma_series(double a, double x)
return sum*vcl_exp(-x+a*vcl_log(x)-vnl_log_gamma(a));
}
else if (x < 0.0)
- assert(!"vnl_gamma_series : x less than 0");
+ assert(!"vnl_gamma_series - x less than 0");
return 0.0;
}
@@ -93,7 +93,7 @@ static double vnl_gamma_cont_frac(double a, double x)
double vnl_gamma_p(double a, double x)
{
if (x < 0.0 || a <= 0.0)
- assert(!"vnl_gamma_p : Invalid arguments.");
+ assert(!"vnl_gamma_p - Invalid arguments.");
if (x < a+1.0)
return vnl_gamma_series(a,x); // Use series representation
@@ -104,7 +104,7 @@ double vnl_gamma_p(double a, double x)
double vnl_gamma_q(double a, double x)
{
if (x < 0.0 || a <= 0.0)
- assert(!"vnl_gamma_q : Invalid arguments.");
+ assert(!"vnl_gamma_q - Invalid arguments.");
if (x < a+1.0)
return 1.0-vnl_gamma_series(a,x); // Use series representation
@@ -112,3 +112,17 @@ double vnl_gamma_q(double a, double x)
return vnl_gamma_cont_frac(a,x); // Use continued fraction representation
}
+double vnl_digamma(double z)
+{
+ double t0 = (z-0.5)/(z+4.65)-1.0;
+ double tlg = vcl_log(4.65+z);
+ double tc = 2.50662827563479526904;
+ double t1 = 225.525584619175212544/z;
+ double t2 = -268.295973841304927459/(1+z);
+ double t3 = +80.9030806934622512966/(2+z);
+ double t4 = -5.00757863970517583837/(3+z);
+ double t5 = 0.0114684895434781459556/(4+z);
+ double neu = t1/z + t2/(1+z) + t3/(2+z) + t4/(3+z) + t5/(4+z);
+ double den = tc + t1 + t2 + t3 + t4 + t5;
+ return (t0 -(neu/den) + tlg);
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_gamma.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_gamma.h
index c80825a80b5ffdd032f9d989685eb1e524a35bf1..8bb14a3ced59e479872387fdde65e19adfa5cda5 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_gamma.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_gamma.h
@@ -40,5 +40,8 @@ inline double vnl_cum_prob_chi2(int n_dof, double chi2)
{
return vnl_gamma_p( n_dof*0.5 , chi2*0.5 );
}
+//: approximate digamma function, dLog[gamma[z]]/dz
+// Analytic derivative of the Lanczos approximation. Error < 10^-11 1<z<20.
+double vnl_digamma(double x);
#endif // vnl_gamma_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_hungarian_algorithm.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_hungarian_algorithm.cxx
index 416662f542152b20a9f02af4fc7b09cbd9e1ad40..e0886a0288924a358cc0148f7a7a7798b2bf1471 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_hungarian_algorithm.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_hungarian_algorithm.cxx
@@ -9,42 +9,47 @@
// set all the elements of v to false.
static void clear_vector( vcl_vector<bool>& v )
{
- typedef vcl_vector<bool>::iterator iter;
- iter end = v.end();
- for ( iter i = v.begin(); i != end; ++i ) {
- *i = false;
- }
+ v.assign( v.size(), false );
}
vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in )
{
- // The Hungarian algorithm (seems to) only work for NxN cost
- // matrices. We can solve the NxM case by padding the matrix with a
- // constant cost.
-
- unsigned const N = vcl_max( cost_in.rows(), cost_in.cols() );
-
- vnl_matrix<double> cost( N, N, 0 );
-
- // Copy in the pieces of the original matrix
- cost.update( cost_in, 0, 0 );
-
// The steps of the algorithm described below are taken from
- // http://www.public.iastate.edu/~ddoty/HungarianAlgorithm.html
+ // http://www.cs.duke.edu/brd/Teaching/Bio/asmb/current/Handouts/munkres.html
// Step 0
- // Make sure there are at least as many rows as columns
- // [ This seems to be misleading since the algorithm presented here
- // seems to only work for NxN matrices.]
+ // Create an nxm matrix called the cost matrix in which each element
+ // represents the cost of assigning one of n workers to one of m
+ // jobs. Rotate the matrix so that there are at least as many
+ // columns as rows and let k=min(n,m)
+
+ // we make a copy of the cost matrix because this algorithm modifies
+ // the cost as it goes.
+ bool transposed_problem;
+ vnl_matrix<double> cost;
+ if( cost_in.rows() > cost_in.cols() ) {
+ // Avoid copying the transpose temporary. Can't write this in the
+ // more sensible way
+ // cost.swap( cost_in.transpose() );
+ // because a temporary cannot bind to non-const reference.
+ cost_in.transpose().swap( cost );
+ transposed_problem = true;
+ } else {
+ cost = cost_in;
+ transposed_problem = false;
+ }
+
+ unsigned const Nr = cost.rows();
+ unsigned const Nc = cost.cols();
// M(i,j) = 1 => cost(i,j) is starred
// M(i,j) = 2 => cost(i,j) is primed
- vnl_matrix<int> M( N, N, 0 );
+ vnl_matrix<vxl_byte> M( Nr, Nc, 0 );
// R_cov[i] = true => row i is covered
// C_cov[j] = true => column j is covered
- vcl_vector<bool> R_cov( N, false );
- vcl_vector<bool> C_cov( N, false );
+ vcl_vector<bool> R_cov( Nr, false );
+ vcl_vector<bool> C_cov( Nc, false );
// row and col of the primed zero in step four to pass to step five.
unsigned Z0_r, Z0_c;
@@ -53,12 +58,12 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
// For each row of the matrix, find the smallest element and subtract
// it from every element in its row. Go to Step 2.
{
- for ( unsigned i = 0; i < N; ++i ) {
+ for ( unsigned i = 0; i < Nr; ++i ) {
double mn = cost(i,0);
- for ( unsigned j = 1; j < N; ++j ) {
+ for ( unsigned j = 1; j < Nc; ++j ) {
if ( mn > cost(i,j) ) mn = cost(i,j);
}
- for ( unsigned j = 0; j < N; ++j ) {
+ for ( unsigned j = 0; j < Nc; ++j ) {
cost(i,j) -= mn;
}
}
@@ -73,9 +78,9 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
{
// We'll use C_cov and R_cov to indicate if there is a starred
// zero in that column or row, respectively
- for ( unsigned i = 0; i < N; ++i ) {
+ for ( unsigned i = 0; i < Nr; ++i ) {
if ( ! R_cov[i] ) {
- for ( unsigned j = 0; j < N; ++j ) {
+ for ( unsigned j = 0; j < Nc; ++j ) {
if ( cost(i,j) == 0.0 && ! C_cov[j] ) {
M(i,j) = 1; // star it
R_cov[i] = true; // and update the row & col status.
@@ -98,8 +103,8 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
step_three:
{
unsigned count = 0;
- for ( unsigned j = 0; j < N; ++j ) {
- for ( unsigned i = 0; i < N; ++i ) {
+ for ( unsigned j = 0; j < Nc; ++j ) {
+ for ( unsigned i = 0; i < Nr; ++i ) {
if ( M(i,j) == 1 ) {
C_cov[j] = true;
++count;
@@ -107,7 +112,7 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
}
}
}
- if ( count == N )
+ if ( count == vcl_min(Nc,Nr) )
goto step_done;
// otherwise, on to step 4.
@@ -126,9 +131,9 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
while ( true )
{
unsigned i, j; // row and column of the uncovered zero, if any.
- for (i = 0 ; i < N; ++i ) {
+ for (i = 0 ; i < Nr; ++i ) {
if ( ! R_cov[i] ) {
- for ( j = 0; j < N; ++j ) {
+ for ( j = 0; j < Nc; ++j ) {
if ( cost(i,j) == 0.0 && ! C_cov[j] ) {
M(i,j) = 2; // prime it
goto exit_loop;
@@ -144,7 +149,7 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
exit_loop:
// Check if there is a starred zero in the row.
bool star_in_row = false;
- for ( unsigned j2 = 0; j2 < N; ++j2 ) {
+ for ( unsigned j2 = 0; j2 < Nc; ++j2 ) {
if ( M(i,j2) == 1 ) {
star_in_row = true;
// cover the row, uncover the star column
@@ -183,11 +188,11 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
cols.push_back( j );
// Look for a starred zero in this column
- for ( i = 0; i < N; ++i ) {
+ for ( i = 0; i < Nr; ++i ) {
if ( M(i,j) == 1 ) break;
}
- if ( i == N ) {
+ if ( i == Nr ) {
// we didn't find a starred zero. Stop the loop
break;
}
@@ -197,10 +202,10 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
cols.push_back( j );
// Look for the primed zero in the row of the starred zero
- for ( j = 0; j < N; ++j ) {
+ for ( j = 0; j < Nc; ++j ) {
if ( M(i,j) == 2 ) break;
}
- assert( j < N ); // there should always be one
+ assert( j < Nc ); // there should always be one
// go back to the top to mark the primed zero, and repeat.
}
@@ -219,8 +224,8 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
}
// Erase all primes.
- for ( unsigned i = 0; i < N; ++i ) {
- for ( unsigned j = 0; j < N; ++j ) {
+ for ( unsigned i = 0; i < Nr; ++i ) {
+ for ( unsigned j = 0; j < Nc; ++j ) {
if ( M(i,j) == 2 ) M(i,j) = 0;
}
}
@@ -240,9 +245,9 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
{
// The value found in step 4 is the smallest uncovered value. Find it now.
double minval = vcl_numeric_limits<double>::infinity();
- for ( unsigned i = 0; i < N; ++i ) {
+ for ( unsigned i = 0; i < Nr; ++i ) {
if ( ! R_cov[i] ) {
- for ( unsigned j = 0; j < N; ++j ) {
+ for ( unsigned j = 0; j < Nc; ++j ) {
if ( ! C_cov[j] && cost(i,j) < minval ) {
minval = cost(i,j);
}
@@ -251,8 +256,8 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
}
// Modify the matrix as instructed.
- for ( unsigned i = 0; i < N; ++i ) {
- for ( unsigned j = 0; j < N; ++j ) {
+ for ( unsigned i = 0; i < Nr; ++i ) {
+ for ( unsigned j = 0; j < Nc; ++j ) {
if ( R_cov[i] ) cost(i,j) += minval;
if ( ! C_cov[j] ) cost(i,j) -= minval;
}
@@ -272,10 +277,14 @@ vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost_in
// Find the stars and generate the resulting assignment. Only
// check the sub-matrix of cost that corresponds to the input cost
// matrix. The remaining rows and columns are unassigned.
- for ( unsigned j = 0; j < cost_in.cols(); ++j ) {
- for ( unsigned i = 0; i < cost_in.rows(); ++i ) {
+ for ( unsigned i = 0; i < Nr; ++i ) {
+ for ( unsigned j = 0; j < Nc; ++j ) {
if ( M(i,j) == 1 ) {
- assign[i] = j;
+ if( transposed_problem ) {
+ assign[j] = i;
+ } else {
+ assign[i] = j;
+ }
}
}
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_hungarian_algorithm.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_hungarian_algorithm.h
index db0fa0cd37bbe1c008675402f57026ad65ffe99d..4e3d527d1cb599e2125ada0536cc836524be897b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_hungarian_algorithm.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_hungarian_algorithm.h
@@ -1,6 +1,5 @@
#ifndef vnl_hungarian_algorithm_h_
#define vnl_hungarian_algorithm_h_
-
//:
// \file
// \author Amitha Perera
@@ -19,11 +18,12 @@
// \param cost An N x M cost matrix. The costs cannot be -Infinity.
//
// \returns A vector v of size N such that v[i] = j means that row i
-// should be assigned to column j. \code v[i] = -1u \endcode (= \code
-// unsigned(-1) \endcode ) means that row i was not assigned to any
-// column. If N \> M, then every column will be assigned to some
-// row. If N \< M then every row will be assigned to some column.
+// should be assigned to column j. <tt>v[i] = unsigned(-1)</tt> means
+// that row i was not assigned to any column. If N \> M, then every
+// column will be assigned to some row. If N \< M then every row will
+// be assigned to some column.
//
+// \relatesalso vnl_matrix
vcl_vector<unsigned> vnl_hungarian_algorithm( vnl_matrix<double> const& cost );
#endif // vnl_hungarian_algorithm_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_imag.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_imag.h
index 54e7817e0a0a690cb4faeea311dca3d6ad1c4f97..109b849b47ef3d898036fbd6dbf5d736bc53a4db 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_imag.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_imag.h
@@ -18,11 +18,11 @@
template <class T> void vnl_imag(vcl_complex<T> const* C, T* I, unsigned int n);
//: Vector of imaginary parts of vnl_vector<vcl_complex<T> >.
-// \relates vnl_vector
+// \relatesalso vnl_vector
template <class T> vnl_vector<T> vnl_imag(vnl_vector<vcl_complex<T> > const& C);
//: Matrix of imaginary parts of vnl_matrix<vcl_complex<T> >.
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
template <class T> vnl_matrix<T> vnl_imag(vnl_matrix<vcl_complex<T> > const& C);
#endif // vnl_imag_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_int_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_int_matrix.h
index f8fd88e335f4485095e2cd99593bd010f217ce57..1fdce6fa969b39531d004d65dce8a786330a43bf 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_int_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_int_matrix.h
@@ -31,7 +31,7 @@ class vnl_int_matrix : public vnl_matrix<int>
vnl_int_matrix(unsigned r, unsigned c, int fillvalue): Base(r, c, fillvalue) {}
vnl_int_matrix(const vnl_matrix<double>& d);
vnl_int_matrix(const vnl_matrix<int>& d):Base(d) {}
- vnl_int_matrix& operator=(const vnl_matrix<int>& d) { return (vnl_int_matrix&)Base::operator=(d); }
+ vnl_int_matrix& operator=(const vnl_matrix<int>& d) { Base::operator=(d); return *this; }
};
#endif // vnl_int_matrix_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_integrant_fnct.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_integrant_fnct.h
index c1431cbd37df4e04e525aacacbd8775f44fbe343..6fc7e93d59fddc291d932fea9562791bffe01ba1 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_integrant_fnct.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_integrant_fnct.h
@@ -4,8 +4,7 @@
// \file
// \author Kongbin Kang
// \date Jan 12, 2005
-// \brief the abstract class of 1D integrant function used in integral
-//
+// \brief the abstract class of 1D integrand function used in integral
class vnl_integrant_fnct
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_inverse.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_inverse.h
index d0c336f062e544b79243e855380bf29b2ed91a49..1f5fc76a530c5fba91a25795aa53c2b3cb6717f6 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_inverse.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_inverse.h
@@ -28,6 +28,8 @@
// Note that this function is inlined (except for the call to vnl_det()),
// which makes it much faster than the vnl_matrix_inverse class in vnl/algo
// since that one is using svd.
+//
+// \relatesalso vnl_matrix_fixed
template <class T>
vnl_matrix_fixed<T,1,1> vnl_inverse(vnl_matrix_fixed<T,1,1> const& m)
@@ -35,6 +37,17 @@ vnl_matrix_fixed<T,1,1> vnl_inverse(vnl_matrix_fixed<T,1,1> const& m)
return vnl_matrix_fixed<T,1,1>(T(1)/m(0,0));
}
+//: Calculates inverse of a small vnl_matrix_fixed (not using svd)
+// This allows you to write e.g.
+//
+// x = vnl_inverse(A) * b;
+//
+// Note that this function is inlined (except for the call to vnl_det()),
+// which makes it much faster than the vnl_matrix_inverse class in vnl/algo
+// since that one is using svd.
+//
+// \relatesalso vnl_matrix_fixed
+
template <class T>
vnl_matrix_fixed<T,2,2> vnl_inverse(vnl_matrix_fixed<T,2,2> const& m)
{
@@ -50,6 +63,17 @@ vnl_matrix_fixed<T,2,2> vnl_inverse(vnl_matrix_fixed<T,2,2> const& m)
return vnl_matrix_fixed<T,2,2>(d);
}
+//: Calculates inverse of a small vnl_matrix_fixed (not using svd)
+// This allows you to write e.g.
+//
+// x = vnl_inverse(A) * b;
+//
+// Note that this function is inlined (except for the call to vnl_det()),
+// which makes it much faster than the vnl_matrix_inverse class in vnl/algo
+// since that one is using svd.
+//
+// \relatesalso vnl_matrix_fixed
+
template <class T>
vnl_matrix_fixed<T,3,3> vnl_inverse(vnl_matrix_fixed<T,3,3> const& m)
{
@@ -72,6 +96,17 @@ vnl_matrix_fixed<T,3,3> vnl_inverse(vnl_matrix_fixed<T,3,3> const& m)
return vnl_matrix_fixed<T,3,3>(d);
}
+//: Calculates inverse of a small vnl_matrix_fixed (not using svd)
+// This allows you to write e.g.
+//
+// x = vnl_inverse(A) * b;
+//
+// Note that this function is inlined (except for the call to vnl_det()),
+// which makes it much faster than the vnl_matrix_inverse class in vnl/algo
+// since that one is using svd.
+//
+// \relatesalso vnl_matrix_fixed
+
template <class T>
vnl_matrix_fixed<T,4,4> vnl_inverse(vnl_matrix_fixed<T,4,4> const& m)
{
@@ -117,6 +152,17 @@ vnl_matrix_fixed<T,4,4> vnl_inverse(vnl_matrix_fixed<T,4,4> const& m)
return vnl_matrix_fixed<T,4,4>(d)*det;
}
+//: Calculates inverse of a small vnl_matrix_fixed (not using svd)
+// This allows you to write e.g.
+//
+// x = vnl_inverse(A) * b;
+//
+// Note that this function is inlined (except for the call to vnl_det()),
+// which makes it much faster than the vnl_matrix_inverse class in vnl/algo
+// since that one is using svd.
+//
+// \relatesalso vnl_matrix
+
template <class T>
vnl_matrix<T> vnl_inverse(vnl_matrix<T> const& m)
{
@@ -125,11 +171,11 @@ vnl_matrix<T> vnl_inverse(vnl_matrix<T> const& m)
if (m.rows() == 1)
return vnl_matrix<T>(1,1, T(1)/m(0,0));
else if (m.rows() == 2)
- return vnl_matrix<T>(vnl_inverse(vnl_matrix_fixed<T,2,2>(m)));
+ return vnl_inverse(vnl_matrix_fixed<T,2,2>(m)).as_ref();
else if (m.rows() == 3)
- return vnl_matrix<T>(vnl_inverse(vnl_matrix_fixed<T,3,3>(m)));
+ return vnl_inverse(vnl_matrix_fixed<T,3,3>(m)).as_ref();
else
- return vnl_matrix<T>(vnl_inverse(vnl_matrix_fixed<T,4,4>(m)));
+ return vnl_inverse(vnl_matrix_fixed<T,4,4>(m)).as_ref();
}
//: Calculates transpose of the inverse of a small vnl_matrix_fixed (not using svd)
@@ -142,6 +188,8 @@ vnl_matrix<T> vnl_inverse(vnl_matrix<T> const& m)
// since that one is using svd. This is also faster than using
//
// x = vnl_inverse(A).transpose() * b;
+//
+// \relatesalso vnl_matrix_fixed
template <class T>
vnl_matrix_fixed<T,1,1> vnl_inverse_transpose(vnl_matrix_fixed<T,1,1> const& m)
@@ -149,6 +197,19 @@ vnl_matrix_fixed<T,1,1> vnl_inverse_transpose(vnl_matrix_fixed<T,1,1> const& m)
return vnl_matrix_fixed<T,1,1>(T(1)/m(0,0));
}
+//: Calculates transpose of the inverse of a small vnl_matrix_fixed (not using svd)
+// This allows you to write e.g.
+//
+// x = vnl_inverse_transpose(A) * b;
+//
+// Note that this function is inlined (except for the call to vnl_det()),
+// which makes it much faster than the vnl_matrix_inverse class in vnl/algo
+// since that one is using svd. This is also faster than using
+//
+// x = vnl_inverse(A).transpose() * b;
+//
+// \relatesalso vnl_matrix_fixed
+
template <class T>
vnl_matrix_fixed<T,2,2> vnl_inverse_transpose(vnl_matrix_fixed<T,2,2> const& m)
{
@@ -164,6 +225,19 @@ vnl_matrix_fixed<T,2,2> vnl_inverse_transpose(vnl_matrix_fixed<T,2,2> const& m)
return vnl_matrix_fixed<T,2,2>(d);
}
+//: Calculates transpose of the inverse of a small vnl_matrix_fixed (not using svd)
+// This allows you to write e.g.
+//
+// x = vnl_inverse_transpose(A) * b;
+//
+// Note that this function is inlined (except for the call to vnl_det()),
+// which makes it much faster than the vnl_matrix_inverse class in vnl/algo
+// since that one is using svd. This is also faster than using
+//
+// x = vnl_inverse(A).transpose() * b;
+//
+// \relatesalso vnl_matrix_fixed
+
template <class T>
vnl_matrix_fixed<T,3,3> vnl_inverse_transpose(vnl_matrix_fixed<T,3,3> const& m)
{
@@ -186,6 +260,19 @@ vnl_matrix_fixed<T,3,3> vnl_inverse_transpose(vnl_matrix_fixed<T,3,3> const& m)
return vnl_matrix_fixed<T,3,3>(d);
}
+//: Calculates transpose of the inverse of a small vnl_matrix_fixed (not using svd)
+// This allows you to write e.g.
+//
+// x = vnl_inverse_transpose(A) * b;
+//
+// Note that this function is inlined (except for the call to vnl_det()),
+// which makes it much faster than the vnl_matrix_inverse class in vnl/algo
+// since that one is using svd. This is also faster than using
+//
+// x = vnl_inverse(A).transpose() * b;
+//
+// \relatesalso vnl_matrix_fixed
+
template <class T>
vnl_matrix_fixed<T,4,4> vnl_inverse_transpose(vnl_matrix_fixed<T,4,4> const& m)
{
@@ -231,6 +318,19 @@ vnl_matrix_fixed<T,4,4> vnl_inverse_transpose(vnl_matrix_fixed<T,4,4> const& m)
return vnl_matrix_fixed<T,4,4>(d)*det;
}
+//: Calculates transpose of the inverse of a small vnl_matrix_fixed (not using svd)
+// This allows you to write e.g.
+//
+// x = vnl_inverse_transpose(A) * b;
+//
+// Note that this function is inlined (except for the call to vnl_det()),
+// which makes it much faster than the vnl_matrix_inverse class in vnl/algo
+// since that one is using svd. This is also faster than using
+//
+// x = vnl_inverse(A).transpose() * b;
+//
+// \relatesalso vnl_matrix
+
template <class T>
vnl_matrix<T> vnl_inverse_transpose(vnl_matrix<T> const& m)
{
@@ -239,11 +339,11 @@ vnl_matrix<T> vnl_inverse_transpose(vnl_matrix<T> const& m)
if (m.rows() == 1)
return vnl_matrix<T>(1,1, T(1)/m(0,0));
else if (m.rows() == 2)
- return vnl_matrix<T>(vnl_inverse_transpose(vnl_matrix_fixed<T,2,2>(m)));
+ return vnl_inverse_transpose(vnl_matrix_fixed<T,2,2>(m)).as_ref();
else if (m.rows() == 3)
- return vnl_matrix<T>(vnl_inverse_transpose(vnl_matrix_fixed<T,3,3>(m)));
+ return vnl_inverse_transpose(vnl_matrix_fixed<T,3,3>(m)).as_ref();
else
- return vnl_matrix<T>(vnl_inverse_transpose(vnl_matrix_fixed<T,4,4>(m)));
+ return vnl_inverse_transpose(vnl_matrix_fixed<T,4,4>(m)).as_ref();
}
#endif // vnl_inverse_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_cost_function.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_cost_function.cxx
index 73c35da4ff1c7e88834b6aa0abc69885244355c1..b3cf88b27a02b8fbebd018ba00fba9b97ab061cd 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_cost_function.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_cost_function.cxx
@@ -11,11 +11,11 @@
#include "vnl_least_squares_cost_function.h"
-vnl_least_squares_cost_function::vnl_least_squares_cost_function(vnl_least_squares_function* f):
- vnl_cost_function(f->get_number_of_unknowns()),
- storage_(f->get_number_of_residuals()),
- jacobian_(f->get_number_of_residuals(), f->get_number_of_unknowns()),
- f_(f)
+vnl_least_squares_cost_function::vnl_least_squares_cost_function(vnl_least_squares_function* func):
+ vnl_cost_function(func->get_number_of_unknowns()),
+ storage_(func->get_number_of_residuals()),
+ jacobian_(func->get_number_of_residuals(), func->get_number_of_unknowns()),
+ f_(func)
{
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_function.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_function.cxx
index 334bdfaafff86e94d61333035a39c0262c03d151..f8ca293a830f2dabc0d372b7edf238172e33dad7 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_function.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_function.cxx
@@ -26,7 +26,7 @@ void vnl_least_squares_function::gradf(vnl_vector<double> const& /*x*/,
vcl_cerr << "Warning: gradf() called but not implemented in derived class\n";
}
-//: Compute fd gradient
+//: Compute finite differences gradient using central differences.
void vnl_least_squares_function::fdgradf(vnl_vector<double> const& x,
vnl_matrix<double>& jacobian,
double stepsize)
@@ -59,6 +59,37 @@ void vnl_least_squares_function::fdgradf(vnl_vector<double> const& x,
}
}
+
+//: Compute finite differences gradient using forward differences.
+void vnl_least_squares_function::ffdgradf(vnl_vector<double> const& x,
+ vnl_matrix<double>& jacobian,
+ double stepsize)
+{
+ unsigned int dim = x.size();
+ unsigned int n = jacobian.rows();
+ assert(dim == get_number_of_unknowns());
+ assert(n == get_number_of_residuals());
+ assert(dim == jacobian.columns());
+
+ vnl_vector<double> tx = x;
+ vnl_vector<double> fplus(n);
+ vnl_vector<double> fcentre(n);
+ this->f(x, fcentre);
+ for (unsigned int i = 0; i < dim; ++i)
+ {
+ // calculate f just to the right of x[i]
+ double tplus = tx[i] = x[i] + stepsize;
+ this->f(tx, fplus);
+
+ double h = 1.0 / (tplus - x[i]);
+ for (unsigned int j = 0; j < n; ++j)
+ jacobian(j,i) = (fplus[j] - fcentre[j]) * h;
+
+ // restore tx
+ tx[i] = x[i];
+ }
+}
+
void vnl_least_squares_function::trace(int /* iteration */,
vnl_vector<double> const& /*x*/,
vnl_vector<double> const& /*fx*/)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_function.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_function.h
index f35368ca8ad5a27981dae80a461adb32ab036f06..8759616a87cb2e6cb6e3169d85c9dfa364d5d599 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_function.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_least_squares_function.h
@@ -72,6 +72,11 @@ class vnl_least_squares_function
void fdgradf(vnl_vector<double> const& x, vnl_matrix<double>& jacobian,
double stepsize);
+ //: Use this to compute a finite-forward-difference gradient other than lmdif
+ // This takes about half as many estimates as fdgradf
+ void ffdgradf(vnl_vector<double> const& x, vnl_matrix<double>& jacobian,
+ double stepsize);
+
//: Called after each LM iteration to print debugging etc.
virtual void trace(int iteration,
vnl_vector<double> const& x,
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_linear_operators_3.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_linear_operators_3.h
index 4bfe73e7ab5eea028d81a7720bc683bd63b66b72..c5bc708a97feaf0950c5daaf9f5312b8675ce1bf 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_linear_operators_3.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_linear_operators_3.h
@@ -24,7 +24,7 @@
#include <vnl/vnl_double_3x3.h>
//: The binary multiplication operator
-// \relates vnl_matrix_fixed
+// \relatesalso vnl_matrix_fixed
inline
vnl_double_3 operator* (const vnl_double_3x3& A, const vnl_double_3& x)
{
@@ -36,7 +36,7 @@ vnl_double_3 operator* (const vnl_double_3x3& A, const vnl_double_3& x)
}
//: The binary addition operator
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
inline
vnl_double_3 operator+ (const vnl_double_3& a, const vnl_double_3& b)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_math.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_math.cxx
index 43e83fbb02f571ad1a71ebb9c7b87e8f48514fce..35d0f2ff5d5d677769ab55d954837c5f40b8af1f 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_math.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_math.cxx
@@ -80,29 +80,30 @@ extern "C" int finite(double);
#if !VCL_STATIC_CONST_INIT_FLOAT_NO_DEFN
-// constants
-const double vnl_math::e VCL_STATIC_CONST_INIT_FLOAT_DEFN( 2.7182818284590452354 );
-const double vnl_math::log2e VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.4426950408889634074 );
-const double vnl_math::log10e VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.43429448190325182765 );
-const double vnl_math::ln2 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.69314718055994530942 );
-const double vnl_math::ln10 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 2.30258509299404568402 );
-const double vnl_math::pi VCL_STATIC_CONST_INIT_FLOAT_DEFN( 3.14159265358979323846 );
-const double vnl_math::pi_over_2 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.57079632679489661923 );
-const double vnl_math::pi_over_4 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.78539816339744830962 );
-const double vnl_math::one_over_pi VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.31830988618379067154 );
-const double vnl_math::two_over_pi VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.63661977236758134308 );
-const double vnl_math::two_over_sqrtpi VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.12837916709551257390 );
+//: constants
+const double vnl_math::e VCL_STATIC_CONST_INIT_FLOAT_DEFN( 2.71828182845904523540 );
+const double vnl_math::log2e VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.44269504088896340740 );
+const double vnl_math::log10e VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.43429448190325182765 );
+const double vnl_math::ln2 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.69314718055994530942 );
+const double vnl_math::ln10 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 2.30258509299404568402 );
+const double vnl_math::pi VCL_STATIC_CONST_INIT_FLOAT_DEFN( 3.14159265358979323846 );
+const double vnl_math::pi_over_2 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.57079632679489661923 );
+const double vnl_math::pi_over_4 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.78539816339744830962 );
+const double vnl_math::one_over_pi VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.31830988618379067154 );
+const double vnl_math::two_over_pi VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.63661977236758134308 );
+const double vnl_math::two_over_sqrtpi VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.12837916709551257390 );
const double vnl_math::one_over_sqrt2pi VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.39894228040143267794 );
-const double vnl_math::sqrt2 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.41421356237309504880 );
-const double vnl_math::sqrt1_2 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.70710678118654752440 );
+const double vnl_math::sqrt2 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.41421356237309504880 );
+const double vnl_math::sqrt1_2 VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.70710678118654752440 );
+const double vnl_math::euler VCL_STATIC_CONST_INIT_FLOAT_DEFN( 0.57721566490153286061 );
-// IEEE double machine precision
-const double vnl_math::eps VCL_STATIC_CONST_INIT_FLOAT_DEFN( 2.2204460492503131e-16 );
-const double vnl_math::sqrteps VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.490116119384766e-08 );
+//: IEEE double machine precision
+const double vnl_math::eps VCL_STATIC_CONST_INIT_FLOAT_DEFN( 2.2204460492503131e-16 );
+const double vnl_math::sqrteps VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.4901161193847660e-08 );
- //: IEEE single machine precision
-const float vnl_math::float_eps VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.192092896e-07f );
-const float vnl_math::float_sqrteps VCL_STATIC_CONST_INIT_FLOAT_DEFN( 3.4526698307e-4f );
+//: IEEE single machine precision
+const float vnl_math::float_eps VCL_STATIC_CONST_INIT_FLOAT_DEFN( 1.1920928960e-7f );
+const float vnl_math::float_sqrteps VCL_STATIC_CONST_INIT_FLOAT_DEFN( 3.4526698307e-4f );
#endif
@@ -163,11 +164,13 @@ static const int sz_l = sizeof(long double)/sizeof(int) -1;
# endif
// Assume IEEE floating point number representation
bool vnl_math_isnan( float x){return bMe(&x,0x7f800000L,sz_f)&&bMp(&x,0x007fffffL,sz_f);}
-bool vnl_math_isnan(double x){return bMe(&x,0x7ff00000L,sz_d)&&bMp(&x,0x000fffffL,sz_d);}
+bool vnl_math_isnan(double x){return bMe(&x,0x7ff00000L,sz_d)&&(bMp(&x,0x000fffffL,sz_d)||bMp(&x,0xffffffffL,1-sz_d));}
bool vnl_math_isnan(long double x)
{
- if (sizeof(long double) == 8) return bMe(&x,0x7ff00000L,sz_l) && bMp(&x,0x000fffffL,sz_l);
- else if (sizeof(long double) <= 12)
+ if (sizeof(long double) == 8) return bMe(&x,0x7ff00000L,sz_l) && (bMp(&x,0x000fffffL,sz_l)||bMp(&x,0xffffffffL,1-sz_d));
+ else if (sizeof(long double) <= 12) // This code doesn't properly check the less significant
+ // bytes for non-zero ness to distinguish inf from nan
+ // see http://babbage.cs.qc.cuny.edu/IEEE-754/References.xhtml#tables
# if defined LDBL_MANT_DIG && LDBL_MANT_DIG<=53
return bMe(&x,0x4001ffffL,sz_l) && bMp(&x,0x40000000,sz_l-4);
# else
@@ -280,4 +283,26 @@ int vnl_huge_val(int) { return 0x7fffffff; }
short vnl_huge_val(short) { return 0x7fff; }
char vnl_huge_val(char) { return 0x7f; }
+
//----------------------------------------------------------------------
+double vnl_math::angle_0_to_2pi(double angle)
+{
+ double a;
+ if (angle>=2*vnl_math::pi)
+ a = vcl_fmod (angle,vnl_math::pi*2);
+ else if (angle < 0)
+ a = (2*vnl_math::pi+ vcl_fmod (angle,2*vnl_math::pi));
+ else
+ a= angle;
+
+ // added by Nhon: these two lines of code is to fix the bug when
+ // angle = -1.1721201390607859e-016
+ // then after all the computation, we get
+ // a = 6.2831853071795862 == 2*vnl_math::pi !!!!!!!
+ // this situation can happen is when a is very close to zero.
+
+ if (!(a>=0 && a<2*vnl_math::pi)) {
+ a = 0;
+ }
+ return a;
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_math.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_math.h
index 5e956027bd9ed1720d089c7ed65867beca57a179..db2b03d169873702a08738c2d36ec59e0d427e23 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_math.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_math.h
@@ -54,9 +54,10 @@
#else
# define USE_SSE2_IMPL 0
#endif
-// Turn on fast impl when using GCC on x86 platform with the following exception:
+// Turn on fast impl when using GCC on Intel-based machines with the following exception:
+// PPC with Mac OS X
// GCCXML
-#if defined(__GNUC__) && (!defined(__GCCXML__)) && (defined(__i386__) || defined(__i386) || defined(__x86_64__) || defined(__x86_64))
+#if defined(__GNUC__) && (!defined(__GCCXML__)) && (defined(__i386__) || defined(__i386) || defined(__x86_64__) || defined(__x86_64)) && (!defined(__APPLE__) || !defined(__ppc__) )
# define GCC_USE_FAST_IMPL 1
#else
# define GCC_USE_FAST_IMPL 0
@@ -97,6 +98,7 @@ class vnl_math
static VNL_DLL_DATA const double one_over_sqrt2pi VCL_STATIC_CONST_INIT_FLOAT_DECL(0.39894228040143267794);
static VNL_DLL_DATA const double sqrt2 VCL_STATIC_CONST_INIT_FLOAT_DECL(1.41421356237309504880);
static VNL_DLL_DATA const double sqrt1_2 VCL_STATIC_CONST_INIT_FLOAT_DECL(0.70710678118654752440);
+ static VNL_DLL_DATA const double euler VCL_STATIC_CONST_INIT_FLOAT_DECL(0.57721566490153286061);
//: IEEE double machine precision
static VNL_DLL_DATA const double eps VCL_STATIC_CONST_INIT_FLOAT_DECL(2.2204460492503131e-16);
@@ -104,6 +106,8 @@ class vnl_math
//: IEEE single machine precision
static VNL_DLL_DATA const float float_eps VCL_STATIC_CONST_INIT_FLOAT_DECL(1.192092896e-07f);
static VNL_DLL_DATA const float float_sqrteps VCL_STATIC_CONST_INIT_FLOAT_DECL(3.4526698307e-4f);
+//: Convert an angle to [0, 2Pi) range
+ static double angle_0_to_2pi(double angle);
};
// We do not want to make assumptions about unknown types that happen
@@ -121,15 +125,17 @@ class vnl_math
//
// isnan
-inline bool vnl_math_isnan(char) { return false; }
-inline bool vnl_math_isnan(short) { return false; }
-inline bool vnl_math_isnan(int) { return false; }
-inline bool vnl_math_isnan(long) { return false; }
-inline bool vnl_math_isnan(signed char) { return false; }
-inline bool vnl_math_isnan(unsigned char) { return false; }
-inline bool vnl_math_isnan(unsigned short){ return false; }
-inline bool vnl_math_isnan(unsigned int) { return false; }
-inline bool vnl_math_isnan(unsigned long) { return false; }
+inline bool vnl_math_isnan(char) { return false; }
+inline bool vnl_math_isnan(short) { return false; }
+inline bool vnl_math_isnan(int) { return false; }
+inline bool vnl_math_isnan(long) { return false; }
+inline bool vnl_math_isnan(long long) { return false; }
+inline bool vnl_math_isnan(signed char) { return false; }
+inline bool vnl_math_isnan(unsigned char) { return false; }
+inline bool vnl_math_isnan(unsigned short) { return false; }
+inline bool vnl_math_isnan(unsigned int) { return false; }
+inline bool vnl_math_isnan(unsigned long) { return false; }
+inline bool vnl_math_isnan(unsigned long long) { return false; }
bool vnl_math_isnan(float);
bool vnl_math_isnan(double);
bool vnl_math_isnan(long double);
@@ -137,16 +143,21 @@ bool vnl_math_isnan(long double);
template <class T> bool vnl_math_isnan(T);
#endif
+
+
+
// isinf
-inline bool vnl_math_isinf(char) { return false; }
-inline bool vnl_math_isinf(short) { return false; }
-inline bool vnl_math_isinf(int) { return false; }
-inline bool vnl_math_isinf(long) { return false; }
-inline bool vnl_math_isinf(signed char) { return false; }
-inline bool vnl_math_isinf(unsigned char) { return false; }
-inline bool vnl_math_isinf(unsigned short){ return false; }
-inline bool vnl_math_isinf(unsigned int) { return false; }
-inline bool vnl_math_isinf(unsigned long) { return false; }
+inline bool vnl_math_isinf(char) { return false; }
+inline bool vnl_math_isinf(short) { return false; }
+inline bool vnl_math_isinf(int) { return false; }
+inline bool vnl_math_isinf(long) { return false; }
+inline bool vnl_math_isinf(long long) { return false; }
+inline bool vnl_math_isinf(signed char) { return false; }
+inline bool vnl_math_isinf(unsigned char) { return false; }
+inline bool vnl_math_isinf(unsigned short) { return false; }
+inline bool vnl_math_isinf(unsigned int) { return false; }
+inline bool vnl_math_isinf(unsigned long) { return false; }
+inline bool vnl_math_isinf(unsigned long long) { return false; }
bool vnl_math_isinf(float);
bool vnl_math_isinf(double);
bool vnl_math_isinf(long double);
@@ -155,15 +166,17 @@ template <class T> bool vnl_math_isinf(T);
#endif
// isfinite
-inline bool vnl_math_isfinite(char) { return true; }
-inline bool vnl_math_isfinite(short) { return true; }
-inline bool vnl_math_isfinite(int) { return true; }
-inline bool vnl_math_isfinite(long) { return true; }
-inline bool vnl_math_isfinite(signed char) { return true; }
-inline bool vnl_math_isfinite(unsigned char) { return true; }
-inline bool vnl_math_isfinite(unsigned short){ return true; }
-inline bool vnl_math_isfinite(unsigned int) { return true; }
-inline bool vnl_math_isfinite(unsigned long) { return true; }
+inline bool vnl_math_isfinite(char) { return true; }
+inline bool vnl_math_isfinite(short) { return true; }
+inline bool vnl_math_isfinite(int) { return true; }
+inline bool vnl_math_isfinite(long) { return true; }
+inline bool vnl_math_isfinite(long long) { return true; }
+inline bool vnl_math_isfinite(signed char) { return true; }
+inline bool vnl_math_isfinite(unsigned char) { return true; }
+inline bool vnl_math_isfinite(unsigned short) { return true; }
+inline bool vnl_math_isfinite(unsigned int) { return true; }
+inline bool vnl_math_isfinite(unsigned long) { return true; }
+inline bool vnl_math_isfinite(unsigned long long) { return true; }
bool vnl_math_isfinite(float);
bool vnl_math_isfinite(double);
bool vnl_math_isfinite(long double);
@@ -513,76 +526,90 @@ inline int vnl_math_ceil(double x)
// abs
-inline bool vnl_math_abs(bool x) { return x; }
-inline unsigned char vnl_math_abs(unsigned char x) { return x; }
-inline unsigned char vnl_math_abs(signed char x) { return x < 0 ? static_cast<unsigned char>(-x) : x; }
-inline unsigned char vnl_math_abs(char x) { return static_cast<unsigned char>(x); }
-inline unsigned short vnl_math_abs(short x) { return x < 0 ? static_cast<unsigned short>(-x) : x; }
-inline unsigned short vnl_math_abs(unsigned short x){ return x; }
-inline unsigned int vnl_math_abs(int x) { return x < 0 ? -x : x; }
-inline unsigned int vnl_math_abs(unsigned int x) { return x; }
-inline unsigned long vnl_math_abs(long x) { return x < 0L ? -x : x; }
-inline unsigned long vnl_math_abs(unsigned long x) { return x; }
-inline float vnl_math_abs(float x) { return x < 0.0f ? -x : x; }
-inline double vnl_math_abs(double x) { return x < 0.0 ? -x : x; }
-inline long double vnl_math_abs(long double x) { return x < 0.0 ? -x : x; }
+inline bool vnl_math_abs(bool x) { return x; }
+inline unsigned char vnl_math_abs(unsigned char x) { return x; }
+inline unsigned char vnl_math_abs(signed char x) { return x < 0 ? static_cast<unsigned char>(-x) : x; }
+inline unsigned char vnl_math_abs(char x) { return static_cast<unsigned char>(x); }
+inline unsigned short vnl_math_abs(short x) { return x < 0 ? static_cast<unsigned short>(-x) : x; }
+inline unsigned short vnl_math_abs(unsigned short x) { return x; }
+inline unsigned int vnl_math_abs(int x) { return x < 0 ? -x : x; }
+inline unsigned int vnl_math_abs(unsigned int x) { return x; }
+inline unsigned long vnl_math_abs(long x) { return x < 0L ? -x : x; }
+inline unsigned long vnl_math_abs(unsigned long x) { return x; }
+inline unsigned long long vnl_math_abs(long long x) { return x < 0LL ? -x : x; }
+inline unsigned long long vnl_math_abs(unsigned long long x) { return x; }
+inline float vnl_math_abs(float x) { return x < 0.0f ? -x : x; }
+inline double vnl_math_abs(double x) { return x < 0.0 ? -x : x; }
+inline long double vnl_math_abs(long double x) { return x < 0.0 ? -x : x; }
// max
-inline int vnl_math_max(int x, int y) { return (x > y) ? x : y; }
-inline unsigned int vnl_math_max(unsigned int x, unsigned int y) { return (x > y) ? x : y; }
-inline long vnl_math_max(long x, long y) { return (x > y) ? x : y; }
-inline unsigned long vnl_math_max(unsigned long x, unsigned long y) { return (x > y) ? x : y;}
-inline float vnl_math_max(float x, float y) { return (x < y) ? y : x; }
-inline double vnl_math_max(double x, double y) { return (x < y) ? y : x; }
+inline int vnl_math_max(int x, int y) { return (x > y) ? x : y; }
+inline unsigned int vnl_math_max(unsigned int x, unsigned int y) { return (x > y) ? x : y; }
+inline long vnl_math_max(long x, long y) { return (x > y) ? x : y; }
+inline unsigned long vnl_math_max(unsigned long x, unsigned long y) { return (x > y) ? x : y; }
+inline long long vnl_math_max(long long x, long long y) { return (x > y) ? x : y; }
+inline unsigned long long vnl_math_max(unsigned long long x, unsigned long long y) { return (x > y) ? x : y; }
+inline float vnl_math_max(float x, float y) { return (x < y) ? y : x; }
+inline double vnl_math_max(double x, double y) { return (x < y) ? y : x; }
// min
-inline int vnl_math_min(int x, int y) { return (x < y) ? x : y; }
-inline unsigned int vnl_math_min(unsigned int x, unsigned int y) { return (x < y) ? x : y; }
-inline long vnl_math_min(long x, long y) { return (x < y) ? x : y; }
-inline unsigned long vnl_math_min(unsigned long x, unsigned long y) { return (x < y) ? x : y;}
-inline float vnl_math_min(float x, float y) { return (x > y) ? y : x; }
-inline double vnl_math_min(double x, double y) { return (x > y) ? y : x; }
+inline int vnl_math_min(int x, int y) { return (x < y) ? x : y; }
+inline unsigned int vnl_math_min(unsigned int x, unsigned int y) { return (x < y) ? x : y; }
+inline long vnl_math_min(long x, long y) { return (x < y) ? x : y; }
+inline unsigned long vnl_math_min(unsigned long x, unsigned long y) { return (x < y) ? x : y; }
+inline long long vnl_math_min(long long x, long long y) { return (x < y) ? x : y; }
+inline unsigned long long vnl_math_min(unsigned long long x, unsigned long long y) { return (x < y) ? x : y; }
+inline float vnl_math_min(float x, float y) { return (x > y) ? y : x; }
+inline double vnl_math_min(double x, double y) { return (x > y) ? y : x; }
// sqr (square)
-inline bool vnl_math_sqr(bool x) { return x; }
-inline int vnl_math_sqr(int x) { return x*x; }
-inline unsigned int vnl_math_sqr(unsigned int x) { return x*x; }
-inline long vnl_math_sqr(long x) { return x*x; }
-inline unsigned long vnl_math_sqr(unsigned long x) { return x*x; }
-inline float vnl_math_sqr(float x) { return x*x; }
-inline double vnl_math_sqr(double x) { return x*x; }
+inline bool vnl_math_sqr(bool x) { return x; }
+inline int vnl_math_sqr(int x) { return x*x; }
+inline unsigned int vnl_math_sqr(unsigned int x) { return x*x; }
+inline long vnl_math_sqr(long x) { return x*x; }
+inline unsigned long vnl_math_sqr(unsigned long x) { return x*x; }
+inline long long vnl_math_sqr(long long x) { return x*x; }
+inline unsigned long long vnl_math_sqr(unsigned long long x) { return x*x; }
+inline float vnl_math_sqr(float x) { return x*x; }
+inline double vnl_math_sqr(double x) { return x*x; }
// cube
-inline bool vnl_math_cube(bool x) { return x; }
-inline int vnl_math_cube(int x) { return x*x*x; }
-inline unsigned int vnl_math_cube(unsigned int x) { return x*x*x; }
-inline long vnl_math_cube(long x) { return x*x*x; }
-inline unsigned long vnl_math_cube(unsigned long x) { return x*x*x; }
-inline float vnl_math_cube(float x) { return x*x*x; }
-inline double vnl_math_cube(double x) { return x*x*x; }
+inline bool vnl_math_cube(bool x) { return x; }
+inline int vnl_math_cube(int x) { return x*x*x; }
+inline unsigned int vnl_math_cube(unsigned int x) { return x*x*x; }
+inline long vnl_math_cube(long x) { return x*x*x; }
+inline unsigned long vnl_math_cube(unsigned long x) { return x*x*x; }
+inline long long vnl_math_cube(long long x) { return x*x*x; }
+inline unsigned long long vnl_math_cube(unsigned long long x) { return x*x*x; }
+inline float vnl_math_cube(float x) { return x*x*x; }
+inline double vnl_math_cube(double x) { return x*x*x; }
// sgn (sign in -1, 0, +1)
-inline int vnl_math_sgn(int x) { return x?((x>0)?1:-1):0; }
-inline int vnl_math_sgn(long x) { return x?((x>0)?1:-1):0; }
-inline int vnl_math_sgn(float x) { return (x != 0)?((x>0)?1:-1):0; }
-inline int vnl_math_sgn(double x) { return (x != 0)?((x>0)?1:-1):0; }
+inline int vnl_math_sgn(int x) { return x?((x>0)?1:-1):0; }
+inline int vnl_math_sgn(long x) { return x?((x>0)?1:-1):0; }
+inline int vnl_math_sgn(long long x) { return x?((x>0)?1:-1):0; }
+inline int vnl_math_sgn(float x) { return (x != 0)?((x>0)?1:-1):0; }
+inline int vnl_math_sgn(double x) { return (x != 0)?((x>0)?1:-1):0; }
// sgn0 (sign in -1, +1 only, useful for reals)
-inline int vnl_math_sgn0(int x) { return (x>=0)?1:-1; }
-inline int vnl_math_sgn0(long x) { return (x>=0)?1:-1; }
-inline int vnl_math_sgn0(float x) { return (x>=0)?1:-1; }
-inline int vnl_math_sgn0(double x) { return (x>=0)?1:-1; }
+inline int vnl_math_sgn0(int x) { return (x>=0)?1:-1; }
+inline int vnl_math_sgn0(long x) { return (x>=0)?1:-1; }
+inline int vnl_math_sgn0(long long x) { return (x>=0)?1:-1; }
+inline int vnl_math_sgn0(float x) { return (x>=0)?1:-1; }
+inline int vnl_math_sgn0(double x) { return (x>=0)?1:-1; }
// squared_magnitude
-inline unsigned int vnl_math_squared_magnitude(char x) { return int(x)*int(x); }
-inline unsigned int vnl_math_squared_magnitude(unsigned char x) { return int(x)*int(x); }
-inline unsigned int vnl_math_squared_magnitude(int x) { return x*x; }
-inline unsigned int vnl_math_squared_magnitude(unsigned int x) { return x*x; }
-inline unsigned long vnl_math_squared_magnitude(long x) { return x*x; }
-inline unsigned long vnl_math_squared_magnitude(unsigned long x) { return x*x; }
-inline float vnl_math_squared_magnitude(float x) { return x*x; }
-inline double vnl_math_squared_magnitude(double x) { return x*x; }
-inline long double vnl_math_squared_magnitude(long double x) { return x*x; }
+inline unsigned int vnl_math_squared_magnitude(char x) { return int(x)*int(x); }
+inline unsigned int vnl_math_squared_magnitude(unsigned char x) { return int(x)*int(x); }
+inline unsigned int vnl_math_squared_magnitude(int x) { return x*x; }
+inline unsigned int vnl_math_squared_magnitude(unsigned int x) { return x*x; }
+inline unsigned long vnl_math_squared_magnitude(long x) { return x*x; }
+inline unsigned long vnl_math_squared_magnitude(unsigned long x) { return x*x; }
+inline unsigned long long vnl_math_squared_magnitude(long long x) { return x*x; }
+inline unsigned long long vnl_math_squared_magnitude(unsigned long long x) { return x*x; }
+inline float vnl_math_squared_magnitude(float x) { return x*x; }
+inline double vnl_math_squared_magnitude(double x) { return x*x; }
+inline long double vnl_math_squared_magnitude(long double x) { return x*x; }
// cuberoot
inline float vnl_math_cuberoot(float a) { return float((a<0) ? -vcl_exp(vcl_log(-a)/3) : vcl_exp(vcl_log(a)/3)); }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_header.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_header.h
index 1a0eaf156a828b82a198c17e63ed330a1ecafe10..4b5928285b1228c907413af90e77b61c63569fd4 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_header.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_header.h
@@ -4,13 +4,18 @@
#ifdef VCL_NEEDS_PRAGMA_INTERFACE
#pragma interface
#endif
+
+#undef swap32
+#undef swap64
+
//:
// \file
// \brief MATLAB header structure
// \author fsm
-
-#undef swap32
-#undef swap64
+// \verbatim
+// Modifications
+// 21 Apr 2009 Kent Williams - Taking care of the byte ordering of the MAT file
+// \endverbatim
#include <vxl_config.h>
@@ -37,47 +42,26 @@ struct vnl_matlab_header
};
};
-namespace byteswap
-{
-//
-// byteswap routines, stolen from
-// ITK
-inline void
-swap32(void *ptr)
+namespace byteswap // byteswap routines, stolen from ITK
{
+ inline void
+ swap32(void *ptr)
+ {
char one_byte;
char *p = reinterpret_cast<char *>(ptr);
-
- one_byte = p[0];
- p[0] = p[3];
- p[3] = one_byte;
-
- one_byte = p[1];
- p[1] = p[2];
- p[2] = one_byte;
-}
-inline void
-swap64(void *ptr)
-{
+ one_byte = p[0]; p[0] = p[3]; p[3] = one_byte;
+ one_byte = p[1]; p[1] = p[2]; p[2] = one_byte;
+ }
+ inline void
+ swap64(void *ptr)
+ {
char one_byte;
char *p = reinterpret_cast<char *>(ptr);
-
- one_byte = p[0];
- p[0] = p[7];
- p[7] = one_byte;
-
- one_byte = p[1];
- p[1] = p[6];
- p[6] = one_byte;
-
- one_byte = p[2];
- p[2] = p[5];
- p[5] = one_byte;
-
- one_byte = p[3];
- p[3] = p[4];
- p[4] = one_byte;
-}
+ one_byte = p[0]; p[0] = p[7]; p[7] = one_byte;
+ one_byte = p[1]; p[1] = p[6]; p[6] = one_byte;
+ one_byte = p[2]; p[2] = p[5]; p[5] = one_byte;
+ one_byte = p[3]; p[3] = p[4]; p[4] = one_byte;
+ }
}
#endif // vnl_matlab_header_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_print.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_print.h
index 7e935114e88252b70472d0e418e720db6c8599cd..36334c9cc2c534281c023f62a7a88f29e8035f58 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_print.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_print.h
@@ -39,42 +39,48 @@ vcl_ostream &vnl_matlab_print(vcl_ostream &,
//-------------------- "named" forms.
-//: print a vnl_diagonal_matrix<>.
+//: print a vnl_diagonal_matrix<T>.
+// \relatesalso vnl_diag_matrix
template <class T>
vcl_ostream &vnl_matlab_print(vcl_ostream &,
vnl_diag_matrix<T> const&,
char const *variable_name =0,
vnl_matlab_print_format =vnl_matlab_print_format_default);
-//: print a vnl_matrix<>.
+//: print a vnl_matrix<T>.
+// \relatesalso vnl_matrix
template <class T>
vcl_ostream &vnl_matlab_print(vcl_ostream &,
vnl_matrix<T> const&,
char const *variable_name =0,
vnl_matlab_print_format =vnl_matlab_print_format_default);
-//: print a vnl_matrix_fixed<>.
+//: print a vnl_matrix_fixed<T>.
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned int n, unsigned int m>
vcl_ostream &vnl_matlab_print(vcl_ostream &,
vnl_matrix_fixed<T,n,m> const&,
char const *variable_name =0,
vnl_matlab_print_format =vnl_matlab_print_format_default);
-//: print a vnl_matrix_ref<>.
+//: print a vnl_matrix_ref<T>.
+// \relatesalso vnl_matrix_ref
template <class T>
vcl_ostream &vnl_matlab_print(vcl_ostream &,
vnl_matrix_ref<T> const &,
char const *variable_name =0,
vnl_matlab_print_format =vnl_matlab_print_format_default);
-//: print a vnl_vector<>.
+//: print a vnl_vector<T>.
+// \relatesalso vnl_vector
template <class T>
vcl_ostream &vnl_matlab_print(vcl_ostream &,
vnl_vector<T> const &,
char const *variable_name =0,
vnl_matlab_print_format =vnl_matlab_print_format_default);
-//: print a vnl_vector_fixed<>.
+//: print a vnl_vector_fixed<T>.
+// \relatesalso vnl_vector_fixed
template <class T, unsigned int n>
vcl_ostream &vnl_matlab_print(vcl_ostream &,
vnl_vector_fixed<T,n> const &,
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_print2.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_print2.h
index bd4b355f6d2efea722d6baf91a25461f64741e32..0edb0b0a7e9875bc080b94b787d22b902f07704b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_print2.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_print2.h
@@ -67,9 +67,9 @@ vnl_matlab_print(T const &obj,
#define VNL_MATLAB_PRINT2_INSTANTIATE(T) \
template struct vnl_matlab_print_proxy<T >; \
-VCL_INSTANTIATE_INLINE(vcl_ostream & \
- operator<<(vcl_ostream &, vnl_matlab_print_proxy<T > const &)); \
+VCL_INSTANTIATE_INLINE(vcl_ostream& \
+ operator<<(vcl_ostream&, vnl_matlab_print_proxy<T > const&)); \
VCL_INSTANTIATE_INLINE(vnl_matlab_print_proxy<T > \
- vnl_matlab_print(T const &, char const *, vnl_matlab_print_format))
+ vnl_matlab_print(T const&, char const*, vnl_matlab_print_format))
#endif // vnl_matlab_print2_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_read.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_read.cxx
index aca69d06dc3d4a081d3274e7e81f551819e269c6..ecb521b43bc6f6f7c91dd64e61aa95d8abdc27b3 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_read.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_read.cxx
@@ -2,21 +2,17 @@
#ifdef VCL_NEEDS_PRAGMA_INTERFACE
#pragma implementation
#endif
+#include "vnl_matlab_read.h"
//:
// \file
// \author fsm
#include <vxl_config.h>
-#include "vnl_matlab_read.h"
#include <vcl_ios.h> // for vcl_ios_cur
#include <vcl_iostream.h>
#include <vcl_cstring.h> // memset()
#include <vcl_complex.h>
#include <vnl/vnl_c_vector.h>
-
-// FIXME: Currently ignores the byte ordering of the MAT file header, effectively
-// assuming the MAT file was written with the native byte ordering.
-
//--------------------------------------------------------------------------------
// SGI needs??
@@ -96,21 +92,21 @@ void vnl_matlab_readhdr::read_hdr()
{
vcl_memset(&hdr, 0, sizeof hdr);
::vnl_read_bytes(s, &hdr, sizeof(hdr));
- //
+
// determine if data needs swapping when read
// Everything else depends on this; if the header needs swapping
// and is not, nothing good will happen.
- switch(hdr.type)
- {
+ switch (hdr.type)
+ {
case 0:
// 0 means double-precision values, column-major, little-endian,
// so you need to swap if the system is big-endian
#if VXL_BIG_ENDIAN
need_swap = true;
-#endif
+#endif
break;
case 10:
- // Regardless of endian-ness, these flag values are
+ // Regardless of endian-ness, these flag values are
// what the writer puts in the header in the native format,
// therefore if you see any of them, the file is the same-endian
// as the system you're reading on.
@@ -126,15 +122,15 @@ void vnl_matlab_readhdr::read_hdr()
// we hope that it means the file needs byte-swapping, and not that
// the file is corrupt.
need_swap = true;
- }
- if(need_swap)
- {
+ }
+ if (need_swap)
+ {
byteswap::swap32(&hdr.type);
byteswap::swap32(&hdr.rows);
byteswap::swap32(&hdr.cols);
byteswap::swap32(&hdr.imag);
byteswap::swap32(&hdr.namlen);
- }
+ }
if (varname)
delete [] varname;
varname = new char[hdr.namlen+1];
@@ -147,6 +143,7 @@ void vnl_matlab_readhdr::read_hdr()
#endif
::vnl_read_bytes(s, varname, hdr.namlen);
varname[hdr.namlen] = '\0';
+
data_read = false;
}
@@ -177,50 +174,38 @@ bool vnl_matlab_readhdr::type_chck(vcl_complex<double> &) { return !is_single()
#define fsm_define_methods(T) \
bool vnl_matlab_readhdr::read_data(T &v) { \
if (!type_chck(v)) { vcl_cerr << "type_check\n"; return false; }\
- if (rows()!=1 || cols()!=1) { vcl_cerr << "size0\n"; return false; } \
+ if (rows()!=1U || cols()!=1U) { vcl_cerr << "size0\n"; return false; } \
vnl_matlab_read_data(s, &v, 1); \
- if(need_swap) \
- { \
- if(sizeof(v) == 4) byteswap::swap32(&v); else byteswap::swap64(&v); \
- } \
+ if (need_swap) { \
+ if (sizeof(v) == 4U) byteswap::swap32(&v); else byteswap::swap64(&v); \
+ } \
data_read = true; return *this; \
} \
bool vnl_matlab_readhdr::read_data(T *p) { \
if (!type_chck(p[0])) { vcl_cerr << "type_check\n"; return false; } \
- if (rows()!=1 && cols()!=1) { vcl_cerr << "size1\n"; return false; } \
+ if (rows()!=1U && cols()!=1U) { vcl_cerr << "size1\n"; return false; } \
vnl_matlab_read_data(s, p, rows()*cols()); \
- if(need_swap) \
- { \
- for(unsigned i = 0; i < rows()*cols(); i++) \
- { \
- if(sizeof(*p) == 4) byteswap::swap32(&(p[i])); else byteswap::swap64(&(p[i])); \
- } \
- } \
+ if (need_swap) { \
+ for (long i = 0; i < rows()*cols(); ++i) { \
+ if (sizeof(*p) == 4U) byteswap::swap32(&(p[i])); else byteswap::swap64(&(p[i])); \
+ } \
+ } \
data_read = true; return *this; \
} \
bool vnl_matlab_readhdr::read_data(T * const *m) { \
if (!type_chck(m[0][0])) { vcl_cerr << "type_check\n"; return false; } \
T *tmp = vnl_c_vector<T >::allocate_T(rows()*cols()); \
- /*vnl_c_vector<T >::fill(tmp, rows()*cols(), 3.14159);*/ \
vnl_matlab_read_data(s, tmp, rows()*cols()); \
- if(need_swap) \
- { \
- for(unsigned i = 0; i < rows()*cols(); i++) \
- { \
- if(sizeof(T) == 4) byteswap::swap32(&(tmp[i])); else byteswap::swap64(&(tmp[i])); \
- } \
+ if (need_swap) { \
+ for (long i = 0; i < rows()*cols(); ++i) { \
+ if (sizeof(T) == 4U) byteswap::swap32(&(tmp[i])); else byteswap::swap64(&(tmp[i])); \
} \
- int a, b; \
- if (is_rowwise()) { \
- a = cols(); \
- b = 1; \
} \
- else { \
- a = 1; \
- b = rows(); \
- } \
- for (int i=0; i<rows(); ++i) \
- for (int j=0; j<cols(); ++j) \
+ int a, b; \
+ if (is_rowwise()) { a = cols(); b = 1; } \
+ else { a = 1; b = rows(); } \
+ for (long i=0; i<rows(); ++i) \
+ for (long j=0; j<cols(); ++j) \
m[i][j] = tmp[a*i + b*j]; \
vnl_c_vector<T >::deallocate(tmp, rows()*cols()); \
data_read = true; return *this; \
@@ -253,12 +238,12 @@ bool vnl_matlab_read_or_die(vcl_istream &s,
vcl_abort();
}
}
- if (v.size() != unsigned(h.rows()*h.cols()))
+ if (v.size() != (unsigned long)(h.rows()*h.cols()))
{
vcl_destroy(&v);
new (&v) vnl_vector<T>(h.rows()*h.cols());
}
- if( ! h.read_data(v.begin()) ) { /*wrong type?*/
+ if ( ! h.read_data(v.begin()) ) { /*wrong type?*/
vcl_cerr << "vnl_matlab_read_or_die: failed to read data\n";
vcl_abort();
}
@@ -279,12 +264,12 @@ bool vnl_matlab_read_or_die(vcl_istream &s,
vcl_abort();
}
}
- if (M.rows() != unsigned(h.rows()) || M.cols() != unsigned(h.cols()))
+ if (M.rows() != (unsigned long)(h.rows()) || M.cols() != (unsigned long)(h.cols()))
{
vcl_destroy(&M);
new (&M) vnl_matrix<T>(h.rows(), h.cols());
}
- if( ! h.read_data(M.data_array()) ) { /*wrong type?*/
+ if ( ! h.read_data(M.data_array()) ) { /*wrong type?*/
vcl_cerr << "vnl_matlab_read_or_die: failed to read data\n";
vcl_abort();
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_read.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_read.h
index 7d869fcf9cfe3efaa0ffec6f589dee2ff36779c8..d46f7159a83802c452496542e1fdff7897965ba4 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_read.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matlab_read.h
@@ -10,9 +10,10 @@
// \author fsm
//
// \verbatim
-// Modifications
-// LSB (Manchester) 23/3/01 documentation tidied
+// Modifications
+// LSB (Manchester) 23 Mar 2001 documentation tidied
// Feb.2002 - Peter Vanroose - brief doxygen comment placed on single line
+// 21 Apr 2009 Kent Williams - Taking care of the byte ordering of the MAT file
// \endverbatim
#include <vcl_iosfwd.h>
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matops.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matops.h
index 158b9bc01b6de97d4949e9800523838ad9e4114c..fb8836727fed698fee992c9830d6d575bb9671f0 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matops.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matops.h
@@ -20,9 +20,8 @@
#include <vnl/vnl_vector.h>
#include <vnl/vnl_matrix.h>
-//: A collection of Matrix operations
-// mostly declared as static methods.
-// Highlights include matrix gluing, and type conversions.
+//: A collection of vnl_matrix operations, provided as static methods.
+// Highlights include matrix glueing, and type conversions.
// matlab_print has been moved to vnl_matlab_print.h.
class vnl_matops
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix.h
index 818f0039e9a825aac7f7bf67a002f05b8af201a1..98e78741b539a5e07a98e562e03f6f337f813958 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix.h
@@ -7,6 +7,31 @@
//:
// \file
// \brief An ordinary mathematical matrix
+// \verbatim
+// Modifications
+// Apr 21, 1989 - MBN - Initial design and implementation
+// Jun 22, 1989 - MBN - Removed non-destructive methods
+// Aug 09, 1989 - LGO - Inherit from Generic
+// Aug 20, 1989 - MBN - Changed template usage to reflect new syntax
+// Sep 11, 1989 - MBN - Added conditional exception handling and base class
+// Oct 05, 1989 - LGO - Don't re-allocate data in operator= when same size
+// Oct 19, 1989 - LGO - Add extra parameter to varargs constructor
+// Oct 19, 1989 - MBN - Added optional argument to set_compare method
+// Dec 08, 1989 - LGO - Allocate column data in one chunk
+// Dec 08, 1989 - LGO - Clean-up get and put, add const everywhere.
+// Dec 19, 1989 - LGO - Remove the map and reduce methods
+// Feb 22, 1990 - MBN - Changed size arguments from int to unsigned int
+// Jun 30, 1990 - MJF - Added base class name to constructor initializer
+// Feb 21, 1992 - VDN - New lite version
+// May 05, 1992 - VDN - Use envelope to avoid unnecessary copying
+// Sep 30, 1992 - VDN - Matrix inversion with singular value decomposition
+// Aug 21, 1996 - AWF - set_identity, normalize_rows, scale_row.
+// Sep 30, 1996 - AWF - set_row/column methods. Const-correct data_block().
+// 14 Feb 1997 - AWF - get_n_rows, get_n_columns.
+// 20 Mar 1997 - PVR - get_row, get_column.
+// 24-Oct-2010 - Peter Vanroose - mutators and filling methods now return *this
+// 18-Jan-2011 - Peter Vanroose - added methods set_diagonal() & get_diagonal()
+// \endverbatim
#include <vcl_iosfwd.h>
#include <vnl/vnl_tag.h>
@@ -96,7 +121,7 @@ class vnl_matrix
// Complexity $O(1)$
vnl_matrix(unsigned r, unsigned c); // r rows, c cols.
- //: Construct a matrix of size r rows by c columns, and all emelemnts equal to v0
+ //: Construct a matrix of size r rows by c columns, and all elements equal to v0
// Complexity $O(r.c)$
vnl_matrix(unsigned r, unsigned c, T const& v0); // r rows, c cols, value v0.
@@ -193,30 +218,66 @@ class vnl_matrix
}
-// Filling and copying------------------------------------------------
-
- //: Set all elements of matrix to specified value.
- // Complexity $O(r.c)$
- void fill(T const&);
-
- //: Set all diagonal elements of matrix to specified value.
- // Complexity $O(\min(r,c))$
- void fill_diagonal(T const&);
-
- //: Fill (laminate) this matrix with the given data.
- // We assume that p points to a contiguous rows*cols array, stored rowwise.
- void copy_in(T const *);
-
- //: Fill (laminate) this matrix with the given data.
+ // ----------------------- Filling and copying -----------------------
+
+ //: Sets all elements of matrix to specified value, and returns "*this".
+ // Complexity $O(r.c)$
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a matrix to a column-normalized all-elements-equal matrix, say
+ // \code
+ // M.fill(1).normalize_columns();
+ // \endcode
+ // Returning "*this" also allows passing such a matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix<double>(5,5,1.0).normalize_columns());
+ // \endcode
+ vnl_matrix& fill(T const&);
+
+ //: Sets all diagonal elements of matrix to specified value; returns "*this".
+ // Complexity $O(\min(r,c))$
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [5 0 0][0 10 0][0 0 15], just say
+ // \code
+ // M.fill_diagonal(5).scale_row(1,2).scale_column(2,3);
+ // \endcode
+ // Returning "*this" also allows passing a diagonal-filled matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix<double>(3,3).fill_diagonal(5));
+ // \endcode
+ vnl_matrix& fill_diagonal(T const&);
+
+ //: Sets the diagonal elements of this matrix to the specified list of values.
+ // Returning "*this" allows "chaining" two or more operations: see the
+ // reasoning (and the examples) in the documentation for method
+ // fill_diagonal().
+ vnl_matrix& set_diagonal(vnl_vector<T> const&);
+
+ //: Fills (laminates) this matrix with the given data, then returns it.
+ // We assume that the argument points to a contiguous rows*cols array, stored rowwise.
+ // No bounds checking on the array.
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to fill a square matrix column-wise, fill it rowwise then transpose:
+ // \code
+ // M.copy_in(array).inplace_transpose();
+ // \endcode
+ // Returning "*this" also allows passing a filled-in matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix<double>(3,3).copy_in(array));
+ // \endcode
+ vnl_matrix& copy_in(T const *);
+
+ //: Fills (laminates) this matrix with the given data, then returns it.
// A synonym for copy_in()
- void set(T const *d) { copy_in(d); }
+ vnl_matrix& set(T const *d) { return copy_in(d); }
- //: Fill the given array with this matrix.
- // We assume that p points to a contiguous rows*cols array, stored rowwise.
+ //: Fills the given array with this matrix.
+ // We assume that the argument points to a contiguous rows*cols array, stored rowwise.
// No bounds checking on the array.
void copy_out(T *) const;
-
//: Set all elements to value v
// Complexity $O(r.c)$
vnl_matrix<T>& operator=(T const&v) { fill(v); return *this; }
@@ -225,7 +286,7 @@ class vnl_matrix
// Complexity $O(\min(r,c))$
vnl_matrix<T>& operator=(vnl_matrix<T> const&);
-// Arithmetic ----------------------------------------------------
+ // ----------------------- Arithmetic --------------------------------
// note that these functions should not pass scalar as a const&.
// Look what would happen to A /= A(0,0).
@@ -288,32 +349,41 @@ class vnl_matrix
//: Set values of this matrix to those of M, starting at [top,left]
vnl_matrix<T>& update(vnl_matrix<T> const&, unsigned top=0, unsigned left=0);
- //: Set the elements of the i'th column to v[j] (No bounds checking)
- void set_column(unsigned i, T const * v);
+ //: Set the elements of the i'th column to v[i] (No bounds checking)
+ vnl_matrix& set_column(unsigned i, T const * v);
- //: Set the elements of the i'th column to value
- void set_column(unsigned i, T value );
+ //: Set the elements of the i'th column to value, then return *this.
+ vnl_matrix& set_column(unsigned i, T value );
- //: Set j-th column to v
- void set_column(unsigned j, vnl_vector<T> const& v);
+ //: Set j-th column to v, then return *this.
+ vnl_matrix& set_column(unsigned j, vnl_vector<T> const& v);
- //: Set columns to those in M, starting at starting_column
- void set_columns(unsigned starting_column, vnl_matrix<T> const& M);
+ //: Set columns to those in M, starting at starting_column, then return *this.
+ vnl_matrix& set_columns(unsigned starting_column, vnl_matrix<T> const& M);
- //: Set the elements of the i'th row to v[j] (No bounds checking)
- void set_row(unsigned i, T const * v);
+ //: Set the elements of the i'th row to v[i] (No bounds checking)
+ vnl_matrix& set_row(unsigned i, T const * v);
- //: Set the elements of the i'th row to value
- void set_row(unsigned i, T value );
+ //: Set the elements of the i'th row to value, then return *this.
+ vnl_matrix& set_row(unsigned i, T value );
//: Set the i-th row
- void set_row(unsigned i, vnl_vector<T> const&);
+ vnl_matrix& set_row(unsigned i, vnl_vector<T> const&);
//: Extract a sub-matrix of size r x c, starting at (top,left)
// Thus it contains elements [top,top+r-1][left,left+c-1]
vnl_matrix<T> extract(unsigned r, unsigned c,
unsigned top=0, unsigned left=0) const;
+ //: Extract a sub-matrix starting at (top,left)
+ //
+ // The output is stored in \a sub_matrix, and it should have the
+ // required size on entry. Thus the result will contain elements
+ // [top,top+sub_matrix.rows()-1][left,left+sub_matrix.cols()-1]
+ void extract ( vnl_matrix<T>& sub_matrix,
+ unsigned top=0, unsigned left=0) const;
+
+
//: Get a vector equal to the given row
vnl_vector<T> get_row(unsigned r) const;
@@ -326,33 +396,92 @@ class vnl_matrix
//: Get n columns beginning at colstart
vnl_matrix<T> get_n_columns(unsigned colstart, unsigned n) const;
- // mutators
-
- //: Set this matrix to an identity matrix
- // Abort if the matrix is not square
- void set_identity();
-
- //: Transpose this matrix efficiently
- void inplace_transpose();
-
- //: Reverse order of rows.
- void flipud();
- //: Reverse order of columns.
- void fliplr();
-
- //: Normalize each row so it is a unit vector
- // Zero rows are ignored
- void normalize_rows();
-
- //: Normalize each column so it is a unit vector
- // Zero columns are ignored
- void normalize_columns();
-
- //: Scale elements in given row by a factor of T
- void scale_row(unsigned row, T value);
-
- //: Scale elements in given column by a factor of T
- void scale_column(unsigned col, T value);
+ //: Return a vector with the content of the (main) diagonal
+ vnl_vector<T> get_diagonal() const;
+
+ // ==== mutators ====
+
+ //: Sets this matrix to an identity matrix, then returns "*this".
+ // Returning "*this" allows e.g. passing an identity matrix as argument to
+ // a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix<double>(5,5).set_identity());
+ // \endcode
+ // Returning "*this" also allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [3 0 0][0 2 0][0 0 1], one could say
+ // \code
+ // M.set_identity().scale_row(0,3).scale_column(1,2);
+ // \endcode
+ // If the matrix is not square, anyhow set main diagonal to 1, the rest to 0.
+ vnl_matrix& set_identity();
+
+ //: Transposes this matrix efficiently, and returns it.
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to fill a square matrix column-wise, fill it rowwise then transpose:
+ // \code
+ // M.copy_in(array).inplace_transpose();
+ // \endcode
+ vnl_matrix& inplace_transpose();
+
+ //: Reverses the order of rows, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to flip both up-down and left-right, one could just say
+ // \code
+ // M.flipud().fliplr();
+ // \endcode
+ vnl_matrix& flipud();
+
+ //: Reverses the order of columns, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to flip both up-down and left-right, one could just say
+ // \code
+ // M.flipud().fliplr();
+ // \endcode
+ vnl_matrix& fliplr();
+
+ //: Normalizes each row so it is a unit vector, and returns "*this".
+ // Zero rows are not modified
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a matrix to a row-normalized all-elements-equal matrix, say
+ // \code
+ // M.fill(1).normalize_rows();
+ // \endcode
+ // Returning "*this" also allows passing such a matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix<double>(5,5,1.0).normalize_rows());
+ // \endcode
+ vnl_matrix& normalize_rows();
+
+ //: Normalizes each column so it is a unit vector, and returns "*this".
+ // Zero columns are not modified
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a matrix to a column-normalized all-elements-equal matrix, say
+ // \code
+ // M.fill(1).normalize_columns();
+ // \endcode
+ // Returning "*this" also allows passing such a matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix<double>(5,5,1.0).normalize_columns());
+ // \endcode
+ vnl_matrix& normalize_columns();
+
+ //: Scales elements in given row by a factor T, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [3 0 0][0 2 0][0 0 1], one could say
+ // \code
+ // M.set_identity().scale_row(0,3).scale_column(1,2);
+ // \endcode
+ vnl_matrix& scale_row(unsigned row, T value);
+
+ //: Scales elements in given column by a factor T, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [3 0 0][0 2 0][0 0 1], one could say
+ // \code
+ // M.set_identity().scale_row(0,3).scale_column(1,2);
+ // \endcode
+ vnl_matrix& scale_column(unsigned col, T value);
//: Swap this matrix with that matrix
void swap(vnl_matrix<T> & that);
@@ -396,6 +525,12 @@ class vnl_matrix
//: Return maximum value of elements
T max_value() const { return vnl_c_vector<T>::max_value(begin(), size()); }
+ //: Return location of minimum value of elements
+ unsigned arg_min() const { return vnl_c_vector<T>::arg_min(begin(), size()); }
+
+ //: Return location of maximum value of elements
+ unsigned arg_max() const { return vnl_c_vector<T>::arg_max(begin(), size()); }
+
//: Return mean of all matrix elements
T mean() const { return vnl_c_vector<T>::mean(begin(), size()); }
@@ -416,6 +551,9 @@ class vnl_matrix
//: Return true if all elements equal to zero, within given tolerance
bool is_zero(double tol) const;
+ //: Return true if all elements of both matrices are equal, within given tolerance
+ bool is_equal(vnl_matrix<T> const& rhs, double tol) const;
+
//: Return true if finite
bool is_finite() const;
@@ -592,7 +730,7 @@ inline void vnl_matrix<T>::put(unsigned row, unsigned column, T const& value)
// non-member arithmetical operators.
//:
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
template<class T>
inline vnl_matrix<T> operator*(T const& value, vnl_matrix<T> const& m)
{
@@ -600,7 +738,7 @@ inline vnl_matrix<T> operator*(T const& value, vnl_matrix<T> const& m)
}
//:
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
template<class T>
inline vnl_matrix<T> operator+(T const& value, vnl_matrix<T> const& m)
{
@@ -608,7 +746,7 @@ inline vnl_matrix<T> operator+(T const& value, vnl_matrix<T> const& m)
}
//: Swap two matrices
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
template<class T>
inline void swap(vnl_matrix<T> &A, vnl_matrix<T> &B) { A.swap(B); }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix.txx
index 2e26ee944c98647438b2a0a502dca9155fff3d20..13e7b4684f99754685245a44cc7982deee9ccfe6 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix.txx
@@ -15,26 +15,26 @@
// Texas Instruments Incorporated, General Electric Company,
// provides this software "as is" without express or implied warranty.
//
-// Created: MBN 04/21/89 Initial design and implementation
-// Updated: MBN 06/22/89 Removed non-destructive methods
-// Updated: LGO 08/09/89 Inherit from Generic
-// Updated: MBN 08/20/89 Changed template usage to reflect new syntax
-// Updated: MBN 09/11/89 Added conditional exception handling and base class
-// Updated: LGO 10/05/89 Don't re-allocate data in operator= when same size
-// Updated: LGO 10/19/89 Add extra parameter to varargs constructor
-// Updated: MBN 10/19/89 Added optional argument to set_compare method
-// Updated: LGO 12/08/89 Allocate column data in one chunk
-// Updated: LGO 12/08/89 Clean-up get and put, add const everywhere.
-// Updated: LGO 12/19/89 Remove the map and reduce methods
-// Updated: MBN 02/22/90 Changed size arguments from int to unsigned int
-// Updated: MJF 06/30/90 Added base class name to constructor initializer
-// Updated: VDN 02/21/92 New lite version
-// Updated: VDN 05/05/92 Use envelope to avoid unnecessary copying
-// Updated: VDN 09/30/92 Matrix inversion with singular value decomposition
-// Updated: AWF 08/21/96 set_identity, normalize_rows, scale_row.
-// Updated: AWF 09/30/96 set_row/set_column methods. Const-correct data_block().
-// Updated: AWF 14/02/97 get_n_rows, get_n_columns.
-// Updated: PVR 20/03/97 get_row, get_column.
+// Created: MBN Apr 21, 1989 Initial design and implementation
+// Updated: MBN Jun 22, 1989 Removed non-destructive methods
+// Updated: LGO Aug 09, 1989 Inherit from Generic
+// Updated: MBN Aug 20, 1989 Changed template usage to reflect new syntax
+// Updated: MBN Sep 11, 1989 Added conditional exception handling and base class
+// Updated: LGO Oct 05, 1989 Don't re-allocate data in operator= when same size
+// Updated: LGO Oct 19, 1989 Add extra parameter to varargs constructor
+// Updated: MBN Oct 19, 1989 Added optional argument to set_compare method
+// Updated: LGO Dec 08, 1989 Allocate column data in one chunk
+// Updated: LGO Dec 08, 1989 Clean-up get and put, add const everywhere.
+// Updated: LGO Dec 19, 1989 Remove the map and reduce methods
+// Updated: MBN Feb 22, 1990 Changed size arguments from int to unsigned int
+// Updated: MJF Jun 30, 1990 Added base class name to constructor initializer
+// Updated: VDN Feb 21, 1992 New lite version
+// Updated: VDN May 05, 1992 Use envelope to avoid unnecessary copying
+// Updated: VDN Sep 30, 1992 Matrix inversion with singular value decomposition
+// Updated: AWF Aug 21, 1996 set_identity, normalize_rows, scale_row.
+// Updated: AWF Sep 30, 1996 set_row/column methods. Const-correct data_block().
+// Updated: AWF 14 Feb 1997 get_n_rows, get_n_columns.
+// Updated: PVR 20 Mar 1997 get_row, get_column.
//
// The parameterized vnl_matrix<T> class implements two dimensional arithmetic
// matrices of a user specified type. The only constraint placed on the type is
@@ -81,6 +81,7 @@
#include "vnl_matrix.h"
#include <vcl_cassert.h>
+#include <vcl_cstddef.h> // size_t
#include <vcl_cstdio.h> // EOF
#include <vcl_cstdlib.h> // abort()
#include <vcl_cctype.h> // isspace()
@@ -102,10 +103,8 @@
#endif
// This macro allocates and initializes the dynamic storage used by a vnl_matrix.
-#define vnl_matrix_alloc_blah(rowz_, colz_) \
+#define vnl_matrix_alloc_blah() \
do { \
- this->num_rows = (rowz_); \
- this->num_cols = (colz_); \
if (this->num_rows && this->num_cols) { \
/* Allocate memory to hold the row pointers */ \
this->data = vnl_c_vector<T>::allocate_Tptr(this->num_rows); \
@@ -128,7 +127,8 @@ do { \
if (this->num_cols && this->num_rows) { \
vnl_c_vector<T>::deallocate(this->data[0], this->num_cols * this->num_rows); \
vnl_c_vector<T>::deallocate(this->data, this->num_rows); \
- } else { \
+ } \
+ else { \
vnl_c_vector<T>::deallocate(this->data, 1); \
} \
} \
@@ -137,47 +137,61 @@ do { \
//: Creates a matrix with given number of rows and columns.
// Elements are not initialized. O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (unsigned rowz, unsigned colz)
+: num_rows(rowz), num_cols(colz)
{
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(rowz, colz);
+ vnl_matrix_alloc_blah();
}
//: Creates a matrix with given number of rows and columns, and initialize all elements to value. O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (unsigned rowz, unsigned colz, T const& value)
+: num_rows(rowz), num_cols(colz)
{
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(rowz, colz);
+ vnl_matrix_alloc_blah();
for (unsigned int i = 0; i < rowz; ++ i)
for (unsigned int j = 0; j < colz; ++ j)
this->data[i][j] = value;
}
-//: r rows, c cols, special type. Currently implements "identity".
+//: r rows, c cols, special type. Currently implements "identity" and "null".
template <class T>
vnl_matrix<T>::vnl_matrix(unsigned r, unsigned c, vnl_matrix_type t)
+: num_rows(r), num_cols(c)
{
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(r, c);
- if (t == vnl_matrix_identity) {
+ vnl_matrix_alloc_blah();
+ switch (t) {
+ case vnl_matrix_identity:
assert(r == c);
for (unsigned int i = 0; i < r; ++ i)
for (unsigned int j = 0; j < c; ++ j)
this->data[i][j] = (i==j) ? T(1) : T(0);
+ break;
+ case vnl_matrix_null:
+ for (unsigned int i = 0; i < r; ++ i)
+ for (unsigned int j = 0; j < c; ++ j)
+ this->data[i][j] = T(0);
+ break;
+ default:
+ assert(false);
+ break;
}
}
#if 1 // fsm: who uses this?
//: Creates a matrix with given dimension (rows, cols) and initialize first n elements, row-wise, to values. O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (unsigned rowz, unsigned colz, unsigned n, T const values[])
+: num_rows(rowz), num_cols(colz)
{
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(rowz, colz);
+ vnl_matrix_alloc_blah();
if (n > rowz*colz)
n = rowz*colz;
T *dst = this->data[0];
@@ -189,11 +203,12 @@ vnl_matrix<T>::vnl_matrix (unsigned rowz, unsigned colz, unsigned n, T const val
//: Creates a matrix from a block array of data, stored row-wise.
// O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (T const* datablck, unsigned rowz, unsigned colz)
+: num_rows(rowz), num_cols(colz)
{
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(rowz, colz);
+ vnl_matrix_alloc_blah();
unsigned int n = rowz*colz;
T *dst = this->data[0];
for (unsigned int k=0; k<n; ++k)
@@ -204,12 +219,13 @@ vnl_matrix<T>::vnl_matrix (T const* datablck, unsigned rowz, unsigned colz)
//: Creates a new matrix and copies all the elements.
// O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const& from)
+: num_rows(from.num_rows), num_cols(from.num_cols)
{
vnl_matrix_construct_hack();
if (from.data) {
- vnl_matrix_alloc_blah(from.num_rows, from.num_cols);
+ vnl_matrix_alloc_blah();
unsigned int n = this->num_rows * this->num_cols;
T *dst = this->data[0];
T const *src = from.data[0];
@@ -225,8 +241,9 @@ vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const& from)
//------------------------------------------------------------
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &A, vnl_matrix<T> const &B, vnl_tag_add)
+: num_rows(A.num_rows), num_cols(A.num_cols)
{
#ifndef NDEBUG
if (A.num_rows != B.num_rows || A.num_cols != B.num_cols)
@@ -234,7 +251,7 @@ vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &A, vnl_matrix<T> const &B, vnl_t
#endif
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(A.num_rows, A.num_cols);
+ vnl_matrix_alloc_blah();
unsigned int n = A.num_rows * A.num_cols;
T const *a = A.data[0];
@@ -242,11 +259,12 @@ vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &A, vnl_matrix<T> const &B, vnl_t
T *dst = this->data[0];
for (unsigned int i=0; i<n; ++i)
- dst[i] = a[i] + b[i];
+ dst[i] = T(a[i] + b[i]);
}
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &A, vnl_matrix<T> const &B, vnl_tag_sub)
+: num_rows(A.num_rows), num_cols(A.num_cols)
{
#ifndef NDEBUG
if (A.num_rows != B.num_rows || A.num_cols != B.num_cols)
@@ -254,7 +272,7 @@ vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &A, vnl_matrix<T> const &B, vnl_t
#endif
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(A.num_rows, A.num_cols);
+ vnl_matrix_alloc_blah();
unsigned int n = A.num_rows * A.num_cols;
T const *a = A.data[0];
@@ -262,67 +280,72 @@ vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &A, vnl_matrix<T> const &B, vnl_t
T *dst = this->data[0];
for (unsigned int i=0; i<n; ++i)
- dst[i] = a[i] - b[i];
+ dst[i] = T(a[i] - b[i]);
}
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &M, T s, vnl_tag_mul)
+: num_rows(M.num_rows), num_cols(M.num_cols)
{
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(M.num_rows, M.num_cols);
+ vnl_matrix_alloc_blah();
unsigned int n = M.num_rows * M.num_cols;
T const *m = M.data[0];
T *dst = this->data[0];
for (unsigned int i=0; i<n; ++i)
- dst[i] = m[i] * s;
+ dst[i] = T(m[i] * s);
}
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &M, T s, vnl_tag_div)
+: num_rows(M.num_rows), num_cols(M.num_cols)
{
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(M.num_rows, M.num_cols);
+ vnl_matrix_alloc_blah();
unsigned int n = M.num_rows * M.num_cols;
T const *m = M.data[0];
T *dst = this->data[0];
for (unsigned int i=0; i<n; ++i)
- dst[i] = m[i] / s;
+ dst[i] = T(m[i] / s);
}
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &M, T s, vnl_tag_add)
+: num_rows(M.num_rows), num_cols(M.num_cols)
{
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(M.num_rows, M.num_cols);
+ vnl_matrix_alloc_blah();
unsigned int n = M.num_rows * M.num_cols;
T const *m = M.data[0];
T *dst = this->data[0];
for (unsigned int i=0; i<n; ++i)
- dst[i] = m[i] + s;
+ dst[i] = T(m[i] + s);
}
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &M, T s, vnl_tag_sub)
+: num_rows(M.num_rows), num_cols(M.num_cols)
{
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(M.num_rows, M.num_cols);
+ vnl_matrix_alloc_blah();
unsigned int n = M.num_rows * M.num_cols;
T const *m = M.data[0];
T *dst = this->data[0];
for (unsigned int i=0; i<n; ++i)
- dst[i] = m[i] - s;
+ dst[i] = T(m[i] - s);
}
-template<class T>
+template <class T>
vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &A, vnl_matrix<T> const &B, vnl_tag_mul)
+: num_rows(A.num_rows), num_cols(B.num_cols)
{
#ifndef NDEBUG
if (A.num_cols != B.num_rows)
@@ -334,13 +357,13 @@ vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &A, vnl_matrix<T> const &B, vnl_t
unsigned int n = B.num_cols;
vnl_matrix_construct_hack();
- vnl_matrix_alloc_blah(l, n);
+ vnl_matrix_alloc_blah();
for (unsigned int i=0; i<l; ++i) {
for (unsigned int k=0; k<n; ++k) {
T sum(0);
for (unsigned int j=0; j<m; ++j)
- sum += A.data[i][j] * B.data[j][k];
+ sum += T(A.data[i][j] * B.data[j][k]);
this->data[i][k] = sum;
}
}
@@ -348,7 +371,7 @@ vnl_matrix<T>::vnl_matrix (vnl_matrix<T> const &A, vnl_matrix<T> const &B, vnl_t
//------------------------------------------------------------
-template<class T>
+template <class T>
vnl_matrix<T>::~vnl_matrix()
{
// save some fcalls if data is 0 (i.e. in matrix_fixed)
@@ -362,13 +385,13 @@ vnl_matrix<T>::~vnl_matrix()
//: Frees up the dynamic storage used by matrix.
// O(m*n).
-template<class T>
+template <class T>
void vnl_matrix<T>::destroy()
{
vnl_matrix_free_blah;
}
-template<class T>
+template <class T>
void vnl_matrix<T>::clear()
{
if (data) {
@@ -383,7 +406,7 @@ void vnl_matrix<T>::clear()
// Elements are not initialized, existing data is not preserved.
// Returns true if size is changed.
-template<class T>
+template <class T>
bool vnl_matrix<T>::set_size (unsigned rowz, unsigned colz)
{
if (this->data) {
@@ -393,11 +416,13 @@ bool vnl_matrix<T>::set_size (unsigned rowz, unsigned colz)
// else, simply release old storage and allocate new.
vnl_matrix_free_blah;
- vnl_matrix_alloc_blah(rowz, colz);
+ this->num_rows = rowz; this->num_cols = colz;
+ vnl_matrix_alloc_blah();
}
else {
// This happens if the matrix is default constructed.
- vnl_matrix_alloc_blah(rowz, colz);
+ this->num_rows = rowz; this->num_cols = colz;
+ vnl_matrix_alloc_blah();
}
return true;
@@ -410,27 +435,44 @@ bool vnl_matrix<T>::set_size (unsigned rowz, unsigned colz)
//: Sets all elements of matrix to specified value. O(m*n).
-template<class T>
-void vnl_matrix<T>::fill (T const& value)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::fill (T const& value)
{
for (unsigned int i = 0; i < this->num_rows; i++)
for (unsigned int j = 0; j < this->num_cols; j++)
this->data[i][j] = value;
+ return *this;
}
//: Sets all diagonal elements of matrix to specified value. O(n).
-template<class T>
-void vnl_matrix<T>::fill_diagonal (T const& value)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::fill_diagonal (T const& value)
{
- for (unsigned int i = 0; i < this->num_rows && i < this->num_cols; i++)
+ for (unsigned int i = 0; i < this->num_rows && i < this->num_cols; ++i)
this->data[i][i] = value;
+ return *this;
+}
+
+//: Sets the diagonal elements of this matrix to the specified list of values.
+
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::set_diagonal(vnl_vector<T> const& diag)
+{
+ assert(diag.size() >= this->num_rows ||
+ diag.size() >= this->num_cols);
+ // The length of the diagonal of a non-square matrix is the minimum of
+ // the matrix's width & height; that explains the "||" in the assert,
+ // and the "&&" in the upper bound for the "for".
+ for (unsigned int i = 0; i < this->num_rows && i < this->num_cols; ++i)
+ this->data[i][i] = diag[i];
+ return *this;
}
#if 0
//: Assigns value to all elements of a matrix. O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T>& vnl_matrix<T>::operator= (T const& value)
{
for (unsigned i = 0; i < this->num_rows; i++) // For each row in Matrix
@@ -444,7 +486,7 @@ vnl_matrix<T>& vnl_matrix<T>::operator= (T const& value)
// If needed, the arrays in lhs matrix are freed up, and new arrays are
// allocated to match the dimensions of the rhs matrix.
-template<class T>
+template <class T>
vnl_matrix<T>& vnl_matrix<T>::operator= (vnl_matrix<T> const& rhs)
{
if (this != &rhs) { // make sure *this != m
@@ -462,7 +504,7 @@ vnl_matrix<T>& vnl_matrix<T>::operator= (vnl_matrix<T> const& rhs)
return *this;
}
-template<class T>
+template <class T>
void vnl_matrix<T>::print(vcl_ostream& os) const
{
for (unsigned int i = 0; i < this->rows(); i++) {
@@ -475,7 +517,7 @@ void vnl_matrix<T>::print(vcl_ostream& os) const
//: Prints the 2D array of elements of a matrix out to a stream.
// O(m*n).
-template<class T>
+template <class T>
vcl_ostream& operator<< (vcl_ostream& os, vnl_matrix<T> const& m)
{
for (unsigned int i = 0; i < m.rows(); ++i) {
@@ -486,16 +528,16 @@ vcl_ostream& operator<< (vcl_ostream& os, vnl_matrix<T> const& m)
return os;
}
-//: Read an vnl_matrix from an ascii vcl_istream.
+//: Read a vnl_matrix from an ascii vcl_istream.
// Automatically determines file size if the input matrix has zero size.
-template<class T>
+template <class T>
vcl_istream& operator>>(vcl_istream& s, vnl_matrix<T>& M)
{
M.read_ascii(s);
return s;
}
-template<class T>
+template <class T>
void vnl_matrix<T>::inline_function_tickler()
{
vnl_matrix<T> M;
@@ -503,7 +545,7 @@ void vnl_matrix<T>::inline_function_tickler()
M = T(1) + T(3) * M;
}
-template<class T>
+template <class T>
vnl_matrix<T>& vnl_matrix<T>::operator+= (T value)
{
for (unsigned int i = 0; i < this->num_rows; i++)
@@ -512,7 +554,7 @@ vnl_matrix<T>& vnl_matrix<T>::operator+= (T value)
return *this;
}
-template<class T>
+template <class T>
vnl_matrix<T>& vnl_matrix<T>::operator-= (T value)
{
for (unsigned int i = 0; i < this->num_rows; i++)
@@ -521,7 +563,7 @@ vnl_matrix<T>& vnl_matrix<T>::operator-= (T value)
return *this;
}
-template<class T>
+template <class T>
vnl_matrix<T>& vnl_matrix<T>::operator*= (T value)
{
for (unsigned int i = 0; i < this->num_rows; i++)
@@ -530,7 +572,7 @@ vnl_matrix<T>& vnl_matrix<T>::operator*= (T value)
return *this;
}
-template<class T>
+template <class T>
vnl_matrix<T>& vnl_matrix<T>::operator/= (T value)
{
for (unsigned int i = 0; i < this->num_rows; i++)
@@ -543,7 +585,7 @@ vnl_matrix<T>& vnl_matrix<T>::operator/= (T value)
//: Adds lhs matrix with rhs matrix, and stores in place in lhs matrix.
// O(m*n). The dimensions of the two matrices must be identical.
-template<class T>
+template <class T>
vnl_matrix<T>& vnl_matrix<T>::operator+= (vnl_matrix<T> const& rhs)
{
#ifndef NDEBUG
@@ -564,7 +606,7 @@ vnl_matrix<T>& vnl_matrix<T>::operator+= (vnl_matrix<T> const& rhs)
// O(m*n).
// The dimensions of the two matrices must be identical.
-template<class T>
+template <class T>
vnl_matrix<T>& vnl_matrix<T>::operator-= (vnl_matrix<T> const& rhs)
{
#ifndef NDEBUG
@@ -581,13 +623,13 @@ vnl_matrix<T>& vnl_matrix<T>::operator-= (vnl_matrix<T> const& rhs)
}
-template<class T>
+template <class T>
vnl_matrix<T> operator- (T const& value, vnl_matrix<T> const& m)
{
vnl_matrix<T> result(m.rows(),m.columns());
for (unsigned int i = 0; i < m.rows(); i++) // For each row
for (unsigned int j = 0; j < m.columns(); j++) // For each element in column
- result.put(i,j, value - m.get(i,j) ); // subtract from value element.
+ result.put(i,j, T(value - m.get(i,j)) ); // subtract from value element.
return result;
}
@@ -597,7 +639,7 @@ vnl_matrix<T> operator- (T const& value, vnl_matrix<T> const& m)
// O(n^3). Number of columns of first matrix must match number of rows
// of second matrix.
-template<class T>
+template <class T>
vnl_matrix<T> vnl_matrix<T>::operator* (vnl_matrix<T> const& rhs) const
{
#ifndef NDEBUG
@@ -622,7 +664,7 @@ vnl_matrix<T> vnl_matrix<T>::operator* (vnl_matrix<T> const& rhs) const
//: Returns new matrix which is the negation of THIS matrix.
// O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T> vnl_matrix<T>::operator- () const
{
vnl_matrix<T> result(this->num_rows, this->num_cols);
@@ -636,7 +678,7 @@ vnl_matrix<T> vnl_matrix<T>::operator- () const
//: Returns new matrix with elements of lhs matrix added with value.
// O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T> vnl_matrix<T>::operator+ (T const& value) const
{
vnl_matrix<T> result(this->num_rows, this->num_cols);
@@ -650,7 +692,7 @@ vnl_matrix<T> vnl_matrix<T>::operator+ (T const& value) const
//: Returns new matrix with elements of lhs matrix multiplied with value.
// O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T> vnl_matrix<T>::operator* (T const& value) const
{
vnl_matrix<T> result(this->num_rows, this->num_cols);
@@ -662,7 +704,7 @@ vnl_matrix<T> vnl_matrix<T>::operator* (T const& value) const
//: Returns new matrix with elements of lhs matrix divided by value. O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T> vnl_matrix<T>::operator/ (T const& value) const
{
vnl_matrix<T> result(this->num_rows, this->num_cols);
@@ -696,7 +738,7 @@ vnl_matrix<T> vnl_matrix<T>::apply(T (*f)(T)) const
//: Returns new matrix with rows and columns transposed.
// O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T> vnl_matrix<T>::transpose() const
{
vnl_matrix<T> result(this->num_cols, this->num_rows);
@@ -708,7 +750,7 @@ vnl_matrix<T> vnl_matrix<T>::transpose() const
// adjoint/hermitian transpose
-template<class T>
+template <class T>
vnl_matrix<T> vnl_matrix<T>::conjugate_transpose() const
{
vnl_matrix<T> result(transpose());
@@ -721,7 +763,7 @@ vnl_matrix<T> vnl_matrix<T>::conjugate_transpose() const
//: Replaces the submatrix of THIS matrix, starting at top left corner, by the elements of matrix m. O(m*n).
// This is the reverse of extract().
-template<class T>
+template <class T>
vnl_matrix<T>& vnl_matrix<T>::update (vnl_matrix<T> const& m,
unsigned top, unsigned left)
{
@@ -742,9 +784,19 @@ vnl_matrix<T>& vnl_matrix<T>::update (vnl_matrix<T> const& m,
//: Returns a copy of submatrix of THIS matrix, specified by the top-left corner and size in rows, cols. O(m*n).
// Use update() to copy new values of this submatrix back into THIS matrix.
-template<class T>
+template <class T>
vnl_matrix<T> vnl_matrix<T>::extract (unsigned rowz, unsigned colz,
- unsigned top, unsigned left) const{
+ unsigned top, unsigned left) const {
+ vnl_matrix<T> result(rowz, colz);
+ this->extract( result, top, left );
+ return result;
+}
+
+template <class T>
+void vnl_matrix<T>::extract( vnl_matrix<T>& submatrix,
+ unsigned top, unsigned left) const {
+ unsigned const rowz = submatrix.rows();
+ unsigned const colz = submatrix.cols();
#ifndef NDEBUG
unsigned int bottom = top + rowz;
unsigned int right = left + colz;
@@ -752,17 +804,15 @@ vnl_matrix<T> vnl_matrix<T>::extract (unsigned rowz, unsigned colz,
vnl_error_matrix_dimension ("extract",
this->num_rows, this->num_cols, bottom, right);
#endif
- vnl_matrix<T> result(rowz, colz);
for (unsigned int i = 0; i < rowz; i++) // actual copy of all elements
for (unsigned int j = 0; j < colz; j++) // in submatrix
- result.data[i][j] = data[top+i][left+j];
- return result;
+ submatrix.data[i][j] = data[top+i][left+j];
}
//: Returns the dot product of the two matrices. O(m*n).
// This is the sum of all pairwise products of the elements m1[i,j]*m2[i,j].
-template<class T>
+template <class T>
T dot_product (vnl_matrix<T> const& m1, vnl_matrix<T> const& m2)
{
#ifndef NDEBUG
@@ -777,7 +827,7 @@ T dot_product (vnl_matrix<T> const& m1, vnl_matrix<T> const& m2)
//: Hermitian inner product.
// O(mn).
-template<class T>
+template <class T>
T inner_product (vnl_matrix<T> const& m1, vnl_matrix<T> const& m2)
{
#ifndef NDEBUG
@@ -791,15 +841,14 @@ T inner_product (vnl_matrix<T> const& m1, vnl_matrix<T> const& m2)
// cos_angle. O(mn).
-template<class T>
+template <class T>
T cos_angle (vnl_matrix<T> const& a, vnl_matrix<T> const& b)
{
- typedef typename vnl_numeric_traits<T>::real_t real_t;
- typedef typename vnl_numeric_traits<T>::abs_t abs_t;
- typedef typename vnl_numeric_traits<abs_t>::real_t abs_r;
+ typedef typename vnl_numeric_traits<T>::abs_t Abs_t;
+ typedef typename vnl_numeric_traits<Abs_t>::real_t abs_r;
T ab = inner_product(a,b);
- abs_t a_b = (abs_t)vcl_sqrt( (abs_r)vnl_math_abs(inner_product(a,a) * inner_product(b,b)) );
+ Abs_t a_b = (Abs_t)vcl_sqrt( (abs_r)vnl_math_abs(inner_product(a,a) * inner_product(b,b)) );
return T( ab / a_b);
}
@@ -807,7 +856,7 @@ T cos_angle (vnl_matrix<T> const& a, vnl_matrix<T> const& b)
//: Returns new matrix whose elements are the products m1[ij]*m2[ij].
// O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T> element_product (vnl_matrix<T> const& m1,
vnl_matrix<T> const& m2)
{
@@ -819,14 +868,14 @@ vnl_matrix<T> element_product (vnl_matrix<T> const& m1,
vnl_matrix<T> result(m1.rows(), m1.columns());
for (unsigned int i = 0; i < m1.rows(); i++)
for (unsigned int j = 0; j < m1.columns(); j++)
- result.put(i,j, m1.get(i,j) * m2.get(i,j) );
+ result.put(i,j, T(m1.get(i,j) * m2.get(i,j)) );
return result;
}
//: Returns new matrix whose elements are the quotients m1[ij]/m2[ij].
// O(m*n).
-template<class T>
+template <class T>
vnl_matrix<T> element_quotient (vnl_matrix<T> const& m1,
vnl_matrix<T> const& m2)
{
@@ -838,24 +887,25 @@ vnl_matrix<T> element_quotient (vnl_matrix<T> const& m1,
vnl_matrix<T> result(m1.rows(), m1.columns());
for (unsigned int i = 0; i < m1.rows(); i++)
for (unsigned int j = 0; j < m1.columns(); j++)
- result.put(i,j, m1.get(i,j) / m2.get(i,j) );
+ result.put(i,j, T(m1.get(i,j) / m2.get(i,j)) );
return result;
}
//: Fill this matrix with the given data.
// We assume that p points to a contiguous rows*cols array, stored rowwise.
-template<class T>
-void vnl_matrix<T>::copy_in(T const *p)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::copy_in(T const *p)
{
T* dp = this->data[0];
unsigned int n = this->num_rows * this->num_cols;
while (n--)
*dp++ = *p++;
+ return *this;
}
//: Fill the given array with this matrix.
// We assume that p points to a contiguous rows*cols array, stored rowwise.
-template<class T>
+template <class T>
void vnl_matrix<T>::copy_out(T *p) const
{
T* dp = this->data[0];
@@ -864,67 +914,63 @@ void vnl_matrix<T>::copy_out(T *p) const
*p++ = *dp++;
}
-//: Fill this matrix with a row*row identity matrix.
-template<class T>
-void vnl_matrix<T>::set_identity()
+//: Fill this matrix with a matrix having 1s on the main diagonal and 0s elsewhere.
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::set_identity()
{
-#ifndef NDEBUG
- if (this->num_rows != this->num_cols) // Size?
- vnl_error_matrix_nonsquare ("set_identity");
-#endif
- for (unsigned int i = 0; i < this->num_rows; i++) // For each row in the Matrix
- for (unsigned int j = 0; j < this->num_cols; j++) // For each element in column
- if (i == j)
- this->data[i][j] = T(1);
- else
- this->data[i][j] = T(0);
+ for (unsigned int i = 0; i < this->num_rows; ++i) // For each row in the Matrix
+ for (unsigned int j = 0; j < this->num_cols; ++j) // For each element in column
+ this->data[i][j] = (i==j) ? T(1) : T(0);
+ return *this;
}
//: Make each row of the matrix have unit norm.
// All-zero rows are ignored.
-template<class T>
-void vnl_matrix<T>::normalize_rows()
-{
- typedef typename vnl_numeric_traits<T>::abs_t abs_t;
- typedef typename vnl_numeric_traits<T>::real_t real_t;
- typedef typename vnl_numeric_traits<real_t>::abs_t abs_real_t;
- for (unsigned int i = 0; i < this->num_rows; i++) { // For each row in the Matrix
- abs_t norm(0); // double will not do for all types.
- for (unsigned int j = 0; j < this->num_cols; j++) // For each element in row
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::normalize_rows()
+{
+ typedef typename vnl_numeric_traits<T>::abs_t Abs_t;
+ typedef typename vnl_numeric_traits<T>::real_t Real_t;
+ typedef typename vnl_numeric_traits<Real_t>::abs_t abs_real_t;
+ for (unsigned int i = 0; i < this->num_rows; ++i) { // For each row in the Matrix
+ Abs_t norm(0); // double will not do for all types.
+ for (unsigned int j = 0; j < this->num_cols; ++j) // For each element in row
norm += vnl_math_squared_magnitude(this->data[i][j]);
if (norm != 0) {
abs_real_t scale = abs_real_t(1)/(vcl_sqrt((abs_real_t)norm));
- for (unsigned int j = 0; j < this->num_cols; j++)
- this->data[i][j] = T(real_t(this->data[i][j]) * scale);
+ for (unsigned int j = 0; j < this->num_cols; ++j)
+ this->data[i][j] = T(Real_t(this->data[i][j]) * scale);
}
}
+ return *this;
}
//: Make each column of the matrix have unit norm.
// All-zero columns are ignored.
-template<class T>
-void vnl_matrix<T>::normalize_columns()
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::normalize_columns()
{
- typedef typename vnl_numeric_traits<T>::abs_t abs_t;
- typedef typename vnl_numeric_traits<T>::real_t real_t;
- typedef typename vnl_numeric_traits<real_t>::abs_t abs_real_t;
+ typedef typename vnl_numeric_traits<T>::abs_t Abs_t;
+ typedef typename vnl_numeric_traits<T>::real_t Real_t;
+ typedef typename vnl_numeric_traits<Real_t>::abs_t abs_real_t;
for (unsigned int j = 0; j < this->num_cols; j++) { // For each column in the Matrix
- abs_t norm(0); // double will not do for all types.
+ Abs_t norm(0); // double will not do for all types.
for (unsigned int i = 0; i < this->num_rows; i++)
norm += vnl_math_squared_magnitude(this->data[i][j]);
if (norm != 0) {
abs_real_t scale = abs_real_t(1)/(vcl_sqrt((abs_real_t)norm));
for (unsigned int i = 0; i < this->num_rows; i++)
- this->data[i][j] = T(real_t(this->data[i][j]) * scale);
+ this->data[i][j] = T(Real_t(this->data[i][j]) * scale);
}
}
+ return *this;
}
//: Multiply row[row_index] by value
-template<class T>
-void vnl_matrix<T>::scale_row(unsigned row_index, T value)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::scale_row(unsigned row_index, T value)
{
#ifndef NDEBUG
if (row_index >= this->num_rows)
@@ -932,11 +978,12 @@ void vnl_matrix<T>::scale_row(unsigned row_index, T value)
#endif
for (unsigned int j = 0; j < this->num_cols; j++) // For each element in row
this->data[row_index][j] *= value;
+ return *this;
}
//: Multiply column[column_index] by value
-template<class T>
-void vnl_matrix<T>::scale_column(unsigned column_index, T value)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::scale_column(unsigned column_index, T value)
{
#ifndef NDEBUG
if (column_index >= this->num_cols)
@@ -944,10 +991,11 @@ void vnl_matrix<T>::scale_column(unsigned column_index, T value)
#endif
for (unsigned int j = 0; j < this->num_rows; j++) // For each element in column
this->data[j][column_index] *= value;
+ return *this;
}
//: Returns a copy of n rows, starting from "row"
-template<class T>
+template <class T>
vnl_matrix<T> vnl_matrix<T>::get_n_rows (unsigned row, unsigned n) const
{
#ifndef NDEBUG
@@ -960,7 +1008,7 @@ vnl_matrix<T> vnl_matrix<T>::get_n_rows (unsigned row, unsigned n) const
}
//: Returns a copy of n columns, starting from "column".
-template<class T>
+template <class T>
vnl_matrix<T> vnl_matrix<T>::get_n_columns (unsigned column, unsigned n) const
{
#ifndef NDEBUG
@@ -976,7 +1024,7 @@ vnl_matrix<T> vnl_matrix<T>::get_n_columns (unsigned column, unsigned n) const
}
//: Create a vector out of row[row_index].
-template<class T>
+template <class T>
vnl_vector<T> vnl_matrix<T>::get_row(unsigned row_index) const
{
#ifdef ERROR_CHECKING
@@ -991,7 +1039,7 @@ vnl_vector<T> vnl_matrix<T>::get_row(unsigned row_index) const
}
//: Create a vector out of column[column_index].
-template<class T>
+template <class T>
vnl_vector<T> vnl_matrix<T>::get_column(unsigned column_index) const
{
#ifdef ERROR_CHECKING
@@ -1005,68 +1053,84 @@ vnl_vector<T> vnl_matrix<T>::get_column(unsigned column_index) const
return v;
}
+//: Return a vector with the content of the (main) diagonal
+template <class T>
+vnl_vector<T> vnl_matrix<T>::get_diagonal() const
+{
+ vnl_vector<T> v(this->num_rows < this->num_cols ? this->num_rows : this->num_cols);
+ for (unsigned int j = 0; j < this->num_rows && j < this->num_cols; ++j)
+ v[j] = this->data[j][j];
+ return v;
+}
+
//--------------------------------------------------------------------------------
//: Set row[row_index] to data at given address. No bounds check.
-template<class T>
-void vnl_matrix<T>::set_row(unsigned row_index, T const *v)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::set_row(unsigned row_index, T const *v)
{
for (unsigned int j = 0; j < this->num_cols; j++) // For each element in row
this->data[row_index][j] = v[j];
+ return *this;
}
//: Set row[row_index] to given vector.
-template<class T>
-void vnl_matrix<T>::set_row(unsigned row_index, vnl_vector<T> const &v)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::set_row(unsigned row_index, vnl_vector<T> const &v)
{
#ifndef NDEBUG
if (v.size() != this->num_cols)
vnl_error_vector_dimension ("vnl_matrix::set_row", v.size(), this->num_cols);
#endif
set_row(row_index,v.data_block());
+ return *this;
}
//: Set row[row_index] to given value.
-template<class T>
-void vnl_matrix<T>::set_row(unsigned row_index, T v)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::set_row(unsigned row_index, T v)
{
for (unsigned int j = 0; j < this->num_cols; j++) // For each element in row
this->data[row_index][j] = v;
+ return *this;
}
//--------------------------------------------------------------------------------
//: Set column[column_index] to data at given address.
-template<class T>
-void vnl_matrix<T>::set_column(unsigned column_index, T const *v)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::set_column(unsigned column_index, T const *v)
{
for (unsigned int i = 0; i < this->num_rows; i++) // For each element in row
this->data[i][column_index] = v[i];
+ return *this;
}
//: Set column[column_index] to given vector.
-template<class T>
-void vnl_matrix<T>::set_column(unsigned column_index, vnl_vector<T> const &v)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::set_column(unsigned column_index, vnl_vector<T> const &v)
{
#ifndef NDEBUG
if (v.size() != this->num_rows)
vnl_error_vector_dimension ("vnl_matrix::set_column", v.size(), this->num_rows);
#endif
set_column(column_index,v.data_block());
+ return *this;
}
//: Set column[column_index] to given value.
-template<class T>
-void vnl_matrix<T>::set_column(unsigned column_index, T v)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::set_column(unsigned column_index, T v)
{
for (unsigned int j = 0; j < this->num_rows; j++) // For each element in row
this->data[j][column_index] = v;
+ return *this;
}
//: Set columns starting at starting_column to given matrix
-template<class T>
-void vnl_matrix<T>::set_columns(unsigned starting_column, vnl_matrix<T> const& m)
+template <class T>
+vnl_matrix<T>& vnl_matrix<T>::set_columns(unsigned starting_column, vnl_matrix<T> const& m)
{
#ifndef NDEBUG
if (this->num_rows != m.num_rows ||
@@ -1079,6 +1143,7 @@ void vnl_matrix<T>::set_columns(unsigned starting_column, vnl_matrix<T> const& m
for (unsigned int j = 0; j < m.num_cols; ++j)
for (unsigned int i = 0; i < this->num_rows; i++) // For each element in row
this->data[i][starting_column + j] = m.data[i][j];
+ return *this;
}
//--------------------------------------------------------------------------------
@@ -1089,7 +1154,7 @@ void vnl_matrix<T>::set_columns(unsigned starting_column, vnl_matrix<T> const& m
// Change this default with set_compare() at run time or by specializing
// vnl_matrix_compare at compile time.
-template<class T>
+template <class T>
bool vnl_matrix<T>::operator_eq(vnl_matrix<T> const& rhs) const
{
if (this == &rhs) // same object => equal.
@@ -1099,13 +1164,31 @@ bool vnl_matrix<T>::operator_eq(vnl_matrix<T> const& rhs) const
return false; // different sizes => not equal.
for (unsigned int i = 0; i < this->num_rows; i++) // For each row
- for (unsigned int j = 0; j < this->num_cols; j++) // For each columne
+ for (unsigned int j = 0; j < this->num_cols; j++) // For each column
if (!(this->data[i][j] == rhs.data[i][j])) // different element ?
return false; // Then not equal.
return true; // Else same; return true
}
+template <class T>
+bool vnl_matrix<T>::is_equal(vnl_matrix<T> const& rhs, double tol) const
+{
+ if (this == &rhs) // same object => equal.
+ return true;
+
+ if (this->num_rows != rhs.num_rows || this->num_cols != rhs.num_cols)
+ return false; // different sizes => not equal.
+
+ for (unsigned int i = 0; i < this->rows(); ++i)
+ for (unsigned int j = 0; j < this->columns(); ++j)
+ if (vnl_math_abs(this->data[i][j] - rhs.data[i][j]) > tol)
+ return false; // difference greater than tol
+
+ return true;
+}
+
+
template <class T>
bool vnl_matrix<T>::is_identity() const
{
@@ -1254,7 +1337,7 @@ bool vnl_matrix<T>::read_ascii(vcl_istream& s)
if (c == EOF)
goto loademup;
if (!vcl_isspace(c)) {
- if (!s.putback(c).good())
+ if (!s.putback(char(c)).good())
vcl_cerr << "vnl_matrix<T>::read_ascii: Could not push back '" << c << "'\n";
goto readfloat;
@@ -1273,7 +1356,7 @@ bool vnl_matrix<T>::read_ascii(vcl_istream& s)
goto loademup;
}
loademup:
- unsigned int colz = first_row_vals.size();
+ vcl_size_t colz = first_row_vals.size();
if (debug) vcl_cerr << colz << " cols, ";
@@ -1323,7 +1406,7 @@ bool vnl_matrix<T>::read_ascii(vcl_istream& s)
row_vals.push_back(row);
}
- unsigned int rowz = row_vals.size();
+ vcl_size_t rowz = row_vals.size();
if (debug)
vcl_cerr << rowz << " rows.\n";
@@ -1365,7 +1448,7 @@ void vnl_matrix<T>::swap(vnl_matrix<T> &that)
//: Reverse order of rows. Name is from Matlab, meaning "flip upside down".
template <class T>
-void vnl_matrix<T>::flipud()
+vnl_matrix<T>& vnl_matrix<T>::flipud()
{
unsigned int n = this->rows();
unsigned int colz = this->columns();
@@ -1380,11 +1463,12 @@ void vnl_matrix<T>::flipud()
(*this)(r2, c) = tmp;
}
}
+ return *this;
}
//: Reverse order of columns.
template <class T>
-void vnl_matrix<T>::fliplr()
+vnl_matrix<T>& vnl_matrix<T>::fliplr()
{
unsigned int n = this->cols();
unsigned int rowz = this->rows();
@@ -1399,6 +1483,7 @@ void vnl_matrix<T>::fliplr()
(*this)(r, c2) = tmp;
}
}
+ return *this;
}
// || M || = \max \sum | M |
@@ -1406,7 +1491,6 @@ void vnl_matrix<T>::fliplr()
template <class T>
typename vnl_matrix<T>::abs_t vnl_matrix<T>::operator_one_norm() const
{
- //typedef vnl_numeric_traits<T>::abs_t abs_t;
abs_t max = 0;
for (unsigned int j=0; j<this->num_cols; ++j) {
abs_t tmp = 0;
@@ -1423,7 +1507,6 @@ typename vnl_matrix<T>::abs_t vnl_matrix<T>::operator_one_norm() const
template <class T>
typename vnl_matrix<T>::abs_t vnl_matrix<T>::operator_inf_norm() const
{
- //typedef vnl_numeric_traits<T>::abs_t abs_t;
abs_t max = 0;
for (unsigned int i=0; i<this->num_rows; ++i) {
abs_t tmp = 0;
@@ -1555,7 +1638,7 @@ L80:
//: Transpose matrix M in place.
// Works for rectangular matrices using an enormously clever algorithm from ACM TOMS.
template <class T>
-void vnl_matrix<T>::inplace_transpose()
+vnl_matrix<T>& vnl_matrix<T>::inplace_transpose()
{
unsigned m = rows();
unsigned n = columns();
@@ -1578,6 +1661,7 @@ void vnl_matrix<T>::inplace_transpose()
for (unsigned i=0; i<n; ++i)
data[i] = tmp + i * m;
}
+ return *this;
}
//------------------------------------------------------------------------------
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_exp.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_exp.h
index 12e0e423fd0718fed6f150d5e2d1f5b85bfe36bf..6a710ab21805ef13be28ab5d8bc6105dd36a52f1 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_exp.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_exp.h
@@ -16,49 +16,19 @@
// \verbatim
// Modifications:
// 14-Jan-2007 Peter Vanroose - added vnl_matrix_fixed interface
-// \endvarbatim
-
-#include <vnl/vnl_matrix_fixed.h>
-#include <vnl/vnl_matrix.h>
-
+// \endverbatim
//: Compute the exponential of a square matrix - fiddly form
-// \relates vnl_matrix
-template <class T>
-bool vnl_matrix_exp(vnl_matrix<T> const &X, vnl_matrix<T> &expX, double max_err);
+// \relatesalso vnl_matrix
+// \relatesalso vnl_matrix_fixed
+template <class SquareMatrix>
+bool vnl_matrix_exp(SquareMatrix const &X, SquareMatrix &expX, double max_err);
//: Compute the exponential of a square matrix - easy form.
-// \relates vnl_matrix
-template <class T>
-vnl_matrix<T> vnl_matrix_exp(vnl_matrix<T> const &X);
-
-#ifndef VCL_VC_60
-
-//: Compute the exponential of a square nxn matrix - easy form.
-// \relates vnl_matrix_fixed
-template <class T, unsigned int n>
-vnl_matrix_fixed<T,n,n> vnl_matrix_exp(vnl_matrix_fixed<T,n,n> const& X);
-
-//: Compute the exponential of a square nxn matrix - fiddly form
-// \relates vnl_matrix_fixed
-template <class T, unsigned int n>
-bool vnl_matrix_exp(vnl_matrix_fixed<T,n,n> const &X, vnl_matrix_fixed<T,n,n> &expX, double max_err);
-
-#else // if is VCL_VC_60
-
-// Visual Studio 6 has trouble with the constraint that both
-// numeric parameters in <T,n,n> must be the same. So we allow
-// <T,m,n>, and use a runtime assert to fail on the invalid cases.
-//
-// This signature is purposefully not documented in Doxygen.
-
-template <class T, unsigned int n, unsigned int m>
-vnl_matrix_fixed<T,n,m> vnl_matrix_exp(vnl_matrix_fixed<T,n,m> const& X);
-
-template <class T, unsigned int n, unsigned int m>
-bool vnl_matrix_exp(vnl_matrix_fixed<T,n,m> const &X, vnl_matrix_fixed<T,n,m> &expX, double max_err);
-
-#endif // VCL_VC_60
+// \relatesalso vnl_matrix
+// \relatesalso vnl_matrix_fixed
+template <class SquareMatrix>
+SquareMatrix vnl_matrix_exp(SquareMatrix const &X);
#endif // vnl_matrix_exp_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_exp.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_exp.txx
index 8333d4c2101a94c0efa6ee105564f40823dbf3dc..70105115aa27da9dbdc1afd0452a78979ad30d33 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_exp.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_exp.txx
@@ -1,9 +1,9 @@
// This is core/vnl/vnl_matrix_exp.txx
#ifndef vnl_matrix_exp_txx_
#define vnl_matrix_exp_txx_
-/*
- fsm
-*/
+//:
+// \file
+// \author fsm
#include "vnl_matrix_exp.h"
#include <vcl_cassert.h>
#ifdef DEBUG
@@ -11,7 +11,7 @@
#endif
template <class Matrix>
-bool vnl_matrix_exp_helper(Matrix const &X, Matrix &expX, double max_err)
+bool vnl_matrix_exp(Matrix const &X, Matrix &expX, double max_err)
{
assert(X.rows() == X.cols());
assert(X.rows() == expX.rows());
@@ -51,16 +51,11 @@ bool vnl_matrix_exp_helper(Matrix const &X, Matrix &expX, double max_err)
return true;
}
-template <class T>
-bool vnl_matrix_exp(vnl_matrix<T> const &X, vnl_matrix<T> &expX, double max_err)
-{
- return vnl_matrix_exp_helper( X, expX, max_err );
-}
-template <class T>
-vnl_matrix<T> vnl_matrix_exp(vnl_matrix<T> const &X)
+template <class Matrix>
+Matrix vnl_matrix_exp(Matrix const &X)
{
- vnl_matrix<T> expX(X.rows(), X.cols());
+ Matrix expX(X.rows(), X.cols());
#ifndef NDEBUG
bool retval =
#endif
@@ -70,62 +65,11 @@ vnl_matrix<T> vnl_matrix_exp(vnl_matrix<T> const &X)
return expX;
}
-#ifndef VCL_VC_60
-
-template <class T, unsigned int n>
-vnl_matrix_fixed<T,n,n> vnl_matrix_exp(vnl_matrix_fixed<T,n,n> const &X)
-{
- vnl_matrix_fixed<T,n,n> expX;
- vnl_matrix_exp(X, expX, 1e-10);
- return expX;
-}
-
-template <class T, unsigned int n>
-bool vnl_matrix_exp(vnl_matrix_fixed<T,n,n> const &X, vnl_matrix_fixed<T,n,n> &expX, double max_err)
-{
- return vnl_matrix_exp_helper( X, expX, max_err );
-}
-
-#else // if is VCL_VC_60
-
-template <class T, unsigned int n, unsigned int m>
-vnl_matrix_fixed<T,n,m> vnl_matrix_exp(vnl_matrix_fixed<T,n,m> const &X)
-{
- vnl_matrix_fixed<T,n,m> expX;
- vnl_matrix_exp(X, expX, 1e-10);
- return expX;
-}
-
-template <class T, unsigned int n, unsigned int m>
-bool vnl_matrix_exp(vnl_matrix_fixed<T,n,m> const &X, vnl_matrix_fixed<T,n,m> &expX, double max_err)
-{
- return vnl_matrix_exp_helper( X, expX, max_err );
-}
-
-#endif // VCL_VC_60
-
-//--------------------------------------------------------------------------------
-
-#undef VNL_MATRIX_EXP_INSTANTIATE_MATRIX
-#define VNL_MATRIX_EXP_INSTANTIATE_MATRIX(T) \
-template bool vnl_matrix_exp(vnl_matrix<T > const&, vnl_matrix<T >&, double); \
-template vnl_matrix<T > vnl_matrix_exp(vnl_matrix<T > const&);
-
-#undef VNL_MATRIX_EXP_INSTANTIATE_FIXED
-#define VNL_MATRIX_EXP_INSTANTIATE_FIXED(T) \
-template bool vnl_matrix_exp(vnl_matrix_fixed<T,1,1> const&, vnl_matrix_fixed<T,1,1>&, double); \
-template vnl_matrix_fixed<T,1,1> vnl_matrix_exp(vnl_matrix_fixed<T,1,1> const&);\
-template bool vnl_matrix_exp(vnl_matrix_fixed<T,2,2> const&, vnl_matrix_fixed<T,2,2>&, double); \
-template vnl_matrix_fixed<T,2,2> vnl_matrix_exp(vnl_matrix_fixed<T,2,2> const&);\
-template bool vnl_matrix_exp(vnl_matrix_fixed<T,3,3> const&, vnl_matrix_fixed<T,3,3>&, double); \
-template vnl_matrix_fixed<T,3,3> vnl_matrix_exp(vnl_matrix_fixed<T,3,3> const&);\
-template bool vnl_matrix_exp(vnl_matrix_fixed<T,4,4> const&, vnl_matrix_fixed<T,4,4>&, double); \
-template vnl_matrix_fixed<T,4,4> vnl_matrix_exp(vnl_matrix_fixed<T,4,4> const&)
-
+//------------------------------------------------------------------------------
#undef VNL_MATRIX_EXP_INSTANTIATE
-#define VNL_MATRIX_EXP_INSTANTIATE(T) \
- VNL_MATRIX_EXP_INSTANTIATE_MATRIX(T) \
- VNL_MATRIX_EXP_INSTANTIATE_FIXED(T)
+#define VNL_MATRIX_EXP_INSTANTIATE(Matrix) \
+template bool vnl_matrix_exp(Matrix const&, Matrix &, double); \
+template Matrix vnl_matrix_exp(Matrix const&)
-#endif
+#endif // vnl_matrix_exp_txx_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed.h
index f0cdc0ab3ffd5eb5519fc02b4f6f23bec5ec1f62..72dd513d3fb28a8824c303a5723ce13a3169737d 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed.h
@@ -18,8 +18,11 @@
// Feb.2002 - Peter Vanroose - brief doxygen comment placed on single line
// Oct.2002 - Amitha Perera - separated vnl_matrix and vnl_matrix_fixed,
// removed necessity for vnl_matrix_fixed_ref
-// 26Oct.2002 - Peter Vanroose - added inplace_transpose() method
-// July.2003 - Paul Smyth - fixed end() bug, made op*=() more general
+// Oct.2002 - Peter Vanroose - added inplace_transpose() method
+// Jul.2003 - Paul Smyth - fixed end() bug, made op*=() more general
+// Mar.2009 - Peter Vanroose - added arg_min() and arg_max()
+// Oct.2010 - Peter Vanroose - mutators and filling methods now return *this
+// Jan.2011 - Peter Vanroose - added methods set_diagonal() & get_diagonal()
// \endverbatim
//-----------------------------------------------------------------------------
@@ -29,27 +32,28 @@
#include "vnl_matrix.h"
#include "vnl_matrix_ref.h"
-#include "vnl_vector.h"
-#include "vnl_c_vector.h"
+#include <vnl/vnl_vector.h>
+#include <vnl/vnl_vector_fixed.h> // needed for e.g. vnl_matrix_fixed_mat_vec_mult()
+#include <vnl/vnl_c_vector.h>
+#include <vnl/vnl_config.h> // for VNL_CONFIG_CHECK_BOUNDS
-export template <class T, unsigned int n> class vnl_vector_fixed;
export template <class T, unsigned int num_rows, unsigned int num_cols> class vnl_matrix_fixed;
// This mess is for a MSVC6 workaround.
//
// The problem: the matrix-matrix operator* should be written as a
-// non-member function since vxl (currently) forbits the use of member
+// non-member function since vxl (currently) forbids the use of member
// templates. However, when declared as
-//
+// \code
// template <class T, unsigned m, unsigned n, unsigned o>
// matrix<T,m,o> operator*( matrix<T,m,n>, matrix<T,n,o> );
-//
+// \endcode
// MSVC6 does not find it. A solution is to declare it as a member
// template. However, the obvious
-//
+// \code
// template <unsigned o>
// matrix<T,num_rows,o> operator*( matrix<T,num_cols,o> );
-//
+// \endcode
// causes an internal compiler error. It turns out that if the new
// template parameter "o" comes _first_, then all is okay. Now, we
// can't change the signature of vnl_matrix_fixed to <unsigned num_cols,
@@ -58,7 +62,7 @@ export template <class T, unsigned int num_rows, unsigned int num_cols> class vn
// are not called for templated functions. So we have to use a helper
// base class. The base class is empty, which means that there is no
// loss in space or time efficiency. Finally, we have:
-//
+// \code
// template <unsigned num_cols, unsigned num_rows, class T>
// class fake_base { };
//
@@ -68,7 +72,7 @@ export template <class T, unsigned int num_rows, unsigned int num_cols> class vn
// template <unsigned o>
// matrix<T,num_rows,o> operator*( fake_base<o,num_cols,T> );
// };
-//
+// \endcode
// Notice how "o" is first in the list of template parameters. Since
// base class conversions _are_ performed during template matching,
// matrix<T,m,n> is matched as fake_base<n,m,T>, and all is good. For
@@ -102,23 +106,36 @@ class vnl_matrix_fixed_fake_base
// inheritance to vnl_matrix. However, it can be converted cheaply to
// a vnl_matrix_ref.
//
-// Read the overview documentation of vnl_vector_fixed. The text there
-// applies here.
+// Read the overview documentation of vnl_vector_fixed.
+// The text there applies here.
template <class T, unsigned int num_rows, unsigned int num_cols>
class vnl_matrix_fixed VNL_MATRIX_FIXED_VCL60_WORKAROUND
{
- public:
- typedef vnl_matrix_fixed<T,num_rows,num_cols> self;
- typedef unsigned int size_type;
-
- private:
T data_[num_rows][num_cols]; // Local storage
public:
+ typedef vnl_matrix_fixed<T,num_rows,num_cols> self;
+ typedef unsigned int size_type;
//: Construct an empty num_rows*num_cols matrix
vnl_matrix_fixed() {}
+ //: Construct an empty num_rows*num_cols matrix
+ //
+ // The sole purpose of this constructor is to match the interface of
+ // vnl_matrix, so that algorithms can template over the matrix type
+ // itself. It is illegal to call this constructor without
+ // <tt>n==num_rows</tt> and <tt>m==num_cols</tt>.
+ vnl_matrix_fixed( unsigned n, unsigned m )
+ {
+#ifdef NDEBUG
+ (void)n;
+ (void)m;
+#else
+ assert( n == num_rows && m == num_cols );
+#endif
+ }
+
//: Construct an m*n matrix and fill with value
explicit vnl_matrix_fixed(T value)
{
@@ -195,6 +212,9 @@ class vnl_matrix_fixed VNL_MATRIX_FIXED_VCL60_WORKAROUND
//: set element
void put (unsigned r, unsigned c, T const& v) { (*this)(r,c) = v; }
+ //: set element, and return *this
+ vnl_matrix_fixed& set (unsigned r, unsigned c, T const& v) { (*this)(r,c) = v; return *this; }
+
//: get element
T get (unsigned r, unsigned c) const { return (*this)(r,c); }
@@ -228,35 +248,75 @@ class vnl_matrix_fixed VNL_MATRIX_FIXED_VCL60_WORKAROUND
return this->data_[r][c];
}
-// Filling and copying------------------------------------------------
-
- //: Set all elements of matrix to specified value.
- // Complexity $O(r.c)$
- void fill (T);
-
- //: Set all diagonal elements of matrix to specified value.
- // Complexity $O(\min(r,c))$
- void fill_diagonal (T);
-
- //: Fill (laminate) this matrix with the given data.
- // We assume that p points to a contiguous rows*cols array, stored rowwise.
- void copy_in(T const *);
-
- //: Fill (laminate) this matrix with the given data.
- // A synonym for copy_in()
- void set(T const *d) { copy_in(d); }
-
- //: Fill the given array with this matrix.
- // We assume that p points to
- // a contiguous rows*cols array, stored rowwise.
- // No bounds checking on the array
+ // ----------------------- Filling and copying -----------------------
+
+ //: Sets all elements of matrix to specified value, and returns "*this".
+ // Complexity $O(r.c)$
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a matrix to a column-normalized all-elements-equal matrix, say
+ // \code
+ // M.fill(1).normalize_columns();
+ // \endcode
+ // Returning "*this" also allows passing such a matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed<double,5,5>(1.0).normalize_columns());
+ // \endcode
+ vnl_matrix_fixed& fill(T);
+
+ //: Sets all diagonal elements of matrix to specified value; returns "*this".
+ // Complexity $O(\min(r,c))$
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [5 0 0][0 10 0][0 0 15], just say
+ // \code
+ // M.fill_diagonal(5).scale_row(1,2).scale_column(2,3);
+ // \endcode
+ // Returning "*this" also allows passing a diagonal-filled matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed<double,3,3>().fill_diagonal(5));
+ // \endcode
+ vnl_matrix_fixed& fill_diagonal(T);
+
+ //: Sets the diagonal elements of this matrix to the specified list of values.
+ // Returning "*this" allows "chaining" two or more operations: see the
+ // reasoning (and the examples) in the documentation for method
+ // fill_diagonal().
+ vnl_matrix_fixed& set_diagonal(vnl_vector<T> const&);
+
+ //: Fills (laminates) this matrix with the given data, then returns it.
+ // We assume that the argument points to a contiguous rows*cols array, stored rowwise.
+ // No bounds checking on the array.
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to fill a square matrix column-wise, fill it rowwise then transpose:
+ // \code
+ // M.copy_in(array).inplace_transpose();
+ // \endcode
+ // Returning "*this" also allows passing a filled-in matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed<double,3,3>().copy_in(array));
+ // \endcode
+ vnl_matrix_fixed& copy_in(T const *);
+
+ //: Fills (laminates) this matrix with the given data, then returns it.
+ // A synonym for copy_in()
+ vnl_matrix_fixed& set(T const *d) { return copy_in(d); }
+
+ //: Fills the given array with this matrix.
+ // We assume that the argument points to a contiguous rows*cols array, stored rowwise.
+ // No bounds checking on the array.
void copy_out(T *) const;
- //: Transpose this matrix efficiently, if it is a square matrix
- void inplace_transpose();
+ //: Transposes this matrix efficiently, if it is square, and returns it.
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to fill a square matrix column-wise, fill it rowwise then transpose:
+ // \code
+ // M.copy_in(array).inplace_transpose();
+ // \endcode
+ vnl_matrix_fixed& inplace_transpose();
-
-// Arithmetic ----------------------------------------------------
+ // ----------------------- Arithmetic --------------------------------
// note that these functions should not pass scalar as a const&.
// Look what would happen to A /= A(0,0).
@@ -356,45 +416,59 @@ class vnl_matrix_fixed VNL_MATRIX_FIXED_VCL60_WORKAROUND
vnl_matrix_fixed apply(T (*f)(T const&)) const;
//: Return transpose
- vnl_matrix_fixed<T,num_cols,num_rows> transpose () const;
+ vnl_matrix_fixed<T,num_cols,num_rows> transpose() const;
//: Return conjugate transpose
- vnl_matrix_fixed<T,num_cols,num_rows> conjugate_transpose () const;
+ vnl_matrix_fixed<T,num_cols,num_rows> conjugate_transpose() const;
//: Set values of this matrix to those of M, starting at [top,left]
- vnl_matrix_fixed& update (vnl_matrix<T> const&, unsigned top=0, unsigned left=0);
+ vnl_matrix_fixed& update(vnl_matrix<T> const&, unsigned top=0, unsigned left=0);
+
+ //: Set the elements of the i'th column to v[i] (No bounds checking)
+ vnl_matrix_fixed& set_column(unsigned i, T const * v);
+
+ //: Set the elements of the i'th column to value, then return *this.
+ vnl_matrix_fixed& set_column(unsigned i, T value );
- //: Set the elements of the i'th column to v[j] (No bounds checking)
- void set_column(unsigned i, T const * v);
+ //: Set j-th column to v, then return *this.
+ vnl_matrix_fixed& set_column(unsigned j, vnl_vector<T> const& v);
- //: Set the elements of the i'th column to value
- void set_column(unsigned i, T value );
+ //: Set j-th column to v, then return *this.
+ vnl_matrix_fixed& set_column(unsigned j, vnl_vector_fixed<T,num_rows> const& v);
- //: Set j-th column to v
- void set_column(unsigned j, vnl_vector<T> const& v);
+ //: Set columns to those in M, starting at starting_column, then return *this.
+ vnl_matrix_fixed& set_columns(unsigned starting_column, vnl_matrix<T> const& M);
- //: Set columns to those in M, starting at starting_column
- void set_columns(unsigned starting_column, vnl_matrix<T> const& M);
+ //: Set the elements of the i'th row to v[i] (No bounds checking)
+ vnl_matrix_fixed& set_row (unsigned i, T const * v);
- //: Set the elements of the i'th row to v[j] (No bounds checking)
- void set_row (unsigned i, T const * v);
+ //: Set the elements of the i'th row to value, then return *this.
+ vnl_matrix_fixed& set_row (unsigned i, T value );
- //: Set the elements of the i'th row to value
- void set_row (unsigned i, T value );
+ //: Set the i-th row, then return *this.
+ vnl_matrix_fixed& set_row (unsigned i, vnl_vector<T> const&);
- //: Set the i-th row
- void set_row (unsigned i, vnl_vector<T> const&);
+ //: Set the i-th row, then return *this.
+ vnl_matrix_fixed& set_row (unsigned i, vnl_vector_fixed<T,num_cols> const&);
//: Extract a sub-matrix of size r x c, starting at (top,left)
// Thus it contains elements [top,top+r-1][left,left+c-1]
vnl_matrix<T> extract (unsigned r, unsigned c,
unsigned top=0, unsigned left=0) const;
+ //: Extract a sub-matrix starting at (top,left)
+ //
+ // The output is stored in \a sub_matrix, and it should have the
+ // required size on entry. Thus the result will contain elements
+ // [top,top+sub_matrix.rows()-1][left,left+sub_matrix.cols()-1]
+ void extract ( vnl_matrix<T>& sub_matrix,
+ unsigned top=0, unsigned left=0) const;
+
//: Get a vector equal to the given row
- vnl_vector<T> get_row (unsigned row) const;
+ vnl_vector_fixed<T,num_cols> get_row (unsigned row) const;
//: Get a vector equal to the given column
- vnl_vector<T> get_column(unsigned col) const;
+ vnl_vector_fixed<T,num_rows> get_column(unsigned col) const;
//: Get n rows beginning at rowstart
vnl_matrix<T> get_n_rows (unsigned rowstart, unsigned n) const;
@@ -402,32 +476,84 @@ class vnl_matrix_fixed VNL_MATRIX_FIXED_VCL60_WORKAROUND
//: Get n columns beginning at colstart
vnl_matrix<T> get_n_columns(unsigned colstart, unsigned n) const;
-
- // mutators
-
- //: Set this matrix to an identity matrix
- // Abort if the matrix is not square
- void set_identity();
-
- //: Reverse order of rows.
- void flipud();
-
- //: Reverse order of columns.
- void fliplr();
-
- //: Normalize each row so it is a unit vector
- // Zero rows are ignored
- void normalize_rows();
-
- //: Normalize each column so it is a unit vector
- // Zero columns are ignored
- void normalize_columns();
-
- //: Scale elements in given row by a factor of T
- void scale_row (unsigned row, T value);
-
- //: Scale elements in given column by a factor of T
- void scale_column(unsigned col, T value);
+ //: Return a vector with the content of the (main) diagonal
+ vnl_vector<T> get_diagonal() const;
+
+ // ==== mutators ====
+
+ //: Sets this matrix to an identity matrix, then returns "*this".
+ // Returning "*this" allows e.g. passing an identity matrix as argument to
+ // a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed<double,5,5>().set_identity());
+ // \endcode
+ // Returning "*this" also allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [3 0 0][0 2 0][0 0 1], one could say
+ // \code
+ // M.set_identity().scale_row(0,3).scale_column(1,2);
+ // \endcode
+ // If the matrix is not square, anyhow set main diagonal to 1, the rest to 0.
+ vnl_matrix_fixed& set_identity();
+
+ //: Reverses the order of rows, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to flip both up-down and left-right, one could just say
+ // \code
+ // M.flipud().fliplr();
+ // \endcode
+ vnl_matrix_fixed& flipud();
+
+ //: Reverses the order of columns, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to flip both up-down and left-right, one could just say
+ // \code
+ // M.flipud().fliplr();
+ // \endcode
+ vnl_matrix_fixed& fliplr();
+
+ //: Normalizes each row so it is a unit vector, and returns "*this".
+ // Zero rows are not modified
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a matrix to a row-normalized all-elements-equal matrix, say
+ // \code
+ // M.fill(1).normalize_rows();
+ // \endcode
+ // Returning "*this" also allows passing such a matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed<double,5,5>(1.0).normalize_rows());
+ // \endcode
+ vnl_matrix_fixed& normalize_rows();
+
+ //: Normalizes each column so it is a unit vector, and returns "*this".
+ // Zero columns are not modified
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a matrix to a column-normalized all-elements-equal matrix, say
+ // \code
+ // M.fill(1).normalize_columns();
+ // \endcode
+ // Returning "*this" also allows passing such a matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed<double,5,5>(1.0).normalize_columns());
+ // \endcode
+ vnl_matrix_fixed& normalize_columns();
+
+ //: Scales elements in given row by a factor T, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [3 0 0][0 2 0][0 0 1], one could say
+ // \code
+ // M.set_identity().scale_row(0,3).scale_column(1,2);
+ // \endcode
+ vnl_matrix_fixed& scale_row (unsigned row, T value);
+
+ //: Scales elements in given column by a factor T, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [3 0 0][0 2 0][0 0 1], one could say
+ // \code
+ // M.set_identity().scale_row(0,3).scale_column(1,2);
+ // \endcode
+ vnl_matrix_fixed& scale_column(unsigned col, T value);
//: Type def for norms.
typedef typename vnl_c_vector<T>::abs_t abs_t;
@@ -468,6 +594,12 @@ class vnl_matrix_fixed VNL_MATRIX_FIXED_VCL60_WORKAROUND
//: Return maximum value of elements
T max_value() const { return vnl_c_vector<T>::max_value(begin(), size()); }
+ //: Return location of minimum value of elements
+ unsigned arg_min() const { return vnl_c_vector<T>::arg_min(begin(), size()); }
+
+ //: Return location of maximum value of elements
+ unsigned arg_max() const { return vnl_c_vector<T>::arg_max(begin(), size()); }
+
//: Return mean of all matrix elements
T mean() const { return vnl_c_vector<T>::mean(begin(), num_rows*num_cols /*size()*/); }
// size() call in this method causes an ICE for MSVC when instantating 1x1 matrix
@@ -589,6 +721,12 @@ class vnl_matrix_fixed VNL_MATRIX_FIXED_VCL60_WORKAROUND
return equal( this->data_block(), rhs.data_block() );
}
+ //: Equality operator
+ bool operator==(vnl_matrix_fixed const &that) const { return this->operator_eq(that); }
+
+ //: Inequality operator
+ bool operator!=(vnl_matrix_fixed const &that) const { return !this->operator_eq(that); }
+
//: Equality operator
bool operator==(vnl_matrix<T> const &that) const { return this->operator_eq(that); }
@@ -759,6 +897,23 @@ vnl_matrix_fixed_mat_vec_mult(const vnl_matrix_fixed<T, M, N>& a,
return out;
}
+template <class T, unsigned M, unsigned N>
+inline
+vnl_vector_fixed<T, N>
+vnl_matrix_fixed_vec_mat_mult(const vnl_vector_fixed<T, M>& a,
+ const vnl_matrix_fixed<T, M, N>& b)
+{
+ vnl_vector_fixed<T, N> out;
+ for (unsigned i = 0; i < N; ++i)
+ {
+ T accum = a(0) * b(0,i);
+ for (unsigned k = 1; k < M; ++k)
+ accum += a(k) * b(k,i);
+ out(i) = accum;
+ }
+ return out;
+}
+
// see comment above
template <class T, unsigned M, unsigned N, unsigned O>
inline
@@ -782,22 +937,32 @@ vnl_matrix_fixed_mat_mat_mult(const vnl_matrix_fixed<T, M, N>& a,
// The version for correct compilers
//: Multiply conformant vnl_matrix_fixed (M x N) and vector_fixed (N)
-// \relates vnl_vector_fixed
-// \relates vnl_matrix_fixed
+// \relatesalso vnl_vector_fixed
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned M, unsigned N>
inline
vnl_vector_fixed<T, M> operator*(const vnl_matrix_fixed<T, M, N>& a, const vnl_vector_fixed<T, N>& b)
{
- return vnl_matrix_fixed_mat_vec_mult(a,b);
+ return vnl_matrix_fixed_mat_vec_mult(a, b);
+}
+
+//: Multiply conformant vector_fixed (M) and vnl_matrix_fixed (M x N)
+// \relatesalso vnl_vector_fixed
+// \relatesalso vnl_matrix_fixed
+template <class T, unsigned M, unsigned N>
+inline
+vnl_vector_fixed<T, N> operator*(const vnl_vector_fixed<T, M>& a, const vnl_matrix_fixed<T, M, N>& b)
+{
+ return vnl_matrix_fixed_vec_mat_mult(a, b);
}
//: Multiply two conformant vnl_matrix_fixed (M x N) times (N x O)
-// \relates vnl_matrix_fixed
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned M, unsigned N, unsigned O>
inline
vnl_matrix_fixed<T, M, O> operator*(const vnl_matrix_fixed<T, M, N>& a, const vnl_matrix_fixed<T, N, O>& b)
{
- return vnl_matrix_fixed_mat_mat_mult(a,b);
+ return vnl_matrix_fixed_mat_mat_mult(a, b);
}
#endif // VCL_VC_6
@@ -906,7 +1071,7 @@ outer_product(vnl_vector_fixed<T,m> const& a, SecondFixedVector const& b)
#else // no need for VC6 workaround for outer_product
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template <class T, unsigned m, unsigned n>
vnl_matrix_fixed<T,m,n> outer_product(vnl_vector_fixed<T,m> const& a, vnl_vector_fixed<T,n> const& b);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed.txx
index 02e8ea1438eac83850965179537d68fd1a12383e..1df00dcac655eca2a339544fd96856f03d980333 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed.txx
@@ -110,21 +110,37 @@ vnl_matrix_fixed<T,nrows,ncols>::equal( const T* a, const T* b )
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::fill (T value)
{
- for (unsigned int i = 0; i < nrows; i++)
- for (unsigned int j = 0; j < ncols; j++)
+ for (unsigned int i = 0; i < nrows; ++i)
+ for (unsigned int j = 0; j < ncols; ++j)
this->data_[i][j] = value;
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::fill_diagonal (T value)
{
- for (unsigned int i = 0; i < nrows && i < ncols; i++)
+ for (unsigned int i = 0; i < nrows && i < ncols; ++i)
this->data_[i][i] = value;
+ return *this;
+}
+
+
+template<class T, unsigned nrows, unsigned ncols>
+vnl_matrix_fixed<T,nrows,ncols>&
+vnl_matrix_fixed<T,nrows,ncols>::set_diagonal(vnl_vector<T> const& diag)
+{
+ assert(diag.size() >= nrows || diag.size() >= ncols);
+ // The length of the diagonal of a non-square matrix is the minimum of
+ // the matrix's width & height; that explains the "||" in the assert,
+ // and the "&&" in the upper bound for the "for".
+ for (unsigned int i = 0; i < nrows && i < ncols; ++i)
+ this->data_[i][i] = diag[i];
+ return *this;
}
@@ -132,10 +148,10 @@ template<class T, unsigned nrows, unsigned ncols>
void
vnl_matrix_fixed<T,nrows,ncols>::print(vcl_ostream& os) const
{
- for (unsigned int i = 0; i < nrows; i++)
+ for (unsigned int i = 0; i < nrows; ++i)
{
os << this->data_[i][0];
- for (unsigned int j = 1; j < ncols; j++)
+ for (unsigned int j = 1; j < ncols; ++j)
os << ' ' << this->data_[i][j];
os << '\n';
}
@@ -168,8 +184,8 @@ vnl_matrix_fixed<T,ncols,nrows>
vnl_matrix_fixed<T,nrows,ncols>::transpose() const
{
vnl_matrix_fixed<T,ncols,nrows> result;
- for (unsigned int i = 0; i < cols(); i++)
- for (unsigned int j = 0; j < rows(); j++)
+ for (unsigned int i = 0; i < cols(); ++i)
+ for (unsigned int j = 0; j < rows(); ++j)
result(i,j) = this->data_[j][i];
return result;
}
@@ -197,8 +213,8 @@ vnl_matrix_fixed<T,nrows,ncols>::update (vnl_matrix<T> const& m,
vnl_error_matrix_dimension ("update",
bottom, right, m.rows(), m.cols());
#endif
- for (unsigned int i = top; i < bottom; i++)
- for (unsigned int j = left; j < right; j++)
+ for (unsigned int i = top; i < bottom; ++i)
+ for (unsigned int j = left; j < right; ++j)
this->data_[i][j] = m(i-top,j-left);
return *this;
}
@@ -209,6 +225,19 @@ vnl_matrix<T>
vnl_matrix_fixed<T,nrows,ncols>::extract (unsigned rowz, unsigned colz,
unsigned top, unsigned left) const
{
+ vnl_matrix<T> result(rowz, colz);
+ this->extract( result, top, left );
+ return result;
+}
+
+
+template<class T, unsigned nrows, unsigned ncols>
+void
+vnl_matrix_fixed<T,nrows,ncols>::extract (vnl_matrix<T>& sub_matrix,
+ unsigned top, unsigned left) const
+{
+ unsigned int rowz = sub_matrix.rows();
+ unsigned int colz = sub_matrix.cols();
#ifndef NDEBUG
unsigned int bottom = top + rowz;
unsigned int right = left + colz;
@@ -216,22 +245,21 @@ vnl_matrix_fixed<T,nrows,ncols>::extract (unsigned rowz, unsigned colz,
vnl_error_matrix_dimension ("extract",
nrows, ncols, bottom, right);
#endif
- vnl_matrix<T> result(rowz, colz);
- for (unsigned int i = 0; i < rowz; i++) // actual copy of all elements
- for (unsigned int j = 0; j < colz; j++) // in submatrix
- result(i,j) = this->data_[top+i][left+j];
- return result;
+ for (unsigned int i = 0; i < rowz; ++i) // actual copy of all elements
+ for (unsigned int j = 0; j < colz; ++j) // in submatrix
+ sub_matrix(i,j) = this->data_[top+i][left+j];
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::copy_in(T const *p)
{
T* dp = this->data_block();
unsigned int i = nrows * ncols;
while (i--)
*dp++ = *p++;
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
@@ -244,39 +272,36 @@ void vnl_matrix_fixed<T,nrows,ncols>::copy_out(T *p) const
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::set_identity()
{
-#ifndef NDEBUG
- if (nrows != ncols) // Size?
- vnl_error_matrix_nonsquare ("set_identity");
-#endif
// Two simple loops are generally better than having a branch inside
// the loop. Probably worth the O(n) extra writes.
- for (unsigned int i = 0; i < nrows; i++)
- for (unsigned int j = 0; j < ncols; j++)
+ for (unsigned int i = 0; i < nrows; ++i)
+ for (unsigned int j = 0; j < ncols; ++j)
this->data_[i][j] = T(0);
- for (unsigned int i = 0; i < nrows; i++)
+ for (unsigned int i = 0; i < nrows && i < ncols; ++i)
this->data_[i][i] = T(1);
+ return *this;
}
//: Make each row of the matrix have unit norm.
// All-zero rows are ignored.
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::normalize_rows()
{
- for (unsigned int i = 0; i < nrows; i++)
+ for (unsigned int i = 0; i < nrows; ++i)
{
abs_t norm(0); // double will not do for all types.
- for (unsigned int j = 0; j < ncols; j++)
+ for (unsigned int j = 0; j < ncols; ++j)
norm += vnl_math_squared_magnitude( this->data_[i][j] );
if (norm != 0)
{
typedef typename vnl_numeric_traits<abs_t>::real_t real_t;
real_t scale = real_t(1)/vcl_sqrt((real_t)norm);
- for (unsigned int j = 0; j < ncols; j++)
+ for (unsigned int j = 0; j < ncols; ++j)
{
// FIXME need correct rounding here
// There is e.g. no *standard* operator*=(complex<float>, double), hence the T() cast.
@@ -284,22 +309,23 @@ vnl_matrix_fixed<T,nrows,ncols>::normalize_rows()
}
}
}
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::normalize_columns()
{
- for (unsigned int j = 0; j < ncols; j++) { // For each column in the Matrix
+ for (unsigned int j = 0; j < ncols; ++j) { // For each column in the Matrix
abs_t norm(0); // double will not do for all types.
- for (unsigned int i = 0; i < nrows; i++)
+ for (unsigned int i = 0; i < nrows; ++i)
norm += vnl_math_squared_magnitude( this->data_[i][j] );
if (norm != 0)
{
typedef typename vnl_numeric_traits<abs_t>::real_t real_t;
real_t scale = real_t(1)/vcl_sqrt((real_t)norm);
- for (unsigned int i = 0; i < nrows; i++)
+ for (unsigned int i = 0; i < nrows; ++i)
{
// FIXME need correct rounding here
// There is e.g. no *standard* operator*=(complex<float>, double), hence the T() cast.
@@ -307,30 +333,33 @@ vnl_matrix_fixed<T,nrows,ncols>::normalize_columns()
}
}
}
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::scale_row(unsigned row_index, T value)
{
#ifndef NDEBUG
if (row_index >= nrows)
vnl_error_matrix_row_index("scale_row", row_index);
#endif
- for (unsigned int j = 0; j < ncols; j++)
+ for (unsigned int j = 0; j < ncols; ++j)
this->data_[row_index][j] *= value;
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::scale_column(unsigned column_index, T value)
{
#ifndef NDEBUG
if (column_index >= ncols)
vnl_error_matrix_col_index("scale_column", column_index);
#endif
- for (unsigned int j = 0; j < nrows; j++)
+ for (unsigned int j = 0; j < nrows; ++j)
this->data_[j][column_index] *= value;
+ return *this;
}
//: Returns a copy of n rows, starting from "row"
@@ -365,100 +394,133 @@ vnl_matrix_fixed<T,nrows,ncols>::get_n_columns (unsigned column, unsigned n) con
//: Create a vector out of row[row_index].
template<class T, unsigned nrows, unsigned ncols>
-vnl_vector<T> vnl_matrix_fixed<T,nrows,ncols>::get_row(unsigned row_index) const
+vnl_vector_fixed<T,ncols> vnl_matrix_fixed<T,nrows,ncols>::get_row(unsigned row_index) const
{
#ifdef ERROR_CHECKING
if (row_index >= nrows)
vnl_error_matrix_row_index ("get_row", row_index);
#endif
- vnl_vector<T> v(ncols);
- for (unsigned int j = 0; j < ncols; j++) // For each element in row
+ vnl_vector_fixed<T,ncols> v;
+ for (unsigned int j = 0; j < ncols; ++j) // For each element in row
v[j] = this->data_[row_index][j];
return v;
}
//: Create a vector out of column[column_index].
template<class T, unsigned nrows, unsigned ncols>
-vnl_vector<T> vnl_matrix_fixed<T,nrows,ncols>::get_column(unsigned column_index) const
+vnl_vector_fixed<T,nrows> vnl_matrix_fixed<T,nrows,ncols>::get_column(unsigned column_index) const
{
#ifdef ERROR_CHECKING
if (column_index >= ncols)
vnl_error_matrix_col_index ("get_column", column_index);
#endif
- vnl_vector<T> v(nrows);
- for (unsigned int j = 0; j < nrows; j++)
+ vnl_vector_fixed<T,nrows> v;
+ for (unsigned int j = 0; j < nrows; ++j)
v[j] = this->data_[j][column_index];
return v;
}
+//: Return a vector with the content of the (main) diagonal
+template<class T, unsigned nrows, unsigned ncols>
+vnl_vector<T> vnl_matrix_fixed<T,nrows,ncols>::get_diagonal() const
+{
+ vnl_vector<T> v(nrows < ncols ? nrows : ncols);
+ for (unsigned int j = 0; j < nrows && j < ncols; ++j)
+ v[j] = this->data_[j][j];
+ return v;
+}
+
//--------------------------------------------------------------------------------
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::set_row(unsigned row_index, T const *v)
{
- for (unsigned int j = 0; j < ncols; j++)
+ for (unsigned int j = 0; j < ncols; ++j)
this->data_[row_index][j] = v[j];
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::set_row(unsigned row_index, vnl_vector<T> const &v)
+{
+ if (v.size() >= ncols)
+ set_row(row_index,v.data_block());
+ else
+ for (unsigned int j = 0; j < v.size(); ++j)
+ this->data_[row_index][j] = v[j];
+ return *this;
+}
+
+template<class T, unsigned nrows, unsigned ncols>
+vnl_matrix_fixed<T,nrows,ncols>&
+vnl_matrix_fixed<T,nrows,ncols>::set_row(unsigned row_index, vnl_vector_fixed<T,ncols> const &v)
{
set_row(row_index,v.data_block());
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::set_row(unsigned row_index, T v)
{
- for (unsigned int j = 0; j < ncols; j++)
+ for (unsigned int j = 0; j < ncols; ++j)
this->data_[row_index][j] = v;
+ return *this;
}
//--------------------------------------------------------------------------------
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::set_column(unsigned column_index, T const *v)
{
- for (unsigned int i = 0; i < nrows; i++)
+ for (unsigned int i = 0; i < nrows; ++i)
this->data_[i][column_index] = v[i];
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::set_column(unsigned column_index, vnl_vector<T> const &v)
+{
+ if (v.size() >= nrows)
+ set_column(column_index,v.data_block());
+ else
+ for (unsigned int i = 0; i < v.size(); ++i)
+ this->data_[i][column_index] = v[i];
+ return *this;
+}
+
+template<class T, unsigned nrows, unsigned ncols>
+vnl_matrix_fixed<T,nrows,ncols>&
+vnl_matrix_fixed<T,nrows,ncols>::set_column(unsigned column_index, vnl_vector_fixed<T,nrows> const &v)
{
set_column(column_index,v.data_block());
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::set_column(unsigned column_index, T v)
{
- for (unsigned int j = 0; j < nrows; j++)
+ for (unsigned int j = 0; j < nrows; ++j)
this->data_[j][column_index] = v;
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::set_columns(unsigned starting_column, vnl_matrix<T> const& m)
{
-#ifndef NDEBUG
- if (nrows != m.rows() ||
- ncols < m.cols() + starting_column) // Size match?
- vnl_error_matrix_dimension ("set_columns",
- nrows, ncols,
- m.rows(), m.cols());
-#endif
-
- for (unsigned int j = 0; j < m.cols(); ++j)
- for (unsigned int i = 0; i < nrows; i++)
+ for (unsigned int j = 0; j < m.cols() && starting_column+j < ncols; ++j) // don't go too far right; possibly only use part of m
+ for (unsigned int i = 0; i < nrows && i < m.rows(); ++i) // smallest of the two heights; possibly only use part of m
this->data_[i][starting_column + j] = m(i,j);
+ return *this;
}
@@ -604,7 +666,7 @@ vnl_matrix_fixed<T,nrows,ncols>::read_ascii(vcl_istream& s)
template <class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::flipud()
{
for (unsigned int r1 = 0; 2*r1+1 < nrows; ++r1)
@@ -617,11 +679,12 @@ vnl_matrix_fixed<T,nrows,ncols>::flipud()
this->data_[r2][c] = tmp;
}
}
+ return *this;
}
template <class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed<T,nrows,ncols>&
vnl_matrix_fixed<T,nrows,ncols>::fliplr()
{
for (unsigned int c1 = 0; 2*c1+1 < ncols; ++c1)
@@ -634,6 +697,7 @@ vnl_matrix_fixed<T,nrows,ncols>::fliplr()
this->data_[r][c2] = tmp;
}
}
+ return *this;
}
template <class T, unsigned nrows, unsigned ncols>
@@ -670,7 +734,8 @@ vnl_matrix_fixed<T,nrows,ncols>::operator_inf_norm() const
//: Transpose square matrix M in place.
template <class T, unsigned nrows, unsigned ncols>
-void vnl_matrix_fixed<T,nrows,ncols>::inplace_transpose()
+vnl_matrix_fixed<T,nrows,ncols>&
+vnl_matrix_fixed<T,nrows,ncols>::inplace_transpose()
{
assert(nrows==ncols); // cannot inplace_transpose non-square fixed size matrix
for (unsigned i = 0; i < nrows; ++i)
@@ -680,6 +745,7 @@ void vnl_matrix_fixed<T,nrows,ncols>::inplace_transpose()
this->data_[i][j] = this->data_[j][i];
this->data_[j][i] = t;
}
+ return *this;
}
// Workaround for argument deduction bug in VC6. See comment in .h
@@ -696,16 +762,16 @@ RM
outer_product_fixed_calc_helper<VecA,VecB,RM>::calc( VecA const& a, VecB const& b )
{
RM out; // RM should be a vnl_matrix_fixed of VecA::SIZE by VecB::SIZE
- for (unsigned int i = 0; i < VecA::SIZE; i++)
- for (unsigned int j = 0; j < VecB::SIZE; j++)
+ for (unsigned int i = 0; i < VecA::SIZE; ++i)
+ for (unsigned int j = 0; j < VecB::SIZE; ++j)
out[i][j] = a[i] * b[j];
return out;
};
#define VNL_OUTER_PRODUCT_FIXED_INSTANTIATE( T, M, N ) \
- template struct outer_product_fixed_calc_helper< vnl_vector_fixed<T,M >, \
- vnl_vector_fixed<T,N >, \
- vnl_matrix_fixed<T,M,N > >
+template struct outer_product_fixed_calc_helper<vnl_vector_fixed<T,M >, \
+ vnl_vector_fixed<T,N >, \
+ vnl_matrix_fixed<T,M,N > >
#else // no need for workaround; declare the function sanely.
@@ -714,22 +780,22 @@ vnl_matrix_fixed<T,m,n>
outer_product(vnl_vector_fixed<T,m> const& a, vnl_vector_fixed<T,n> const& b)
{
vnl_matrix_fixed<T,m,n> out; // = a.column() * b.row()
- for (unsigned int i = 0; i < m; i++)
- for (unsigned int j = 0; j < n; j++)
+ for (unsigned int i = 0; i < m; ++i)
+ for (unsigned int j = 0; j < n; ++j)
out[i][j] = a[i] * b[j];
return out;
}
#define VNL_OUTER_PRODUCT_FIXED_INSTANTIATE( T, M, N ) \
- template vnl_matrix_fixed<T,M,N > outer_product(vnl_vector_fixed<T,M > const&,\
- vnl_vector_fixed<T,N > const& )
+template vnl_matrix_fixed<T,M,N > outer_product(vnl_vector_fixed<T,M > const&,\
+ vnl_vector_fixed<T,N > const& )
#endif // VC60 outer_product workaround
#undef VNL_MATRIX_FIXED_INSTANTIATE
#define VNL_MATRIX_FIXED_INSTANTIATE(T, M, N) \
- template class vnl_matrix_fixed<T,M,N >; \
- VNL_OUTER_PRODUCT_FIXED_INSTANTIATE( T, M, N )
+template class vnl_matrix_fixed<T,M,N >; \
+VNL_OUTER_PRODUCT_FIXED_INSTANTIATE( T, M, N )
#endif // vnl_matrix_fixed_txx_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed_ref.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed_ref.h
index 5bd7e18799bf6d65299acac9d2f88f23af1de100..1ca537d4a7d6f871af3b5b70507bf949135117a7 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed_ref.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed_ref.h
@@ -5,130 +5,127 @@
#pragma interface
#endif
//:
-// \file
-// \brief Fixed size stack-stored vnl_matrix
+// \file
+// \brief Fixed size stack-stored vnl_matrix
//
-// > > From: Amitha Perera [mailto:perera@cs.rpi.edu]
-// > > Sent: Monday, October 07, 2002 3:18 PM
-// > > Subject: vnl_vector_fixed_ref
-// > >
-// > > I'm working on separating vnl_vector and vnl_vector_fixed in the VXL
-// > > tree, as I mailed a while ago to the vxl-maintainers list. I noticed
-// > > that you'd committed a vnl_vector_fixed_ref class which doesn't seem
-// > > to provide any additional functionality over vnl_vector_ref. May I
-// > > remove it, or is there some use for it?
-// > >
-// > > FYI, the author is listed as "Paul P. Smyth, Vicon Motion
-// > > Systems Ltd."
-// > > and the comment is dated 02 May 2001.
+// vnl_matrix_fixed_ref is a fixed-size vnl_matrix for which the data space
+// has been supplied externally. This is useful for two main tasks:
+//
+// (a) Treating some row-based "C" matrix as a vnl_matrix in order to
+// perform vnl_matrix operations on it.
+//
+// (b) Declaring a vnl_matrix that uses entirely stack-based storage for the
+// matrix.
//
-// Paul Smyth <paul.smyth@vicon.com> writes:
-// > The rationale behind it was that I had some (fast) algorithms for
-// > matrix/vector operations that made use of compile-time knowledge of the
-// > vector and matrix sizes.
-// > This was typically appropriate when trying to interpret a fixed-size
-// > subvector within a large vector of parameters as e.g. a translation.
-// >
-// > As I saw it, the various types of vector possible were: (with their current
-// > names)
-// > - pointer to memory, plus compile-time knowledge of vector size ( T*, and enum{size}) = vnl_vector_fixed_ref
-// > - ownership of memory, plus compile-time size = vnl_vector_fixed
-// > - pointer to memory, plus run-time only knowledge of size (T* and size()) = vnl_vector_ref
-// > - ownership of memory, variably sized = vnl_vector
-// >
-// > I had a conversation with Andrew Fitzgibbon, where he reckoned that the best
-// > thing to do with vnl vectors etc. was to create entirely separate types, and
-// > routines for conversion between them (possibly implicitly), rather that
-// > trying to establish a class hierarchy, which may add too many burdens in
-// > terms of object size for small vectors/matrices.
-// >
-// > Sorry - I've now found the debate on the maintaners list!
-// >
-// > Anyway, I believe that vector_fixed_ref is very necessary, and that you
-// > should be able to convert from a vector_fixed to a vector_fixed_ref - say
-// > using an as_ref() member on vector_fixed or standalone function.
-// > And I believe that for the restructured classes, vector_fixed_ref and
-// > vector_fixed should not be related by inheritance, as that would place an
-// > excessive burden on the size of vector_fixed.
-// >
-// > ------
-// > Another issue - do you have a mechanism for dealing with const data safely?
-// > {
-// > template<typename T, int n>
-// > vnl_vector_fixed_ref(T* i_Data);
-// >
-// > void MyFunction(const vnl_vector<double> & Input)
-// > {
-// > // take a reference to the first 3 elements of Input
-// > vnl_vector_fixed_ref<double,3> ref(Input.begin());
-// > // compiler error - as making vector_fixed_ref from const
-// > double *
-// > }
-// > }
-// >
-// > The options appear to be
-// > 1) Make a separate class vnl_vector_fixed_ref_const
-// > 2) Make vnl_vector_fixed_ref so it can be instantiated with
-// > vnl_vector_fixed_ref<double,n> AND vnl_vector_fixed_ref<const double,n>, and
-// > gives appropriate behaviour - would probably require a to_const function
-// > which generates vnl_vector_fixed_ref<const T,n> from
-// > vnl_vector_fixed_ref<T,n>
-// >
-// > ------
-// > Another note is that a number of routines that use vector_fixed currently
-// > (e.g. cross_3d) should really use vector_fixed_ref as an input, because they
-// > should be able to operate on fixed vector references as well as fixed
-// > vectors.
-// >
-// > While I'm at it, has it been decided that the vnl_vector and vnl_vector_ref
-// > classes are to remain unchanged? Because having vnl_vector as the base, and
-// > vnl_vector_ref derived from it is a real pain in the backside. A vector
-// > which may or may not own its own memory is a more general type than one
-// > which does own it's own memory, and having vnl_vector as the base means that
-// > all sorts of nastinesses can happen. Simply, a vector_ref Is-not a type of
-// > vector.
-// > If anything, it should be the other way round.
-// >
-// > void DoAssign(vnl_vector<double> & RefToMemoryIDontOwn, const vnl_vector<double> & NewContents)
-// > {
-// > RefToMemoryIDontOwn = NewContents;
-// > }
-// >
-// > void DeleteTwice()
-// > {
-// > vnl_vector<double> vec1(3, 0); // size 3 - news 3*double
-// > vnl_vector<double> vec2(4,1); // size 4 news 4 * double
-// > vnl_vector_ref<double> ref_to_1(3,vec1.begin()); // copies pointer
-// > DoAssign(ref_to_1, vec2); // deletes memory owned by 1, news 4 * double
-// > // vec1 now points to deleted memory, and will crash when goes out of scope
-// > }
-// >
-// > Maybe that issue isn't on your agenda - but it's a bit of a disaster. I know
-// > that fixing this might break some code.
-// >
-// > ---------
-// > Sorry for rolling all these things into one - I'd be interested to know what
-// > you think. But please don't kill my vnl_vector_ref!
-// >
-// > Paul.
+// The big warning is that returning a vnl_matrix_fixed_ref pointer will free
+// non-heap memory if deleted through a vnl_matrix pointer. This should be
+// very difficult though, as vnl_matrix_fixed_ref objects may not be constructed
+// using operator new. This in turn is plausible as the point is to avoid
+// such calls.
+//
+// \author Andrew W. Fitzgibbon, Oxford RRG
+// \date 04 Aug 1996
//
-// vnl_matrix_fixed_ref is a fixed-size vnl_matrix for which the data space
-// has been supplied externally. This is useful for two main tasks:
+// Additional comments on the vnl_matrix_fixed_ref and vnl_vector_fixed_ref
+// classes, extracted from an email conversation between Paul P. Smyth,
+// Vicon Motion Systems Ltd., from May 02, 2001, and Amitha Perera
+// (who answers the following on Monday, October 07, 2002):
//
-// (a) Treating some row-based "C" matrix as a vnl_matrix in order to
-// perform vnl_matrix operations on it.
+// I'm working on separating vnl_vector and vnl_vector_fixed in the VXL
+// tree, as I mailed a while ago to the vxl-maintainers list. I noticed
+// that you'd committed a vnl_vector_fixed_ref class which doesn't seem
+// to provide any additional functionality over vnl_vector_ref. May I
+// remove it, or is there some use for it?
//
-// (b) Declaring a vnl_matrix that uses entirely stack-based storage for the
-// matrix.
+// Paul Smyth writes:
+// The rationale behind it was that I had some (fast) algorithms for
+// matrix/vector operations that made use of compile-time knowledge of the
+// vector and matrix sizes.
+// This was typically appropriate when trying to interpret a fixed-size
+// subvector within a large vector of parameters as e.g. a translation.
//
-// The big warning is that returning a vnl_matrix_fixed_ref pointer will free
-// non-heap memory if deleted through a vnl_matrix pointer. This should be
-// very difficult though, as vnl_matrix_fixed_ref objects may not be constructed
-// using operator new. This in turn is plausible as the point is to avoid
-// such calls.
+// As I saw it, the various types of vector possible were: (with their current
+// names)
+// - pointer to memory, plus compile-time knowledge of vector size ( T*, and enum{size}) = vnl_vector_fixed_ref
+// - ownership of memory, plus compile-time size = vnl_vector_fixed
+// - pointer to memory, plus run-time only knowledge of size (T* and size()) = vnl_vector_ref
+// - ownership of memory, variably sized = vnl_vector
//
-// \author Andrew W. Fitzgibbon, Oxford RRG
-// \date 04 Aug 96
+// I had a conversation with Andrew Fitzgibbon, where he reckoned that the best
+// thing to do with vnl vectors etc. was to create entirely separate types, and
+// routines for conversion between them (possibly implicitly), rather that
+// trying to establish a class hierarchy, which may add too many burdens in
+// terms of object size for small vectors/matrices.
+//
+// Sorry - I've now found the debate on the maintainers list!
+//
+// Anyway, I believe that vector_fixed_ref is very necessary, and that you
+// should be able to convert from a vector_fixed to a vector_fixed_ref - say
+// using an as_ref() member on vector_fixed or standalone function.
+// And I believe that for the restructured classes, vector_fixed_ref and
+// vector_fixed should not be related by inheritance, as that would place an
+// excessive burden on the size of vector_fixed.
+//
+// ------
+// Another issue - do you have a mechanism for dealing with const data safely?
+// {
+// template<typename T, int n>
+// vnl_vector_fixed_ref(T* i_Data);
+//
+// void MyFunction(const vnl_vector<double> & Input)
+// {
+// // take a reference to the first 3 elements of Input
+// vnl_vector_fixed_ref<double,3> ref(Input.begin());
+// // compiler error - as making vector_fixed_ref from const
+// double *
+// }
+// }
+//
+// The options appear to be
+// 1) Make a separate class vnl_vector_fixed_ref_const
+// 2) Make vnl_vector_fixed_ref so it can be instantiated with
+// vnl_vector_fixed_ref<double,n> AND vnl_vector_fixed_ref<const double,n>, and
+// gives appropriate behaviour - would probably require a to_const function
+// which generates vnl_vector_fixed_ref<const T,n> from
+// vnl_vector_fixed_ref<T,n>
+//
+// ------
+// Another note is that a number of routines that use vector_fixed currently
+// (e.g. cross_3d) should really use vector_fixed_ref as an input, because they
+// should be able to operate on fixed vector references as well as fixed
+// vectors.
+//
+// While I'm at it, has it been decided that the vnl_vector and vnl_vector_ref
+// classes are to remain unchanged? Because having vnl_vector as the base, and
+// vnl_vector_ref derived from it is a real pain in the backside. A vector
+// which may or may not own its own memory is a more general type than one
+// which does own its own memory, and having vnl_vector as the base means that
+// all sorts of nastinesses can happen. Simply, a vector_ref Is-not a type of
+// vector.
+// If anything, it should be the other way round.
+//
+// void DoAssign(vnl_vector<double> & RefToMemoryIDontOwn, const vnl_vector<double> & NewContents)
+// {
+// RefToMemoryIDontOwn = NewContents;
+// }
+//
+// void DeleteTwice()
+// {
+// vnl_vector<double> vec1(3, 0); // size 3 - news 3*double
+// vnl_vector<double> vec2(4,1); // size 4 news 4 * double
+// vnl_vector_ref<double> ref_to_1(3,vec1.begin()); // copies pointer
+// DoAssign(ref_to_1, vec2); // deletes memory owned by 1, news 4 * double
+// // vec1 now points to deleted memory, and will crash when goes out of scope
+// }
+//
+// Maybe that issue isn't on your agenda - but it's a bit of a disaster. I know
+// that fixing this might break some code.
+//
+// ---------
+// Sorry for rolling all these things into one - I'd be interested to know what
+// you think. But please don't kill my vnl_vector_ref!
+//
+// Paul.
//
// \verbatim
// Modifications:
@@ -136,6 +133,9 @@
// 4-Jul-2003 Paul Smyth - general cleanup and rewrite; interface now as vnl_matrix_fixed
// 15-Aug-2003 Peter Vanroose - removed "duplicate" operator=(vnl_matrix_fixed<T,n> const&)
// 8-Dec-2006 Markus Moll - changed operator>> signature (to const& argument)
+// 30-Mar-2009 Peter Vanroose - added arg_min() and arg_max()
+// 24-Oct-2010 Peter Vanroose - mutators and filling methods now return *this
+// 18-Jan-2011 Peter Vanroose - added methods set_diagonal() & get_diagonal()
// \endverbatim
//
//-----------------------------------------------------------------------------
@@ -200,6 +200,10 @@ class vnl_matrix_fixed_ref_const
v[j] = (*this)(j,column_index);
return v;
}
+
+ //: Return a vector with the content of the (main) diagonal
+ vnl_vector<T> get_diagonal() const;
+
const T * data_block() const { return data_; }
//: Const iterators
@@ -228,20 +232,19 @@ class vnl_matrix_fixed_ref_const
T const * operator[] (unsigned r) const { return data_ + num_cols * r; }
//: Return number of rows
- unsigned rows () const { return num_rows; }
+ unsigned rows() const { return num_rows; }
//: Return number of columns
// A synonym for cols()
- unsigned columns () const { return num_cols; }
+ unsigned columns() const { return num_cols; }
//: Return number of columns
// A synonym for columns()
- unsigned cols () const { return num_cols; }
+ unsigned cols() const { return num_cols; }
//: Return number of elements
// This equals rows() * cols()
- unsigned size () const { return num_rows*num_cols; }
-
+ unsigned size() const { return num_rows*num_cols; }
//: Print matrix to os in some hopefully sensible format
void print(vcl_ostream& os) const;
@@ -264,7 +267,7 @@ class vnl_matrix_fixed_ref_const
//: Extract a sub-matrix of size rows x cols, starting at (top,left)
// Thus it contains elements [top,top+rows-1][left,left+cols-1]
- vnl_matrix<T> extract (unsigned rows, unsigned cols,
+ vnl_matrix<T> extract (unsigned rowz, unsigned colz,
unsigned top=0, unsigned left=0) const;
//: Get n rows beginning at rowstart
@@ -312,6 +315,12 @@ class vnl_matrix_fixed_ref_const
//: Return maximum value of elements
T max_value() const { return vnl_c_vector<T>::max_value(begin(), size()); }
+ //: Return location of minimum value of elements
+ unsigned arg_min() const { return vnl_c_vector<T>::arg_min(begin(), size()); }
+
+ //: Return location of maximum value of elements
+ unsigned arg_max() const { return vnl_c_vector<T>::arg_max(begin(), size()); }
+
//: Return mean of all matrix elements
T mean() const { return vnl_c_vector<T>::mean(begin(), size()); }
@@ -422,7 +431,6 @@ class vnl_matrix_fixed_ref : public vnl_matrix_fixed_ref_const<T,num_rows,num_co
// No boundary checking here.
T * operator[] (unsigned r) const { return data_block() + num_cols * r; }
-
//: Access an element for reading or writing
// There are assert style boundary checks - #define NDEBUG to turn them off.
T & operator() (unsigned r, unsigned c) const
@@ -434,34 +442,74 @@ class vnl_matrix_fixed_ref : public vnl_matrix_fixed_ref_const<T,num_rows,num_co
return *(this->data_block() + num_cols * r + c);
}
-
- // Filling and copying------------------------------------------------
-
- //: Set all elements of matrix to specified value.
- // Complexity $O(r.c)$
- void fill (T) const;
-
- //: Set all diagonal elements of matrix to specified value.
- // Complexity $O(\min(r,c))$
- void fill_diagonal (T) const;
-
- //: Fill (laminate) this matrix with the given data.
- // We assume that p points to a contiguous rows*cols array, stored rowwise.
- void copy_in(T const *) const;
-
- //: Fill (laminate) this matrix with the given data.
- // A synonym for copy_in()
- void set(T const *d) const { copy_in(d); }
-
- //: Fill the given array with this matrix.
- // We assume that p points to a contiguous rows*cols array, stored rowwise.
- // No bounds checking on the array
-
- //: Transpose this matrix efficiently, if it is a square matrix
- void inplace_transpose() const;
-
-
- // Arithmetic ----------------------------------------------------
+ // ----------------------- Filling and copying -----------------------
+
+ //: Sets all elements of matrix to specified value, and returns "*this".
+ // Complexity $O(r.c)$
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a matrix to a column-normalized all-elements-equal matrix, say
+ // \code
+ // M.fill(1).normalize_columns();
+ // \endcode
+ // Returning "*this" also allows passing such a matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed_ref_const<double,5,5>(1.0).normalize_columns());
+ // \endcode
+ vnl_matrix_fixed_ref const& fill (T) const;
+
+ //: Sets all diagonal elements of matrix to specified value; returns "*this".
+ // Complexity $O(\min(r,c))$
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [5 0 0][0 10 0][0 0 15], just say
+ // \code
+ // M.fill_diagonal(5).scale_row(1,2).scale_column(2,3);
+ // \endcode
+ // Returning "*this" also allows passing a diagonal-filled matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed_ref<double,3,3>().fill_diagonal(5));
+ // \endcode
+ vnl_matrix_fixed_ref const& fill_diagonal (T) const;
+
+ //: Sets the diagonal elements of this matrix to the specified list of values.
+ // Returning "*this" allows "chaining" two or more operations: see the
+ // reasoning (and the examples) in the documentation for method
+ // fill_diagonal().
+ vnl_matrix_fixed_ref const& set_diagonal(vnl_vector<T> const&) const;
+
+ //: Fills (laminates) this matrix with the given data, then returns it.
+ // We assume that the argument points to a contiguous rows*cols array, stored rowwise.
+ // No bounds checking on the array.
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to fill a square matrix column-wise, fill it rowwise then transpose:
+ // \code
+ // M.copy_in(array).inplace_transpose();
+ // \endcode
+ // Returning "*this" also allows passing a filled-in matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed_ref<double,3,3>().copy_in(array));
+ // \endcode
+ vnl_matrix_fixed_ref const& copy_in(T const *) const;
+
+ //: Fills (laminates) this matrix with the given data, then returns it.
+ // A synonym for copy_in()
+ vnl_matrix_fixed_ref const& set(T const *d) const { return copy_in(d); }
+
+ //: Fills the given array with this matrix.
+ // We assume that the argument points to a contiguous rows*cols array, stored rowwise.
+ // No bounds checking on the array
+
+ //: Transposes this matrix efficiently, if it is square, and returns it.
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to fill a square matrix column-wise, fill it rowwise then transpose:
+ // \code
+ // M.copy_in(array).inplace_transpose();
+ // \endcode
+ vnl_matrix_fixed_ref const& inplace_transpose() const;
+
+ // ----------------------- Arithmetic --------------------------------
// note that these functions should not pass scalar as a const&.
// Look what would happen to A /= A(0,0).
@@ -552,65 +600,117 @@ class vnl_matrix_fixed_ref : public vnl_matrix_fixed_ref_const<T,num_rows,num_co
}
#endif
-
//: Set values of this matrix to those of M, starting at [top,left]
vnl_matrix_fixed_ref const & update (vnl_matrix<T> const&, unsigned top=0, unsigned left=0) const;
- //: Set the elements of the i'th column to v[j] (No bounds checking)
- void set_column(unsigned i, T const * v) const;
-
- //: Set the elements of the i'th column to value
- void set_column(unsigned i, T value ) const;
-
- //: Set j-th column to v
- void set_column(unsigned j, vnl_vector<T> const& v) const;
-
- //: Set columns to those in M, starting at starting_column
- void set_columns(unsigned starting_column, vnl_matrix<T> const& M) const;
-
- //: Set the elements of the i'th row to v[j] (No bounds checking)
- void set_row (unsigned i, T const * v) const;
-
- //: Set the elements of the i'th row to value
- void set_row (unsigned i, T value ) const;
-
- //: Set the i-th row
- void set_row (unsigned i, vnl_vector<T> const&) const;
-
-
- // mutators
-
- //: Set this matrix to an identity matrix
- // Abort if the matrix is not square
- void set_identity() const;
-
- //: Reverse order of rows.
- void flipud() const;
-
- //: Reverse order of columns.
- void fliplr() const;
-
- //: Normalize each row so it is a unit vector
- // Zero rows are ignored
- void normalize_rows() const;
-
- //: Normalize each column so it is a unit vector
- // Zero columns are ignored
- void normalize_columns() const;
-
- //: Scale elements in given row by a factor of T
- void scale_row (unsigned row, T value) const;
-
- //: Scale elements in given column by a factor of T
- void scale_column(unsigned col, T value) const;
-
+ //: Set the elements of the i'th column to v[i] (No bounds checking)
+ vnl_matrix_fixed_ref const& set_column(unsigned i, T const * v) const;
+
+ //: Set the elements of the i'th column to value, then return *this.
+ vnl_matrix_fixed_ref const& set_column(unsigned i, T value ) const;
+
+ //: Set j-th column to v, then return *this.
+ vnl_matrix_fixed_ref const& set_column(unsigned j, vnl_vector<T> const& v) const;
+
+ //: Set j-th column to v, then return *this.
+ vnl_matrix_fixed_ref const& set_column(unsigned j, vnl_vector_fixed<T, num_rows> const& v) const;
+
+ //: Set columns to those in M, starting at starting_column, then return *this.
+ vnl_matrix_fixed_ref const& set_columns(unsigned starting_column, vnl_matrix<T> const& M) const;
+
+ //: Set the elements of the i'th row to v[i] (No bounds checking)
+ vnl_matrix_fixed_ref const& set_row (unsigned i, T const * v) const;
+
+ //: Set the elements of the i'th row to value, then return *this.
+ vnl_matrix_fixed_ref const& set_row (unsigned i, T value ) const;
+
+ //: Set the i-th row to v, then return *this.
+ vnl_matrix_fixed_ref const& set_row (unsigned i, vnl_vector<T> const& v) const;
+
+ //: Set the i-th row to v, then return *this.
+ vnl_matrix_fixed_ref const& set_row (unsigned i, vnl_vector_fixed<T, num_cols> const& v) const;
+
+ // ==== mutators ====
+
+ //: Sets this matrix to an identity matrix, then returns "*this".
+ // Returning "*this" allows e.g. passing an identity matrix as argument to
+ // a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed_ref<double,5,5>().set_identity());
+ // \endcode
+ // Returning "*this" also allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [3 0 0][0 2 0][0 0 1], one could say
+ // \code
+ // M.set_identity().scale_row(0,3).scale_column(1,2);
+ // \endcode
+ // If the matrix is not square, anyhow set main diagonal to 1, the rest to 0.
+ vnl_matrix_fixed_ref const& set_identity() const;
+
+ //: Reverses the order of rows, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to flip both up-down and left-right, one could just say
+ // \code
+ // M.flipud().fliplr();
+ // \endcode
+ vnl_matrix_fixed_ref const& flipud() const;
+
+ //: Reverses the order of columns, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to flip both up-down and left-right, one could just say
+ // \code
+ // M.flipud().fliplr();
+ // \endcode
+ vnl_matrix_fixed_ref const& fliplr() const;
+
+ //: Normalizes each row so it is a unit vector, and returns "*this".
+ // Zero rows are not modified
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a matrix to a row-normalized all-elements-equal matrix, say
+ // \code
+ // M.fill(1).normalize_rows();
+ // \endcode
+ // Returning "*this" also allows passing such a matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed_ref<double,5,5>(1.0).normalize_rows());
+ // \endcode
+ vnl_matrix_fixed_ref const& normalize_rows() const;
+
+ //: Normalizes each column so it is a unit vector, and returns "*this".
+ // Zero columns are not modified
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a matrix to a column-normalized all-elements-equal matrix, say
+ // \code
+ // M.fill(1).normalize_columns();
+ // \endcode
+ // Returning "*this" also allows passing such a matrix as argument
+ // to a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_matrix_fixed_ref<double,5,5>(1.0).normalize_columns());
+ // \endcode
+ vnl_matrix_fixed_ref const& normalize_columns() const;
+
+ //: Scales elements in given row by a factor T, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [3 0 0][0 2 0][0 0 1], one could say
+ // \code
+ // M.set_identity().scale_row(0,3).scale_column(1,2);
+ // \endcode
+ vnl_matrix_fixed_ref const& scale_row (unsigned row, T value) const;
+
+ //: Scales elements in given column by a factor T, and returns "*this".
+ // Returning "*this" allows "chaining" two or more operations:
+ // e.g., to set a 3x3 matrix to [3 0 0][0 2 0][0 0 1], one could say
+ // \code
+ // M.set_identity().scale_row(0,3).scale_column(1,2);
+ // \endcode
+ vnl_matrix_fixed_ref const& scale_column(unsigned col, T value) const;
////----------------------- Input/Output ----------------------------
// : Read a vnl_matrix from an ascii vcl_istream, automatically determining file size if the input matrix has zero size.
bool read_ascii(vcl_istream& s) const;
-
//----------------------------------------------------------------------
// Conversion to vnl_matrix_ref.
@@ -657,7 +757,7 @@ class vnl_matrix_fixed_ref : public vnl_matrix_fixed_ref_const<T,num_rows,num_co
//: Return true if *this == rhs
bool operator_eq (vnl_matrix_fixed_ref_const<T,num_rows,num_cols> const & rhs) const
{
- return equal( this->data_block(), rhs.data_block() );
+ return vnl_matrix_fixed_ref<T,num_rows,num_cols>::equal( this->data_block(), rhs.data_block() );
}
//: Equality operator
@@ -675,11 +775,9 @@ class vnl_matrix_fixed_ref : public vnl_matrix_fixed_ref_const<T,num_rows,num_co
// the template parameters. The vector-vector operations are
// element-wise.
-
// Make the operators below inline because (1) they are small and
// (2) we then have less explicit instantiation trouble.
-
// --- Matrix-scalar -------------------------------------------------------------
template<class T, unsigned m, unsigned n>
@@ -829,8 +927,8 @@ vnl_matrix_fixed_mat_mat_mult(const vnl_matrix_fixed_ref_const<T, M, N>& a,
// The version for correct compilers
//: Multiply conformant vnl_matrix_fixed (M x N) and vector_fixed (N)
-// \relates vnl_vector_fixed
-// \relates vnl_matrix_fixed
+// \relatesalso vnl_vector_fixed
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned M, unsigned N>
inline
vnl_vector_fixed<T, M> operator*(const vnl_matrix_fixed_ref_const<T, M, N>& a, const vnl_vector_fixed_ref_const<T, N>& b)
@@ -839,7 +937,7 @@ vnl_vector_fixed<T, M> operator*(const vnl_matrix_fixed_ref_const<T, M, N>& a, c
}
//: Multiply two conformant vnl_matrix_fixed (M x N) times (N x O)
-// \relates vnl_matrix_fixed
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned M, unsigned N, unsigned O>
inline
vnl_matrix_fixed<T, M, O> operator*(const vnl_matrix_fixed_ref_const<T, M, N>& a, const vnl_matrix_fixed_ref_const<T, N, O>& b)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed_ref.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed_ref.txx
index 2bf43d7c18eb67ceb5f5a6b5c061e1459facb005..e3d04d6308e4c1244e8b1eef3022eab968fc8f25 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed_ref.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_matrix_fixed_ref.txx
@@ -112,21 +112,37 @@ vnl_matrix_fixed_ref_const<T,nrows,ncols>::equal( const T* a, const T* b )
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::fill (T value) const
{
for (unsigned int i = 0; i < nrows; i++)
for (unsigned int j = 0; j < ncols; j++)
(*this)(i,j) = value;
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
-vnl_matrix_fixed_ref<T,nrows,ncols>::fill_diagonal (T value) const
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
+vnl_matrix_fixed_ref<T,nrows,ncols>::fill_diagonal(T value) const
{
for (unsigned int i = 0; i < nrows && i < ncols; i++)
(*this)(i,i) = value;
+ return *this;
+}
+
+
+template<class T, unsigned nrows, unsigned ncols>
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
+vnl_matrix_fixed_ref<T,nrows,ncols>::set_diagonal(vnl_vector<T> const& diag) const
+{
+ assert(diag.size() >= nrows || diag.size() >= ncols);
+ // The length of the diagonal of a non-square matrix is the minimum of
+ // the matrix's width & height; that explains the "||" in the assert,
+ // and the "&&" in the upper bound for the "for".
+ for (unsigned int i = 0; i < nrows && i < ncols; ++i)
+ (*this)(i,i) = diag[i];
+ return *this;
}
@@ -227,13 +243,14 @@ vnl_matrix_fixed_ref_const<T,nrows,ncols>::extract (unsigned rowz, unsigned colz
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::copy_in(T const *p) const
{
T* dp = this->data_block();
unsigned int i = nrows * ncols;
while (i--)
*dp++ = *p++;
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
@@ -246,38 +263,35 @@ void vnl_matrix_fixed_ref_const<T,nrows,ncols>::copy_out(T *p) const
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::set_identity() const
{
-#ifndef NDEBUG
- if (nrows != ncols) // Size?
- vnl_error_matrix_nonsquare ("set_identity");
-#endif
// Two simple loops are generally better than having a branch inside
// the loop. Probably worth the O(n) extra writes.
- for (unsigned int i = 0; i < nrows; i++)
- for (unsigned int j = 0; j < ncols; j++)
+ for (unsigned int i = 0; i < nrows; ++i)
+ for (unsigned int j = 0; j < ncols; ++j)
(*this)(i,j) = T(0);
- for (unsigned int i = 0; i < nrows; i++)
+ for (unsigned int i = 0; i < nrows && i < ncols; ++i)
(*this)(i,i) = T(1);
+ return *this;
}
//: Make each row of the matrix have unit norm.
// All-zero rows are ignored.
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::normalize_rows() const
{
- typedef typename vnl_numeric_traits<T>::abs_t abs_t;
+ typedef typename vnl_numeric_traits<T>::abs_t Abs_t;
for (unsigned int i = 0; i < nrows; i++)
{
- abs_t norm(0); // double will not do for all types.
+ Abs_t norm(0); // double will not do for all types.
for (unsigned int j = 0; j < ncols; j++)
norm += vnl_math_squared_magnitude( (*this)(i,j) );
if (norm != 0)
{
- typedef typename vnl_numeric_traits<abs_t>::real_t real_t;
+ typedef typename vnl_numeric_traits<Abs_t>::real_t real_t;
real_t scale = real_t(1)/vcl_sqrt((real_t)norm);
for (unsigned int j = 0; j < ncols; j++)
{
@@ -287,21 +301,22 @@ vnl_matrix_fixed_ref<T,nrows,ncols>::normalize_rows() const
}
}
}
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::normalize_columns() const
{
- typedef typename vnl_numeric_traits<T>::abs_t abs_t;
+ typedef typename vnl_numeric_traits<T>::abs_t Abs_t;
for (unsigned int j = 0; j < ncols; j++) { // For each column in the Matrix
- abs_t norm(0); // double will not do for all types.
+ Abs_t norm(0); // double will not do for all types.
for (unsigned int i = 0; i < nrows; i++)
norm += vnl_math_squared_magnitude( (*this)(i,j) );
if (norm != 0)
{
- typedef typename vnl_numeric_traits<abs_t>::real_t real_t;
+ typedef typename vnl_numeric_traits<Abs_t>::real_t real_t;
real_t scale = real_t(1)/vcl_sqrt((real_t)norm);
for (unsigned int i = 0; i < nrows; i++)
{
@@ -311,10 +326,11 @@ vnl_matrix_fixed_ref<T,nrows,ncols>::normalize_columns() const
}
}
}
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::scale_row(unsigned row_index, T value) const
{
#ifndef NDEBUG
@@ -323,10 +339,11 @@ vnl_matrix_fixed_ref<T,nrows,ncols>::scale_row(unsigned row_index, T value) cons
#endif
for (unsigned int j = 0; j < ncols; j++)
(*this)(row_index,j) *= value;
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::scale_column(unsigned column_index, T value) const
{
#ifndef NDEBUG
@@ -335,6 +352,7 @@ vnl_matrix_fixed_ref<T,nrows,ncols>::scale_column(unsigned column_index, T value
#endif
for (unsigned int j = 0; j < nrows; j++)
(*this)(j,column_index) *= value;
+ return *this;
}
//: Returns a copy of n rows, starting from "row"
@@ -401,59 +419,91 @@ vnl_vector<T> vnl_matrix_fixed_ref_const<T,nrows,ncols>::get_column(unsigned col
#endif // 0
+//: Return a vector with the content of the (main) diagonal
+template<class T, unsigned nrows, unsigned ncols>
+vnl_vector<T> vnl_matrix_fixed_ref_const<T,nrows,ncols>::get_diagonal() const
+{
+ vnl_vector<T> v(nrows < ncols ? nrows : ncols);
+ for (unsigned int j = 0; j < nrows && j < ncols; ++j)
+ v[j] = (*this)(j,j);
+ return v;
+}
+
//--------------------------------------------------------------------------------
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::set_row(unsigned row_index, T const *v) const
{
for (unsigned int j = 0; j < ncols; j++)
(*this)(row_index,j) = v[j];
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
+vnl_matrix_fixed_ref<T,nrows,ncols>::set_row(unsigned row_index, vnl_vector_fixed<T,ncols> const &v) const
+{
+ set_row(row_index,v.data_block());
+ return *this;
+}
+
+template<class T, unsigned nrows, unsigned ncols>
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::set_row(unsigned row_index, vnl_vector<T> const &v) const
{
set_row(row_index,v.data_block());
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::set_row(unsigned row_index, T v) const
{
for (unsigned int j = 0; j < ncols; j++)
(*this)(row_index,j) = v;
+ return *this;
}
//--------------------------------------------------------------------------------
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::set_column(unsigned column_index, T const *v) const
{
for (unsigned int i = 0; i < nrows; i++)
(*this)(i,column_index) = v[i];
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
+vnl_matrix_fixed_ref<T,nrows,ncols>::set_column(unsigned column_index, vnl_vector_fixed<T,nrows> const &v) const
+{
+ set_column(column_index,v.data_block());
+ return *this;
+}
+
+template<class T, unsigned nrows, unsigned ncols>
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::set_column(unsigned column_index, vnl_vector<T> const &v) const
{
set_column(column_index,v.data_block());
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::set_column(unsigned column_index, T v) const
{
for (unsigned int j = 0; j < nrows; j++)
(*this)(j,column_index) = v;
+ return *this;
}
template<class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::set_columns(unsigned starting_column, vnl_matrix<T> const& m) const
{
#ifndef NDEBUG
@@ -467,6 +517,7 @@ vnl_matrix_fixed_ref<T,nrows,ncols>::set_columns(unsigned starting_column, vnl_m
for (unsigned int j = 0; j < m.cols(); ++j)
for (unsigned int i = 0; i < nrows; i++)
(*this)(i,starting_column + j) = m(i,j);
+ return *this;
}
@@ -612,7 +663,7 @@ vnl_matrix_fixed_ref<T,nrows,ncols>::read_ascii(vcl_istream& s) const
template <class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::flipud() const
{
for (unsigned int r1 = 0; 2*r1+1 < nrows; ++r1)
@@ -625,11 +676,12 @@ vnl_matrix_fixed_ref<T,nrows,ncols>::flipud() const
(*this)(r2, c) = tmp;
}
}
+ return *this;
}
template <class T, unsigned nrows, unsigned ncols>
-void
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
vnl_matrix_fixed_ref<T,nrows,ncols>::fliplr() const
{
for (unsigned int c1 = 0; 2*c1+1 < ncols; ++c1)
@@ -642,6 +694,7 @@ vnl_matrix_fixed_ref<T,nrows,ncols>::fliplr() const
(*this)(r, c2) = tmp;
}
}
+ return *this;
}
template <class T, unsigned nrows, unsigned ncols>
@@ -678,7 +731,8 @@ vnl_matrix_fixed_ref_const<T,nrows,ncols>::operator_inf_norm() const
//: Transpose square matrix M in place.
template <class T, unsigned nrows, unsigned ncols>
-void vnl_matrix_fixed_ref<T,nrows,ncols>::inplace_transpose() const
+vnl_matrix_fixed_ref<T,nrows,ncols> const&
+vnl_matrix_fixed_ref<T,nrows,ncols>::inplace_transpose() const
{
assert(nrows==ncols); // cannot inplace_transpose non-square fixed size matrix
for (unsigned i = 0; i < nrows; ++i)
@@ -688,6 +742,7 @@ void vnl_matrix_fixed_ref<T,nrows,ncols>::inplace_transpose() const
(*this)(i,j) = (*this)(j,i);
(*this)(j,i) = t;
}
+ return *this;
}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_na.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_na.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..20ecee32e91184bb2e150cc587a0635bc5fa24b1
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_na.cxx
@@ -0,0 +1,122 @@
+// This is core/vnl/vnl_na.cxx
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma implementation
+#endif
+//:
+// \file
+
+#include "vnl_na.h"
+#include <vxl_config.h>
+#include <vcl_istream.h>
+#include <vcl_ios.h>
+
+//: A particular qNaN to indicate not available.
+// This returns the bit pattern 0x7ff00000000007a2, as used by Octave and R
+// Don't assume that any VXL functions will treat the value as NA rather than NaN, unless
+// explicitly documented.
+double vnl_na(double)
+{
+ double a;
+
+#if VXL_HAS_INT_64
+ *reinterpret_cast<vxl_uint_64*>(&a) = 0x7ff00000000007a2LL;
+#else
+# if VXL_BIG_ENDIAN
+# define hw 0
+# define lw 1
+# else // VXL_LITTLE_ENDIAN
+# define hw 1
+# define lw 0
+# endif
+ reinterpret_cast<vxl_uint_32*>(&a)[hw]=0x7ff00000;
+ reinterpret_cast<vxl_uint_32*>(&a)[lw]=0x000007a2;
+#endif
+
+ return a;
+}
+
+
+
+//: A particular qNaN to indicate not available.
+// This returns the bit pattern 0x7f8007a2
+// Don't assume that any VXL functions will treat the value as NA rather than NaN, unless
+// explicitly documented.
+float vnl_na(float)
+{
+ float a;
+
+ *reinterpret_cast<vxl_uint_32*>(&a) = 0x7f8007a2L;
+
+ return a;
+}
+
+
+//: True if parameter is specific NA qNaN.
+// Tests for bit pattern 0x7ff00000000007a2, as used by Octave and R
+bool vnl_na_isna(double x)
+{
+#if VXL_HAS_INT_64
+ return ((*reinterpret_cast<vxl_uint_64*>(&x))&0xfff7ffffffffffffLL) // ignore signalling bit
+ == 0x7ff00000000007a2LL;
+#else
+ return ((reinterpret_cast<vxl_int_32*>(&x)[hw]) & 0xfff7ffff) == 0x7ff00000 &&
+ reinterpret_cast<vxl_int_32*>(&x)[lw] == 0x000007a2;
+#endif
+}
+
+//: True if parameter is specific NA qNaN.
+// Tests for bit pattern 0x7F8007a2
+bool vnl_na_isna(float x)
+{
+ return ((*reinterpret_cast<vxl_uint_32*>(&x))&0xffbfffffL) // ignore signalling bit
+ == 0x7f8007a2L;
+}
+
+//: Read a floating point number or "NA" from a stream.
+template <class T> inline void vnl_na_extract_type(vcl_istream &is, T& x)
+{
+ if (!is) return;
+ is >> x;
+
+ if (!!is || is.eof()) return;
+ is.clear();
+
+ char c=' ';
+ is >> c;
+ if (c != 'N' && c!='n')
+ {
+ is.putback(c);
+ is.clear(vcl_ios::badbit);
+ return;
+ }
+ is >> c;
+ if (c != 'A' && c!='a')
+ {
+ is.putback(c);
+ is.clear(vcl_ios::badbit);
+ return;
+ }
+ x = vnl_na(T());
+}
+
+void vnl_na_extract(vcl_istream &is, double& x) { vnl_na_extract_type(is, x); }
+void vnl_na_extract(vcl_istream &is, float& x) { vnl_na_extract_type(is, x); }
+
+//: Write a floating point number or "NA" to a stream.
+void vnl_na_insert(vcl_ostream &os, double x)
+{
+ if (vnl_na_isna(x))
+ os << "NA";
+ else
+ os << x;
+}
+
+//: Write a floating point number or "NA" to a stream.
+void vnl_na_insert(vcl_ostream &os, float x)
+{
+ if (vnl_na_isna(x))
+ os << "NA";
+ else
+ os << x;
+}
+//----------------------------------------------------------------------
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_na.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_na.h
new file mode 100644
index 0000000000000000000000000000000000000000..8f7b68779d491f7e978d4b036a860d49d8507a1e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_na.h
@@ -0,0 +1,131 @@
+// This is core/vnl/vnl_na.h
+#ifndef vnl_na_h_
+#define vnl_na_h_
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma interface
+#endif
+
+
+#include <vcl_iosfwd.h>
+
+//:
+// \file
+// \brief NA (Not Available) is a particular double NaN to represent missing data.
+// For example, where a vnl_vector<double> represents a series of samples from an image,
+// NA could be used to represent places where the measurement was taken outside the image.
+//
+// NA is distinct from the two other standard meanings of NaN - Indeterminate and Error.
+// It is entirely up to each algorithm to treat NA values meaningfully. Unless
+// a function's interpretation of NA is explicitly documented, you should assume that
+// it will be treated similarly to every other NaN.
+// The IEEE754 bit value used to represent NA in double-precision is 0x7ff00000000007a2, the
+// same as used by Octave and R. Initial values of NA are stored as signalling NaNs, but
+// many uses will convert this to the non-signalling variant 0x7ff80000000007a2. vnl_isna()
+// will accept either variant.
+//
+// The single precision NA is stored as 0x7f8007a2. I cannot find any external support for
+// this or any other value for single precision NA. There is no automatic conversion between
+// the NA values during casting, promotion, etc. If you want to convert a float to double,
+// whilst preserving the NA-ness of the value, you will have to test for and set the new NA
+// value explicitly.
+//
+// You can read and write floating point values from a stream using standard operators
+// by using a conversion manipulator.
+// \verbatim
+// double x, y;
+// is >> x >> y;
+// os << x << ' ' << y;
+// \endverbatim
+
+
+//: qNaN to indicate value Not Available.
+// Don't assume that any VXL functions will do something sensible in the face of NA, unless
+// explicitly documented.
+double vnl_na(double dummy);
+
+//: qNaN to indicate value Not Available.
+// Don't assume that any VXL functions will do something sensible in the face of NA, unless
+// explicitly documented.
+float vnl_na(float dummy);
+
+//: True if parameter is specific NA qNaN.
+// Tests for bit pattern 0x7ff00000000007a2, as used by Octave and R
+bool vnl_na_isna(double);
+
+//: True if parameter is specific NA qNaN.
+// Tests for bit pattern 0x7f8007a2
+bool vnl_na_isna(float);
+
+
+//: Read a floating point number or "NA" from a stream.
+// Should behave exactly like a>>x, if the extraction operator was aware of the
+// character sequence \code NA.
+void vnl_na_extract(vcl_istream &is, double& x);
+
+
+//: Write a floating point number or "NA" to a stream.
+// Should behave exactly like a<<x, if the insertion operator was aware of the
+// character sequence \code NA.
+void vnl_na_insert(vcl_ostream &is, double x);
+
+//: Read a floating point number or "NA" from a stream.
+// Should behave exactly like a>>x, if the extraction operator was aware of the
+// character sequence \code NA.
+void vnl_na_extract(vcl_istream &is, float& x);
+
+
+//: Write a floating point number or "NA" to a stream.
+// Should behave exactly like a<<x, if the insertion operator was aware of the
+// character sequence \code NA.
+void vnl_na_insert(vcl_ostream &is, float x);
+
+
+//: Wrapper around a double or float that handles streaming NA.
+template <class T> struct vnl_na_stream_t
+{
+ T& x_;
+ vnl_na_stream_t(T& x): x_(x) {}
+};
+
+//: Wrapper around a double or float that handles streaming NA.
+template <class T> struct vnl_na_stream_const_t
+{
+ const T& x_;
+ vnl_na_stream_const_t(const T& x): x_(x) {}
+};
+
+//: Wrap a double or float to handle streaming NA.
+template <class T> inline vnl_na_stream_t<T> vnl_na_stream(T& x)
+{
+ return vnl_na_stream_t<T>(x);
+}
+
+//: Wrap a double or float to handle streaming NA.
+template <class T> inline vnl_na_stream_const_t<T> vnl_na_stream(const T& x)
+{
+ return vnl_na_stream_const_t<T>(x);
+}
+
+//: Insert wrapped double or float into stream, whilst handling NA.
+template <class T> inline vcl_ostream& operator <<(vcl_ostream &os, const vnl_na_stream_t<T>& ns)
+{
+ vnl_na_insert(os, ns.x_);
+ return os;
+}
+
+//: Insert wrapped double or float into stream, whilst handling NA.
+template <class T> inline vcl_ostream& operator <<(vcl_ostream &os, const vnl_na_stream_const_t<T>& ns)
+{
+ vnl_na_insert(os, ns.x_);
+ return os;
+}
+
+//: Extract wrapped double or float from stream, whilst handling NA.
+template <class T> inline vcl_istream& operator >>(vcl_istream &is, const vnl_na_stream_t<T>& ns)
+{
+ vnl_na_extract(is, ns.x_);
+ return is;
+}
+
+
+#endif // vnl_na_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_nonlinear_minimizer.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_nonlinear_minimizer.cxx
index 33d5292f262210fca93b55f5c801d3e1b4635079..70a5d207f77608202fa7fd763bc54a3ff569f73b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_nonlinear_minimizer.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_nonlinear_minimizer.cxx
@@ -12,17 +12,20 @@
//: Default ctor sets verbosity etc.
vnl_nonlinear_minimizer::vnl_nonlinear_minimizer()
+: xtol(1e-8) // Termination tolerance on X (solution vector)
+, maxfev(2000) // Termination maximum number of iterations.
+, ftol(xtol * 0.01) // Termination tolerance on F (sum of squared residuals)
+, gtol(1e-5) // Termination tolerance on Grad(F)' * F = 0
+, epsfcn(xtol * 0.001) // Step length for FD Jacobian
+, num_iterations_(0)
+, num_evaluations_(0)
+, start_error_(0)
+, end_error_(0)
+, trace(false)
+, verbose_(false)
+, check_derivatives_(0)
+, failure_code_(ERROR_FAILURE)
{
- xtol = 1e-8; // Termination tolerance on X (solution vector)
- maxfev = 2000; // Termination maximum number of iterations.
- ftol = xtol * 0.01; // Termination tolerance on F (sum of squared residuals)
- gtol = 1e-5; // Termination tolerance on Grad(F)' * F = 0
- epsfcn = xtol * 0.001; // Step length for FD Jacobian
- trace = false;
- verbose_ = false;
- check_derivatives_=0;
- failure_code_ = ERROR_FAILURE;
- reset();
}
vnl_nonlinear_minimizer::~vnl_nonlinear_minimizer()
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_nonlinear_minimizer.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_nonlinear_minimizer.h
index c114e1fd676b15780289e2d739f7599f1cbec851..782cf252d976ea0e24d7667b62ae236f289703fa 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_nonlinear_minimizer.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_nonlinear_minimizer.h
@@ -5,15 +5,15 @@
#pragma interface
#endif
//:
-// \file
-// \brief Base class for nonlinear optimization
-// \author Andrew W. Fitzgibbon, Oxford RRG
-// \date 22 Aug 99
+// \file
+// \brief Base class for nonlinear optimization
+// \author Andrew W. Fitzgibbon, Oxford RRG
+// \date 22 Aug 1999
//
// \verbatim
// Modifications
-// 22/03/2001 dac - added binary io and tidied documentation
-// Feb.2002 - Peter Vanroose - brief doxygen comment placed on single line
+// 22 Mar.2001 - dac - added binary io and tidied documentation
+// Feb.2002 - Peter Vanroose - brief doxygen comment placed on single line
// \endverbatim
#include <vcl_string.h>
@@ -98,17 +98,6 @@ class vnl_nonlinear_minimizer
// Each iteration may have comprised several function evaluations.
int get_num_iterations() const { return num_iterations_; }
- //:Return the covariance of the estimate at the end.
- virtual vnl_matrix<double> const& get_covariance();
-
- //: Return the name of the class.
- // Used by polymorphic IO
- virtual vcl_string is_a() const;
-
- //: Return true if the name of the class matches the argument.
- // Used by polymorphic IO
- virtual bool is_class(vcl_string const& s) const;
-
//:Some generic return codes that apply to all minimizers.
enum ReturnCodes {
ERROR_FAILURE =-1,
@@ -118,12 +107,27 @@ class vnl_nonlinear_minimizer
CONVERGED_XFTOL = 3,
CONVERGED_GTOL = 4,
FAILED_TOO_MANY_ITERATIONS = 5,
+ TOO_MANY_ITERATIONS = FAILED_TOO_MANY_ITERATIONS, // for backward-compatibility
FAILED_FTOL_TOO_SMALL = 6,
FAILED_XTOL_TOO_SMALL = 7,
FAILED_GTOL_TOO_SMALL = 8,
FAILED_USER_REQUEST = 9
};
+ //:Whether the error reduced in the last minimization
+ bool obj_value_reduced() { return failure_code_ != ERROR_FAILURE && failure_code_ != ERROR_DODGY_INPUT && end_error_ < start_error_; }
+
+ //:Return the covariance of the estimate at the end.
+ virtual vnl_matrix<double> const& get_covariance();
+
+ //: Return the name of the class.
+ // Used by polymorphic IO
+ virtual vcl_string is_a() const;
+
+ //: Return true if the name of the class matches the argument.
+ // Used by polymorphic IO
+ virtual bool is_class(vcl_string const& s) const;
+
//:Return the failure code of the last minimization
ReturnCodes get_failure_code() const { return failure_code_; }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_numeric_traits.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_numeric_traits.h
index e1a6cf7ab2daffe639cedbab93760ce90f6d378a..1ffce473bf59021b52bc79145c2c98d23d27251e 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_numeric_traits.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_numeric_traits.h
@@ -332,6 +332,32 @@ class vnl_numeric_traits<size_t const> : public vnl_numeric_traits<size_t> {};
#endif // _WIN64
+#ifdef _WIN64
+VCL_DEFINE_SPECIALIZATION
+class vnl_numeric_traits<long long>
+{
+ public:
+ //: Additive identity
+ static const long long zero VCL_STATIC_CONST_INIT_INT_DECL(0);
+ //: Multiplicative identity
+ static const long long one VCL_STATIC_CONST_INIT_INT_DECL(1);
+ //: Maximum value which this type can assume
+ static const long long maxval; // = 0x7fffffff;
+ //: Return value of abs()
+ typedef unsigned long long abs_t;
+ //: Name of a type twice as long as this one for accumulators and products.
+ typedef long long double_t;
+ //: Name of type which results from multiplying this type with a double
+ typedef double real_t;
+};
+
+#if !VCL_CANNOT_SPECIALIZE_CV
+VCL_DEFINE_SPECIALIZATION
+class vnl_numeric_traits<long long const> : public vnl_numeric_traits<long long> {};
+#endif
+
+#endif // _WIN64
+
VCL_DEFINE_SPECIALIZATION
class vnl_numeric_traits<float>
{
@@ -473,5 +499,4 @@ VCL_DEFINE_SPECIALIZATION
class vnl_numeric_traits<vcl_complex<long double> const> : public vnl_numeric_traits<vcl_complex<long double> > {};
#endif
-
#endif // vnl_numeric_traits_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_operators.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_operators.h
index 525475f7e7dc6a75c67094e9177fc299d25317ec..884e6f2815d61f0cac03a029ab49b9fa5e93256f 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_operators.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_operators.h
@@ -6,6 +6,10 @@
// \brief Various operators for templated vnl classes
// \author Ian Scott
+#include <vnl/vnl_vector.h>
+#include <vnl/vnl_vector_fixed.h>
+#include <vnl/vnl_matrix.h>
+#include <vnl/vnl_matrix_fixed.h>
//: Define a complete ordering on vnl_vector
// This is useful to create a set, or map of vectors.
@@ -13,13 +17,7 @@
// The ordering itself is implementation defined - so don't rely
// on the meaning of less here.
//
-// \relates vnl_vector
-
-#include <vnl/vnl_vector.h>
-#include <vnl/vnl_vector_fixed.h>
-#include <vnl/vnl_matrix.h>
-#include <vnl/vnl_matrix_fixed.h>
-
+// \relatesalso vnl_vector
template<class T>
bool operator<(vnl_vector<T> const& lhs, vnl_vector<T> const& rhs)
@@ -37,14 +35,14 @@ bool operator<(vnl_vector<T> const& lhs, vnl_vector<T> const& rhs)
return false; // Else all same.
}
-
//: Define a complete ordering on vnl_matrix
// This is useful to create a set, or map of matrices.
//
// The ordering itself is implementation defined - so don't rely
// on the meaning of less here.
//
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
+
template<class T>
bool operator<(vnl_matrix<T> const& lhs, vnl_matrix<T> const& rhs)
{
@@ -55,7 +53,6 @@ bool operator<(vnl_matrix<T> const& lhs, vnl_matrix<T> const& rhs)
else if (lhs.cols() < rhs.cols()) return true;
else if (lhs.cols() > rhs.cols()) return false;
-
for (unsigned i = 0; i < lhs.size(); i++) // For each index
{
if (lhs.data_block()[i] < rhs.data_block()[i]) return true; // Element different ?
@@ -64,22 +61,22 @@ bool operator<(vnl_matrix<T> const& lhs, vnl_matrix<T> const& rhs)
return false; // Else all same.
}
-
//: Define a complete ordering on vnl_vector_fixed
// This is useful to create a set, or map of vectors.
//
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
+
template<class T, unsigned int n>
bool operator<(vnl_vector_fixed<T,n> const& lhs, vnl_vector_fixed<T,n> const& rhs)
{
return lhs.as_ref() < rhs.as_ref();
}
-
//: Define a complete ordering on vnl_matrix_fixed
// This is useful to create a set, or map of matrices.
//
-// \relates vnl_matrix_fixed
+// \relatesalso vnl_matrix_fixed
+
template<class T, unsigned int n, unsigned int m>
bool operator<(vnl_matrix_fixed<T,n,m> const& lhs, vnl_matrix_fixed<T,n,m> const& rhs)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_power.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_power.h
new file mode 100644
index 0000000000000000000000000000000000000000..861c04b6b8620b689c722b9ea1fc728306623f2a
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_power.h
@@ -0,0 +1,81 @@
+// This is core/vnl/vnl_power.h
+#ifndef vnl_power_h_
+#define vnl_power_h_
+//:
+// \file
+// \brief Calculates nth power of a small vnl_matrix_fixed (not using svd)
+// \author Peter Vanroose
+// \date 21 July 2009
+//
+// \verbatim
+// Modifications
+// <none yet>
+// \endverbatim
+
+#include <vnl/vnl_matrix_fixed.h>
+#include <vnl/vnl_matrix.h>
+#include <vnl/vnl_inverse.h> // used for negative powers
+#include <vcl_cassert.h>
+
+//: Calculates nth power of a vnl_matrix_fixed (not using svd)
+// This allows you to write e.g.
+//
+// x = vnl_power(A,7) * vnl_power(B,-4) * b;
+//
+// Note that this function is inlined (except for the call to vnl_inverse()),
+// which makes it much faster than a full-fledged square matrix power
+// implementation using svd, which belongs in vnl/algo.
+//
+// \relatesalso vnl_matrix_fixed
+
+template <class T, unsigned int d>
+vnl_matrix_fixed<T,d,d> vnl_power(vnl_matrix_fixed<T,d,d> const& m, int n)
+{
+ assert(n >= 0 || d <= 4); // to allow the use of vnl_inverse()
+ if (n == 0)
+ return vnl_matrix_fixed<T,d,d>().set_identity();
+ else if (n == 1 || m.is_identity())
+ return m;
+ else if (n < 0)
+ return vnl_inverse(vnl_power(m, -n));
+ else {
+ vnl_matrix_fixed<T,d,d> r = vnl_power(m, n/2);
+ return n%2==0 ? r * r : r * r * m;
+ }
+}
+
+//: Calculates nth power of a square vnl_matrix (not using svd)
+// This allows you to write e.g.
+//
+// x = vnl_power(A,7) * vnl_power(B,-4) * b;
+//
+// Note that this function is inlined (except for the call to vnl_inverse()),
+// which makes it much faster than a full-fledged square matrix power
+// implementation using svd, which belongs in vnl/algo.
+//
+// \relatesalso vnl_matrix
+
+template <class T>
+vnl_matrix<T> vnl_power(vnl_matrix<T> const& m, int n)
+{
+ assert(m.rows() == m.columns());
+ assert(n >= 0 || m.rows() <= 4);
+ if (n == 0)
+ return vnl_matrix<T>(m.rows(),m.columns()).set_identity();
+ else if (n == 1 || m.is_identity())
+ return m;
+ else if (n < 0 && m.rows() == 1)
+ return vnl_power(vnl_matrix_fixed<T,1,1>(m),n).as_ref();
+ else if (n < 0 && m.rows() == 2)
+ return vnl_power(vnl_matrix_fixed<T,2,2>(m),n).as_ref();
+ else if (n < 0 && m.rows() == 3)
+ return vnl_power(vnl_matrix_fixed<T,3,3>(m),n).as_ref();
+ else if (n < 0 && m.rows() == 4)
+ return vnl_power(vnl_matrix_fixed<T,4,4>(m),n).as_ref();
+ else {
+ vnl_matrix<T> r = vnl_power(m, n/2);
+ return n%2==0 ? r * r : r * r * m;
+ }
+}
+
+#endif // vnl_power_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_quaternion.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_quaternion.h
index 90782dd331c719c03cf468d0097b134d3469b71a..2086bf2e4c11e43b78af69255b4161b79ecce3ff 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_quaternion.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_quaternion.h
@@ -34,12 +34,14 @@
// (x, y, z) = sin(theta/2) (kx, ky, kz)
// \endcode
// where theta and k are respectively the angle and axis of rotation.
-// 3D vectors can be thought of as imaginary quaternions, and so a
+//
+// 3D vectors can be thought of as pure imaginary quaternions, and so a
// quaternion is represented as a vnl_vector_fixed<T,4> with the imaginary
// part before the real part for 1-1 alignment.
//
-// Unit quaternions provide a more efficient representation for
-// rotation, than the usual orthonormal matrix that has nine
+// Unit quaternions (i.e., for which $x^2 + y^2 + z^2 + r^2 = 1$)
+// provide a more efficient representation for rotation
+// than the usual orthonormal matrix that has nine
// parameters and six orthonormal constraints. The unit
// quaternion has only one unit magnitude constraint. Composing
// rotations with quaternions results in fewer multiplications
@@ -78,9 +80,9 @@ class vnl_quaternion : public vnl_vector_fixed<T, 4>
// However, if you specify an angle in [-2pi, 0], then methods angle() and axis() will return values with opposite signs.
// \sa vnl_quaternion::angle()
// \sa vnl_quaternion::axis()
- vnl_quaternion(vnl_vector_fixed<T,3> const& axis, T angle);
+ vnl_quaternion(vnl_vector_fixed<T,3> const& axis, double angle);
- //: Construct quaternion from from 3x3 row-major matrix
+ //: Construct quaternion from 3x3 row-major matrix
explicit vnl_quaternion(vnl_matrix_fixed<T,3,3> const& transform);
//: Construct quaternion from a 3D vector
@@ -136,9 +138,10 @@ class vnl_quaternion : public vnl_vector_fixed<T, 4>
//: Angle of rotation.
// \note Returned angle lies in [0, 2*pi]
- T angle() const;
+ double angle() const;
//: 3x3 rotation matrix
+ // The orthonormal vectors are the rows of the matrix, not its columns
vnl_matrix_fixed<T,3,3> rotation_matrix_transpose() const;
//: 4x4 rotation matrix
@@ -157,7 +160,7 @@ class vnl_quaternion : public vnl_vector_fixed<T, 4>
vnl_vector_fixed<T,3> rotate(vnl_vector_fixed<T,3> const&) const;
//: Rotation representation in Euler angles.
- // The angles raturned will be [theta_X,theta_Y,theta_Z]
+ // The angles returned will be [theta_X,theta_Y,theta_Z]
// where the final rotation is found be first applying theta_X radians
// about the X axis, then theta_Y about the Y-axis, etc.
// The axes stay in a fixed reference frame.
@@ -166,7 +169,7 @@ class vnl_quaternion : public vnl_vector_fixed<T, 4>
};
//: operator<<
-// \relates vnl_quaternion
+// \relatesalso vnl_quaternion
template <class T>
inline vcl_ostream& operator<< (vcl_ostream& os, vnl_quaternion<T> const& q)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_quaternion.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_quaternion.txx
index 707d5803597a64e7113d3ced4183c314d898755c..d46a8e7d42dd8b3425f67951b7d79230f235319a 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_quaternion.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_quaternion.txx
@@ -49,24 +49,24 @@
// rotation axis.
template <class T>
-vnl_quaternion<T>::vnl_quaternion (T x, T y, T z, T r)
+vnl_quaternion<T>::vnl_quaternion (T tx, T ty, T tz, T rea)
{
- this->operator[](0) = x; // 3 first elements are
- this->operator[](1) = y; // imaginary parts
- this->operator[](2) = z;
- this->operator[](3) = r; // last element is real part
+ this->operator[](0) = tx; // 3 first elements are
+ this->operator[](1) = ty; // imaginary parts
+ this->operator[](2) = tz;
+ this->operator[](3) = rea; // last element is real part
}
//: Creates a quaternion from the normalized axis direction and the angle of rotation in radians.
template <class T>
-vnl_quaternion<T>::vnl_quaternion(vnl_vector_fixed<T,3> const& axis, T angle)
+vnl_quaternion<T>::vnl_quaternion(vnl_vector_fixed<T,3> const& Axis, double Angle)
{
- double a = angle * 0.5; // half angle
+ double a = Angle * 0.5; // half angle
T s = T(vcl_sin(a));
- for (int i = 0; i < 3; i++) // imaginary vector is sine of
- this->operator[](i) = s * axis(i); // half angle multiplied with axis
- this->operator[](3) = T(vcl_cos(a)); // real part is cosine of half angle
+ for (int i = 0; i < 3; i++) // imaginary vector is sine of
+ this->operator[](i) = T(s * Axis(i));// half angle multiplied with axis
+ this->operator[](3) = T(vcl_cos(a)); // real part is cosine of half angle
}
//: Creates a quaternion from a vector.
@@ -78,7 +78,7 @@ vnl_quaternion<T>::vnl_quaternion(vnl_vector_fixed<T,3> const& vec)
{
for (unsigned int i = 0; i < 3; ++i)
this->operator[](i) = vec(i);
- this->operator[](3) = 0.0;
+ this->operator[](3) = T(0);
}
//: Creates a quaternion from a vector.
@@ -94,64 +94,73 @@ vnl_quaternion<T>::vnl_quaternion(vnl_vector_fixed<T,4> const& vec)
//: Creates a quaternion from a rotation matrix.
-// Its orthonormal basis vectors are row-wise.
-// WARNING: Takes the transpose of the rotation matrix...
+// Its orthonormal basis vectors are the matrix rows.
+// NOTE: this matrix *must* have determinant +1; this is not verified!
+// WARNING: Takes the transpose of the rotation matrix, i.e.,
+// the orthonormal vectors must be the rows of the matrix, not the columns.
template <class T>
vnl_quaternion<T>::vnl_quaternion(vnl_matrix_fixed<T,3,3> const& rot)
{
double d0 = rot(0,0), d1 = rot(1,1), d2 = rot(2,2);
- double xx = 1.0 + d0 - d1 - d2; // from the diagonal of rotation
- double yy = 1.0 - d0 + d1 - d2; // matrix, find the terms in
- double zz = 1.0 - d0 - d1 + d2; // each Quaternion component
- double rr = 1.0 + d0 + d1 + d2;
+ double xx = 1.0 + d0 - d1 - d2; // from the diagonal of the rotation
+ double yy = 1.0 - d0 + d1 - d2; // matrix, find the terms in
+ double zz = 1.0 - d0 - d1 + d2; // each Quaternion component
+ double rr = 1.0 + d0 + d1 + d2; // (using the fact that rr+xx+yy+zz=4)
- double max = rr; // find the maximum of all
- if (xx > max) max = xx; // diagonal terms.
- if (yy > max) max = yy;
- if (zz > max) max = zz;
+ double max = rr; // find the maximum of all terms;
+ if (xx > max) max = xx; // dividing by the maximum makes
+ if (yy > max) max = yy; // the computations more stable
+ if (zz > max) max = zz; // and avoid division by zero
if (rr == max) {
- T r4 = T(vcl_sqrt(rr * 4.0));
- this->x() = (rot(1,2) - rot(2,1)) / r4; // find other components from
- this->y() = (rot(2,0) - rot(0,2)) / r4; // off diagonal terms of
- this->z() = (rot(0,1) - rot(1,0)) / r4; // rotation matrix.
+ T r4 = T(vcl_sqrt(rr)*2);
this->r() = r4 / 4;
- } else if (xx == max) {
- T x4 = T(vcl_sqrt(xx * 4.0));
+ r4 = T(1) / r4;
+ this->x() = (rot(1,2) - rot(2,1)) * r4; // find other components from
+ this->y() = (rot(2,0) - rot(0,2)) * r4; // off diagonal terms of
+ this->z() = (rot(0,1) - rot(1,0)) * r4; // rotation matrix.
+ }
+ else if (xx == max) {
+ T x4 = T(vcl_sqrt(xx)*2);
this->x() = x4 / 4;
- this->y() = (rot(0,1) + rot(1,0)) / x4;
- this->z() = (rot(0,2) + rot(2,0)) / x4;
- this->r() = (rot(1,2) - rot(2,1)) / x4;
- } else if (yy == max) {
- T y4 = T(vcl_sqrt(yy * 4.0));
- this->x() = (rot(0,1) + rot(1,0)) / y4;
+ x4 = T(1) / x4;
+ this->y() = (rot(0,1) + rot(1,0)) * x4;
+ this->z() = (rot(0,2) + rot(2,0)) * x4;
+ this->r() = (rot(1,2) - rot(2,1)) * x4;
+ }
+ else if (yy == max) {
+ T y4 = T(vcl_sqrt(yy)*2);
this->y() = y4 / 4;
- this->z() = (rot(1,2) + rot(2,1)) / y4;
- this->r() = (rot(2,0) - rot(0,2)) / y4;
- } else {
- T z4 = T(vcl_sqrt(zz * 4.0));
- this->x() = (rot(0,2) + rot(2,0)) / z4;
- this->y() = (rot(1,2) + rot(2,1)) / z4;
+ y4 = T(1) / y4;
+ this->x() = (rot(0,1) + rot(1,0)) * y4;
+ this->z() = (rot(1,2) + rot(2,1)) * y4;
+ this->r() = (rot(2,0) - rot(0,2)) * y4;
+ }
+ else {
+ T z4 = T(vcl_sqrt(zz)*2);
this->z() = z4 / 4;
- this->r() = (rot(0,1) - rot(1,0)) / z4;
+ z4 = T(1) / z4;
+ this->x() = (rot(0,2) + rot(2,0)) * z4;
+ this->y() = (rot(1,2) + rot(2,1)) * z4;
+ this->r() = (rot(0,1) - rot(1,0)) * z4;
}
}
-//: Construct quaternion from Euler Angles,
+//: Construct quaternion from Euler Angles
// That is a rotation about the X axis, followed by Y, followed by
// the Z axis, using a fixed reference frame.
template <class T>
vnl_quaternion<T>::vnl_quaternion(T theta_X, T theta_Y, T theta_Z)
{
- vnl_quaternion<T> Rx(vcl_sin(theta_X/2), 0, 0, vcl_cos(theta_X/2));
- vnl_quaternion<T> Ry(0, vcl_sin(theta_Y/2), 0, vcl_cos(theta_Y/2));
- vnl_quaternion<T> Rz(0, 0, vcl_sin(theta_Z/2), vcl_cos(theta_Z/2));
+ vnl_quaternion<T> Rx(static_cast<T>(vcl_sin(double(theta_X)*0.5)), 0, 0, static_cast<T>(vcl_cos(double(theta_X)*0.5)));
+ vnl_quaternion<T> Ry(0, static_cast<T>(vcl_sin(double(theta_Y)*0.5)), 0, static_cast<T>(vcl_cos(double(theta_Y)*0.5)));
+ vnl_quaternion<T> Rz(0, 0, static_cast<T>(vcl_sin(double(theta_Z)*0.5)), static_cast<T>(vcl_cos(double(theta_Z)*0.5)));
*this = Rz * Ry * Rx;
}
//: Rotation representation in Euler angles.
-// The angles raturned will be [theta_X,theta_Y,theta_Z]
+// The angles returned will be [theta_X,theta_Y,theta_Z]
// where the final rotation is found be first applying theta_X radians
// about the X axis, then theta_Y about the Y-axis, etc.
// The axes stay in a fixed reference frame.
@@ -161,18 +170,18 @@ vnl_vector_fixed<T,3> vnl_quaternion<T>::rotation_euler_angles() const
vnl_vector_fixed<T,3> angles;
vnl_matrix_fixed<T,4,4> rotM = rotation_matrix_transpose_4();
- T xy = vcl_sqrt(vnl_math_sqr(rotM(0,0)) + vnl_math_sqr(rotM(0,1)));
- if (xy > vcl_numeric_limits<T>::epsilon() * T(8.0))
+ T xy = T(vcl_sqrt(double(vnl_math_sqr(rotM(0,0)) + vnl_math_sqr(rotM(0,1)))));
+ if (xy > vcl_numeric_limits<T>::epsilon() * T(8))
{
- angles(0) = vcl_atan2(rotM(1,2), rotM(2,2));
- angles(1) = vcl_atan2(-rotM(0,2), xy);
- angles(2) = vcl_atan2(rotM(0,1), rotM(0,0));
+ angles(0) = T(vcl_atan2(double(rotM(1,2)), double(rotM(2,2))));
+ angles(1) = T(vcl_atan2(double(-rotM(0,2)), double(xy)));
+ angles(2) = T(vcl_atan2(double(rotM(0,1)), double(rotM(0,0))));
}
else
{
- angles(0) = vcl_atan2(-rotM(2,1), rotM(1,1));
- angles(1) = vcl_atan2(-rotM(0,2), xy);
- angles(2) = 0;
+ angles(0) = T(vcl_atan2(double(-rotM(2,1)), double(rotM(1,1))));
+ angles(1) = T(vcl_atan2(double(-rotM(0,2)), double(xy)));
+ angles(2) = T(0);
}
return angles;
}
@@ -181,10 +190,10 @@ vnl_vector_fixed<T,3> vnl_quaternion<T>::rotation_euler_angles() const
//: Queries the rotation angle of the quaternion.
// Returned angle lies in [0, 2*pi]
template <class T>
-T vnl_quaternion<T>::angle() const
+double vnl_quaternion<T>::angle() const
{
- return T(2 * vcl_atan2 (this->imaginary().magnitude(),
- this->real())); // angle is always positive
+ return 2 * vcl_atan2(double(this->imaginary().magnitude()),
+ double(this->real())); // angle is always positive
}
//: Queries the direction of the rotation axis of the quaternion.
@@ -194,9 +203,9 @@ vnl_vector_fixed<T,3> vnl_quaternion<T>::axis() const
{
vnl_vector_fixed<T,3> direc = this->imaginary(); // direc parallel to imag. part
T mag = direc.magnitude();
- if (mag == 0) {
+ if (mag == T(0)) {
vcl_cout << "Axis not well defined for zero Quaternion. Using (0,0,1) instead.\n";
- direc[2] = 1.0; // or signal exception here.
+ direc[2] = T(1); // or signal exception here.
}
else
direc /= mag; // normalize direction vector
@@ -234,9 +243,7 @@ template <class T>
vnl_matrix_fixed<T,4,4> vnl_quaternion<T>::rotation_matrix_transpose_4() const
{
vnl_matrix_fixed<T,4,4> rot;
- rot.set_identity();
- rot.update(this->rotation_matrix_transpose().as_ref());
- return rot;
+ return rot.set_identity().update(this->rotation_matrix_transpose().as_ref());
}
//: Returns the conjugate of given quaternion, having same real and opposite imaginary parts.
@@ -288,9 +295,10 @@ vnl_quaternion<T> vnl_quaternion<T>::operator* (vnl_quaternion<T> const& rhs) co
template <class T>
vnl_vector_fixed<T,3> vnl_quaternion<T>::rotate(vnl_vector_fixed<T,3> const& v) const
{
- T r = this->real();
+ T rea = this->real();
vnl_vector_fixed<T,3> i = this->imaginary();
- return v + vnl_cross_3d(i, v) * T(2*r) - vnl_cross_3d(vnl_cross_3d(i, v), i) * T(2);
+ vnl_vector_fixed<T,3> i_x_v(vnl_cross_3d(i, v));
+ return v + i_x_v * T(2*rea) - vnl_cross_3d(i_x_v, i) * T(2);
}
#undef VNL_QUATERNION_INSTANTIATE
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_random.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_random.cxx
index d0699551e361997a92aadcba1aba68c035986b18..97d4fc107f6e399f26e31f6c45b09fb95fb5a252 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_random.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_random.cxx
@@ -17,7 +17,7 @@ unsigned long vnl_random::linear_congruential_lrand32()
//: Construct with seed
vnl_random::vnl_random(unsigned long seed)
- : mz_array_position(0L), mz_borrow(0), mz_previous_normal_flag(0)
+ : linear_congruential_previous(seed), mz_array_position(0L), mz_borrow(0), mz_previous_normal_flag(0)
{reseed(seed);}
//: Construct with seed
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rank.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rank.h
index 7b99a79576f82a927117fb1d91adc6942fdf1d32..8fddbc10d30503049a8e058dd5b37496aa114da1 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rank.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rank.h
@@ -22,7 +22,7 @@ typedef enum { vnl_rank_pivot_one, vnl_rank_pivot_all } vnl_rank_pivot_type;
// By default, the row rank of the matrix is determined.
// Specify vnl_rank_column to obtain the column rank.
//
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
template <class T>
unsigned int vnl_rank(vnl_matrix<T> const& mat, vnl_rank_type = vnl_rank_both);
@@ -39,7 +39,7 @@ unsigned int vnl_rank(vnl_matrix<T> const& mat, vnl_rank_type = vnl_rank_both);
// Note that for integer matrices, the resulting matrix is still integer,
// and is guaranteed to be row equivalent with the original matrix.
//
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
//
template <class T>
vnl_matrix<T> vnl_rank_row_reduce(vnl_matrix<T> const& mat,
@@ -47,7 +47,7 @@ vnl_matrix<T> vnl_rank_row_reduce(vnl_matrix<T> const& mat,
//: Column reduce a matrix.
//
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
//
template <class T>
vnl_matrix<T> vnl_rank_column_reduce(vnl_matrix<T> const& mat,
@@ -60,7 +60,7 @@ vnl_matrix<T> vnl_rank_column_reduce(vnl_matrix<T> const& mat,
// changed, and the number of nonzero elements will be minimal (viz at most
// one per row and one per column).
//
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
//
template <class T>
vnl_matrix<T> vnl_rank_row_column_reduce(vnl_matrix<T> const& mat,
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rational.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rational.cxx
index 227bf7cefc3ee7c3fc48e4ba89741b6e6267483c..a43759f0ab7183d0653078ac0e21c7dcdc00fe15 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rational.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rational.cxx
@@ -3,6 +3,9 @@
//:
// \file
+#include <vnl/vnl_numeric_traits.h> // for vnl_numeric_traits<long>::maxval
+#include <vcl_cassert.h>
+
//: Creates a rational from a double.
// This is done by computing the continued fraction approximation for d.
vnl_rational::vnl_rational(double d)
@@ -25,3 +28,75 @@ vnl_rational::vnl_rational(double d)
if (sign) num_ = -num_;
// no need to normalize() since prev_num and prev_den have guaranteed a gcd=1
}
+
+//: Multiply/assign: replace lhs by lhs * rhs
+// Note that 0 * Inf and Inf * 0 are undefined.
+// Also note that there could be integer overflow during this calculation!
+// In that case, an approximate result will be returned.
+vnl_rational& vnl_rational::operator*=(vnl_rational const& r)
+{
+ assert(num_!=0 || den_ != 0); // 0 * Inf is undefined
+ long a = vnl_rational::gcd(r.numerator(),den_),
+ b = vnl_rational::gcd(r.denominator(),num_);
+ num_ /= b; den_ /= a;
+ a = r.numerator()/a; b = r.denominator()/b;
+ // find out whether overflow would occur; in that case, return approximate result
+ double n = double(a) * double(num_),
+ d = double(b) * double(den_);
+ if (n < vnl_numeric_traits<long>::maxval && d < vnl_numeric_traits<long>::maxval)
+ { num_ *= a; den_ *= b; normalize(); return *this; }
+ else
+ return *this = vnl_rational(n/d);
+}
+
+//: Multiply/assign: replace lhs by lhs * rhs
+// Note that there could be integer overflow during this calculation!
+// In that case, an approximate result will be returned.
+vnl_rational& vnl_rational::operator*=(long r)
+{
+ long a = vnl_rational::gcd(r,den_);
+ den_ /= a; r /= a;
+ // find out whether overflow would occur; in that case, return approximate result
+ double n = double(r) * double(num_);
+ if (n < vnl_numeric_traits<long>::maxval)
+ { num_ *= r; normalize(); return *this; }
+ else
+ return *this = vnl_rational(n/double(den_));
+}
+
+//: Divide/assign: replace lhs by lhs / rhs
+// Note that 0 / 0 and Inf / Inf are undefined.
+// Also note that there could be integer overflow during this calculation!
+// In that case, an approximate result will be returned.
+vnl_rational& vnl_rational::operator/=(vnl_rational const& r)
+{
+ assert(num_!=0 || den_ != 0); // 0/0, Inf/Inf undefined
+ long a = vnl_rational::gcd(r.numerator(),num_),
+ b = vnl_rational::gcd(r.denominator(),den_);
+ num_ /= a; den_ /= b;
+ a = r.numerator()/a; b = r.denominator()/b;
+ // find out whether overflow would occur; in that case, return approximate result
+ double n = double(b) * double(num_),
+ d = double(a) * double(den_);
+ if (n < vnl_numeric_traits<long>::maxval && d < vnl_numeric_traits<long>::maxval)
+ { num_ *= b; den_ *= a; normalize(); return *this; }
+ else
+ return *this = vnl_rational(n/d);
+}
+
+//: Divide/assign: replace lhs by lhs / rhs
+// Note that 0 / 0 is undefined.
+// Also note that there could be integer overflow during this calculation!
+// In that case, an approximate result will be returned.
+vnl_rational& vnl_rational::operator/=(long r)
+{
+ assert(num_!=0 || r != 0); // 0/0 undefined
+ long a = vnl_rational::gcd(r,num_);
+ num_ /= a; r /= a;
+ // find out whether overflow would occur; in that case, return approximate result
+ double d = double(r) * double(den_);
+ if (d < vnl_numeric_traits<long>::maxval)
+ { den_ *= r; normalize(); return *this; }
+ else
+ return *this = vnl_rational(double(num_)/d);
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rational.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rational.h
index 0f9f8ded6db94db63ac7c304d403c0851c5b3496..d90d7d4bf3e773a20cb69bc7ecb731d5bbf9f857 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rational.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rational.h
@@ -41,6 +41,8 @@
// Peter Vanroose, 10 July 2001: added abs().
// Peter Vanroose, 10 July 2001: removed state data member and added Inf repres
// Peter Vanroose, 9 July 2001: ported to vnl from COOL
+// Peter Vanroose, 11 June 2009: made "*" and "/" robust against int overflow
+// (actually a full re-implementation, using gcd)
// \endverbatim
#include <vcl_iostream.h>
@@ -75,23 +77,23 @@ class vnl_rational
// Also serves as automatic cast from long to vnl_rational.
// The only input which is not allowed is (0,0);
// the denominator is allowed to be 0, to represent +Inf or -Inf.
- inline vnl_rational (long num = 0L, long den = 1L)
+ inline vnl_rational(long num = 0L, long den = 1L)
: num_(num), den_(den) { assert(num!=0||den!=0); normalize(); }
//: Creates a rational with given numerator and denominator.
// Note these are not automatic type conversions because of a bug
// in the Borland compiler. Since these just convert their
// arguments to long anyway, there is no harm in letting
// the long overload be used for automatic conversions.
- explicit inline vnl_rational (int num, int den = 1)
+ explicit inline vnl_rational(int num, int den = 1)
: num_(num), den_(den) { assert(num!=0||den!=0); normalize(); }
- explicit inline vnl_rational (unsigned int num, unsigned int den = 1)
+ explicit inline vnl_rational(unsigned int num, unsigned int den = 1)
: num_((long)num), den_((long)den) { assert(num!=0||den!=0); normalize(); }
//: Creates a rational from a double.
// This is done by computing the continued fraction approximation for d.
// Note that this is explicitly *not* an automatic type conversion.
- explicit vnl_rational (double d);
+ explicit vnl_rational(double d);
// Copy constructor
- inline vnl_rational (vnl_rational const& from)
+ inline vnl_rational(vnl_rational const& from)
: num_(from.numerator()), den_(from.denominator()) {}
// Destructor
inline ~vnl_rational() {}
@@ -99,22 +101,22 @@ class vnl_rational
inline void set(long num, long den) { assert(num!=0||den!=0); num_=num; den_=den; normalize(); }
//: Return the numerator of the (simplified) rational number representation
- inline long numerator () const { return num_; }
+ inline long numerator() const { return num_; }
//: Return the denominator of the (simplified) rational number representation
- inline long denominator () const { return den_; }
+ inline long denominator() const { return den_; }
//: Copies the contents and state of rhs rational over to the lhs
- inline vnl_rational& operator= (vnl_rational const& rhs) {
+ inline vnl_rational& operator=(vnl_rational const& rhs) {
num_ = rhs.numerator(); den_ = rhs.denominator(); return *this; }
//: Returns true if the two rationals have the same representation
- inline bool operator== (vnl_rational const& rhs) const {
+ inline bool operator==(vnl_rational const& rhs) const {
return num_ == rhs.numerator() && den_ == rhs.denominator(); }
- inline bool operator!= (vnl_rational const& rhs) const { return !operator==(rhs); }
- inline bool operator== (long rhs) const { return num_ == rhs && den_ == 1; }
- inline bool operator!= (long rhs) const { return !operator==(rhs); }
- inline bool operator== (int rhs) const { return num_ == rhs && den_ == 1; }
- inline bool operator!= (int rhs) const { return !operator==(rhs); }
+ inline bool operator!=(vnl_rational const& rhs) const { return !operator==(rhs); }
+ inline bool operator==(long rhs) const { return num_ == rhs && den_ == 1; }
+ inline bool operator!=(long rhs) const { return !operator==(rhs); }
+ inline bool operator==(int rhs) const { return num_ == rhs && den_ == 1; }
+ inline bool operator!=(int rhs) const { return !operator==(rhs); }
//: Unary minus - returns the negation of the current rational.
inline vnl_rational operator-() const { return vnl_rational(-num_, den_); }
@@ -126,126 +128,126 @@ class vnl_rational
inline vnl_rational abs() const { return vnl_rational(num_<0?-num_:num_, den_); }
//: Replaces rational with 1/rational and returns it.
// Inverting 0 gives +Inf, inverting +-Inf gives 0.
- vnl_rational& invert () {
+ vnl_rational& invert() {
long t = num_; num_ = den_; den_ = t; normalize(); return *this; }
//: Plus/assign: replace lhs by lhs + rhs
// Note that +Inf + -Inf and -Inf + +Inf are undefined.
- inline vnl_rational& operator+= (vnl_rational const& r) {
+ inline vnl_rational& operator+=(vnl_rational const& r) {
if (den_ == r.denominator()) num_ += r.numerator();
else { long c = vnl_rational::gcd(den_,r.denominator()); if (c==0) c=1;
num_ = num_*(r.denominator()/c) + (den_/c)*r.numerator();
den_ *= r.denominator()/c; }
assert(num_!=0 || den_ != 0); // +Inf + -Inf is undefined
- normalize (); return *this;
+ normalize(); return *this;
}
- inline vnl_rational& operator+= (long r) { num_ += den_*r; return *this; }
+ inline vnl_rational& operator+=(long r) { num_ += den_*r; return *this; }
//: Minus/assign: replace lhs by lhs - rhs
// Note that +Inf - +Inf and -Inf - -Inf are undefined.
- inline vnl_rational& operator-= (vnl_rational const& r) {
+ inline vnl_rational& operator-=(vnl_rational const& r) {
if (den_ == r.denominator()) num_ -= r.num_;
else { long c = vnl_rational::gcd(den_,r.denominator()); if (c==0) c=1;
num_ = num_*(r.denominator()/c) - (den_/c)*r.numerator();
den_ *= r.denominator()/c; }
assert(num_!=0 || den_ != 0); // +Inf - +Inf is undefined
- normalize (); return *this;
+ normalize(); return *this;
}
- inline vnl_rational& operator-= (long r) { num_ -= den_*r; return *this; }
+ inline vnl_rational& operator-=(long r) { num_ -= den_*r; return *this; }
//: Multiply/assign: replace lhs by lhs * rhs
// Note that 0 * Inf and Inf * 0 are undefined.
- inline vnl_rational& operator*= (vnl_rational const& r) {
- num_ *= r.numerator(); den_ *= r.denominator();
- assert(num_!=0 || den_ != 0); // 0 * Inf is undefined
- normalize (); return *this;
- }
- inline vnl_rational& operator*= (long r) {num_*=r;normalize();return *this;}
+ // Also note that there could be integer overflow during this calculation!
+ // In that case, an approximate result will be returned.
+ vnl_rational& operator*=(vnl_rational const& r);
+ //: Multiply/assign: replace lhs by lhs * rhs
+ // Note that there could be integer overflow during this calculation!
+ // In that case, an approximate result will be returned.
+ vnl_rational& operator*=(long r);
//: Divide/assign: replace lhs by lhs / rhs
// Note that 0 / 0 and Inf / Inf are undefined.
- inline vnl_rational& operator/= (vnl_rational const& r) {
- num_ *= r.denominator(); den_ *= r.numerator();
- assert(num_!=0 || den_ != 0); // 0/0, Inf/Inf undefined
- normalize (); return *this;
- }
- inline vnl_rational& operator/= (long r) {
- den_ *= r; assert(num_!=0 || den_ != 0); // 0/0 undefined
- normalize (); return *this;
- }
+ // Also note that there could be integer overflow during this calculation!
+ // In that case, an approximate result will be returned.
+ vnl_rational& operator/=(vnl_rational const& r);
+ //: Divide/assign: replace lhs by lhs / rhs
+ // Note that 0 / 0 is undefined.
+ // Also note that there could be integer overflow during this calculation!
+ // In that case, an approximate result will be returned.
+ vnl_rational& operator/=(long r);
//: Modulus/assign: replace lhs by lhs % rhs
// Note that r % Inf is r, and that r % 0 and Inf % r are undefined.
- inline vnl_rational& operator%= (vnl_rational const& r) {
+ inline vnl_rational& operator%=(vnl_rational const& r) {
assert(r.numerator() != 0);
if (den_ == r.denominator()) num_ %= r.numerator();
else { long c = vnl_rational::gcd(den_,r.denominator()); if (c==0) c=1;
num_ *= r.denominator()/c;
num_ %= (den_/c)*r.numerator();
den_ *= r.denominator()/c; }
- normalize (); return *this;
+ normalize(); return *this;
}
inline vnl_rational& operator%=(long r){assert(r);num_%=den_*r;normalize();return *this;}
//: Pre-increment (++r). No-op when +-Inf.
- inline vnl_rational& operator++ () { num_ += den_; return *this; }
+ inline vnl_rational& operator++() { num_ += den_; return *this; }
//: Pre-decrement (--r). No-op when +-Inf.
- inline vnl_rational& operator-- () { num_ -= den_; return *this; }
+ inline vnl_rational& operator--() { num_ -= den_; return *this; }
//: Post-increment (r++). No-op when +-Inf.
inline vnl_rational operator++(int){vnl_rational b=*this;num_+=den_;return b;}
//: Post-decrement (r--). No-op when +-Inf.
inline vnl_rational operator--(int){vnl_rational b=*this;num_-=den_;return b;}
- inline bool operator< (vnl_rational const& rhs) const {
+ inline bool operator<(vnl_rational const& rhs) const {
if (den_ == rhs.denominator()) // If same denominator
return num_ < rhs.numerator(); // includes the case -Inf < +Inf
// note that denominator is always >= 0:
else
return num_ * rhs.denominator() < den_ * rhs.numerator();
}
- inline bool operator> (vnl_rational const& r) const { return r < *this; }
- inline bool operator<= (vnl_rational const& r) const { return !operator>(r); }
- inline bool operator>= (vnl_rational const& r) const { return !operator<(r); }
- inline bool operator< (long r) const { return num_ < den_ * r; }
- inline bool operator> (long r) const { return num_ > den_ * r; }
- inline bool operator<= (long r) const { return !operator>(r); }
- inline bool operator>= (long r) const { return !operator<(r); }
- inline bool operator< (int r) const { return num_ < den_ * r; }
- inline bool operator> (int r) const { return num_ > den_ * r; }
- inline bool operator<= (int r) const { return !operator>(r); }
- inline bool operator>= (int r) const { return !operator<(r); }
- inline bool operator< (double r) const { return num_ < den_ * r; }
- inline bool operator> (double r) const { return num_ > den_ * r; }
- inline bool operator<= (double r) const { return !operator>(r); }
- inline bool operator>= (double r) const { return !operator<(r); }
+ inline bool operator>(vnl_rational const& r) const { return r < *this; }
+ inline bool operator<=(vnl_rational const& r) const { return !operator>(r); }
+ inline bool operator>=(vnl_rational const& r) const { return !operator<(r); }
+ inline bool operator<(long r) const { return num_ < den_ * r; }
+ inline bool operator>(long r) const { return num_ > den_ * r; }
+ inline bool operator<=(long r) const { return !operator>(r); }
+ inline bool operator>=(long r) const { return !operator<(r); }
+ inline bool operator<(int r) const { return num_ < den_ * r; }
+ inline bool operator>(int r) const { return num_ > den_ * r; }
+ inline bool operator<=(int r) const { return !operator>(r); }
+ inline bool operator>=(int r) const { return !operator<(r); }
+ inline bool operator<(double r) const { return num_ < den_ * r; }
+ inline bool operator>(double r) const { return num_ > den_ * r; }
+ inline bool operator<=(double r) const { return !operator>(r); }
+ inline bool operator>=(double r) const { return !operator<(r); }
//: Converts rational value to integer by truncating towards zero.
- inline long truncate () const { assert(den_ != 0); return num_/den_; }
+ inline long truncate() const { assert(den_ != 0); return num_/den_; }
//: Converts rational value to integer by truncating towards negative infinity.
- inline long floor () const { long t = truncate();
+ inline long floor() const { long t = truncate();
return num_<0L && (num_%den_) != 0 ? t-1 : t; }
//: Converts rational value to integer by truncating towards positive infinity.
- inline long ceil () const { long t = truncate();
+ inline long ceil() const { long t = truncate();
return num_>0L && (num_%den_) != 0 ? t+1 : t; }
//: Rounds rational to nearest integer.
- inline long round () const { long t = truncate();
+ inline long round() const { long t = truncate();
if (num_ < 0) return ((-num_)%den_) >= 0.5*den_ ? t-1 : t;
else return (num_ %den_) >= 0.5*den_ ? t+1 : t;
}
// Implicit conversions
- inline operator short () {
- long t = truncate (); short r = (short)t;
+ inline operator short() {
+ long t = truncate(); short r = (short)t;
assert(r == t); // abort on underflow or overflow
return r;
}
- inline operator int () {
- long t = truncate (); int r = (int)t;
+ inline operator int() {
+ long t = truncate(); int r = (int)t;
assert(r == t); // abort on underflow or overflow
return r;
}
- inline operator long () const { return truncate(); }
- inline operator long () { return truncate(); }
- inline operator float () const { return ((float)num_)/((float)den_); }
- inline operator float () { return ((float)num_)/((float)den_); }
- inline operator double () const { return ((double)num_)/((double)den_); }
- inline operator double () { return ((double)num_)/((double)den_); }
+ inline operator long() const { return truncate(); }
+ inline operator long() { return truncate(); }
+ inline operator float() const { return ((float)num_)/((float)den_); }
+ inline operator float() { return ((float)num_)/((float)den_); }
+ inline operator double() const { return ((double)num_)/((double)den_); }
+ inline operator double() { return ((double)num_)/((double)den_); }
//: Calculate greatest common divisor of two integers.
// Used to simplify rational number.
@@ -258,11 +260,11 @@ class vnl_rational
//: Private function to normalize numerator/denominator of rational number.
// If num_ and den_ are both nonzero, their gcd is made 1 and den_ made positive.
// Otherwise, the nonzero den_ is set to 1 or the nonzero num_ to +1 or -1.
- inline void normalize () {
+ inline void normalize() {
if (num_ == 0) { den_ = 1; return; } // zero
if (den_ == 0) { num_ = (num_>0) ? 1 : -1; return; } // +-Inf
if (num_ != 1 && num_ != -1 && den_ != 1) {
- long common = vnl_rational::gcd (num_, den_);
+ long common = vnl_rational::gcd(num_, den_);
if (common != 1) { num_ /= common; den_ /= common; }
}
// if negative, put sign in numerator:
@@ -271,172 +273,172 @@ class vnl_rational
};
//: formatted output
-// \relates vnl_rational
-inline vcl_ostream& operator<< (vcl_ostream& s, vnl_rational const& r)
+// \relatesalso vnl_rational
+inline vcl_ostream& operator<<(vcl_ostream& s, vnl_rational const& r)
{
return s << r.numerator() << '/' << r.denominator();
}
//: simple input
-// \relates vnl_rational
-inline vcl_istream& operator>> (vcl_istream& s, vnl_rational& r)
+// \relatesalso vnl_rational
+inline vcl_istream& operator>>(vcl_istream& s, vnl_rational& r)
{
long n, d; s >> n >> d;
r.set(n,d); return s;
}
//: Returns the sum of two rational numbers.
-// \relates vnl_rational
-inline vnl_rational operator+ (vnl_rational const& r1, vnl_rational const& r2)
+// \relatesalso vnl_rational
+inline vnl_rational operator+(vnl_rational const& r1, vnl_rational const& r2)
{
vnl_rational result(r1); return result += r2;
}
-inline vnl_rational operator+ (vnl_rational const& r1, long r2)
+inline vnl_rational operator+(vnl_rational const& r1, long r2)
{
vnl_rational result(r1); return result += r2;
}
-inline vnl_rational operator+ (vnl_rational const& r1, int r2)
+inline vnl_rational operator+(vnl_rational const& r1, int r2)
{
vnl_rational result(r1); return result += (long)r2;
}
-inline vnl_rational operator+ (long r2, vnl_rational const& r1)
+inline vnl_rational operator+(long r2, vnl_rational const& r1)
{
vnl_rational result(r1); return result += r2;
}
-inline vnl_rational operator+ (int r2, vnl_rational const& r1)
+inline vnl_rational operator+(int r2, vnl_rational const& r1)
{
vnl_rational result(r1); return result += (long)r2;
}
//: Returns the difference of two rational numbers.
-// \relates vnl_rational
-inline vnl_rational operator- (vnl_rational const& r1, vnl_rational const& r2)
+// \relatesalso vnl_rational
+inline vnl_rational operator-(vnl_rational const& r1, vnl_rational const& r2)
{
vnl_rational result(r1); return result -= r2;
}
-inline vnl_rational operator- (vnl_rational const& r1, long r2)
+inline vnl_rational operator-(vnl_rational const& r1, long r2)
{
vnl_rational result(r1); return result -= r2;
}
-inline vnl_rational operator- (vnl_rational const& r1, int r2)
+inline vnl_rational operator-(vnl_rational const& r1, int r2)
{
vnl_rational result(r1); return result -= (long)r2;
}
-inline vnl_rational operator- (long r2, vnl_rational const& r1)
+inline vnl_rational operator-(long r2, vnl_rational const& r1)
{
vnl_rational result(-r1); return result += r2;
}
-inline vnl_rational operator- (int r2, vnl_rational const& r1)
+inline vnl_rational operator-(int r2, vnl_rational const& r1)
{
vnl_rational result(-r1); return result += (long)r2;
}
//: Returns the product of two rational numbers.
-// \relates vnl_rational
-inline vnl_rational operator* (vnl_rational const& r1, vnl_rational const& r2)
+// \relatesalso vnl_rational
+inline vnl_rational operator*(vnl_rational const& r1, vnl_rational const& r2)
{
vnl_rational result(r1); return result *= r2;
}
-inline vnl_rational operator* (vnl_rational const& r1, long r2)
+inline vnl_rational operator*(vnl_rational const& r1, long r2)
{
vnl_rational result(r1); return result *= r2;
}
-inline vnl_rational operator* (vnl_rational const& r1, int r2)
+inline vnl_rational operator*(vnl_rational const& r1, int r2)
{
vnl_rational result(r1); return result *= (long)r2;
}
-inline vnl_rational operator* (long r2, vnl_rational const& r1)
+inline vnl_rational operator*(long r2, vnl_rational const& r1)
{
vnl_rational result(r1); return result *= r2;
}
-inline vnl_rational operator* (int r2, vnl_rational const& r1)
+inline vnl_rational operator*(int r2, vnl_rational const& r1)
{
vnl_rational result(r1); return result *= (long)r2;
}
//: Returns the quotient of two rational numbers.
-// \relates vnl_rational
-inline vnl_rational operator/ (vnl_rational const& r1, vnl_rational const& r2)
+// \relatesalso vnl_rational
+inline vnl_rational operator/(vnl_rational const& r1, vnl_rational const& r2)
{
vnl_rational result(r1); return result /= r2;
}
-inline vnl_rational operator/ (vnl_rational const& r1, long r2)
+inline vnl_rational operator/(vnl_rational const& r1, long r2)
{
vnl_rational result(r1); return result /= r2;
}
-inline vnl_rational operator/ (vnl_rational const& r1, int r2)
+inline vnl_rational operator/(vnl_rational const& r1, int r2)
{
vnl_rational result(r1); return result /= (long)r2;
}
-inline vnl_rational operator/ (long r1, vnl_rational const& r2)
+inline vnl_rational operator/(long r1, vnl_rational const& r2)
{
vnl_rational result(r1); return result /= r2;
}
-inline vnl_rational operator/ (int r1, vnl_rational const& r2)
+inline vnl_rational operator/(int r1, vnl_rational const& r2)
{
vnl_rational result((long)r1); return result /= r2;
}
//: Returns the remainder of r1 divided by r2.
-// \relates vnl_rational
-inline vnl_rational operator% (vnl_rational const& r1, vnl_rational const& r2)
+// \relatesalso vnl_rational
+inline vnl_rational operator%(vnl_rational const& r1, vnl_rational const& r2)
{
vnl_rational result(r1); return result %= r2;
}
-inline vnl_rational operator% (vnl_rational const& r1, long r2)
+inline vnl_rational operator%(vnl_rational const& r1, long r2)
{
vnl_rational result(r1); return result %= r2;
}
-inline vnl_rational operator% (vnl_rational const& r1, int r2)
+inline vnl_rational operator%(vnl_rational const& r1, int r2)
{
vnl_rational result(r1); return result %= (long)r2;
}
-inline vnl_rational operator% (long r1, vnl_rational const& r2)
+inline vnl_rational operator%(long r1, vnl_rational const& r2)
{
vnl_rational result(r1); return result %= r2;
}
-inline vnl_rational operator% (int r1, vnl_rational const& r2)
+inline vnl_rational operator%(int r1, vnl_rational const& r2)
{
vnl_rational result((long)r1); return result %= r2;
}
-inline bool operator== (int r1, vnl_rational const& r2) { return r2==r1; }
-inline bool operator== (long r1, vnl_rational const& r2) { return r2==r1; }
-inline bool operator!= (int r1, vnl_rational const& r2) { return r2!=r1; }
-inline bool operator!= (long r1, vnl_rational const& r2) { return r2!=r1; }
-inline bool operator< (int r1, vnl_rational const& r2) { return r2> r1; }
-inline bool operator< (long r1, vnl_rational const& r2) { return r2> r1; }
-inline bool operator> (int r1, vnl_rational const& r2) { return r2< r1; }
-inline bool operator> (long r1, vnl_rational const& r2) { return r2< r1; }
-inline bool operator<= (int r1, vnl_rational const& r2) { return r2>=r1; }
-inline bool operator<= (long r1, vnl_rational const& r2) { return r2>=r1; }
-inline bool operator>= (int r1, vnl_rational const& r2) { return r2<=r1; }
-inline bool operator>= (long r1, vnl_rational const& r2) { return r2<=r1; }
-
-inline long truncate (vnl_rational const& r) { return r.truncate(); }
-inline long floor (vnl_rational const& r) { return r.floor(); }
-inline long ceil (vnl_rational const& r) { return r.ceil(); }
-inline long round (vnl_rational const& r) { return r.round(); }
+inline bool operator==(int r1, vnl_rational const& r2) { return r2==r1; }
+inline bool operator==(long r1, vnl_rational const& r2) { return r2==r1; }
+inline bool operator!=(int r1, vnl_rational const& r2) { return r2!=r1; }
+inline bool operator!=(long r1, vnl_rational const& r2) { return r2!=r1; }
+inline bool operator< (int r1, vnl_rational const& r2) { return r2> r1; }
+inline bool operator< (long r1, vnl_rational const& r2) { return r2> r1; }
+inline bool operator> (int r1, vnl_rational const& r2) { return r2< r1; }
+inline bool operator> (long r1, vnl_rational const& r2) { return r2< r1; }
+inline bool operator<=(int r1, vnl_rational const& r2) { return r2>=r1; }
+inline bool operator<=(long r1, vnl_rational const& r2) { return r2>=r1; }
+inline bool operator>=(int r1, vnl_rational const& r2) { return r2<=r1; }
+inline bool operator>=(long r1, vnl_rational const& r2) { return r2<=r1; }
+
+inline long truncate(vnl_rational const& r) { return r.truncate(); }
+inline long floor(vnl_rational const& r) { return r.floor(); }
+inline long ceil(vnl_rational const& r) { return r.ceil(); }
+inline long round(vnl_rational const& r) { return r.round(); }
inline vnl_rational vnl_math_abs(vnl_rational const& x) { return x<0L ? -x : x; }
inline vnl_rational vnl_math_squared_magnitude(vnl_rational const& x) { return x*x; }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real.h
index da865fe4886d2696ddebddbedb90ccd88fefb604..825609becfca0f85b29baaba9448c4752a64e22a 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real.h
@@ -18,11 +18,11 @@
template <class T> void vnl_real(vcl_complex<T> const* C, T* R, unsigned int n);
//: Vector of real parts of vnl_vector<vcl_complex<T> >.
-// \relates vnl_vector
+// \relatesalso vnl_vector
template <class T> vnl_vector<T> vnl_real(vnl_vector<vcl_complex<T> > const& C);
//: Matrix of real parts of vnl_matrix<vcl_complex<T> >.
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
template <class T> vnl_matrix<T> vnl_real(vnl_matrix<vcl_complex<T> > const& C);
#endif // vnl_real_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_npolynomial.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_npolynomial.cxx
index 71d74502acd5034b2f1a5e4f5814aeacecc3446c..f1beff7f5fdc7085ee95c211533066c57dcb85b5 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_npolynomial.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_npolynomial.cxx
@@ -15,7 +15,7 @@
#include <vcl_sstream.h>
//: Constructor
-//<PRE>
+// \verbatim
// coeffs = vnl_vector<double>(nterms)
// polyn = vnl_matrix<int>(nterms,nvar)
// Example: A*x^3 + B*x*y + C*y^2 + D*x*y^2
@@ -26,7 +26,7 @@
// [1 1]
// [0 2]
// [1 2];
-//</PRE>
+// \endverbatim
vnl_real_npolynomial::vnl_real_npolynomial(const vnl_vector<double>& c, const vnl_matrix<unsigned int>& p)
: coeffs_(c)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_npolynomial.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_npolynomial.h
index 3e19caaf8d13d4c5023f86f068f2b95053781bb8..9e99c2b2d578f8ba4eb4d29082ec44de74affafc 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_npolynomial.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_npolynomial.h
@@ -69,9 +69,9 @@ class vnl_real_npolynomial
public:
// Constructor-----------------------------------------------------------------
- vnl_real_npolynomial() : nvar_(0), nterms_(0), ideg_(0) {} // don't use this: only here for the STL vector class.
+ vnl_real_npolynomial() : coeffs_(), polyn_(), nvar_(0), nterms_(0), ideg_(0) {} // don't use this: only here for the STL vector class.
- //: Construct the poylnomial with coefficients vector c and with exponents matrix p
+ //: Construct the polynomial with coefficients vector c and with exponents matrix p
vnl_real_npolynomial(const vnl_vector<double>& c, const vnl_matrix<unsigned int>& p);
// Computations--------------------------------------------------------------
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_polynomial.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_polynomial.cxx
index 13f91e3463ab5400e8a86f24517e3821423f4fb9..e5ebea5520ecf9789d41859435130c35ec929016 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_polynomial.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_polynomial.cxx
@@ -202,14 +202,15 @@ void vnl_real_polynomial::print(vcl_ostream& os) const
int i = 0;
while (i <= d && coeffs_[i] == 0) ++i;
if (i > d) { os << "0 "; return; }
- bool b = (coeffs_[i+1] > 0); // to avoid '+' in front of equation
+ bool b = (coeffs_[i] > 0); // to avoid '+' in front of equation
for (; i <= d; ++i) {
if (coeffs_[i] == 0) continue;
if (coeffs_[i] > 0 && !b) os << '+';
b = false;
- if (coeffs_[i] == -1) os << '-';
- else if (coeffs_[i] != 1) os << coeffs_[i];
+ if (i==d) os << coeffs_[i]; // the 0-degree coeff should always be output if not zero
+ else if (coeffs_[i] == -1) os << '-';
+ else if (coeffs_[i] != 1) os << coeffs_[i];
if (i < d-1) os << " X^" << d-i << ' ';
else if (i == d-1) os << " X ";
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_polynomial.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_polynomial.h
index fd108d3ce460a439fa5b5fe3d19f92e81a7a8f14..f3b0c0bc4690602968c32c4e6eedfc65476c7b87 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_polynomial.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_real_polynomial.h
@@ -30,6 +30,11 @@
// evaluation of the polynomial $p(x)$ at given values of $x$,
// or of its derivative $p'(x)$.
//
+// The coefficients (coeffs_) are stored as a vnl_vector, where
+// coeffs_[n] is the coefficient of the x^(d-n) term,
+// where d is the degree of the polynomial. Otherwise said,
+// the coefficients are stored starting with the highest degree term.
+//
// Roots may be extracted using the roots() method.
class vnl_real_polynomial
{
@@ -113,11 +118,11 @@ class vnl_real_polynomial
};
//: Returns polynomial which is sum of two polynomials f1(x)+f2(x)
-// \relates vnl_real_polynomial
+// \relatesalso vnl_real_polynomial
vnl_real_polynomial operator+(const vnl_real_polynomial& f1, const vnl_real_polynomial& f2);
//: Returns polynomial which is different of two polynomials f1(x)-f2(x)
-// \relates vnl_real_polynomial
+// \relatesalso vnl_real_polynomial
vnl_real_polynomial operator-(const vnl_real_polynomial& f1, const vnl_real_polynomial& f2);
//: Returns polynomial which is product of two polynomials f1(x)*f2(x)
@@ -125,7 +130,7 @@ vnl_real_polynomial operator*(const vnl_real_polynomial& f1, const vnl_real_poly
//: Returns RMS difference between f1 and f2 over range [x1,x2]
// $\frac1{\sqrt{|x_2-x_1|}}\,\sqrt{\int_{x_1}^{x_2}\left(f_1(x)-f_2(x)\right)^2\,dx}$
-// \relates vnl_real_polynomial
+// \relatesalso vnl_real_polynomial
double vnl_rms_difference(const vnl_real_polynomial& f1, const vnl_real_polynomial& f2,
double x1, double x2);
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rotation_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rotation_matrix.h
index 5b307089f7ab17d114c1054aa1fcb308fb845642..3712f010e2e80046fff98d62c5e77240e5658218 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rotation_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_rotation_matrix.h
@@ -25,11 +25,11 @@ bool vnl_rotation_matrix(vnl_vector<double> const &axis, vnl_matrix<double>& R);
bool vnl_rotation_matrix(vnl_vector_fixed<double,3> const& axis, vnl_matrix_fixed<double,3,3>& R);
//: Returns an orthogonal 3x3 matrix which is a rotation about the axis, by an angle equal to ||axis||.
-// \relates vnl_matrix_fixed
+// \relatesalso vnl_matrix_fixed
vnl_matrix_fixed<double,3,3> vnl_rotation_matrix(vnl_vector_fixed<double,3> const& axis);
//: Returns an orthogonal 3x3 matrix which is a rotation about the axis, by an angle equal to ||axis||.
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
vnl_matrix<double> vnl_rotation_matrix(vnl_vector<double> const& axis);
#endif // vnl_rotation_matrix_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sample.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sample.cxx
index 3ebddf3fa31a2868c3cd24ef00d57dbaa17e6200..90c1c7d64c3d7a60e9a6cb45b5cebd1a7a9aac97 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sample.cxx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sample.cxx
@@ -2,13 +2,6 @@
#ifdef VCL_NEEDS_PRAGMA_INTERFACE
#pragma implementation
#endif
-//:
-// \file
-// \author fsm
-// \verbatim
-// Modifications
-// 2007-03-26 Peter Vanroose - avoid returning log(0.0) by switching params
-// \endverbatim
#include "vnl_sample.h"
#include <vnl/vnl_math.h>
@@ -20,7 +13,7 @@
# include <stdlib.h> // dont_vxl_filter
#else
// rand() is not always a good random number generator,
-// so use a simple congruential random number generator when no drand48 - PVr
+// so use a simple congruential random number generator when drand48 not available - PVr
static unsigned long vnl_sample_seed = 12345;
#endif
@@ -44,12 +37,13 @@ void vnl_sample_reseed(int seed)
#endif
}
-//: return a random number uniformly drawn on [a, b)
double vnl_sample_uniform(double a, double b)
{
#if VXL_STDLIB_HAS_DRAND48
double u = drand48(); // uniform on [0, 1)
#else
+// rand() is not always a good random number generator,
+// so use a simple congruential random number generator when drand48 not available - PVr
vnl_sample_seed = (vnl_sample_seed*16807)%2147483647L;
double u = double(vnl_sample_seed)/2147483647L; // uniform on [0, 1)
#endif
@@ -73,3 +67,30 @@ double vnl_sample_normal(double mean, double sigma)
vnl_sample_normal_2(&x, 0);
return mean + sigma * x;
}
+
+// Implementation of Bernoulli sampling by Peter Vanroose
+int vnl_sample_bernoulli(double q)
+{
+ // quick return if possible:
+ if (q==0.0) return 0;
+ if (q==1.0) return 1;
+ if (q<0.0 || q>1.0) return -1;
+ // q should be the probability of returning 0:
+ return (vnl_sample_uniform(0.0, 1.0/q) >= 1.0) ? 1 : 0;
+}
+
+// Implementation of binomial sampling by Peter Vanroose
+int vnl_sample_binomial(int n, double q)
+{
+ // Returns a random "k" value, between 0 and n, viz. the sum of n random
+ // and independent drawings from a Bernoulli distribution with parameter q.
+
+ if (n <= 0 || q<0.0 || q>1.0) return -1; // That is: when the input makes no sense, return nonsense "-1".
+ if (q==0.0) return 0;
+ if (q==1.0) return n;
+ int k = 0;
+ for (int i=n-1; i>=0; --i) {
+ k += vnl_sample_bernoulli(q);
+ }
+ return k;
+}
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sample.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sample.h
index da2b8af48e40ed329ce03d84cd2a858cc5999dfc..bd3b50b028d57fe432ba326f129aff444a6819ee 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sample.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sample.h
@@ -7,6 +7,14 @@
//:
// \file
// \brief easy ways to sample from various probability distributions
+// \author fsm
+// \verbatim
+// Modifications
+// 2005-01-01 Peter Vanroose - use simple (but robust) rng when no DRAND48
+// 2007-03-26 Peter Vanroose - avoid returning log(0.0) by switching params
+// 2010-09-12 Peter Vanroose - added implementation for binomial sampling
+// 2010-09-12 Peter Vanroose - added Bernoulli (unfair coin toss) sampling
+// \endverbatim
//: re-seed the random number generator.
void vnl_sample_reseed();
@@ -14,7 +22,7 @@ void vnl_sample_reseed();
//: re-seed the random number generator given a seed.
void vnl_sample_reseed(int seed);
-//: uniform on [a, b)
+//: return a random number uniformly drawn on [a, b)
double vnl_sample_uniform(double a, double b);
//: two independent samples from a standard normal distribution.
@@ -23,8 +31,15 @@ void vnl_sample_normal_2(double *x, double *y);
//: Normal distribution with given mean and standard deviation
double vnl_sample_normal(double mean, double sigma);
-// P(X = k) = [kth term in binomial expansion of (p + (1-p))^n]
-//int vnl_sample_binomial(int n, int k, double p);
+//: Return random k, where P(X = k) = [kth term in binomial expansion of (q + (1-q))^n].
+// The returned value will lie between 0 and n (but will be -1 when input is nonsense).
+int vnl_sample_binomial(int n, double q);
+
+//: Bernoulli distribution ("coin toss").
+// The returned value will be 0 (with probability q) or 1 (with probability 1-q).
+// For a "fair" coin toss, use q=0.5.
+// When q does not lie between 0 and 1, the value -1 is returned.
+int vnl_sample_bernoulli(double q);
// ----------------------------------------
@@ -44,6 +59,22 @@ inline void vnl_sample_normal(I begin, I end, double mean, double sigma)
(*p) = vnl_sample_normal(mean, sigma);
}
+//: handy function to fill a range of values.
+template <class I>
+inline void vnl_sample_binomial(I begin, I end, int n, double q)
+{
+ for (I p=begin; p!=end; ++p)
+ (*p) = vnl_sample_binomial(n, q);
+}
+
+//: handy function to fill a range of values.
+template <class I>
+inline void vnl_sample_bernoulli(I begin, I end, double q)
+{
+ for (I p=begin; p!=end; ++p)
+ (*p) = vnl_sample_bernoulli(q);
+}
+
//: handy function to fill a range of values.
template <class I, class T>
inline void vnl_sample_uniform(I begin, I end, double a, double b, T /*dummy*/)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_scalar_join_iterator.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_scalar_join_iterator.h
index e51bc74303937874677d873240aee2e763d61d69..95849ab95f559a90aca6031c60b42b06dd19db4e 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_scalar_join_iterator.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_scalar_join_iterator.h
@@ -112,7 +112,7 @@ class vnl_scalar_join_iterator
private:
// Postfix ++ is private as it would be costly to implement.
- vnl_scalar_join_iterator<T>& operator ++ (int);
+ vnl_scalar_join_iterator<T> operator++ (int);
#if 0
T object1() const { return *I1[index1].object; }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_scalar_join_iterator.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_scalar_join_iterator.txx
index 00212a7ad039372a8b55dbd2a4c3aeb195029884..0592a3a3ab04d227c2e8444c1895885fb04fc5c9 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_scalar_join_iterator.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_scalar_join_iterator.txx
@@ -42,7 +42,7 @@ template <class T>
vcl_ostream& operator<<(vcl_ostream& s,
const vnl_scalar_join_iterator_indexed_pair<T>& p)
{
- return s << p.original_index << " " << *(p.object) << '\n';
+ return s << p.original_index << ' ' << *(p.object) << '\n';
}
template <class T>
@@ -152,7 +152,7 @@ unsigned vnl_scalar_join_iterator<T>::row2() const
//: Postfix ++ should not be used. Only present for instantiation purposes.
template <class T>
-vnl_scalar_join_iterator<T>& vnl_scalar_join_iterator<T>::operator++(int)
+vnl_scalar_join_iterator<T> vnl_scalar_join_iterator<T>::operator++(int)
{
vcl_cerr << "This should not happen! postfix ++ called\n";
return *this;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_lst_sqr_function.cxx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_lst_sqr_function.cxx
new file mode 100644
index 0000000000000000000000000000000000000000..234511bf54dbaf66fbff727789e988081b62e80f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_lst_sqr_function.cxx
@@ -0,0 +1,568 @@
+// This is core/vnl/vnl_sparse_lst_sqr_function.cxx
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma implementation
+#endif
+//:
+// \file
+// \author Matt Leotta (Brown)
+// \date April 13, 2005
+
+
+#include "vnl_sparse_lst_sqr_function.h"
+#include <vcl_iostream.h>
+#include <vcl_cassert.h>
+#include <vnl/vnl_vector_ref.h>
+
+void vnl_sparse_lst_sqr_function::dim_warning(unsigned int nr_of_unknowns,
+ unsigned int nr_of_residuals)
+{
+ if (nr_of_unknowns > nr_of_residuals)
+ vcl_cerr << "vnl_sparse_lst_sqr_function: WARNING: "
+ << "unknowns(" << nr_of_unknowns << ") > "
+ << "residuals("<< nr_of_residuals << ")\n";
+}
+
+//: Construct vnl_sparse_lst_sqr_function.
+// Assumes A consists of \p num_a parameters each of size \p num_params_per_a
+// Assumes B consists of \p num_b parameters each of size \p num_params_per_b
+// Assumes C consists of \p num_params_c parameters
+// Assumes there is a residual x_ij for all i and j, each of size \p num_residuals_per_e
+// The optional argument should be no_gradient if the gradf function has not
+// been implemented. Default is use_gradient.
+vnl_sparse_lst_sqr_function::vnl_sparse_lst_sqr_function(
+ unsigned int num_a,
+ unsigned int num_params_per_a,
+ unsigned int num_b,
+ unsigned int num_params_per_b,
+ unsigned int num_params_c,
+ unsigned int num_residuals_per_e,
+ UseGradient g,
+ UseWeights w)
+ : failure(false),
+ residual_indices_(),
+ indices_a_(num_a+1,0),
+ indices_b_(num_b+1,0),
+ num_params_c_(num_params_c),
+ indices_e_(num_a*num_b+1,0),
+ use_gradient_(g == use_gradient),
+ use_weights_(w == use_weights)
+{
+ unsigned int k = num_params_per_a;
+ for (unsigned int i=1; i<indices_a_.size(); ++i, k+=num_params_per_a)
+ indices_a_[i] = k;
+
+ k = num_params_per_b;
+ for (unsigned int i=1; i<indices_b_.size(); ++i, k+=num_params_per_b)
+ indices_b_[i] = k;
+
+ k = num_residuals_per_e;
+ for (unsigned int i=1; i<indices_e_.size(); ++i, k+=num_residuals_per_e)
+ indices_e_[i] = k;
+}
+
+//: Construct vnl_sparse_lst_sqr_function.
+// Assumes A consists of \p num_a parameters each of size \p num_params_per_a
+// Assumes B consists of \p num_b parameters each of size \p num_params_per_b
+// Assumes C consists of \p num_params_c parameters
+// \p xmask is a mask for residual availability. residual e_ij exists only if mask[i][j]==true
+// Assumes each available residual has size \p num_residuals_per_e
+// The optional argument should be no_gradient if the gradf function has not
+// been implemented. Default is use_gradient.
+vnl_sparse_lst_sqr_function::vnl_sparse_lst_sqr_function(
+ unsigned int num_a,
+ unsigned int num_params_per_a,
+ unsigned int num_b,
+ unsigned int num_params_per_b,
+ unsigned int num_params_c,
+ const vcl_vector<vcl_vector<bool> >& xmask,
+ unsigned int num_residuals_per_e,
+ UseGradient g,
+ UseWeights w)
+ : failure(false),
+ residual_indices_(xmask),
+ indices_a_(num_a+1,0),
+ indices_b_(num_b+1,0),
+ num_params_c_(num_params_c),
+ indices_e_(residual_indices_.num_non_zero()+1,0),
+ use_gradient_(g == use_gradient),
+ use_weights_(w == use_weights)
+{
+ unsigned int k = num_params_per_a;
+ for (unsigned int i=1; i<indices_a_.size(); ++i, k+=num_params_per_a)
+ indices_a_[i] = k;
+
+ k = num_params_per_b;
+ for (unsigned int i=1; i<indices_b_.size(); ++i, k+=num_params_per_b)
+ indices_b_[i] = k;
+
+ k = num_residuals_per_e;
+ for (unsigned int i=1; i<indices_e_.size(); ++i, k+=num_residuals_per_e)
+ indices_e_[i] = k;
+
+ dim_warning(num_a*num_params_per_a + num_b*num_params_per_b + num_params_c, k);
+}
+
+
+//: Construct vnl_sparse_lst_sqr_function.
+// This constructor is the most general
+// \param a_sizes is a vector describing the number of parameters for each a_i
+// \param b_sizes is a vector describing the number of parameters for each b_j
+// \param num_params_c is the number of C parameters
+// \param e_sizes is a vector describing the number of parameters for each residual e_ij
+// \param xmask is a mask for residual availability. residual e_ij exists only if mask[i][j]==true
+// xmask must be a_sizes.size() by b_sizes.size() and contain e_sizes.size() true entries
+// The optional argument should be no_gradient if the gradf function has not
+// been implemented. Default is use_gradient.
+vnl_sparse_lst_sqr_function::vnl_sparse_lst_sqr_function(
+ const vcl_vector<unsigned int>& a_sizes,
+ const vcl_vector<unsigned int>& b_sizes,
+ unsigned int num_params_c,
+ const vcl_vector<unsigned int>& e_sizes,
+ const vcl_vector<vcl_vector<bool> >& xmask,
+ UseGradient g,
+ UseWeights w)
+ : failure(false),
+ residual_indices_(xmask),
+ indices_a_(a_sizes.size()+1,0),
+ indices_b_(b_sizes.size()+1,0),
+ num_params_c_(num_params_c),
+ indices_e_(e_sizes.size()+1,0),
+ use_gradient_(g == use_gradient),
+ use_weights_(w == use_weights)
+{
+ assert(residual_indices_.num_non_zero() == (int)e_sizes.size());
+ assert(residual_indices_.num_rows() == (int)a_sizes.size());
+ assert(residual_indices_.num_cols() == (int)b_sizes.size());
+
+ for (unsigned int i=0; i<a_sizes.size(); ++i)
+ indices_a_[i+1] = indices_a_[i]+a_sizes[i];
+
+ for (unsigned int i=0; i<b_sizes.size(); ++i)
+ indices_b_[i+1] = indices_b_[i]+b_sizes[i];
+
+ for (unsigned int i=0; i<e_sizes.size(); ++i)
+ indices_e_[i+1] = indices_e_[i]+e_sizes[i];
+
+ dim_warning(indices_a_.back() + indices_b_.back() + num_params_c,
+ indices_e_.back());
+}
+
+
+//: Compute all residuals.
+// Given the parameter vectors a, b, and c, compute the vector of residuals f.
+// f has been sized appropriately before the call.
+// The default implementation computes f by calling fij for each valid
+// pair of i and j. You do not need to overload this method unless you
+// want to provide a more efficient implementation for your problem.
+void
+vnl_sparse_lst_sqr_function::f(vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c,
+ vnl_vector<double>& e)
+{
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+ for (unsigned int i=0; i<number_of_a(); ++i)
+ {
+ // This is semi const incorrect - there is no vnl_vector_ref_const
+ const vnl_vector_ref<double> ai(number_of_params_a(i),
+ const_cast<double*>(a.data_block())+index_a(i));
+
+ vnl_crs_index::sparse_vector row = residual_indices_.sparse_row(i);
+ for (sv_itr r_itr=row.begin(); r_itr!=row.end(); ++r_itr)
+ {
+ unsigned int j = r_itr->second;
+ unsigned int k = r_itr->first;
+ // This is semi const incorrect - there is no vnl_vector_ref_const
+ const vnl_vector_ref<double> bj(number_of_params_b(j),
+ const_cast<double*>(b.data_block())+index_b(j));
+ vnl_vector_ref<double> eij(number_of_residuals(k), e.data_block()+index_e(k));
+ fij(i,j,ai,bj,c,eij); // compute residual vector e_ij
+ }
+ }
+}
+
+
+//: Compute the sparse Jacobian in block form.
+// Given the parameter vectors a, b, and c, compute the set of block
+// Jacobians Aij, Bij, and Cij.
+// All Aij, Bij, and Cij have been sized appropriately before the call.
+// The default implementation computes A, B, and C by calling
+// jac_Aij, jac_Bij, and jac_Cij for each valid pair of i and j.
+// You do not need to overload this method unless you want to provide
+// a more efficient implementation for your problem.
+void
+vnl_sparse_lst_sqr_function::jac_blocks(vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c,
+ vcl_vector<vnl_matrix<double> >& A,
+ vcl_vector<vnl_matrix<double> >& B,
+ vcl_vector<vnl_matrix<double> >& C)
+{
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+ for (unsigned int i=0; i<number_of_a(); ++i)
+ {
+ // This is semi const incorrect - there is no vnl_vector_ref_const
+ const vnl_vector_ref<double> ai(number_of_params_a(i),
+ const_cast<double*>(a.data_block())+index_a(i));
+
+ vnl_crs_index::sparse_vector row = residual_indices_.sparse_row(i);
+ for (sv_itr r_itr=row.begin(); r_itr!=row.end(); ++r_itr)
+ {
+ unsigned int j = r_itr->second;
+ unsigned int k = r_itr->first;
+ // This is semi const incorrect - there is no vnl_vector_ref_const
+ const vnl_vector_ref<double> bj(number_of_params_b(j),
+ const_cast<double*>(b.data_block())+index_b(j));
+
+ jac_Aij(i,j,ai,bj,c,A[k]); // compute Jacobian A_ij
+ jac_Bij(i,j,ai,bj,c,B[k]); // compute Jacobian B_ij
+ jac_Cij(i,j,ai,bj,c,C[k]); // compute Jacobian C_ij
+ }
+ }
+}
+
+
+//: Compute the sparse Jacobian in block form using a finite difference approximation.
+// Given the parameter vectors a, b and c, compute the set of block Jacobians
+// Aij, Bij, and Cij. The finite difference approximation is done independently
+// at each block. All Aij, Bij, and Cij have been sized appropriately before the call.
+// The default implementation computes A, B, and C by calling
+// jac_Aij, jac_Bij, and jac_Cij for each valid pair of i and j.
+// You do not need to overload this method unless you want to provide
+// a more efficient implementation for your problem.
+void
+vnl_sparse_lst_sqr_function::fd_jac_blocks(vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c,
+ vcl_vector<vnl_matrix<double> >& A,
+ vcl_vector<vnl_matrix<double> >& B,
+ vcl_vector<vnl_matrix<double> >& C,
+ double stepsize)
+{
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+ for (unsigned int i=0; i<number_of_a(); ++i)
+ {
+ // This is semi const incorrect - there is no vnl_vector_ref_const
+ const vnl_vector_ref<double> ai(number_of_params_a(i),
+ const_cast<double*>(a.data_block())+index_a(i));
+
+ vnl_crs_index::sparse_vector row = residual_indices_.sparse_row(i);
+ for (sv_itr r_itr=row.begin(); r_itr!=row.end(); ++r_itr)
+ {
+ unsigned int j = r_itr->second;
+ unsigned int k = r_itr->first;
+ // This is semi const incorrect - there is no vnl_vector_ref_const
+ const vnl_vector_ref<double> bj(number_of_params_b(j),
+ const_cast<double*>(b.data_block())+index_b(j));
+
+ fd_jac_Aij(i,j,ai,bj,c,A[k],stepsize); // compute Jacobian A_ij with finite differences
+ fd_jac_Bij(i,j,ai,bj,c,B[k],stepsize); // compute Jacobian B_ij with finite differences
+ fd_jac_Cij(i,j,ai,bj,c,C[k],stepsize); // compute Jacobian C_ij with finite differences
+ }
+ }
+}
+
+
+//: If using weighted least squares, compute the weights for each i and j.
+// Return the weights in \a weights.
+// The default implementation computes \a weights by calling
+// compute_weight_ij for each valid pair of i and j.
+// You do not need to overload this method unless you want to provide
+// a more specialized implementation for your problem.
+void
+vnl_sparse_lst_sqr_function::compute_weights(vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c,
+ vnl_vector<double> const& e,
+ vnl_vector<double>& weights)
+{
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+ for (unsigned int i=0; i<number_of_a(); ++i)
+ {
+ // This is semi const incorrect - there is no vnl_vector_ref_const
+ const vnl_vector_ref<double> ai(number_of_params_a(i),
+ const_cast<double*>(a.data_block())+index_a(i));
+
+ vnl_crs_index::sparse_vector row = residual_indices_.sparse_row(i);
+ for (sv_itr r_itr=row.begin(); r_itr!=row.end(); ++r_itr)
+ {
+ unsigned int j = r_itr->second;
+ unsigned int k = r_itr->first;
+ // This is semi const incorrect - there is no vnl_vector_ref_const
+ const vnl_vector_ref<double> bj(number_of_params_b(j),
+ const_cast<double*>(b.data_block())+index_b(j));
+ const vnl_vector_ref<double> eij(number_of_residuals(k),
+ const_cast<double*>(e.data_block()+index_e(k)));
+ compute_weight_ij(i,j,ai,bj,c,eij,weights[k]);
+ }
+ }
+}
+
+
+//: If using weighted least squares, apply the weights to residuals f.
+// The default implementation applies \a weights by calling
+// apply_weight_ij for each valid pair of i and j.
+// You do not need to overload this method unless you want to provide
+// a more specialized implementation for your problem.
+void
+vnl_sparse_lst_sqr_function::apply_weights(vnl_vector<double> const& weights,
+ vnl_vector<double>& e)
+{
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+ for (unsigned int i=0; i<number_of_a(); ++i)
+ {
+ vnl_crs_index::sparse_vector row = residual_indices_.sparse_row(i);
+ for (sv_itr r_itr=row.begin(); r_itr!=row.end(); ++r_itr)
+ {
+ unsigned int j = r_itr->second;
+ unsigned int k = r_itr->first;
+ vnl_vector_ref<double> eij(number_of_residuals(k), e.data_block()+index_e(k));
+ apply_weight_ij(i,j,weights[k],eij);
+ }
+ }
+}
+
+
+//: If using weighted least squares, apply the weights to residuals A, B, C.
+// The default implementation applies \a weights by calling
+// apply_weight_ij for each valid pair of i and j.
+// You do not need to overload this method unless you want to provide
+// a more specialized implementation for your problem.
+void
+vnl_sparse_lst_sqr_function::apply_weights(vnl_vector<double> const& weights,
+ vcl_vector<vnl_matrix<double> >& A,
+ vcl_vector<vnl_matrix<double> >& B,
+ vcl_vector<vnl_matrix<double> >& C)
+{
+ typedef vnl_crs_index::sparse_vector::iterator sv_itr;
+ for (unsigned int i=0; i<number_of_a(); ++i)
+ {
+ vnl_crs_index::sparse_vector row = residual_indices_.sparse_row(i);
+ for (sv_itr r_itr=row.begin(); r_itr!=row.end(); ++r_itr)
+ {
+ unsigned int j = r_itr->second;
+ unsigned int k = r_itr->first;
+ apply_weight_ij(i,j,weights[k],A[k],B[k],C[k]);
+ }
+ }
+}
+
+
+//: Compute the residuals from the ith component of a, the jth component of b.
+// Given the parameter vectors ai, bj, and c, compute the vector of residuals fij.
+// fij has been sized appropriately before the call.
+void
+vnl_sparse_lst_sqr_function::fij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_vector<double>& f_i_j)
+{
+ vcl_cerr << "Warning: fij() called but not implemented in derived class\n";
+}
+
+//: Calculate the Jacobian A_ij, given the parameter vectors a_i, b_j, and c.
+void
+vnl_sparse_lst_sqr_function::jac_Aij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Aij)
+{
+ vcl_cerr << "Warning: jac_Aij() called but not implemented in derived class\n";
+}
+
+//: Calculate the Jacobian B_ij, given the parameter vectors a_i, b_j, and c.
+void
+vnl_sparse_lst_sqr_function::jac_Bij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Bij)
+{
+ vcl_cerr << "Warning: jac_Bij() called but not implemented in derived class\n";
+}
+
+//: Calculate the Jacobian C_ij, given the parameter vectors a_i, b_j, and c.
+void
+vnl_sparse_lst_sqr_function::jac_Cij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Cij)
+{
+ if(num_params_c_ > 0)
+ vcl_cerr << "Warning: jac_Cij() called but not implemented in derived class\n";
+}
+
+//: Use this to compute a finite-difference Jacobian A_ij
+void
+vnl_sparse_lst_sqr_function::fd_jac_Aij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Aij,
+ double stepsize)
+{
+ const unsigned int dim = ai.size();
+ const unsigned int n = Aij.rows();
+ assert(dim == number_of_params_a(i));
+ assert(n == number_of_residuals(i,j));
+ assert(dim == Aij.columns());
+
+ vnl_vector<double> tai = ai;
+ vnl_vector<double> fplus(n);
+ vnl_vector<double> fminus(n);
+ // note: i and j are indices for the macro problem
+ // while ii and jj are indices for subproblem jacobian Aij
+ for (unsigned int ii = 0; ii < dim; ++ii)
+ {
+ // calculate f just to the right of ai[ii]
+ double tplus = tai[ii] = ai[ii] + stepsize;
+ this->fij(i,j,tai,bj,c,fplus);
+
+ // calculate f just to the left of ai[ii]
+ double tminus = tai[ii] = ai[ii] - stepsize;
+ this->fij(i,j,tai,bj,c,fminus);
+
+ double h = 1.0 / (tplus - tminus);
+ for (unsigned int jj = 0; jj < n; ++jj)
+ Aij(jj,ii) = (fplus[jj] - fminus[jj]) * h;
+
+ // restore tai
+ tai[ii] = ai[ii];
+ }
+}
+
+
+//: Use this to compute a finite-difference Jacobian B_ij
+void
+vnl_sparse_lst_sqr_function::fd_jac_Bij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Bij,
+ double stepsize)
+{
+ const unsigned int dim = bj.size();
+ const unsigned int n = Bij.rows();
+ assert(dim == number_of_params_b(j));
+ assert(n == number_of_residuals(i,j));
+ assert(dim == Bij.columns());
+
+ vnl_vector<double> tbj = bj;
+ vnl_vector<double> fplus(n);
+ vnl_vector<double> fminus(n);
+ // note: i and j are indices for the macro problem
+ // while ii and jj are indices for subproblem jacobian Bij
+ for (unsigned int ii = 0; ii < dim; ++ii)
+ {
+ // calculate f just to the right of bj[ii]
+ double tplus = tbj[ii] = bj[ii] + stepsize;
+ this->fij(i,j,ai,tbj,c,fplus);
+
+ // calculate f just to the left of bj[ii]
+ double tminus = tbj[ii] = bj[ii] - stepsize;
+ this->fij(i,j,ai,tbj,c,fminus);
+
+ double h = 1.0 / (tplus - tminus);
+ for (unsigned int jj = 0; jj < n; ++jj)
+ Bij(jj,ii) = (fplus[jj] - fminus[jj]) * h;
+
+ // restore tbj
+ tbj[ii] = bj[ii];
+ }
+}
+
+
+//: Use this to compute a finite-difference Jacobian C_ij
+void
+vnl_sparse_lst_sqr_function::fd_jac_Cij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Cij,
+ double stepsize)
+{
+ const unsigned int dim = c.size();
+ const unsigned int n = Cij.rows();
+ assert(dim == number_of_params_c());
+ assert(n == number_of_residuals(i,j));
+ assert(dim == Cij.columns());
+
+ vnl_vector<double> tc = c;
+ vnl_vector<double> fplus(n);
+ vnl_vector<double> fminus(n);
+ // note: i and j are indices for the macro problem
+ // while ii and jj are indices for subproblem jacobian Cij
+ for (unsigned int ii = 0; ii < dim; ++ii)
+ {
+ // calculate f just to the right of c[ii]
+ double tplus = tc[ii] = c[ii] + stepsize;
+ this->fij(i,j,ai,bj,tc,fplus);
+
+ // calculate f just to the left of c[ii]
+ double tminus = tc[ii] = c[ii] - stepsize;
+ this->fij(i,j,ai,bj,tc,fminus);
+
+ double h = 1.0 / (tplus - tminus);
+ for (unsigned int jj = 0; jj < n; ++jj)
+ Cij(jj,ii) = (fplus[jj] - fminus[jj]) * h;
+
+ // restore tc
+ tc[ii] = c[ii];
+ }
+}
+
+
+//: If using weighted least squares, compute the weight.
+// Return the weight in \a weight.
+// The default implementation sets weight = 1
+void
+vnl_sparse_lst_sqr_function::compute_weight_ij(int /*i*/, int /*j*/,
+ vnl_vector<double> const& /*ai*/,
+ vnl_vector<double> const& /*bj*/,
+ vnl_vector<double> const& /*c*/,
+ vnl_vector<double> const& /*fij*/,
+ double& weight)
+{
+ weight = 1.0;
+}
+
+
+//: If using weighted least squares, apply the weight to fij.
+// The default implementation multiplies fij by weight.
+void
+vnl_sparse_lst_sqr_function::apply_weight_ij(int /*i*/, int /*j*/,
+ double const& weight,
+ vnl_vector<double>& fij)
+{
+ fij *= weight;
+}
+
+
+//: If using weighted least squares, apply the weight to Aij, Bij, Cij.
+// The default implementation multiplies each matrix by weight.
+void
+vnl_sparse_lst_sqr_function::apply_weight_ij(int /*i*/, int /*j*/,
+ double const& weight,
+ vnl_matrix<double>& Aij,
+ vnl_matrix<double>& Bij,
+ vnl_matrix<double>& Cij)
+{
+ Aij *= weight;
+ Bij *= weight;
+ Cij *= weight;
+}
+
+
+void vnl_sparse_lst_sqr_function::trace(int /* iteration */,
+ vnl_vector<double> const& /*a*/,
+ vnl_vector<double> const& /*b*/,
+ vnl_vector<double> const& /*c*/,
+ vnl_vector<double> const& /*e*/)
+{
+ // This default implementation is empty; overloaded in derived class.
+}
+
+
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_lst_sqr_function.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_lst_sqr_function.h
new file mode 100644
index 0000000000000000000000000000000000000000..7b22142d14bef68c40ab0901a6971ea9865ddbe5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_lst_sqr_function.h
@@ -0,0 +1,337 @@
+// This is core/vnl/vnl_sparse_lst_sqr_function.h
+#ifndef vnl_sparse_lst_sqr_function_h_
+#define vnl_sparse_lst_sqr_function_h_
+#ifdef VCL_NEEDS_PRAGMA_INTERFACE
+#pragma interface
+#endif
+//:
+// \file
+// \brief Abstract base for sparse least squares functions
+// \author Matt Leotta (Brown)
+// \date April 13, 2005
+//
+// \verbatim
+// Modifications
+// Apr 13, 2005 MJL - Modified from vnl_least_squares_function
+// Mar 15, 2010 MJL - Modified to add 'c' parameters (globals)
+// \endverbatim
+//
+#include <vnl/vnl_vector.h>
+#include <vnl/vnl_matrix.h>
+#include <vnl/vnl_crs_index.h>
+
+//: Abstract base for sparse least squares functions.
+// vnl_sparse_lst_sqr_function is an abstract base for functions to be minimized
+// by an optimizer. To define your own function to be minimized, subclass
+// from vnl_sparse_lst_sqr_function, and implement the pure virtual f (and
+// optionally grad_f).
+//
+// This differs from a vnl_least_squares_function in that many entries in the
+// Jacobian are known to be zero, and we don't want to compute them. The particular
+// sparse structure is that described in Hartley and Zisserman section A4.3. It
+// is assumed that the parameter vector can be partitioned into sets A and B.
+// These are further partitioned into subsets {a_1, a_2, ... a_m} and
+// {b_1, b_2, ... b_n}. Likewise, the residual vector X is partitioned into
+// {x_11, x_12, ... x_mn} (not all x_ij are required). We further assume that
+// dx_ij/da_k = 0 for all i != k and dx_ij/db_k = 0 for all j != k.
+//
+// This implementation further generalizes the concept by allowing for a
+// third set of parameters C that are non-sparse. That is, dx_ij/dC != 0
+// for all i and j (in general).
+//
+// An example use case is bundle adjustment where each a_i is the parameters
+// for one of m cameras, each b_j is the parameters of a 3D point, and x_ij
+// is the projection error of the jth point by the ith camera. If type
+// C parameters are used, they might represent the unknown intrinic camera
+// parameters that are assumed to be fixed over all images.
+class vnl_sparse_lst_sqr_function
+{
+ public:
+ enum UseGradient {
+ no_gradient,
+ use_gradient
+ };
+ enum UseWeights {
+ no_weights,
+ use_weights
+ };
+ bool failure;
+
+ //: Construct vnl_sparse_lst_sqr_function.
+ // Assumes A consists of \p num_a parameters each of size \p num_params_per_a
+ // Assumes B consists of \p num_b parameters each of size \p num_params_per_b
+ // Assumes C consists of \p num_params_c parameters
+ // Assumes there is a residual x_ij for all i and j, each of size \p num_residuals_per_e
+ // The optional argument should be no_gradient if the gradf function has not
+ // been implemented. Default is use_gradient.
+ vnl_sparse_lst_sqr_function(unsigned int num_a,
+ unsigned int num_params_per_a,
+ unsigned int num_b,
+ unsigned int num_params_per_b,
+ unsigned int num_params_c,
+ unsigned int num_residuals_per_e,
+ UseGradient g = use_gradient,
+ UseWeights w = no_weights);
+
+ //: Construct vnl_sparse_lst_sqr_function.
+ // Assumes A consists of \p num_a parameters each of size \p num_params_per_a
+ // Assumes B consists of \p num_b parameters each of size \p num_params_per_b
+ // Assumes C consists of \p num_params_c parameters
+ // \p xmask is a mask for residual availability. residual e_ij exists only if mask[i][j]==true
+ // Assumes each available residual has size \p num_residuals_per_e
+ // The optional argument should be no_gradient if the gradf function has not
+ // been implemented. Default is use_gradient.
+ vnl_sparse_lst_sqr_function(unsigned int num_a,
+ unsigned int num_params_per_a,
+ unsigned int num_b,
+ unsigned int num_params_per_b,
+ unsigned int num_params_c,
+ const vcl_vector<vcl_vector<bool> >& xmask,
+ unsigned int num_residuals_per_e,
+ UseGradient g = use_gradient,
+ UseWeights w = no_weights);
+
+ //: Construct vnl_sparse_lst_sqr_function.
+ // This constructor is the most general
+ // \param a_sizes is a vector describing the number of parameters for each a_i
+ // \param b_sizes is a vector describing the number of parameters for each b_j
+ // \param num_params_c is the number of C parameters
+ // \param e_sizes is a vector describing the number of parameters for each residual e_ij
+ // \param xmask is a mask for residual availability. residual e_ij exists only if mask[i][j]==true
+ // xmask must be a_sizes.size() by b_sizes.size() and contain e_sizes.size() true entries
+ // The optional argument should be no_gradient if the gradf function has not
+ // been implemented. Default is use_gradient.
+ vnl_sparse_lst_sqr_function(const vcl_vector<unsigned int>& a_sizes,
+ const vcl_vector<unsigned int>& b_sizes,
+ unsigned int num_params_c,
+ const vcl_vector<unsigned int>& e_sizes,
+ const vcl_vector<vcl_vector<bool> >& xmask,
+ UseGradient g = use_gradient,
+ UseWeights w = no_weights);
+
+ virtual ~vnl_sparse_lst_sqr_function() {}
+
+ // the virtuals may call this to signal a failure.
+ void throw_failure() { failure = true; }
+ void clear_failure() { failure = false; }
+
+ //: Compute all residuals.
+ // Given the parameter vectors a, b, and c, compute the vector of residuals f.
+ // f has been sized appropriately before the call.
+ // The default implementation computes f by calling fij for each valid
+ // pair of i and j. You do not need to overload this method unless you
+ // want to provide a more efficient implementation for your problem.
+ virtual void f(vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c,
+ vnl_vector<double>& f);
+
+ //: Compute the sparse Jacobian in block form.
+ // Given the parameter vectors a, b, and c, compute the set of block
+ // Jacobians Aij, Bij, and Cij.
+ // All Aij, Bij, and Cij have been sized appropriately before the call.
+ // The default implementation computes A, B, and C by calling
+ // jac_Aij, jac_Bij, and jac_Cij for each valid pair of i and j.
+ // You do not need to overload this method unless you want to provide
+ // a more efficient implementation for your problem.
+ virtual void jac_blocks(vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c,
+ vcl_vector<vnl_matrix<double> >& A,
+ vcl_vector<vnl_matrix<double> >& B,
+ vcl_vector<vnl_matrix<double> >& C);
+
+ //: Compute the sparse Jacobian in block form using a finite difference approximation.
+ // Given the parameter vectors a, b and c, compute the set of block Jacobians
+ // Aij, Bij, and Cij. The finite difference approximation is done independently
+ // at each block. All Aij, Bij, and Cij have been sized appropriately before the call.
+ // The default implementation computes A, B, and C by calling
+ // jac_Aij, jac_Bij, and jac_Cij for each valid pair of i and j.
+ // You do not need to overload this method unless you want to provide
+ // a more efficient implementation for your problem.
+ virtual void fd_jac_blocks(vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c,
+ vcl_vector<vnl_matrix<double> >& A,
+ vcl_vector<vnl_matrix<double> >& B,
+ vcl_vector<vnl_matrix<double> >& C,
+ double stepsize);
+
+ //: If using weighted least squares, compute the weights for each i and j.
+ // Return the weights in \a weights.
+ // The default implementation computes \a weights by calling
+ // compute_weight_ij for each valid pair of i and j.
+ // You do not need to overload this method unless you want to provide
+ // a more specialized implementation for your problem.
+ virtual void compute_weights(vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c,
+ vnl_vector<double> const& f,
+ vnl_vector<double>& weights);
+
+ //: If using weighted least squares, apply the weights to residuals f.
+ // The default implementation applies \a weights by calling
+ // apply_weight_ij for each valid pair of i and j.
+ // You do not need to overload this method unless you want to provide
+ // a more specialized implementation for your problem.
+ virtual void apply_weights(vnl_vector<double> const& weights,
+ vnl_vector<double>& f);
+
+ //: If using weighted least squares, apply the weights to residuals A, B, C.
+ // The default implementation applies \a weights by calling
+ // apply_weight_ij for each valid pair of i and j.
+ // You do not need to overload this method unless you want to provide
+ // a more specialized implementation for your problem.
+ virtual void apply_weights(vnl_vector<double> const& weights,
+ vcl_vector<vnl_matrix<double> >& A,
+ vcl_vector<vnl_matrix<double> >& B,
+ vcl_vector<vnl_matrix<double> >& C);
+
+ //: Compute the residuals from the ith component of a, the jth component of b.
+ // Given the parameter vectors ai, bj, and c, compute the vector of residuals fij.
+ // fij has been sized appropriately before the call.
+ virtual void fij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_vector<double>& fij);
+
+ //: Calculate the Jacobian A_ij, given the parameter vectors a_i, b_j, and c.
+ virtual void jac_Aij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Aij);
+
+ //: Calculate the Jacobian B_ij, given the parameter vectors a_i, b_j, and c.
+ virtual void jac_Bij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Bij);
+
+ //: Calculate the Jacobian C_ij, given the parameter vectors a_i, b_j, and c.
+ virtual void jac_Cij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Cij);
+
+ //: Use this to compute a finite-difference Jacobian A_ij
+ void fd_jac_Aij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Aij,
+ double stepsize);
+
+ //: Use this to compute a finite-difference Jacobian B_ij
+ void fd_jac_Bij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Bij,
+ double stepsize);
+
+ //: Use this to compute a finite-difference Jacobian C_ij
+ void fd_jac_Cij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_matrix<double>& Cij,
+ double stepsize);
+
+ //: If using weighted least squares, compute the weight.
+ // Return the weight in \a weight.
+ // The default implementation sets weight = 1
+ virtual void compute_weight_ij(int i, int j,
+ vnl_vector<double> const& ai,
+ vnl_vector<double> const& bj,
+ vnl_vector<double> const& c,
+ vnl_vector<double> const& fij,
+ double& weight);
+
+ //: If using weighted least squares, apply the weight to fij.
+ // The default implementation multiplies fij by weight.
+ virtual void apply_weight_ij(int i, int j,
+ double const& weight,
+ vnl_vector<double>& fij);
+
+ //: If using weighted least squares, apply the weight to Aij, Bij, Cij.
+ // The default implementation multiplies each matrix by weight.
+ virtual void apply_weight_ij(int i, int j,
+ double const& weight,
+ vnl_matrix<double>& Aij,
+ vnl_matrix<double>& Bij,
+ vnl_matrix<double>& Cij);
+
+ //: Called after each LM iteration to print debugging etc.
+ virtual void trace(int iteration,
+ vnl_vector<double> const& a,
+ vnl_vector<double> const& b,
+ vnl_vector<double> const& c,
+ vnl_vector<double> const& e);
+
+ //: Return the number of parameters of a_j
+ unsigned int number_of_params_a(int i) const { return indices_a_[i+1]-indices_a_[i]; }
+
+ //: Return the number of parameters of b_i
+ unsigned int number_of_params_b(int j) const { return indices_b_[j+1]-indices_b_[j]; }
+
+ //: Return the number of parameters of c
+ unsigned int number_of_params_c() const { return num_params_c_; }
+
+ //: Return the number of residuals in the kth residual vector.
+ unsigned int number_of_residuals(int k) const { return indices_e_[k+1]-indices_e_[k]; }
+
+ //: Return the number of residuals for x_ij.
+ unsigned int number_of_residuals(int i, int j) const
+ {
+ int k = residual_indices_(i,j);
+ if (k<0) return 0;
+ else return number_of_residuals(k);
+ }
+
+ //: return the index of aj in a
+ unsigned int index_a(int i) const { return indices_a_[i]; }
+
+ //: return the index of bj in b
+ unsigned int index_b(int j) const { return indices_b_[j]; }
+
+ //: return the index of ek in e
+ unsigned int index_e(int k) const { return indices_e_[k]; }
+
+ //: Return the number of subsets in \p a
+ unsigned int number_of_a() const { return indices_a_.size()-1; }
+
+ //: Return the number of subsets in \p b
+ unsigned int number_of_b() const { return indices_b_.size()-1; }
+
+ //: Return the number of residual vectors
+ unsigned int number_of_e() const { return indices_e_.size()-1; }
+
+ //: Return true if the derived class has indicated that gradf has been implemented
+ bool has_gradient() const { return use_gradient_; }
+
+ //: Return true if the derived class has indicated that
+ // \a apply_weights or \a apply_weight_ij have been implemented
+ bool has_weights() const { return use_weights_; }
+
+ //: Return a const reference to the residual indexer
+ const vnl_crs_index& residual_indices() const { return residual_indices_; }
+
+ protected:
+ vnl_crs_index residual_indices_;
+ vcl_vector<unsigned int> indices_a_;
+ vcl_vector<unsigned int> indices_b_;
+ unsigned int num_params_c_;
+ vcl_vector<unsigned int> indices_e_;
+
+ bool use_gradient_;
+ bool use_weights_;
+
+ private:
+ void dim_warning(unsigned int n_unknowns, unsigned int n_residuals);
+};
+
+#endif // vnl_sparse_lst_sqr_function_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix.h
index 9825245134637d8d5e5f936a2eb94089d9abd985..b1356801afa12505f9c9703da6283d1d706e0f19 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix.h
@@ -21,18 +21,38 @@
// \date 20 Oct 98
//
// \verbatim
-// Modifications
+// Modifications
+// Robin Flatland 5/31/99 Added pre_mult(lhs,result), where
+// lhs is a vector.
//
-// Robin Flatland 5/31/99 Added pre_mult(lhs,result), where
-// lhs is a vector.
+// Robin Flatland 6/08/99 Added iterator that allows sequential
+// access to non-zero values in matrix.
+// Iterator is controlled using reset, next,
+// getrow, getcolumn, and value.
//
-// Robin Flatland 6/08/99 Added iterator that allows sequential
-// access to non-zero values in matrix.
-// Iterator is controlled using reset, next,
-// getrow, getcolumn, and value.
-//
-// David Capel May 2000 Added set_row, scale_row, mult, vcat and const
-// methods where appropriate.
+// David Capel May 2000 Added set_row, scale_row, mult, vcat and const
+// methods where appropriate.
+// Peter Vanroose - Jan.2009 - Added several methods, modelled after vnl_matrix<T>:
+// const version of operator()(unsigned int, unsigned int)
+// T get(unsigned int, unsigned int)
+// void put(unsigned int, unsigned int, T)
+// void clear()
+// vnl_sparse_matrix& normalize_rows()
+// bool operator==()
+// bool operator!=()
+// unary minus of a matrix
+// addition of two matrices
+// subtraction of two matrices
+// multiplication of two matrices
+// in-place addition of two matrices
+// in-place subtraction of two matrices
+// in-place multiplication of two matrices
+// scalar multiplication of a matrix
+// in-place scalar multiplication of a matrix
+// scalar division of a matrix
+// in-place scalar division of a matrix
+// Peter Vanroose - Oct.2010 - Added set_identity()
+// Peter Vanroose - Mar.2011 - Added transpose() and conjugate_transpose()
// \endverbatim
#include <vcl_vector.h>
@@ -56,10 +76,10 @@ class vnl_sparse_matrix_pair
unsigned int first;
T second;
-//: Constructs a pair with null values
+ //: Constructs a pair with null values
vnl_sparse_matrix_pair() : first(0), second(T(0)) {}
-//: Constructs a pair with position a and value b
+ //: Constructs a pair with position a and value b
vnl_sparse_matrix_pair(unsigned int const& a, T const& b) : first(a), second(b) {}
vnl_sparse_matrix_pair(const vnl_sparse_matrix_pair<T>& o) : first(o.first), second(o.second) {}
@@ -97,8 +117,6 @@ class vnl_sparse_matrix
typedef vcl_vector < row > vnl_sparse_matrix_elements;
#endif
- // typedef vcl_vector<typename pair_t> row;
-
//: Construct an empty matrix
vnl_sparse_matrix();
@@ -106,13 +124,10 @@ class vnl_sparse_matrix
vnl_sparse_matrix(unsigned int m, unsigned int n);
//: Construct an m*n Matrix and copy rhs into it.
- vnl_sparse_matrix(const vnl_sparse_matrix<T>& rhs);
+ vnl_sparse_matrix(vnl_sparse_matrix<T> const& rhs);
//: Copy another vnl_sparse_matrix<T> into this.
- vnl_sparse_matrix<T>& operator=(const vnl_sparse_matrix<T>& rhs);
-
- //: Multiply this*rhs, another sparse matrix.
- void mult(vnl_sparse_matrix<T> const& rhs, vnl_sparse_matrix<T>& result) const;
+ vnl_sparse_matrix<T>& operator=(vnl_sparse_matrix<T> const& rhs);
//: Multiply this*rhs, where rhs is a vector.
void mult(vnl_vector<T> const& rhs, vnl_vector<T>& result) const;
@@ -123,23 +138,27 @@ class vnl_sparse_matrix
//: Multiplies lhs*this, where lhs is a vector
void pre_mult(const vnl_vector<T>& lhs, vnl_vector<T>& result) const;
- //: Add rhs to this.
- void add(const vnl_sparse_matrix<T>& rhs, vnl_sparse_matrix<T>& result) const;
-
- //: Subtract rhs from this.
- void subtract(const vnl_sparse_matrix<T>& rhs, vnl_sparse_matrix<T>& result) const;
-
//: Get a reference to an entry in the matrix.
T& operator()(unsigned int row, unsigned int column);
- //: Get diag(A_tranpose * A).
+ //: Get the value of an entry in the matrix.
+ T operator()(unsigned int row, unsigned int column) const;
+
+ //: Get an entry in the matrix.
+ // This is the "const" version of operator().
+ T get(unsigned int row, unsigned int column) const;
+
+ //: Put (i.e., add or overwrite) an entry into the matrix.
+ void put(unsigned int row, unsigned int column, T value);
+
+ //: Get diag(A_transpose * A).
// Useful for forming Jacobi preconditioners for linear solvers.
void diag_AtA(vnl_vector<T>& result) const;
- //: Set a whole row at once. Much faster.
- void set_row(unsigned int r,
- vcl_vector<int> const& cols,
- vcl_vector<T> const& vals);
+ //: Set a whole row at once. Much faster. Returns *this.
+ vnl_sparse_matrix& set_row(unsigned int r,
+ vcl_vector<int> const& cols,
+ vcl_vector<T> const& vals);
//: Return row as vector of pairs
// Added to aid binary I/O
@@ -164,7 +183,10 @@ class vnl_sparse_matrix
T sum_row(unsigned int r);
//: Useful for normalizing row sums in convolution operators
- void scale_row(unsigned int r, T scale);
+ vnl_sparse_matrix& scale_row(unsigned int r, T scale);
+
+ //: Set all elements to null
+ void clear() { elements.clear(); }
//: Resizes the array to have r rows and c cols -- sets elements to null
void set_size( int r, int c );
@@ -189,6 +211,91 @@ class vnl_sparse_matrix
//: Returns the value pointed to by the internal iterator.
T value() const;
+ //: Comparison
+ bool operator==(vnl_sparse_matrix<T> const& rhs) const;
+
+ //: Inequality
+ bool operator!=(vnl_sparse_matrix<T> const& rhs) const
+ { return !operator==(rhs); }
+
+ //: Unary minus
+ vnl_sparse_matrix<T> operator-() const;
+
+ //: addition
+ vnl_sparse_matrix<T> operator+(vnl_sparse_matrix<T> const& rhs) const;
+
+ //: subtraction
+ vnl_sparse_matrix<T> operator-(vnl_sparse_matrix<T> const& rhs) const;
+
+ //: multiplication
+ vnl_sparse_matrix<T> operator*(vnl_sparse_matrix<T> const& rhs) const;
+
+ //: in-place addition
+ vnl_sparse_matrix<T>& operator+=(vnl_sparse_matrix<T> const& rhs);
+
+ //: in-place subtraction
+ vnl_sparse_matrix<T>& operator-=(vnl_sparse_matrix<T> const& rhs);
+
+ //: in-place multiplication
+ vnl_sparse_matrix<T>& operator*=(vnl_sparse_matrix<T> const& rhs);
+
+ //: scalar multiplication
+ vnl_sparse_matrix<T> operator*(T const& rhs) const;
+
+ //: in-place scalar multiplication
+ vnl_sparse_matrix<T>& operator*=(T const& rhs);
+
+ //: scalar division
+ vnl_sparse_matrix<T> operator/(T const& rhs) const;
+
+ //: in-place scalar division
+ vnl_sparse_matrix<T>& operator/=(T const& rhs);
+
+ //: returns a new sparse matrix, viz. the transpose of this
+ vnl_sparse_matrix<T> transpose() const;
+
+ //: returns a new sparse matrix, viz. the conjugate (or Hermitian) transpose of this
+ vnl_sparse_matrix<T> conjugate_transpose() const;
+
+ //: Sets this matrix to an identity matrix, then returns "*this".
+ // Returning "*this" allows e.g. passing an identity matrix as argument to
+ // a function f, without having to name the constructed matrix:
+ // \code
+ // f(vnl_sparse_matrix<double>(5000,5000).set_identity());
+ // \endcode
+ // Returning "*this" also allows "chaining" two or more operations:
+ // e.g., to set a matrix to identity, then add an other matrix to it:
+ // \code
+ // M.set_identity() += M2;
+ // \endcode
+ // If the matrix is not square, anyhow set main diagonal to 1, the rest to 0.
+ vnl_sparse_matrix& set_identity();
+
+ //: Normalizes each row so it is a unit vector, and returns "*this".
+ // Zero rows are not modified
+ // Returning "*this" allows "chaining" two or more operations:
+ // \code
+ // M.normalize_rows() += M2;
+ // \endcode
+ // Note that there is no method normalize_columns() since its implementation
+ // would be much more inefficient than normalize_rows()!
+ vnl_sparse_matrix& normalize_rows();
+
+ // These three methods are used to implement their operator() variants
+ // They should ideally be protected, but for backward compatibility reasons
+ // they continue to be public for a while ...
+
+ //: Add rhs to this.
+ // Deprecated for direct use: please use operator "+" instead.
+ void add(const vnl_sparse_matrix<T>& rhs, vnl_sparse_matrix<T>& result) const;
+
+ //: Subtract rhs from this.
+ // Deprecated for direct use: please use operator "-" instead.
+ void subtract(const vnl_sparse_matrix<T>& rhs, vnl_sparse_matrix<T>& result) const;
+
+ //: Multiply this*rhs, another sparse matrix.
+ // Deprecated for direct use: please use operator "*" instead.
+ void mult(vnl_sparse_matrix<T> const& rhs, vnl_sparse_matrix<T>& result) const;
protected:
vnl_sparse_matrix_elements elements;
@@ -200,5 +307,15 @@ class vnl_sparse_matrix
mutable bool itr_isreset;
};
+// non-member arithmetical operators.
+
+//:
+// \relatesalso vnl_matrix
+template<class T>
+inline vnl_sparse_matrix<T> operator*(T const& value, vnl_sparse_matrix<T> const& m)
+{
+ return m * value;
+}
+
#endif // vnl_sparse_matrix_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix.txx
index 8ae4ab6bed8df3d4c0e2d393e2cab93150806571..a94889c7622b3e64191b59749179379592eb6336 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix.txx
@@ -5,11 +5,13 @@
// \file
#include "vnl_sparse_matrix.h"
+
#include <vcl_cassert.h>
#include <vcl_algorithm.h>
#include <vcl_iostream.h>
-// #define DEBUG_SPARSE 1
+#include <vnl/vnl_math.h>
+#include <vnl/vnl_complex_traits.h>
#ifdef DEBUG_SPARSE
# include <vnl/vnl_matrix.h>
@@ -62,16 +64,25 @@ template <class T>
void vnl_sparse_matrix<T>::mult(vnl_sparse_matrix<T> const& rhs, vnl_sparse_matrix<T>& result) const
{
assert(rhs.rows() == columns());
+ assert(this != &result); // make sure not to overwrite *this
+ assert(&rhs != &result); // make sure not to overwrite rhs
unsigned int result_rows = rows();
unsigned int result_cols = rhs.columns();
- // Clear result matrix.
- result.elements.clear();
+ // Early return: empty result matrix
+ if (result_rows <= 0 || result_cols <= 0) return;
- // Now give the result matrix enough rows.
- result.elements.resize(result_rows);
- result.rs_ = result_rows;
result.cs_ = result_cols;
+ if (result.rows() != result_rows)
+ {
+ // Clear result matrix.
+ result.elements.clear();
+ // give the result matrix enough rows (but only if not yet correct).
+ result.elements.resize(result_rows);
+ result.rs_ = result_rows;
+ for (unsigned row_id=0; row_id<result_rows; ++row_id)
+ result.elements[row_id] = row();
+ }
// Now, iterate over non-zero rows of this.
for (unsigned row_id=0; row_id<elements.size(); ++row_id) {
@@ -263,27 +274,27 @@ void vnl_sparse_matrix<T>::pre_mult(const vnl_vector<T>& lhs, vnl_vector<T>& res
// Now, iterate over lhs values and rows of rhs
unsigned lhs_col_id = 0;
for (typename vcl_vector<row>::const_iterator rhs_row_iter = elements.begin();
- rhs_row_iter != elements.end();
- ++rhs_row_iter, lhs_col_id++ )
- {
- // Get the row from rhs matrix.
- row const & rhs_row = *rhs_row_iter;
+ rhs_row_iter != elements.end();
+ ++rhs_row_iter, lhs_col_id++ )
+ {
+ // Get the row from rhs matrix.
+ row const & rhs_row = *rhs_row_iter;
- // Skip to next row if empty.
- if (rhs_row.empty()) continue;
+ // Skip to next row if empty.
+ if (rhs_row.empty()) continue;
- // Iterate over values in rhs row
- for (typename row::const_iterator rhs_col_iter = rhs_row.begin();
- rhs_col_iter != rhs_row.end();
- ++rhs_col_iter)
- {
- // Get the element from the row.
- vnl_sparse_matrix_pair<T> const& entry = *rhs_col_iter;
- unsigned const rhs_col_id = entry.first;
+ // Iterate over values in rhs row
+ for (typename row::const_iterator rhs_col_iter = rhs_row.begin();
+ rhs_col_iter != rhs_row.end();
+ ++rhs_col_iter)
+ {
+ // Get the element from the row.
+ vnl_sparse_matrix_pair<T> const& entry = *rhs_col_iter;
+ unsigned const rhs_col_id = entry.first;
- result[ rhs_col_id ] += lhs[ lhs_col_id ] * entry.second;
- }
+ result[ rhs_col_id ] += lhs[ lhs_col_id ] * entry.second;
}
+ }
}
//------------------------------------------------------------
@@ -307,36 +318,36 @@ void vnl_sparse_matrix<T>::add(const vnl_sparse_matrix<T>& rhs,
for (typename vcl_vector<row>::const_iterator row_iter = elements.begin();
row_iter != elements.end();
++row_iter, ++row_id)
- {
- // Get the row from this matrix (lhs).
- row const & this_row = *row_iter;
+ {
+ // Get the row from this matrix (lhs).
+ row const & this_row = *row_iter;
- // Get the new row in the result matrix.
- row& result_row = result.elements[row_id];
+ // Get the new row in the result matrix.
+ row& result_row = result.elements[row_id];
- // Store this into result row.
- result_row = this_row;
+ // Store this into result row.
+ result_row = this_row;
- // If rhs row is empty, we are done.
- if (rhs.empty_row(row_id))
- continue;
+ // If rhs row is empty, we are done.
+ if (rhs.empty_row(row_id))
+ continue;
- // Get the rhs row.
- row const& rhs_row = rhs.elements[row_id];
+ // Get the rhs row.
+ row const& rhs_row = rhs.elements[row_id];
- // Iterate over the rhs row.
- for (typename row::const_iterator col_iter = rhs_row.begin();
- col_iter != rhs_row.end();
- ++col_iter)
- {
- // Get the element from the row.
- vnl_sparse_matrix_pair<T> const& entry = *col_iter;
- unsigned const col_id = entry.first;
+ // Iterate over the rhs row.
+ for (typename row::const_iterator col_iter = rhs_row.begin();
+ col_iter != rhs_row.end();
+ ++col_iter)
+ {
+ // Get the element from the row.
+ vnl_sparse_matrix_pair<T> const& entry = *col_iter;
+ unsigned const col_id = entry.first;
- // So we are at (row_id,col_id) in rhs matrix.
- result(row_id,col_id) += entry.second;
- }
+ // So we are at (row_id,col_id) in rhs matrix.
+ result(row_id,col_id) += entry.second;
}
+ }
}
//------------------------------------------------------------
@@ -360,36 +371,36 @@ void vnl_sparse_matrix<T>::subtract(const vnl_sparse_matrix<T>& rhs,
for (typename vcl_vector<row>::const_iterator row_iter = elements.begin();
row_iter != elements.end();
++row_iter, ++row_id)
- {
- // Get the row from this matrix (lhs).
- row const& this_row = *row_iter;
+ {
+ // Get the row from this matrix (lhs).
+ row const& this_row = *row_iter;
- // Get the new row in the result matrix.
- row& result_row = result.elements[row_id];
+ // Get the new row in the result matrix.
+ row& result_row = result.elements[row_id];
- // Store this into result row.
- result_row = this_row;
+ // Store this into result row.
+ result_row = this_row;
- // If rhs row is empty, we are done.
- if (rhs.empty_row(row_id))
- continue;
+ // If rhs row is empty, we are done.
+ if (rhs.empty_row(row_id))
+ continue;
- // Get the rhs row.
- row const& rhs_row = rhs.elements[row_id];
+ // Get the rhs row.
+ row const& rhs_row = rhs.elements[row_id];
- // Iterate over the rhs row.
- for (typename row::const_iterator col_iter = rhs_row.begin();
- col_iter != rhs_row.end();
- ++col_iter)
- {
- // Get the element from the row.
- vnl_sparse_matrix_pair<T> const& entry = *col_iter;
- unsigned const col_id = entry.first;
+ // Iterate over the rhs row.
+ for (typename row::const_iterator col_iter = rhs_row.begin();
+ col_iter != rhs_row.end();
+ ++col_iter)
+ {
+ // Get the element from the row.
+ vnl_sparse_matrix_pair<T> const& entry = *col_iter;
+ unsigned const col_id = entry.first;
- // So we are at (row_id,col_id) in rhs matrix.
- result(row_id,col_id) -= entry.second;
- }
+ // So we are at (row_id,col_id) in rhs matrix.
+ result(row_id,col_id) -= entry.second;
}
+ }
}
//------------------------------------------------------------
@@ -400,16 +411,69 @@ T& vnl_sparse_matrix<T>::operator()(unsigned int r, unsigned int c)
assert((r < rows()) && (c < columns()));
row& rw = elements[r];
typename row::iterator ri;
- for (ri = rw.begin(); (ri != rw.end()) && ((*ri).first < c); ++ri);
+ for (ri = rw.begin(); (ri != rw.end()) && ((*ri).first < c); ++ri)
+ /*nothing*/;
if ((ri == rw.end()) || ((*ri).first != c)) {
// Add new column to the row.
- ri = rw.insert(ri, vnl_sparse_matrix_pair<T>(c,T(0)));
+ ri = rw.insert(ri, vnl_sparse_matrix_pair<T>(c,T()));
}
return (*ri).second;
}
+//------------------------------------------------------------
+//: Get the value of an entry in the matrix.
+template <class T>
+T vnl_sparse_matrix<T>::operator()(unsigned int r, unsigned int c) const
+{
+ assert((r < rows()) && (c < columns()));
+ row const& rw = elements[r];
+ typename row::const_iterator ri = rw.begin();
+ while (ri != rw.end() && (*ri).first < c)
+ ++ri;
+ if (ri == rw.end() || (*ri).first != c)
+ return T(); // uninitialised value (default constructor) is returned
+ else
+ return (*ri).second;
+}
+
+//------------------------------------------------------------
+//: Get an entry in the matrix.
+// This is the "const" version of operator().
+template <class T>
+T vnl_sparse_matrix<T>::get(unsigned int r, unsigned int c) const
+{
+ assert((r < rows()) && (c < columns()));
+ row const& rw = elements[r];
+ typename row::const_iterator ri = rw.begin();
+ while (ri != rw.end() && (*ri).first < c)
+ ++ri;
+ if (ri == rw.end() || (*ri).first != c)
+ return T(); // uninitialised value (default constructor) is returned
+ else
+ return (*ri).second;
+}
+
+//------------------------------------------------------------
+//: Put (i.e., add or overwrite) an entry into the matrix.
+template <class T>
+void vnl_sparse_matrix<T>::put(unsigned int r, unsigned int c, T v)
+{
+ assert((r < rows()) && (c < columns()));
+ row& rw = elements[r];
+ typename row::iterator ri = rw.begin();
+ while (ri != rw.end() && (*ri).first < c)
+ ++ri;
+
+ if (ri == rw.end() || (*ri).first != c) {
+ // Add new column to the row.
+ rw.insert(ri, vnl_sparse_matrix_pair<T>(c,v));
+ }
+ else
+ (*ri).second = v;
+}
+
template <class T>
void vnl_sparse_matrix<T>::diag_AtA(vnl_vector<T> & result) const
{
@@ -432,23 +496,26 @@ void vnl_sparse_matrix<T>::diag_AtA(vnl_vector<T> & result) const
//: Set row in the matrix.
template <class T>
-void vnl_sparse_matrix<T>::set_row(unsigned int r,
- vcl_vector<int> const& cols,
- vcl_vector<T> const& vals)
+vnl_sparse_matrix<T>&
+vnl_sparse_matrix<T>::set_row(unsigned int r,
+ vcl_vector<int> const& colz,
+ vcl_vector<T> const& vals)
{
assert (r < rows());
- assert (cols.size() == vals.size());
+ assert (colz.size() == vals.size());
row& rw = elements[r];
- if (rw.size() != cols.size()) rw = row(cols.size());
- for (unsigned int i=0; i < cols.size(); ++i)
- rw[i] = vnl_sparse_matrix_pair<T>(cols[i], vals[i]);
+ if (rw.size() != colz.size()) rw = row(colz.size());
+ for (unsigned int i=0; i < colz.size(); ++i)
+ rw[i] = vnl_sparse_matrix_pair<T>(colz[i], vals[i]);
typedef typename vnl_sparse_matrix_pair<T>::less less;
vcl_sort(rw.begin(), rw.end(), less());
+ return *this;
}
template <class T>
-vnl_sparse_matrix<T>& vnl_sparse_matrix<T>::vcat(vnl_sparse_matrix<T> const& A)
+vnl_sparse_matrix<T>&
+vnl_sparse_matrix<T>::vcat(vnl_sparse_matrix<T> const& A)
{
if (rs_ == 0) {
rs_ = A.rs_;
@@ -479,12 +546,14 @@ T vnl_sparse_matrix<T>::sum_row(unsigned int r)
}
template <class T>
-void vnl_sparse_matrix<T>::scale_row(unsigned int r, T scale)
+vnl_sparse_matrix<T>&
+vnl_sparse_matrix<T>::scale_row(unsigned int r, T scale)
{
assert(r < rows());
row& rw = elements[r];
for (typename row::iterator ri = rw.begin(); ri != rw.end(); ++ri)
(*ri).second *= scale;
+ return *this;
}
//------------------------------------------------------------
@@ -513,21 +582,22 @@ template <class T>
void vnl_sparse_matrix<T>::resize( int r, int c)
{
unsigned int oldCs = cs_;
-
+
rs_ = r;
cs_ = c;
elements.resize(r);
- // If the array has fewer columns now, we also need to cut them out
- if (oldCs > cs_){
- for (unsigned int r = 0; r < elements.size(); r++){
- row& rw = elements[r];
+ // If the array has fewer columns now, we also need to cut them out
+ if (oldCs > cs_) {
+ for (unsigned int i = 0; i < elements.size(); ++i) {
+ row& rw = elements[i];
typename row::iterator iter;
- for (iter = rw.begin(); iter != rw.end() && (*iter).first<cs_ ; ++iter);
+ for (iter = rw.begin(); iter != rw.end() && (*iter).first<cs_ ; ++iter)
+ /*nothing*/;
if (iter != rw.end()) rw.erase(iter,rw.end());
}
}
-
+
reset(); // reset iterator
}
@@ -552,10 +622,11 @@ bool vnl_sparse_matrix<T>::next() const
return false;
if ( itr_isreset ) {
- // itr_cur is not pointing to a entry
+ // itr_cur is not pointing to an entry
itr_row = 0;
itr_isreset = false;
- } else {
+ }
+ else {
// itr_cur is pointing to an entry.
// Try to move to next entry in current row.
itr_cur++;
@@ -604,6 +675,301 @@ T vnl_sparse_matrix<T>::value() const
return (*itr_cur).second;
}
+//------------------------------------------------------------
+//: Comparison
+//
+template <class T>
+bool vnl_sparse_matrix<T>::operator==(vnl_sparse_matrix<T> const& rhs) const
+{
+ // first of all, sizes must match:
+ if (rhs.rows() != rows() || rhs.columns() != columns()) {
+#ifdef DEBUG_SPARSE
+ vcl_cerr << "Sizes are different: " << rows() << 'x' << columns() << ' ' << rhs.rows() << 'x' << rhs.columns() << '\n';
+#endif
+ return false;
+ }
+
+ // Now, iterate over non-zero rows of this and of rhs.
+ unsigned int row_id = 0;
+ for (typename vcl_vector<row>::const_iterator row_iter = elements.begin();
+ row_iter != elements.end();
+ ++row_iter, ++row_id)
+ {
+ // Get the row from this matrix (lhs).
+ row const& this_row = *row_iter;
+
+ // Get the rhs row.
+ row const& rhs_row = rhs.elements[row_id];
+
+ // first of all, row sizes must match:
+ if (rhs_row.size() != this_row.size())
+ return false;
+
+ // Iterate over the rhs row.
+ for (typename row::const_iterator col_iter = rhs_row.begin();
+ col_iter != rhs_row.end();
+ ++col_iter)
+ {
+ // Get the element from the row.
+ vnl_sparse_matrix_pair<T> const& entry = *col_iter;
+ unsigned const col_id = entry.first;
+
+ // So we are at (row_id,col_id) in rhs matrix.
+ if (get(row_id,col_id) != entry.second)
+ return false;
+ }
+ }
+ // if we reach this point, all comparisons succeeded:
+ return true;
+}
+
+//: Unary minus
+template <class T>
+vnl_sparse_matrix<T> vnl_sparse_matrix<T>::operator-() const
+{
+ // The matrix to be returned:
+ vnl_sparse_matrix<T> result(rows(), columns());
+
+ // Iterate over non-zero rows of this matrix.
+ unsigned int row_id = 0;
+ for (typename vcl_vector<row>::const_iterator row_iter = elements.begin();
+ row_iter != elements.end();
+ ++row_iter, ++row_id)
+ {
+ // Get the row.
+ row const& this_row = *row_iter;
+
+ // Iterate over the row.
+ for (typename row::const_iterator col_iter = this_row.begin();
+ col_iter != this_row.end();
+ ++col_iter)
+ {
+ // Assign the corresponding result element.
+ vnl_sparse_matrix_pair<T> const& entry = *col_iter;
+ result(row_id, entry.first) = - entry.second;
+ }
+ }
+ return result;
+}
+
+//: addition
+template <class T>
+vnl_sparse_matrix<T> vnl_sparse_matrix<T>::operator+(vnl_sparse_matrix<T> const& rhs) const
+{
+ vnl_sparse_matrix<T> result(rows(), columns());
+ add(rhs, result);
+ return result;
+}
+
+//: subtraction
+template <class T>
+vnl_sparse_matrix<T> vnl_sparse_matrix<T>::operator-(vnl_sparse_matrix<T> const& rhs) const
+{
+ vnl_sparse_matrix<T> result(rows(), columns());
+ subtract(rhs, result);
+ return result;
+}
+
+//: multiplication
+template <class T>
+vnl_sparse_matrix<T> vnl_sparse_matrix<T>::operator*(vnl_sparse_matrix<T> const& rhs) const
+{
+ vnl_sparse_matrix<T> result(rows(), rhs.columns());
+ mult(rhs, result);
+ return result;
+}
+
+//: in-place scalar multiplication
+template <class T>
+vnl_sparse_matrix<T>& vnl_sparse_matrix<T>::operator*=(T const& rhs)
+{
+ // Iterate over non-zero rows of this matrix.
+ for (typename vcl_vector<row>::iterator row_iter = elements.begin();
+ row_iter != elements.end();
+ ++row_iter)
+ {
+ // Get the row.
+ row& this_row = *row_iter;
+
+ // Iterate over the row.
+ for (typename row::iterator col_iter = this_row.begin();
+ col_iter != this_row.end();
+ ++col_iter)
+ {
+ // Change the corresponding element.
+ col_iter->second *= rhs;
+ }
+ }
+ return *this;
+}
+
+//: in-place scalar division
+template <class T>
+vnl_sparse_matrix<T>& vnl_sparse_matrix<T>::operator/=(T const& rhs)
+{
+ // Iterate over non-zero rows of this matrix.
+ for (typename vcl_vector<row>::iterator row_iter = elements.begin();
+ row_iter != elements.end();
+ ++row_iter)
+ {
+ // Get the row.
+ row& this_row = *row_iter;
+
+ // Iterate over the row.
+ for (typename row::iterator col_iter = this_row.begin();
+ col_iter != this_row.end();
+ ++col_iter)
+ {
+ // Change the corresponding element.
+ col_iter->second /= rhs;
+ }
+ }
+ return *this;
+}
+
+//: scalar multiplication
+template <class T>
+vnl_sparse_matrix<T> vnl_sparse_matrix<T>::operator*(T const& rhs) const
+{
+ vnl_sparse_matrix<T> result = *this;
+ return result *= rhs;
+}
+
+//: scalar division
+template <class T>
+vnl_sparse_matrix<T> vnl_sparse_matrix<T>::operator/(T const& rhs) const
+{
+ vnl_sparse_matrix<T> result = *this;
+ return result /= rhs;
+}
+
+//: in-place addition
+template <class T>
+vnl_sparse_matrix<T>& vnl_sparse_matrix<T>::operator+=(vnl_sparse_matrix<T> const& rhs)
+{
+ return *this = operator+(rhs);
+}
+
+//: in-place subtraction
+template <class T>
+vnl_sparse_matrix<T>& vnl_sparse_matrix<T>::operator-=(vnl_sparse_matrix<T> const& rhs)
+{
+ return *this = operator-(rhs);
+}
+
+//: in-place multiplication
+template <class T>
+vnl_sparse_matrix<T>& vnl_sparse_matrix<T>::operator*=(vnl_sparse_matrix<T> const& rhs)
+{
+ return *this = operator*(rhs);
+}
+
+//: Make each row of the matrix have unit norm.
+// All-zero rows are ignored.
+template<class T>
+vnl_sparse_matrix<T>& vnl_sparse_matrix<T>::normalize_rows()
+{
+ typedef typename vnl_numeric_traits<T>::abs_t Abs_t;
+ typedef typename vnl_numeric_traits<T>::real_t Real_t;
+ typedef typename vnl_numeric_traits<Real_t>::abs_t abs_real_t;
+
+ // Iterate through the matrix rows, and normalize one at a time:
+ for (typename vcl_vector<row>::iterator row_iter = elements.begin();
+ row_iter != elements.end();
+ ++row_iter)
+ {
+ // Get the row.
+ row& this_row = *row_iter;
+
+ Abs_t norm(0); // double will not do for all types.
+
+ // Iterate over the row
+ for (typename row::iterator col_iter = this_row.begin();
+ col_iter != this_row.end();
+ ++col_iter)
+ {
+ vnl_sparse_matrix_pair<T>& entry = *col_iter;
+ norm += vnl_math_squared_magnitude(entry.second);
+ }
+ if (norm != 0) {
+ abs_real_t scale = abs_real_t(1)/(vcl_sqrt((abs_real_t)norm));
+ // Iterate again over the row
+ for (typename row::iterator col_iter = this_row.begin();
+ col_iter != this_row.end();
+ ++col_iter)
+ {
+ vnl_sparse_matrix_pair<T>& entry = *col_iter;
+ entry.second = T(Real_t(entry.second) * scale);
+ }
+ }
+ }
+ return *this;
+}
+
+//: Fill this matrix with 1s on the main diagonal and 0s elsewhere.
+template<class T>
+vnl_sparse_matrix<T>& vnl_sparse_matrix<T>::set_identity()
+{
+ // Iterate through the matrix rows, and set one at a time:
+ unsigned int rownum = 0;
+ for (typename vcl_vector<row>::iterator row_iter = elements.begin();
+ row_iter != elements.end() && rownum < cols();
+ ++row_iter, ++rownum)
+ {
+ row& rw = *row_iter;
+ rw.clear();
+ rw[0] = vnl_sparse_matrix_pair<T>(rownum,T(1));
+ }
+ return *this;
+}
+
+//: returns a new sparse matrix, viz. the transpose of this
+template<class T>
+vnl_sparse_matrix<T> vnl_sparse_matrix<T>::transpose() const
+{
+ vnl_sparse_matrix<T> result(cols(), rows());
+ unsigned int rownum = 0; // row number in this matrix
+ // iterate through the rows of this matrix,
+ // and add every element thus found to the new result matrix
+ for (typename vcl_vector<row>::const_iterator row_iter = elements.begin();
+ row_iter != elements.end();
+ ++row_iter, ++rownum)
+ {
+ row const& this_row = *row_iter;
+ for (typename row::const_iterator col_iter = this_row.begin();
+ col_iter != this_row.end();
+ ++col_iter)
+ {
+ vnl_sparse_matrix_pair<T> entry = *col_iter; // new copy of element
+ row& rw = result.elements[entry.first];
+ entry.first = rownum; // modify element: its column number is now rownum
+ rw.insert(rw.end(), entry); // insert at the end of the row
+ }
+ }
+ return result;
+}
+
+//: returns a new sparse matrix, viz. the conjugate (or Hermitian) transpose of this
+template<class T>
+vnl_sparse_matrix<T> vnl_sparse_matrix<T>::conjugate_transpose() const
+{
+ vnl_sparse_matrix<T> result(transpose());
+ for (typename vcl_vector<row>::iterator row_iter = result.elements.begin();
+ row_iter != result.elements.end();
+ ++row_iter)
+ {
+ row& this_row = *row_iter;
+ for (typename row::iterator col_iter = this_row.begin();
+ col_iter != this_row.end();
+ ++col_iter)
+ {
+ vnl_sparse_matrix_pair<T>& entry = *col_iter;
+ entry.second = vnl_complex_traits<T>::conjugate(entry.second);
+ }
+ }
+ return result;
+}
+
#define VNL_SPARSE_MATRIX_INSTANTIATE(T) \
template class vnl_sparse_matrix<T >
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix_linear_system.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix_linear_system.h
index 3cb76729b6c8a01ab75e21232b042376ef6e6652..2072174f4ed506012939de2c5dcf9dab718d5b94 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix_linear_system.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sparse_matrix_linear_system.h
@@ -32,7 +32,7 @@ class vnl_sparse_matrix_linear_system : public vnl_linear_system
//::Constructor from vnl_sparse_matrix<double> for system Ax = b
// Keeps a reference to the original sparse matrix A and vector b so DO NOT DELETE THEM!!
vnl_sparse_matrix_linear_system(vnl_sparse_matrix<T> const& A, vnl_vector<T> const& b) :
- vnl_linear_system(A.columns(), A.rows()), A_(A), b_(b) {}
+ vnl_linear_system(A.columns(), A.rows()), A_(A), b_(b), jacobi_precond_() {}
//: Implementations of the vnl_linear_system virtuals.
void multiply(vnl_vector<double> const& x, vnl_vector<double> & b) const;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sse.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sse.h
index 84a55b7b8cc8409eb68886ba067318a475b7abbf..5af0f7c03742511f06187d3e67c81b192f00ee7f 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sse.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sse.h
@@ -1,26 +1,30 @@
#ifndef vnl_sse_h_
#define vnl_sse_h_
-
-//! \file
-// \author Kieran O'Mahony
-// \date Sep 2007
-// \brief Support for Streaming SIMD Extensions to speed up vector arithmetic
-
-#include <vcl_compiler.h> //for macro decisions based on compiler type
-#include <vxl_config.h> // for checking supported integer data types
-#include <vcl_cfloat.h> // for DBL_MAX and FLT_MAX
-
-#include <vnl/vnl_config.h> //is SSE enabled
-#include <vnl/vnl_alloc.h> //is SSE enabled
-
-//some caveats...
+//:
+// \file
+// \author Kieran O'Mahony
+// \date Sep 2007
+// \brief Support for Streaming SIMD Extensions to speed up vector arithmetic
+// \verbatim
+// Modifications
+// 2009-03-30 Peter Vanroose - Added arg_min() & arg_max() and reimplemented min() & max()
+// \endverbatim
+
+#include <vcl_compiler.h> // for macro decisions based on compiler type
+#include <vxl_config.h> // for checking supported integer data types
+#include <vcl_cfloat.h> // for DBL_MAX and FLT_MAX
+
+#include <vnl/vnl_config.h> // is SSE enabled
+#include <vnl/vnl_alloc.h> // is SSE enabled
+
+// some caveats...
// - Due to the way vnl_matrix is represented in memory cannot guarantee 16-byte alignment,
// therefore have to use slower unaligned loading intrinsics for matrices.
// - The GCC 3.4 intrinsics seem to be horrendously slow...
+
// - On Mac OS X, in order to support Universal Binaries, we do not consider it a hard
// error if VNL_CONFIG_ENABLE_SSE2 is true for PowerPC builds. PowerPC obviously does
// not support SSE2, so we simply redefine it to false.
-
#if VNL_CONFIG_ENABLE_SSE2
# if defined(__APPLE__) && (defined(__ppc__) || defined(__ppc64__))
# undef VNL_CONFIG_ENABLE_SSE2
@@ -28,71 +32,88 @@
# elif !VXL_HAS_EMMINTRIN_H
# error "Required file emmintrin.h for SSE2 not found"
# else
-# include <emmintrin.h> //sse 2 intrinsics
+# include <emmintrin.h> // sse 2 intrinsics
# endif
#endif
-//Try and use compiler instructions for forcing inlining if possible
-//Also instruction for aligning stack memory is compiler dependent
-#if defined(VCL_GCC) && ! defined(VCL_GCC_3)
-# define VNL_SSE_FORCE_INLINE __attribute__((always_inline)) inline
+// Try and use compiler instructions for forcing inlining if possible
+// Also instruction for aligning stack memory is compiler dependent
+#if defined(VCL_GCC)
+// With attribute always_inline, gcc can give an error if a function
+// cannot be inlined, so it is disabled. Problem seen on 64 bit
+// platforms with vcl_vector<vnl_rational>.
+# define VNL_SSE_FORCE_INLINE /* __attribute__((always_inline)) */ inline
# define VNL_SSE_STACK_ALIGNED(x) __attribute__((aligned(x)))
#elif defined VCL_VC || defined VCL_ICC
# define VNL_SSE_FORCE_INLINE __forceinline
# define VNL_SSE_STACK_ALIGNED(x) __declspec(align(x))
#else
# define VNL_SSE_FORCE_INLINE inline
-# define VNL_SSE_STACK_ALIGNED(x)
-# define VNL_SSE_STACK_STORE(pf) _mm_storeu_##pf //no stack alignment so use unaligned store (slower!)
+# define VNL_SSE_STACK_ALIGNED(x)
+# define VNL_SSE_STACK_STORE(pf) _mm_storeu_##pf // no stack alignment so use unaligned store (slower!)
#endif
+static VNL_SSE_FORCE_INLINE void vnl_sse_free( void* v, unsigned n, unsigned s )
+{
+#if VNL_CONFIG_ENABLE_SSE2 && VXL_HAS_MM_MALLOC
+ (void)n;
+ (void)s;
+ _mm_free(v);
+#elif VNL_CONFIG_ENABLE_SSE2 && VXL_HAS_ALIGNED_MALLOC
+ (void)n;
+ (void)s;
+ _aligned_free(v);
+#elif VNL_CONFIG_ENABLE_SSE2 && VXL_HAS_MINGW_ALIGNED_MALLOC
+ (void)n;
+ (void)s;
+ __mingw_aligned_free(v);
+#elif VNL_CONFIG_ENABLE_SSE2 && VXL_HAS_POSIX_MEMALIGN
+ (void)n;
+ (void)s;
+ vcl_free(v);
+#else // sse2 disabled or could not get memory alignment support, use slower unaligned based intrinsics
+# if VNL_CONFIG_THREAD_SAFE
+ (void)n;
+ (void)s;
+ delete [] static_cast<char*>(v);
+# else
+ if (v) vnl_alloc::deallocate(v, (n == 0) ? 8 : (n * s));
+# endif
+#endif
+}
+
+
+# define VNL_SSE_FREE(v,n,s) vnl_sse_free(v,n,s);
+
// SSE operates faster with 16 byte aligned memory addresses.
-// Check what memory alignment function is supported
+// Check what memory alignment function is supported
#if VNL_CONFIG_ENABLE_SSE2 && VXL_HAS_MM_MALLOC
# define VNL_SSE_ALLOC(n,s,a) _mm_malloc(n*s,a)
-# define VNL_SSE_FREE(v,n,s) _mm_free(v)
-//! Custom memory deallocation function to free 16 byte aligned of data
-VNL_SSE_FORCE_INLINE void vnl_sse_dealloc(void* mem, unsigned , unsigned ) { VNL_SSE_FREE(mem,n,size); }
#elif VNL_CONFIG_ENABLE_SSE2 && VXL_HAS_ALIGNED_MALLOC
# include <malloc.h>
# define VNL_SSE_ALLOC(n,s,a) _aligned_malloc(n*s,a)
-# define VNL_SSE_FREE(v,n,s) _aligned_free(v)
-//! Custom memory deallocation function to free 16 byte aligned of data
-VNL_SSE_FORCE_INLINE void vnl_sse_dealloc(void* mem, unsigned , unsigned ) { VNL_SSE_FREE(mem,n,size); }
#elif VNL_CONFIG_ENABLE_SSE2 && VXL_HAS_MINGW_ALIGNED_MALLOC
# include <malloc.h>
# define VNL_SSE_ALLOC(n,s,a) __mingw_aligned_malloc(n*s,a)
-# define VNL_SSE_FREE(v,n,s) __mingw_aligned_free(v)
-//! Custom memory deallocation function to free 16 byte aligned of data
-VNL_SSE_FORCE_INLINE void vnl_sse_dealloc(void* mem, unsigned , unsigned ) { VNL_SSE_FREE(mem,n,size); }
#elif VNL_CONFIG_ENABLE_SSE2 && VXL_HAS_POSIX_MEMALIGN
# include <vcl_cstdlib.h>
# define VNL_SSE_ALLOC(n,s,a) memalign(a,n*s)
-# define VNL_SSE_FREE(v,n,s) free(v)
-//! Custom memory deallocation function to free 16 byte aligned of data
-VNL_SSE_FORCE_INLINE void vnl_sse_dealloc(void* mem, unsigned , unsigned ) { VNL_SSE_FREE(mem,n,size); }
-#else //sse2 disabled or could not get memory alignment support, use slower unaligned based intrinsics
+#else // sse2 disabled or could not get memory alignment support, use slower unaligned based intrinsics
# define VNL_SSE_HEAP_STORE(pf) _mm_storeu_##pf
# define VNL_SSE_HEAP_LOAD(pf) _mm_loadu_##pf
# if VNL_CONFIG_THREAD_SAFE
# define VNL_SSE_ALLOC(n,s,a) new char[n*s]
-# define VNL_SSE_FREE(v,n,s) delete [] static_cast<char*>(v)
-//! Custom memory deallocation function to free 16 byte aligned of data
-VNL_SSE_FORCE_INLINE void vnl_sse_dealloc(void* mem, unsigned , unsigned ) { VNL_SSE_FREE(mem,n,size); }
# else
# define VNL_SSE_ALLOC(n,s,a) vnl_alloc::allocate((n == 0) ? 8 : (n * s));
-# define VNL_SSE_FREE(v,n,s) if (v) vnl_alloc::deallocate(v, (n == 0) ? 8 : (n * s));
-//! Custom memory deallocation function to free 16 byte aligned of data
-VNL_SSE_FORCE_INLINE void vnl_sse_dealloc(void* mem, unsigned n, unsigned size) { VNL_SSE_FREE(mem,n,size); }
# endif
#endif
// Stack memory can be aligned -> use SSE aligned store
#ifndef VNL_SSE_STACK_STORE
-# define VNL_SSE_STACK_STORE(pf) _mm_store_##pf
+# define VNL_SSE_STACK_STORE(pf) _mm_store_##pf
#endif
// Heap memory can be aligned -> use SSE aligned load & store
@@ -101,709 +122,766 @@ VNL_SSE_FORCE_INLINE void vnl_sse_dealloc(void* mem, unsigned n, unsigned size)
# define VNL_SSE_HEAP_LOAD(pf) _mm_load_##pf
#endif
-//! Custom memory allocation function to force 16 byte alignment of data
-VNL_SSE_FORCE_INLINE void* vnl_sse_alloc(unsigned n, unsigned size)
+//: Custom memory allocation function to force 16 byte alignment of data
+VNL_SSE_FORCE_INLINE void* vnl_sse_alloc(vcl_size_t n, unsigned size)
{
return VNL_SSE_ALLOC(n,size,16);
}
+//: Custom memory deallocation function to free 16 byte aligned of data
+VNL_SSE_FORCE_INLINE void vnl_sse_dealloc(void* mem, vcl_size_t n, unsigned size)
+{
+ VNL_SSE_FREE(mem,n,size);
+}
-//avoid inlining when debugging
+// avoid inlining when debugging
#ifndef NDEBUG
#undef VNL_SSE_FORCE_INLINE
-#define VNL_SSE_FORCE_INLINE
+#define VNL_SSE_FORCE_INLINE
#endif
-
-//! Bog standard (no sse) implementation for non sse enabled hardware and any type
-// which doesn't have a template specialisation.
-template <class T>
-class vnl_sse {
- public:
-
- static VNL_SSE_FORCE_INLINE void element_product(const T* x, const T* y, T* r, unsigned n)
- {
- for(unsigned i = 0; i < n; ++i)
- r[i] = x[i] * y[i];
- }
- static VNL_SSE_FORCE_INLINE T dot_product(const T* x, const T* y, unsigned n)
- {
- T sum(0);
- for(unsigned i = 0; i < n; ++i)
- sum += x[i] * y[i];
- return sum;
- }
-
- static VNL_SSE_FORCE_INLINE T euclid_dist_sq(const T* x, const T* y, unsigned n)
- {
- //IMS: Unable to optimise this any further for MSVC compiler
- T sum(0);
- #ifdef VCL_VC_6
- for (unsigned i=0; i<n; ++i)
- {
- const T diff = x[i] - y[i];
- sum += diff*diff;
- }
- #else
- --x;
- --y;
- while (n!=0)
- {
- const T diff = x[n] - y[n];
- sum += diff*diff;
- --n;
- }
- #endif
- return sum;
- }
-
- static VNL_SSE_FORCE_INLINE void vector_x_matrix(const T* v, const T* m, T* r, unsigned rows, unsigned cols)
- {
- for (unsigned int j=0; j<cols; ++j) {
- T som(0);
- for (unsigned int i=0; i<rows; ++i)
- som += (m+i*cols)[j] * v[i];
- r[j] = som;
- }
- }
-
- static VNL_SSE_FORCE_INLINE void matrix_x_vector(const T* m, const T* v, T* r, unsigned rows, unsigned cols)
+//: Bog standard (no sse) implementation for non sse enabled hardware and any type which doesn't have a template specialisation.
+template <class T>
+class vnl_sse
+{
+ public:
+ static VNL_SSE_FORCE_INLINE void element_product(const T* x, const T* y, T* r, unsigned n)
+ {
+ for (unsigned i = 0; i < n; ++i)
+ r[i] = x[i] * y[i];
+ }
+
+ static VNL_SSE_FORCE_INLINE T dot_product(const T* x, const T* y, unsigned n)
+ {
+ T sum(0);
+ for (unsigned i = 0; i < n; ++i)
+ sum += x[i] * y[i];
+ return sum;
+ }
+
+ static VNL_SSE_FORCE_INLINE T euclid_dist_sq(const T* x, const T* y, unsigned n)
+ {
+ // IMS: Unable to optimise this any further for MSVC compiler
+ T sum(0);
+ #ifdef VCL_VC_6
+ for (unsigned i=0; i<n; ++i)
{
- for (unsigned int i=0; i<rows; ++i) {
- T som(0);
- for (unsigned int j=0; j<cols; ++j)
- som += (m+i*cols)[j] * v[j];
- r[i] = som;
- }
+ const T diff = x[i] - y[i];
+ sum += diff*diff;
}
-
- static VNL_SSE_FORCE_INLINE T sum(const T* v, unsigned n)
+ #else
+ --x;
+ --y;
+ while (n!=0)
{
- T tot(0);
- for (unsigned i = 0; i < n; ++i)
- tot += *v++;
- return tot;
+ const T diff = x[n] - y[n];
+ sum += diff*diff;
+ --n;
}
-
- static VNL_SSE_FORCE_INLINE T max(const T* v, unsigned n)
- {
- T tmp = v[0];
- for (unsigned i=1; i<n; ++i)
- if (v[i] > tmp)
- tmp = v[i];
- return tmp;
+ #endif
+ return sum;
+ }
+
+ static VNL_SSE_FORCE_INLINE void vector_x_matrix(const T* v, const T* m, T* r, unsigned rows, unsigned cols)
+ {
+ for (unsigned int j=0; j<cols; ++j) {
+ T som(0);
+ for (unsigned int i=0; i<rows; ++i)
+ som += (m+i*cols)[j] * v[i];
+ r[j] = som;
}
-
- static VNL_SSE_FORCE_INLINE T min(const T* v, unsigned n)
- {
- T tmp = v[0];
- for (unsigned i=1; i<n; ++i)
- if (v[i] < tmp)
- tmp = v[i];
- return tmp;
+ }
+
+ static VNL_SSE_FORCE_INLINE void matrix_x_vector(const T* m, const T* v, T* r, unsigned rows, unsigned cols)
+ {
+ for (unsigned int i=0; i<rows; ++i) {
+ T som(0);
+ for (unsigned int j=0; j<cols; ++j)
+ som += (m+i*cols)[j] * v[j];
+ r[i] = som;
}
-
+ }
+
+ static VNL_SSE_FORCE_INLINE T sum(const T* v, unsigned n)
+ {
+ T tot(0);
+ for (unsigned i = 0; i < n; ++i)
+ tot += *v++;
+ return tot;
+ }
+
+ static VNL_SSE_FORCE_INLINE T max(const T* v, unsigned n)
+ {
+ if (n==0) return T(0); // the maximum of an empty set is undefined
+ T tmp = *v;
+ while (--n > 0)
+ if (*++v > tmp)
+ tmp = *v;
+ return tmp;
+ }
+
+ static VNL_SSE_FORCE_INLINE T min(const T* v, unsigned n)
+ {
+ if (n==0) return T(0); // the minimum of an empty set is undefined
+ T tmp = *v;
+ while (--n > 0)
+ if (*++v < tmp)
+ tmp = *v;
+ return tmp;
+ }
+
+ static VNL_SSE_FORCE_INLINE unsigned arg_max(const T* v, unsigned n)
+ {
+ if (n==0) return unsigned(-1); // the maximum of an empty set is undefined
+ T tmp = *v;
+ unsigned idx = 0;
+ for (unsigned i=1; i<n; ++i)
+ if (*++v > tmp)
+ tmp = *v, idx = i;
+ return idx;
+ }
+
+ static VNL_SSE_FORCE_INLINE unsigned arg_min(const T* v, unsigned n)
+ {
+ if (n==0) return unsigned(-1); // the minimum of an empty set is undefined
+ T tmp = *v;
+ unsigned idx = 0;
+ for (unsigned i=1; i<n; ++i)
+ if (*++v < tmp)
+ tmp = *v, idx = i;
+ return idx;
+ }
};
#if VNL_CONFIG_ENABLE_SSE2
-//! SSE2 implementation for double precision floating point (64 bit)
+//: SSE2 implementation for double precision floating point (64 bit)
VCL_DEFINE_SPECIALIZATION
-class vnl_sse<double> {
- public:
-
- static VNL_SSE_FORCE_INLINE void element_product(const double* x, const double* y, double* r, unsigned n)
- {
- switch(n % 4)
+class vnl_sse<double>
+{
+ public:
+ static VNL_SSE_FORCE_INLINE void element_product(const double* x, const double* y, double* r, unsigned n)
+ {
+ switch (n%4)
+ {
+ // do scalar (single value) load, multiply and store for end elements
+ case 3: --n; _mm_store_sd(r+n,_mm_mul_sd(_mm_load_sd(x+n),_mm_load_sd(y+n)));
+ case 2: --n; _mm_store_sd(r+n,_mm_mul_sd(_mm_load_sd(x+n),_mm_load_sd(y+n)));
+ case 1: --n; _mm_store_sd(r+n,_mm_mul_sd(_mm_load_sd(x+n),_mm_load_sd(y+n)));
+ case 0: ;
+ }
+
+ // load, multiply and store two doubles at a time
+ // loop unroll to handle 4
+ if (vcl_ptrdiff_t(x)%16 || vcl_ptrdiff_t(y)%16 || vcl_ptrdiff_t(r)%16)
+ // unaligned case
+ for (int i = n-4; i >= 0; i-=4)
+ {
+ _mm_storeu_pd(r+i,_mm_mul_pd(_mm_loadu_pd(x+i),_mm_loadu_pd(y+i)));
+ _mm_storeu_pd(r+i+2,_mm_mul_pd(_mm_loadu_pd(x+i+2),_mm_loadu_pd(y+i+2)));
+ }
+ else // aligned case
+ for (int i = n-4; i >= 0; i-=4)
{
- // do scalar (single value) load, multiply and store for end elements
- case 3: --n; _mm_store_sd(r+n,_mm_mul_sd(_mm_load_sd(x+n),_mm_load_sd(y+n)));
- case 2: --n; _mm_store_sd(r+n,_mm_mul_sd(_mm_load_sd(x+n),_mm_load_sd(y+n)));
- case 1: --n; _mm_store_sd(r+n,_mm_mul_sd(_mm_load_sd(x+n),_mm_load_sd(y+n)));
- case 0: ;
- }
-
- //load, multiply and store two doubles at a time
- //loop unroll to handle 4
- for(int i = n-4; i >= 0; i-=4)
- {
VNL_SSE_HEAP_STORE(pd)(r+i,_mm_mul_pd(VNL_SSE_HEAP_LOAD(pd)(x+i),VNL_SSE_HEAP_LOAD(pd)(y+i)));
VNL_SSE_HEAP_STORE(pd)(r+i+2,_mm_mul_pd(VNL_SSE_HEAP_LOAD(pd)(x+i+2),VNL_SSE_HEAP_LOAD(pd)(y+i+2)));
}
- }
-
- static VNL_SSE_FORCE_INLINE double dot_product(const double* x, const double* y, unsigned n)
+ }
+
+ static VNL_SSE_FORCE_INLINE double dot_product(const double* x, const double* y, unsigned n)
+ {
+ double ret;
+ __m128d sum;
+ if (n%2)
{
- double ret;
- __m128d sum;
- if(n%2)
- {
- // handle single element at end of odd sized vectors
- n--; sum = _mm_mul_sd(_mm_load_sd(x+n),_mm_load_sd(y+n));
- }
- else
- sum = _mm_setzero_pd();
-
- for(int i = n-2; i >= 0; i-=2)
+ // handle single element at end of odd sized vectors
+ n--; sum = _mm_mul_sd(_mm_load_sd(x+n),_mm_load_sd(y+n));
+ }
+ else
+ sum = _mm_setzero_pd();
+
+ if (vcl_ptrdiff_t(x)%16 || vcl_ptrdiff_t(y)%16)
+ // unaligned case
+ for (int i = n-2; i >= 0; i-=2)
+ sum = _mm_add_pd(_mm_mul_pd(_mm_loadu_pd(x+i), _mm_loadu_pd(y+i)),sum);
+ else // aligned case
+ for (int i = n-2; i >= 0; i-=2)
sum = _mm_add_pd(_mm_mul_pd(VNL_SSE_HEAP_LOAD(pd)(x+i), VNL_SSE_HEAP_LOAD(pd)(y+i)),sum);
- // sum will contain 2 accumulated values, need to add them together
- sum = _mm_add_sd(sum,_mm_unpackhi_pd(sum,_mm_setzero_pd()));
- _mm_store_sd(&ret,sum);
- return ret;
- }
-
- static VNL_SSE_FORCE_INLINE double euclid_dist_sq(const double* x, const double* y, unsigned n)
+ // sum will contain 2 accumulated values, need to add them together
+ sum = _mm_add_sd(sum,_mm_unpackhi_pd(sum,_mm_setzero_pd()));
+ _mm_store_sd(&ret,sum);
+ return ret;
+ }
+
+ static VNL_SSE_FORCE_INLINE double euclid_dist_sq(const double* x, const double* y, unsigned n)
+ {
+ double ret;
+ __m128d sum,a;
+
+ if (n%2)
{
- double ret;
- __m128d sum,a;
-
- if(n%2)
- {
- // handle single element at end of odd sized vectors
- n--; a = _mm_sub_sd(_mm_load_sd(x+n),_mm_load_sd(y+n));
- sum = _mm_mul_sd(a,a);
+ // handle single element at end of odd sized vectors
+ n--; a = _mm_sub_sd(_mm_load_sd(x+n),_mm_load_sd(y+n));
+ sum = _mm_mul_sd(a,a);
+ }
+ else
+ sum = _mm_setzero_pd();
+
+ if (vcl_ptrdiff_t(x)%16 || vcl_ptrdiff_t(y)%16)
+ // unaligned case
+ for ( int i = n-2; i >= 0; i-=2 )
+ {
+ a = _mm_sub_pd(_mm_loadu_pd(x+i),_mm_loadu_pd(y+i));
+ sum = _mm_add_pd(_mm_mul_pd(a,a),sum);
}
- else
- sum = _mm_setzero_pd();
-
+ else // aligned case
for ( int i = n-2; i >= 0; i-=2 )
- {
- a = _mm_sub_pd(VNL_SSE_HEAP_LOAD(pd)(x+i),VNL_SSE_HEAP_LOAD(pd)(y+i));
+ {
+ a = _mm_sub_pd(VNL_SSE_HEAP_LOAD(pd)(x+i),VNL_SSE_HEAP_LOAD(pd)(y+i));
sum = _mm_add_pd(_mm_mul_pd(a,a),sum);
}
- // sum will contain 2 accumulated values, need to add them together
- sum = _mm_add_sd(sum,_mm_unpackhi_pd(sum,_mm_setzero_pd()));
- _mm_store_sd(&ret,sum);
- return ret;
- }
-
- static VNL_SSE_FORCE_INLINE void vector_x_matrix(const double* v, const double* m, double* r, unsigned rows, unsigned cols)
- {
- __m128d accum, x,y,z,w;
+ // sum will contain 2 accumulated values, need to add them together
+ sum = _mm_add_sd(sum,_mm_unpackhi_pd(sum,_mm_setzero_pd()));
+ _mm_store_sd(&ret,sum);
+ return ret;
+ }
- //calculate if there are any left-over rows/columns
- unsigned r_left = rows%4;
- unsigned r_nice = rows - r_left;
- unsigned c_left = cols%2;
- unsigned c_nice = cols - c_left;
+ static VNL_SSE_FORCE_INLINE void vector_x_matrix(const double* v, const double* m, double* r, unsigned rows, unsigned cols)
+ {
+ __m128d accum, x,y,z,w;
- //handle 2 matrix columns at a time
- for (unsigned j = 0; j < c_nice; j+=2)
- {
+ // calculate if there are any left-over rows/columns
+ unsigned r_left = rows%4;
+ unsigned r_nice = rows - r_left;
+ unsigned c_left = cols%2;
+ unsigned c_nice = cols - c_left;
- //handle 4 matrix rows at a time
- accum = _mm_setzero_pd();
- unsigned i = 0;
- while( i < r_nice )
- {
- //load vector data so that
- // y = (v0,v1) , w = (v2,v3)
- y = VNL_SSE_HEAP_LOAD(pd)(v+i);
- w = VNL_SSE_HEAP_LOAD(pd)(v+i+2);
-
- _mm_prefetch((const char*)(v+i+4), _MM_HINT_NTA);
-
- // after shuffling
- // x = (v0, v0)
- // y = (v1, v1)
- // z = (v2, v2)
- // w = (v3, v3)
- x = _mm_shuffle_pd(y,y,_MM_SHUFFLE2(0,0));
- y = _mm_shuffle_pd(y,y,_MM_SHUFFLE2(1,1));
- z = _mm_shuffle_pd(w,w,_MM_SHUFFLE2(0,0));
- w = _mm_shuffle_pd(w,w,_MM_SHUFFLE2(1,1));
-
- // multipy the two matrix columns
- // i.e. x = ( v0 * m00, v0 * m01)
- // y = ( v1 * m10, v1 * m11)
- // z = ( v2 * m20, v2 * m21)
- // w = ( v3 * m30, v3 * m31)
- x = _mm_mul_pd(x,_mm_loadu_pd(i++*cols+m+j));
- y = _mm_mul_pd(y,_mm_loadu_pd(i++*cols+m+j));
- z = _mm_mul_pd(z,_mm_loadu_pd(i++*cols+m+j));
- w = _mm_mul_pd(w,_mm_loadu_pd(i++*cols+m+j));
-
- //now sum both columns
- accum = _mm_add_pd(x,accum);
- accum = _mm_add_pd(y,accum);
- accum = _mm_add_pd(z,accum);
- accum = _mm_add_pd(w,accum);
-
- //accum is now ( v0 * m00 + v1 * m10 + v2 * m20 + v3 * m30,
- // v0 * m01 + v1 * m11 + v2 * m21 + v3 * m31 )
- }
-
- // handle left-over rows
- switch(r_left)
- {
- case 3: accum = _mm_add_pd(_mm_mul_pd(_mm_load1_pd(v+i),_mm_loadu_pd(m+i*cols+j)), accum); i++;
- case 2: accum = _mm_add_pd(_mm_mul_pd(_mm_load1_pd(v+i),_mm_loadu_pd(m+i*cols+j)), accum); i++;
- case 1: accum = _mm_add_pd(_mm_mul_pd(_mm_load1_pd(v+i),_mm_loadu_pd(m+i*cols+j)), accum);
- case 0: ;
- }
-
- //store the 2 values of the result vector
- //use stream to avoid polluting the cache
- _mm_stream_pd(r+j,accum);
+ // handle 2 matrix columns at a time
+ for (unsigned j = 0; j < c_nice; j+=2)
+ {
+ // handle 4 matrix rows at a time
+ accum = _mm_setzero_pd();
+ unsigned i = 0;
+ while ( i < r_nice )
+ {
+ // load vector data so that
+ // y = (v0,v1) , w = (v2,v3)
+ y = VNL_SSE_HEAP_LOAD(pd)(v+i);
+ w = VNL_SSE_HEAP_LOAD(pd)(v+i+2);
+
+ _mm_prefetch((const char*)(v+i+4), _MM_HINT_NTA);
+
+ // after shuffling
+ // x = (v0, v0)
+ // y = (v1, v1)
+ // z = (v2, v2)
+ // w = (v3, v3)
+ x = _mm_shuffle_pd(y,y,_MM_SHUFFLE2(0,0));
+ y = _mm_shuffle_pd(y,y,_MM_SHUFFLE2(1,1));
+ z = _mm_shuffle_pd(w,w,_MM_SHUFFLE2(0,0));
+ w = _mm_shuffle_pd(w,w,_MM_SHUFFLE2(1,1));
+
+ // multiply the two matrix columns
+ // i.e. x = ( v0 * m00, v0 * m01)
+ // y = ( v1 * m10, v1 * m11)
+ // z = ( v2 * m20, v2 * m21)
+ // w = ( v3 * m30, v3 * m31)
+ x = _mm_mul_pd(x,_mm_loadu_pd(i++*cols+m+j));
+ y = _mm_mul_pd(y,_mm_loadu_pd(i++*cols+m+j));
+ z = _mm_mul_pd(z,_mm_loadu_pd(i++*cols+m+j));
+ w = _mm_mul_pd(w,_mm_loadu_pd(i++*cols+m+j));
+
+ // now sum both columns
+ accum = _mm_add_pd(x,accum);
+ accum = _mm_add_pd(y,accum);
+ accum = _mm_add_pd(z,accum);
+ accum = _mm_add_pd(w,accum);
+
+ // accum is now ( v0 * m00 + v1 * m10 + v2 * m20 + v3 * m30,
+ // v0 * m01 + v1 * m11 + v2 * m21 + v3 * m31 )
}
- // handle the left over columns
- if( c_left )
+ // handle left-over rows
+ switch (r_left)
{
- accum = _mm_setzero_pd();
- for (unsigned int i=0; i<rows; ++i)
- accum = _mm_add_sd(_mm_mul_sd(_mm_load_sd(m+i*cols+cols-1),_mm_load_sd(v+i)),accum);
- _mm_store_sd(r+cols-1, accum);
+ case 3: accum = _mm_add_pd(_mm_mul_pd(_mm_load1_pd(v+i),_mm_loadu_pd(m+i*cols+j)), accum); i++;
+ case 2: accum = _mm_add_pd(_mm_mul_pd(_mm_load1_pd(v+i),_mm_loadu_pd(m+i*cols+j)), accum); i++;
+ case 1: accum = _mm_add_pd(_mm_mul_pd(_mm_load1_pd(v+i),_mm_loadu_pd(m+i*cols+j)), accum);
+ case 0: ;
}
+
+ // store the 2 values of the result vector
+ // use stream to avoid polluting the cache
+ _mm_stream_pd(r+j,accum);
}
-
- static VNL_SSE_FORCE_INLINE void matrix_x_vector(const double* m, const double* v, double* r, unsigned rows, unsigned cols)
+
+ // handle the left over columns
+ if ( c_left )
{
- __m128d accum, x,y,mxy1,mxy2;
-
- //calculate if there are any left-over rows/columns
- unsigned r_left = rows%2;
- unsigned r_nice = rows - r_left;
- unsigned c_left = cols%2;
- unsigned c_nice = cols - c_left;
-
- //handle 2 matrix rows at a time
- for (unsigned i = 0; i < r_nice; i+=2)
- {
+ accum = _mm_setzero_pd();
+ for (unsigned int i=0; i<rows; ++i)
+ accum = _mm_add_sd(_mm_mul_sd(_mm_load_sd(m+i*cols+cols-1),_mm_load_sd(v+i)),accum);
+ _mm_store_sd(r+cols-1, accum);
+ }
+ }
+
+ static VNL_SSE_FORCE_INLINE void matrix_x_vector(const double* m, const double* v, double* r, unsigned rows, unsigned cols)
+ {
+ __m128d accum, x,y,mxy1,mxy2;
+
+ // calculate if there are any left-over rows/columns
+ unsigned r_left = rows%2;
+ unsigned r_nice = rows - r_left;
+ unsigned c_left = cols%2;
+ unsigned c_nice = cols - c_left;
- //handle 4 matrix columns at a time
- accum = _mm_setzero_pd();
- const double *r1 = m+i*cols, *r2 = m+(i+1)*cols;
- unsigned j = 0;
- for (; j < c_nice; j+=2)
- {
- // load vector data so that
- // y = (v0, v1)
- y = VNL_SSE_HEAP_LOAD(pd)(v+j);
-
- //shuffle so that
- // x = (v0,v0) y = (v1,v1)
- x = _mm_shuffle_pd(y,y,_MM_SHUFFLE2(0,0));
- y = _mm_shuffle_pd(y,y,_MM_SHUFFLE2(1,1));
-
- //load the matrix data so that
- // mxy1 = (m00,m01), mxy2 = (m10,m11)
- mxy1 = _mm_loadu_pd(r1+j);
- mxy2 = _mm_loadu_pd(r2+j);
-
- //unpack matrix data to acheive
- // (v0,v0) * (m00,m10)
- // (v1,v1) * (m01,m11)
- x = _mm_mul_pd(x,_mm_unpacklo_pd(mxy1,mxy2));
- y = _mm_mul_pd(y,_mm_unpackhi_pd(mxy1,mxy2));
-
- //now sum the results
- accum = _mm_add_pd(x,accum);
- accum = _mm_add_pd(y,accum);
-
- //accum is now ( v0 * m00 + v1 * m01,
- // v0 * m11 + v1 * m11 )
- }
- // handle the left over columns
- if(c_left)
- accum = _mm_add_pd(_mm_mul_pd(_mm_load1_pd(v+j),_mm_set_pd(*(r1+j),*(r2+j))), accum);
-
- //store the 2 values of the result vector
- //use stream to avoid polluting the cache
- _mm_stream_pd(r+i,accum);
- }
-
- // handle the left over rows
- if( r_left )
+ // handle 2 matrix rows at a time
+ for (unsigned i = 0; i < r_nice; i+=2)
+ {
+ // handle 2 matrix columns at a time
+ accum = _mm_setzero_pd();
+ const double *r1 = m+i*cols, *r2 = m+(i+1)*cols;
+ unsigned j = 0;
+ for (; j < c_nice; j+=2)
{
- accum = _mm_setzero_pd();
- const double* p = m+(rows-1)*cols;
- for (unsigned int j=0; j<cols; ++j)
- accum = _mm_add_sd(_mm_mul_sd(_mm_load_sd(p+j),_mm_load_sd(v+j)),accum);
- _mm_store_sd(r+rows-1, accum);
+ // load vector data so that
+ // y = (v0, v1)
+ y = VNL_SSE_HEAP_LOAD(pd)(v+j);
+
+ // shuffle so that
+ // x = (v0,v0) y = (v1,v1)
+ x = _mm_shuffle_pd(y,y,_MM_SHUFFLE2(0,0));
+ y = _mm_shuffle_pd(y,y,_MM_SHUFFLE2(1,1));
+
+ // load the matrix data so that
+ // mxy1 = (m00,m01), mxy2 = (m10,m11)
+ mxy1 = _mm_loadu_pd(r1+j);
+ mxy2 = _mm_loadu_pd(r2+j);
+
+ // unpack matrix data to achieve
+ // (v0,v0) * (m00,m10)
+ // (v1,v1) * (m01,m11)
+ x = _mm_mul_pd(x,_mm_unpacklo_pd(mxy1,mxy2));
+ y = _mm_mul_pd(y,_mm_unpackhi_pd(mxy1,mxy2));
+
+ // now sum the results
+ accum = _mm_add_pd(x,accum);
+ accum = _mm_add_pd(y,accum);
+
+ // accum is now ( v0 * m00 + v1 * m01,
+ // v0 * m11 + v1 * m11 )
}
+ // handle the left over columns
+ if (c_left)
+ accum = _mm_add_pd(_mm_mul_pd(_mm_load1_pd(v+j),_mm_set_pd(*(r2+j),*(r1+j))), accum);
+
+ // store the 2 values of the result vector
+ // use stream to avoid polluting the cache
+ _mm_stream_pd(r+i,accum);
}
-
- static VNL_SSE_FORCE_INLINE double sum(const double* x, unsigned n)
- {
- double ret;
- // decision logic for odd sized vectors
- __m128d sum = n%2 ? _mm_load_sd(x+--n) : _mm_setzero_pd();
-
- //sum two elements at a time, sum will contain two running totals
- for(int i = n-2; i >= 0; i-=2)
- sum = _mm_add_pd(VNL_SSE_HEAP_LOAD(pd)(x+i),sum);
-
- // sum will contain 2 accumulated values, need to add them together
- sum = _mm_add_sd(sum,_mm_unpackhi_pd(sum,_mm_setzero_pd()));
- _mm_store_sd(&ret,sum);
- return ret;
- }
-
- static VNL_SSE_FORCE_INLINE double max(const double* x, unsigned n)
+
+ // handle the left over rows
+ if ( r_left )
{
- double ret;
- // decision logic for odd sized vectors
- __m128d max = n%2 ? _mm_load_sd(x+--n) : _mm_setzero_pd();
-
- //handle two elements at a time, max will contain two max values
- for (int i=n-2; i>=0; i-=2)
- max = _mm_max_pd(VNL_SSE_HEAP_LOAD(pd)(x+i), max);
-
- // need to store max's two values
- max = _mm_max_sd(max,_mm_unpackhi_pd(max,_mm_setzero_pd()));
- _mm_store_sd(&ret,max);
- return ret;
+ accum = _mm_setzero_pd();
+ const double* p = m+(rows-1)*cols;
+ for (unsigned int j=0; j<cols; ++j)
+ accum = _mm_add_sd(_mm_mul_sd(_mm_load_sd(p+j),_mm_load_sd(v+j)),accum);
+ _mm_store_sd(r+rows-1, accum);
}
-
- static VNL_SSE_FORCE_INLINE double min(const double* x, unsigned n)
- {
- double ret;
- __m128d min = _mm_set1_pd(DBL_MAX);
+ }
+
+ static VNL_SSE_FORCE_INLINE double sum(const double* x, unsigned n)
+ {
+ double ret;
+ // decision logic for odd sized vectors
+ __m128d sum = n%2 ? _mm_load_sd(x+--n) : _mm_setzero_pd();
+
+ // sum two elements at a time, sum will contain two running totals
+ for (int i = n-2; i >= 0; i-=2)
+ sum = _mm_add_pd(VNL_SSE_HEAP_LOAD(pd)(x+i),sum);
+
+ // sum will contain 2 accumulated values, need to add them together
+ sum = _mm_add_sd(sum,_mm_unpackhi_pd(sum,_mm_setzero_pd()));
+ _mm_store_sd(&ret,sum);
+ return ret;
+ }
+
+ static VNL_SSE_FORCE_INLINE double max(const double* x, unsigned n)
+ {
+ double ret;
+ // decision logic for odd sized vectors
+ __m128d max = n%2 ? _mm_load_sd(x+--n) : _mm_setzero_pd();
+
+ // handle two elements at a time, max will contain two max values
+ for (int i=n-2; i>=0; i-=2)
+ max = _mm_max_pd(VNL_SSE_HEAP_LOAD(pd)(x+i), max);
+
+ // need to store max's two values
+ max = _mm_max_sd(max,_mm_unpackhi_pd(max,_mm_setzero_pd()));
+ _mm_store_sd(&ret,max);
+ return ret;
+ }
+
+ static VNL_SSE_FORCE_INLINE double min(const double* x, unsigned n)
+ {
+ double ret;
+ __m128d min = _mm_set1_pd(DBL_MAX);
+
+ // hand last element if odd sized vector
+ if (n%2)
+ min = _mm_min_sd(min,_mm_load_sd(x+--n));
+
+ // handle two elements at a time, min will contain two min values
+ for (int i=n-2; i>=0; i-=2)
+ min = _mm_min_pd(VNL_SSE_HEAP_LOAD(pd)(x+i), min);
+
+ // need to store min's two values
+ min = _mm_min_sd(min,_mm_unpackhi_pd(min,_mm_setzero_pd()));
+ _mm_store_sd(&ret,min);
+ return ret;
+ }
+};
- // hand last element if odd sized vector
- if(n%2)
- min = _mm_min_sd(min,_mm_load_sd(x+--n));
+//: SSE2 implementation for single precision floating point (32 bit)
+VCL_DEFINE_SPECIALIZATION
+class vnl_sse<float>
+{
+ public:
+ static VNL_SSE_FORCE_INLINE void element_product(const float* x, const float* y, float* r, unsigned n)
+ {
+ switch (n%4)
+ {
+ // do scalar (single value) load, multiply and store for end elements
+ case 3: --n; _mm_store_ss(r+n,_mm_mul_ss(_mm_load_ss(x+n),_mm_load_ss(y+n)));
+ case 2: --n; _mm_store_ss(r+n,_mm_mul_ss(_mm_load_ss(x+n),_mm_load_ss(y+n)));
+ case 1: --n; _mm_store_ss(r+n,_mm_mul_ss(_mm_load_ss(x+n),_mm_load_ss(y+n)));
+ case 0: ;
+ }
- //handle two elements at a time, min will contain two min values
- for (int i=n-2; i>=0; i-=2)
- min = _mm_min_pd(VNL_SSE_HEAP_LOAD(pd)(x+i), min);
+ // load, multiply and store four floats at a time
+ for (int i = n-4; i >= 0; i-=4)
+ VNL_SSE_HEAP_STORE(ps)(r+i,_mm_mul_ps(VNL_SSE_HEAP_LOAD(ps)(x+i),VNL_SSE_HEAP_LOAD(ps)(y+i)));
+ }
- // need to store min's two values
- min = _mm_min_sd(min,_mm_unpackhi_pd(min,_mm_setzero_pd()));
- _mm_store_sd(&ret,min);
- return ret;
+ static VNL_SSE_FORCE_INLINE float dot_product(const float* x, const float* y, unsigned n)
+ {
+ float ret;
+ __m128 sum = _mm_setzero_ps();
+ switch (n%4)
+ {
+ // handle elements at end of vectors with sizes not divisable by 4
+ case 3: n--; sum = _mm_mul_ss(_mm_load_ss(x+n), _mm_load_ss(y+n));
+ case 2: n--; sum = _mm_add_ss(_mm_mul_ss(_mm_load_ss(x+n), _mm_load_ss(y+n)),sum);
+ case 1: n--; sum = _mm_add_ss(_mm_mul_ss(_mm_load_ss(x+n), _mm_load_ss(y+n)),sum);
+ case 0: ;
}
-};
-//! SSE2 implementation for single precision floating point (32 bit)
-VCL_DEFINE_SPECIALIZATION
-class vnl_sse<float> {
- public:
-
- static VNL_SSE_FORCE_INLINE void element_product(const float* x, const float* y, float* r, unsigned n)
- {
- switch(n % 4)
- {
- // do scalar (single value) load, multiply and store for end elements
- case 3: --n; _mm_store_ss(r+n,_mm_mul_ss(_mm_load_ss(x+n),_mm_load_ss(y+n)));
- case 2: --n; _mm_store_ss(r+n,_mm_mul_ss(_mm_load_ss(x+n),_mm_load_ss(y+n)));
- case 1: --n; _mm_store_ss(r+n,_mm_mul_ss(_mm_load_ss(x+n),_mm_load_ss(y+n)));
- case 0: ;
- }
+ for (int i = n-4; i >= 0; i-=4)
+ sum = _mm_add_ps(_mm_mul_ps(VNL_SSE_HEAP_LOAD(ps)(x+i), VNL_SSE_HEAP_LOAD(ps)(y+i)),sum);
+
+ // sum will contain 4 accumulated values, need to add them together
+ sum = _mm_add_ps(sum,_mm_movehl_ps(_mm_setzero_ps(),sum));
+ sum = _mm_add_ss(sum,_mm_shuffle_ps(sum,sum,_MM_SHUFFLE(3,2,1,1)));
- //load, multiply and store four floats at a time
- for(int i = n-4; i >= 0; i-=4)
- VNL_SSE_HEAP_STORE(ps)(r+i,_mm_mul_ps(VNL_SSE_HEAP_LOAD(ps)(x+i),VNL_SSE_HEAP_LOAD(ps)(y+i)));
+ _mm_store_ss(&ret,sum);
+ return ret;
+ }
+
+ static VNL_SSE_FORCE_INLINE float euclid_dist_sq(const float* x, const float* y, unsigned n)
+ {
+ float ret;
+ __m128 sum,a;
+ sum = a = _mm_setzero_ps();
+ switch (n%4)
+ {
+ // handle elements at end of vectors with sizes not divisable by 4
+ case 3: --n; a = _mm_sub_ss(_mm_load_ss(x+n),_mm_load_ss(y+n));
+ case 2: --n; a = _mm_shuffle_ps(_mm_sub_ss(_mm_load_ss(x+n),_mm_load_ss(y+n)), a ,_MM_SHUFFLE(1,0,0,1));
+ case 1: --n; a = _mm_move_ss(a,_mm_sub_ss(_mm_load_ss(x+n),_mm_load_ss(y+n)));
+ sum = _mm_mul_ps(a,a);
+ case 0: ;
}
-
- static VNL_SSE_FORCE_INLINE float dot_product(const float* x, const float* y, unsigned n)
- {
- float ret;
- __m128 sum = _mm_setzero_ps();
- switch(n % 4)
- {
- // handle elements at end of vectors with sizes not divisable by 4
- case 3: n--; sum = _mm_mul_ss(_mm_load_ss(x+n), _mm_load_ss(y+n));
- case 2: n--; sum = _mm_add_ss(_mm_mul_ss(_mm_load_ss(x+n), _mm_load_ss(y+n)),sum);
- case 1: n--; sum = _mm_add_ss(_mm_mul_ss(_mm_load_ss(x+n), _mm_load_ss(y+n)),sum);
- case 0: ;
- }
-
- for(int i = n-4; i >= 0; i-=4)
- sum = _mm_add_ps(_mm_mul_ps(VNL_SSE_HEAP_LOAD(ps)(x+i), VNL_SSE_HEAP_LOAD(ps)(y+i)),sum);
-
- // sum will contain 4 accumulated values, need to add them together
- sum = _mm_add_ps(sum,_mm_movehl_ps(_mm_setzero_ps(),sum));
- sum = _mm_add_ss(sum,_mm_shuffle_ps(sum,sum,_MM_SHUFFLE(3,2,1,1)));
-
- _mm_store_ss(&ret,sum);
- return ret;
+
+ for ( int i = n-4; i >= 0; i-=4 )
+ {
+ a = _mm_sub_ps(VNL_SSE_HEAP_LOAD(ps)(x+i),VNL_SSE_HEAP_LOAD(ps)(y+i));
+ sum = _mm_add_ps(_mm_mul_ps(a,a),sum);
}
-
- static VNL_SSE_FORCE_INLINE float euclid_dist_sq(const float* x, const float* y, unsigned n)
+
+ // sum will contain 4 accumulated values, need to add them together
+ sum = _mm_add_ps(sum,_mm_movehl_ps(_mm_setzero_ps(),sum));
+ sum = _mm_add_ss(sum,_mm_shuffle_ps(sum,sum,_MM_SHUFFLE(3,2,1,1)));
+
+ _mm_store_ss(&ret,sum);
+ return ret;
+ }
+
+ static VNL_SSE_FORCE_INLINE void vector_x_matrix(const float* v, const float* m, float* r, unsigned rows, unsigned cols)
+ {
+ __m128 accum, x,y,z,w;
+
+ // calculate if there are any left-over rows/columns
+ unsigned r_left = rows%4;
+ unsigned r_nice = rows - r_left;
+ unsigned c_left = cols%4;
+ unsigned c_nice = cols - c_left;
+
+ // handle 4 matrix columns at a time
+ for (unsigned j = 0; j < c_nice; j+=4)
{
- float ret;
- __m128 sum,a;
- sum = a = _mm_setzero_ps();
- switch(n % 4)
+ // handle 4 matrix rows at a time
+ accum = _mm_setzero_ps();
+ unsigned i = 0;
+ while ( i < r_nice )
{
- // handle elements at end of vectors with sizes not divisable by 4
- case 3: --n; a = _mm_sub_ss(_mm_load_ss(x+n),_mm_load_ss(y+n));
- case 2: --n; a = _mm_shuffle_ps(_mm_sub_ss(_mm_load_ss(x+n),_mm_load_ss(y+n)), a ,_MM_SHUFFLE(1,0,0,1));
- case 1: --n; a = _mm_move_ss(a,_mm_sub_ss(_mm_load_ss(x+n),_mm_load_ss(y+n)));
- sum = _mm_mul_ps(a,a);
- case 0: ;
+ // load vector data so that
+ // w = (v0,v1,v2,v3)
+ w = VNL_SSE_HEAP_LOAD(ps)(v+i);
+
+ // after shuffling
+ // x = (v0, v0, v0, v0)
+ // y = (v1, v1, v1, v1)
+ // z = (v2, v2, v2, v2)
+ // w = (v3, v3, v3, v3)
+ x = _mm_shuffle_ps(w,w,_MM_SHUFFLE(0,0,0,0));
+ y = _mm_shuffle_ps(w,w,_MM_SHUFFLE(1,1,1,1));
+ z = _mm_shuffle_ps(w,w,_MM_SHUFFLE(2,2,2,2));
+ w = _mm_shuffle_ps(w,w,_MM_SHUFFLE(3,3,3,3));
+
+ // multiply the four matrix columns
+ // i.e. x = ( v0 * m00, v0 * m01, v0 * m02, v0 * m03)
+ // y = ( v1 * m10, v1 * m11, v1 * m12, v1 * m13)
+ // z = ( v2 * m20, v2 * m21, v2 * m22, v2 * m23)
+ // w = ( v3 * m30, v3 * m31, v3 * m32, v3 * m33)
+ x = _mm_mul_ps(x,_mm_loadu_ps(m+i++*cols+j));
+ y = _mm_mul_ps(y,_mm_loadu_ps(m+i++*cols+j));
+ z = _mm_mul_ps(z,_mm_loadu_ps(m+i++*cols+j));
+ w = _mm_mul_ps(w,_mm_loadu_ps(m+i++*cols+j));
+
+ // now sum the four columns
+ accum = _mm_add_ps(x,accum);
+ accum = _mm_add_ps(y,accum);
+ accum = _mm_add_ps(z,accum);
+ accum = _mm_add_ps(w,accum);
+
+ // accum is now ( v0 * m00 + v1 * m10 + v2 * m20 + v3 * m30,
+ // v0 * m01 + v1 * m11 + v2 * m21 + v3 * m31,
+ // v0 * m02 + v1 * m12 + v2 * m22 + v3 * m32,
+ // v0 * m03 + v1 * m13 + v2 * m23 + v3 * m33 )
}
-
- for ( int i = n-4; i >= 0; i-=4 )
+
+ // handle left-over rows
+ switch (r_left)
{
- a = _mm_sub_ps(VNL_SSE_HEAP_LOAD(ps)(x+i),VNL_SSE_HEAP_LOAD(ps)(y+i));
- sum = _mm_add_ps(_mm_mul_ps(a,a),sum);
+ case 3: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+i),_mm_loadu_ps(m+i*cols+j)), accum); i++;
+ case 2: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+i),_mm_loadu_ps(m+i*cols+j)), accum); i++;
+ case 1: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+i),_mm_loadu_ps(m+i*cols+j)), accum);
+ case 0: ;
}
- // sum will contain 4 accumulated values, need to add them together
- sum = _mm_add_ps(sum,_mm_movehl_ps(_mm_setzero_ps(),sum));
- sum = _mm_add_ss(sum,_mm_shuffle_ps(sum,sum,_MM_SHUFFLE(3,2,1,1)));
+ // store the 4 values of the result vector
+ // use stream to avoid polluting the cache
+ _mm_stream_ps(r+j,accum);
+ }
- _mm_store_ss(&ret,sum);
- return ret;
+ // handle the left over columns
+ for (; c_left > 0; --c_left) {
+ accum = _mm_setzero_ps();
+ for (unsigned int i=0; i<rows; ++i)
+ accum = _mm_add_ss(_mm_mul_ss(_mm_load_ss(m+i*cols+cols-c_left), _mm_load_ss(v+i)),accum);
+ _mm_store_ss(r+cols-c_left,accum);
}
+ }
+
+ static VNL_SSE_FORCE_INLINE void matrix_x_vector(const float* m, const float* v, float* r, unsigned rows, unsigned cols)
+ {
+ __m128 accum, x,y,z,w,mxy1,mxy2,mzw1,mzw2, mr1,mr2,mr3,mr4;
- static VNL_SSE_FORCE_INLINE void vector_x_matrix(const float* v, const float* m, float* r, unsigned rows, unsigned cols)
+ // calculate if there are any left-over rows/columns
+ unsigned r_left = rows%4;
+ unsigned r_nice = rows - r_left;
+ unsigned c_left = cols%4;
+ unsigned c_nice = cols - c_left;
+
+ // handle 4 matrix rows at a time
+ for (unsigned i = 0; i < r_nice; i+=4)
{
- __m128 accum, x,y,z,w;
-
- //calculate if there are any left-over rows/columns
- unsigned r_left = rows%4;
- unsigned r_nice = rows - r_left;
- unsigned c_left = cols%4;
- unsigned c_nice = cols - c_left;
-
- //handle 4 matrix columns at a time
- for (unsigned j = 0; j < c_nice; j+=4)
+ // handle 4 matrix columns at a time
+ accum = _mm_setzero_ps();
+ const float *r1 = m+i*cols, *r2 = m+(i+1)*cols,
+ *r3 = m+(i+2)*cols, *r4 = m+(i+3)*cols;
+ unsigned j = 0;
+ for (; j < c_nice; j+=4)
{
- //handle 4 matrix rows at a time
- accum = _mm_setzero_ps();
- unsigned i = 0;
- while ( i < r_nice )
- {
- //load vector data so that
- // w = (v0,v1,v2,v3)
- w = VNL_SSE_HEAP_LOAD(ps)(v+i);
-
- // after shuffling
- // x = (v0, v0, v0, v0)
- // y = (v1, v1, v1, v1)
- // z = (v2, v2, v2, v2)
- // w = (v3, v3, v3, v3)
- x = _mm_shuffle_ps(w,w,_MM_SHUFFLE(0,0,0,0));
- y = _mm_shuffle_ps(w,w,_MM_SHUFFLE(1,1,1,1));
- z = _mm_shuffle_ps(w,w,_MM_SHUFFLE(2,2,2,2));
- w = _mm_shuffle_ps(w,w,_MM_SHUFFLE(3,3,3,3));
-
- // multipy the four matrix columns
- // i.e. x = ( v0 * m00, v0 * m01, v0 * m02, v0 * m03)
- // y = ( v1 * m10, v1 * m11, v1 * m12, v1 * m13)
- // z = ( v2 * m20, v2 * m21, v2 * m22, v2 * m23)
- // w = ( v3 * m30, v3 * m31, v3 * m32, v3 * m33)
- x = _mm_mul_ps(x,_mm_loadu_ps(m+i++*cols+j));
- y = _mm_mul_ps(y,_mm_loadu_ps(m+i++*cols+j));
- z = _mm_mul_ps(z,_mm_loadu_ps(m+i++*cols+j));
- w = _mm_mul_ps(w,_mm_loadu_ps(m+i++*cols+j));
-
- //now sum the four columns
- accum = _mm_add_ps(x,accum);
- accum = _mm_add_ps(y,accum);
- accum = _mm_add_ps(z,accum);
- accum = _mm_add_ps(w,accum);
-
- //accum is now ( v0 * m00 + v1 * m10 + v2 * m20 + v3 * m30,
- // v0 * m01 + v1 * m11 + v2 * m21 + v3 * m31,
- // v0 * m02 + v1 * m12 + v2 * m22 + v3 * m32,
- // v0 * m03 + v1 * m13 + v2 * m23 + v3 * m33 )
- }
-
- // handle left-over rows
- switch(r_left)
- {
- case 3: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+i),_mm_loadu_ps(m+i*cols+j)), accum); i++;
- case 2: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+i),_mm_loadu_ps(m+i*cols+j)), accum); i++;
- case 1: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+i),_mm_loadu_ps(m+i*cols+j)), accum);
- case 0: ;
- }
-
- //store the 4 values of the result vector
- //use stream to avoid polluting the cache
- _mm_stream_ps(r+j,accum);
+ // load vector data so that
+ // w = (v0, v1, v2, v3)
+ w = VNL_SSE_HEAP_LOAD(ps)(v+j);
+
+ // after shuffling
+ // x = (v0, v0, v0, v0)
+ // y = (v1, v1, v1, v1)
+ // z = (v2, v2, v2, v2)
+ // w = (v3, v3, v3, v3)
+ x = _mm_shuffle_ps(w,w,_MM_SHUFFLE(0,0,0,0));
+ y = _mm_shuffle_ps(w,w,_MM_SHUFFLE(1,1,1,1));
+ z = _mm_shuffle_ps(w,w,_MM_SHUFFLE(2,2,2,2));
+ w = _mm_shuffle_ps(w,w,_MM_SHUFFLE(3,3,3,3));
+
+ // load form first two rows of the matrix
+ // i.e. mr1 = (m00, m01, m02, m03)
+ // mr2 = (m10, m11, m12, m13)
+ mr1 = _mm_loadu_ps(r1+j);
+ mr2 = _mm_loadu_ps(r2+j);
+
+ // unpack into xy and zw parts
+ // i.e mxy1 = (m00, m10, m01, m11)
+ // mzw1 = (m02, m12, m03, m13)
+ mxy1 = _mm_unpacklo_ps(mr1,mr2);
+ mzw1 = _mm_unpackhi_ps(mr1,mr2);
+
+ // similarly for the next two rows
+ mr3 = _mm_loadu_ps(r3+j);
+ mr4 = _mm_loadu_ps(r4+j);
+
+ // unpack into xy and zw parts
+ // i.e mxy2 = (m20, m30, m21, m31)
+ // mxy2 = (m22, m32, m23, m33)
+ mxy2 = _mm_unpacklo_ps(mr3,mr4);
+ mzw2 = _mm_unpackhi_ps(mr3,mr4);
+
+ // move around matrix data and multiply so that
+ // x = (v0,v0,v0,v0) * (m00,m10,m20,m30)
+ // y = (v1,v1,v1,v1) * (m01,m11,m21,m31)
+ // z = (v2,v2,v2,v2) * (m02,m12,m22,m32)
+ // w = (v3,v3,v3,v3) * (m03,m13,m23,m33)
+#if 1
+ __m128 mx = _mm_movelh_ps(mxy1,mxy2);
+ x = _mm_mul_ps(x, mx);
+ __m128 my = _mm_movehl_ps(mxy2,mxy1);
+ y = _mm_mul_ps(y, my);
+ __m128 mz = _mm_movelh_ps(mzw1,mzw2);
+ z = _mm_mul_ps(z, mz);
+ __m128 mw = _mm_movehl_ps(mzw2,mzw1);
+ w = _mm_mul_ps(w,mw);
+#else
+ x = _mm_mul_ps(x,_mm_movelh_ps(mxy1,mxy2));
+ y = _mm_mul_ps(y,_mm_movehl_ps(mxy1,mxy2));
+ z = _mm_mul_ps(z,_mm_movelh_ps(mzw1,mzw2));
+ w = _mm_mul_ps(w,_mm_movehl_ps(mzw1,mzw2));
+#endif // 0
+
+ // now sum the four results
+ accum = _mm_add_ps(x,accum);
+ accum = _mm_add_ps(y,accum);
+ accum = _mm_add_ps(z,accum);
+ accum = _mm_add_ps(w,accum);
+
+ // accum is now ( v0 * m00 + v1 * m01 + v2 * m02 + v3 * m03,
+ // v0 * m10 + v1 * m11 + v2 * m12 + v3 * m13,
+ // v0 * m20 + v1 * m21 + v2 * m22 + v3 * m23,
+ // v0 * m30 + v1 * m31 + v2 * m32 + v3 * m33 )
}
// handle the left over columns
- for(; c_left > 0; --c_left) {
- accum = _mm_setzero_ps();
- for (unsigned int i=0; i<rows; ++i)
- accum = _mm_add_ss(_mm_mul_ss(_mm_load_ss(m+i*cols+cols-c_left), _mm_load_ss(v+i)),accum);
- _mm_store_ss(r+cols-c_left,accum);
- }
- }
-
- static VNL_SSE_FORCE_INLINE void matrix_x_vector(const float* m, const float* v, float* r, unsigned rows, unsigned cols)
- {
- __m128 accum, x,y,z,w,mxy1,mxy2,mzw1,mzw2, mr1,mr2,mr3,mr4;
-
- //calculate if there are any left-over rows/columns
- unsigned r_left = rows%4;
- unsigned r_nice = rows - r_left;
- unsigned c_left = cols%4;
- unsigned c_nice = cols - c_left;
-
- //handle 4 matrix rows at a time
- for (unsigned i = 0; i < r_nice; i+=4)
+ switch (c_left)
{
- //handle 4 matrix columns at a time
- accum = _mm_setzero_ps();
- const float *r1 = m+i*cols, *r2 = m+(i+1)*cols,
- *r3 = m+(i+2)*cols, *r4 = m+(i+3)*cols;
- unsigned j = 0;
- for(; j < c_nice; j+=4)
- {
- // load vector data so that
- // w = (v0, v1, v2, v3)
- w = VNL_SSE_HEAP_LOAD(ps)(v+j);
-
- // after shuffling
- // x = (v0, v0, v0, v0)
- // y = (v1, v1, v1, v1)
- // z = (v2, v2, v2, v2)
- // w = (v3, v3, v3, v3)
- x = _mm_shuffle_ps(w,w,_MM_SHUFFLE(0,0,0,0));
- y = _mm_shuffle_ps(w,w,_MM_SHUFFLE(1,1,1,1));
- z = _mm_shuffle_ps(w,w,_MM_SHUFFLE(2,2,2,2));
- w = _mm_shuffle_ps(w,w,_MM_SHUFFLE(3,3,3,3));
-
- // load form first two rows of the matrix
- //i.e. mr1 = (m00, m01, m02, m03)
- // mr2 = (m10, m11, m12, m13)
- mr1 = _mm_loadu_ps(r1+j);
- mr2 = _mm_loadu_ps(r2+j);
-
- //unpack into xy and zw parts
- // i.e mxy1 = (m00, m10, m01, m11)
- // mxy1 = (m02, m12, m03, m13)
- mxy1 = _mm_unpacklo_ps(mr1,mr2);
- mzw1 = _mm_unpackhi_ps(mr1,mr2);
-
- //similarly for the next two rows
- mr3 = _mm_loadu_ps(r3+j);
- mr4 = _mm_loadu_ps(r4+j);
-
- //unpack into xy and zw parts
- // i.e mxy2 = (m20, m30, m21, m31)
- // mxy2 = (m22, m32, m23, m33)
- mxy2 = _mm_unpacklo_ps(mr3,mr4);
- mzw2 = _mm_unpackhi_ps(mr3,mr4);
-
- // move around matrix data and multiply so that
- // x = (v0,v0,v0,v0) * (m00,m10,m20,m30)
- // y = (v1,v1,v1,v1) * (m01,m11,m21,m31)
- // z = (v2,v2,v2,v2) * (m02,m12,m22,m32)
- // w = (v3,v3,v3,v3) * (m03,m13,m23,m33)
- x = _mm_mul_ps(x,_mm_movelh_ps(mxy1,mxy2));
- y = _mm_mul_ps(y,_mm_movehl_ps(mxy1,mxy2));
- z = _mm_mul_ps(z,_mm_movelh_ps(mzw1,mzw2));
- w = _mm_mul_ps(w,_mm_movehl_ps(mzw1,mzw2));
-
- //now sum the four results
- accum = _mm_add_ps(x,accum);
- accum = _mm_add_ps(y,accum);
- accum = _mm_add_ps(z,accum);
- accum = _mm_add_ps(w,accum);
-
- //accum is now ( v0 * m00 + v1 * m01 + v2 * m02 + v3 * m03,
- // v0 * m10 + v1 * m11 + v2 * m12 + v3 * m13,
- // v0 * m20 + v1 * m21 + v2 * m22 + v3 * m23,
- // v0 * m30 + v1 * m31 + v2 * m32 + v3 * m33 )
- }
-
- // handle the left over columns
- switch(c_left)
- {
- case 3: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+j),_mm_set_ps(*(r1+j),*(r2+j),*(r3+j),*(r4+j))), accum); j++;
- case 2: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+j),_mm_set_ps(*(r1+j),*(r2+j),*(r3+j),*(r4+j))), accum); j++;
- case 1: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+j),_mm_set_ps(*(r1+j),*(r2+j),*(r3+j),*(r4+j))), accum);
- case 0: ;
- }
- //store the 4 values of the result vector
- //use stream to avoid polluting the cache
- _mm_stream_ps(r+i,accum);
- }
-
- // handle the left over rows
- for(; r_left > 0; --r_left) {
- accum = _mm_setzero_ps();
- const float* p = m+(rows-r_left)*cols;
- for (unsigned int j=0; j<cols; ++j)
- accum = _mm_add_ss(_mm_mul_ss(_mm_load_ss(p+j), _mm_load_ss(v+j)),accum);
- _mm_store_ss(r+rows-r_left,accum);
- }
- }
-
- static VNL_SSE_FORCE_INLINE float sum(const float* x, unsigned n)
- {
- float ret;
- __m128 sum = _mm_setzero_ps();
- switch(n % 4)
- { // handle vector sizes which aren't divisible by 4
- case 3: sum = _mm_load_ss(x+--n);
- case 2: sum = _mm_shuffle_ps(_mm_load_ss(x+--n), sum ,_MM_SHUFFLE(1,0,0,1));
- case 1: sum = _mm_move_ss(sum,_mm_load_ss(x+--n));
+ case 3: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+j),_mm_set_ps(*(r4+j),*(r3+j),*(r2+j),*(r1+j))), accum); j++;
+ case 2: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+j),_mm_set_ps(*(r4+j),*(r3+j),*(r2+j),*(r1+j))), accum); j++;
+ case 1: accum = _mm_add_ps(_mm_mul_ps(_mm_load1_ps(v+j),_mm_set_ps(*(r4+j),*(r3+j),*(r2+j),*(r1+j))), accum);
case 0: ;
}
+ // store the 4 values of the result vector
+ // use stream to avoid polluting the cache
+ _mm_stream_ps(r+i,accum);
+ }
- //sum four elements at a time, sum will contain four running totals
- for(int i = n-4; i >= 0; i-=4)
- sum = _mm_add_ps(VNL_SSE_HEAP_LOAD(ps)(x+i),sum);
+ // handle the left over rows
+ for (; r_left > 0; --r_left) {
+ accum = _mm_setzero_ps();
+ const float* p = m+(rows-r_left)*cols;
+ for (unsigned int j=0; j<cols; ++j)
+ accum = _mm_add_ss(_mm_mul_ss(_mm_load_ss(p+j), _mm_load_ss(v+j)),accum);
+ _mm_store_ss(r+rows-r_left,accum);
+ }
+ }
+
+ static VNL_SSE_FORCE_INLINE float sum(const float* x, unsigned n)
+ {
+ float ret;
+ __m128 sum = _mm_setzero_ps();
+ switch (n%4)
+ { // handle vector sizes which aren't divisible by 4
+ case 3: sum = _mm_load_ss(x+--n);
+ case 2: sum = _mm_shuffle_ps(_mm_load_ss(x+--n), sum ,_MM_SHUFFLE(1,0,0,1));
+ case 1: sum = _mm_move_ss(sum,_mm_load_ss(x+--n));
+ case 0: ;
+ }
- // sum will contain 4 accumulated values, need to add them together
- sum = _mm_add_ps(sum,_mm_movehl_ps(_mm_setzero_ps(),sum));
- sum = _mm_add_ss(sum,_mm_shuffle_ps(sum,sum,_MM_SHUFFLE(3,2,1,1)));
- _mm_store_ss(&ret,sum);
- return ret;
+ // sum four elements at a time, sum will contain four running totals
+ for (int i = n-4; i >= 0; i-=4)
+ sum = _mm_add_ps(VNL_SSE_HEAP_LOAD(ps)(x+i),sum);
+
+ // sum will contain 4 accumulated values, need to add them together
+ sum = _mm_add_ps(sum,_mm_movehl_ps(_mm_setzero_ps(),sum));
+ sum = _mm_add_ss(sum,_mm_shuffle_ps(sum,sum,_MM_SHUFFLE(3,2,1,1)));
+ _mm_store_ss(&ret,sum);
+ return ret;
+ }
+
+ static VNL_SSE_FORCE_INLINE float max(const float* x, unsigned n)
+ {
+ float ret;
+ __m128 max = _mm_setzero_ps();
+ switch (n%4)
+ { // handle vector sizes which aren't divisible by 4
+ case 3: max = _mm_load_ss(x+--n);
+ case 2: max = _mm_shuffle_ps(_mm_load_ss(x+--n), max ,_MM_SHUFFLE(1,0,0,1));
+ case 1: max = _mm_move_ss(max,_mm_load_ss(x+--n));
+ case 0: ;
}
-
- static VNL_SSE_FORCE_INLINE float max(const float* x, unsigned n)
- {
- float ret;
- __m128 max = _mm_setzero_ps();
- switch(n % 4)
- { // handle vector sizes which aren't divisible by 4
- case 3: max = _mm_load_ss(x+--n);
- case 2: max = _mm_shuffle_ps(_mm_load_ss(x+--n), max ,_MM_SHUFFLE(1,0,0,1));
- case 1: max = _mm_move_ss(max,_mm_load_ss(x+--n));
- case 0: ;
- }
-
- //handle four elements at a time, max will contain four max values
- for(int i = n-4; i >= 0; i-=4)
- max = _mm_max_ps(VNL_SSE_HEAP_LOAD(ps)(x+i), max);
-
- // need compare max's four values
- max = _mm_max_ps(max,_mm_movehl_ps(_mm_setzero_ps(),max));
- max = _mm_max_ss(max,_mm_shuffle_ps(max,max,_MM_SHUFFLE(3,2,1,1)));
- _mm_store_ss(&ret,max);
-
- return ret;
+
+ // handle four elements at a time, max will contain four max values
+ for (int i = n-4; i >= 0; i-=4)
+ max = _mm_max_ps(VNL_SSE_HEAP_LOAD(ps)(x+i), max);
+
+ // need compare max's four values
+ max = _mm_max_ps(max,_mm_movehl_ps(_mm_setzero_ps(),max));
+ max = _mm_max_ss(max,_mm_shuffle_ps(max,max,_MM_SHUFFLE(3,2,1,1)));
+ _mm_store_ss(&ret,max);
+
+ return ret;
+ }
+
+ static VNL_SSE_FORCE_INLINE float min(const float* x, unsigned n)
+ {
+ float ret;
+ __m128 min = _mm_set1_ps(FLT_MAX);
+
+ switch (n%4)
+ { // handle vector sizes which aren't divisible by 4
+ case 3: min = _mm_min_ss(min,_mm_load_ss(x+--n));
+ case 2: min = _mm_min_ss(min,_mm_load_ss(x+--n));
+ case 1: min = _mm_min_ss(min,_mm_load_ss(x+--n));
+ case 0: ;
}
-
- static VNL_SSE_FORCE_INLINE float min(const float* x, unsigned n)
- {
- float ret;
- __m128 min = _mm_set1_ps(FLT_MAX);
-
- switch(n%4)
- { // handle vector sizes which aren't divisible by 4
- case 3: min = _mm_min_ss(min,_mm_load_ss(x+--n));
- case 2: min = _mm_min_ss(min,_mm_load_ss(x+--n));
- case 1: min = _mm_min_ss(min,_mm_load_ss(x+--n));
- case 0: ;
- }
- //handle four elements at a time, min will contain four min values
- for(int i = n-4; i >= 0; i-=4)
- min = _mm_min_ps(VNL_SSE_HEAP_LOAD(ps)(x+i), min);
+ // handle four elements at a time, min will contain four min values
+ for (int i = n-4; i >= 0; i-=4)
+ min = _mm_min_ps(VNL_SSE_HEAP_LOAD(ps)(x+i), min);
- // need compare min's four values
- min = _mm_min_ps(min,_mm_movehl_ps(_mm_setzero_ps(),min));
- min = _mm_min_ss(min,_mm_shuffle_ps(min,min,_MM_SHUFFLE(3,2,1,1)));
- _mm_store_ss(&ret,min);
-
- return ret;
- }
+ // need compare min's four values
+ min = _mm_min_ps(min,_mm_movehl_ps(_mm_setzero_ps(),min));
+ min = _mm_min_ss(min,_mm_shuffle_ps(min,min,_MM_SHUFFLE(3,2,1,1)));
+ _mm_store_ss(&ret,min);
+
+ return ret;
+ }
};
-#endif
+#endif // VNL_CONFIG_ENABLE_SSE2
-#endif //vnl_sse_h_
+#endif // vnl_sse_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sym_matrix.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sym_matrix.h
index 210ec0bb6a9e16e0cb95e32b0a6b2f4473c5de51..5a4396541b024a80771bdd0eaa028a7680516cff 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sym_matrix.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sym_matrix.h
@@ -8,7 +8,7 @@
// \file
// \brief Contains class for symmetric matrices
// \author Ian Scott (Manchester ISBE)
-// \date 6/12/2001
+// \date 6 Dec 2001
#include <vcl_cassert.h>
#include <vcl_iosfwd.h>
@@ -28,7 +28,7 @@ class vnl_sym_matrix
//: Construct an empty symmetric matrix.
vnl_sym_matrix(): data_(0), index_(0), nn_(0) {}
- //: Construct an symmetric matrix of size nn by nn.
+ //: Construct a symmetric matrix of size nn by nn.
explicit vnl_sym_matrix(unsigned nn):
data_(vnl_c_vector<T>::allocate_T(nn * (nn + 1) / 2)),
index_(vnl_c_vector<T>::allocate_Tptr(nn)),
@@ -48,7 +48,7 @@ class vnl_sym_matrix
//: Copy constructor
inline vnl_sym_matrix(vnl_sym_matrix<T> const& that);
-
+
~vnl_sym_matrix()
{ vnl_c_vector<T>::deallocate(data_, size());
vnl_c_vector<T>::deallocate(index_, nn_);}
@@ -143,7 +143,7 @@ class vnl_sym_matrix
};
//:
-// \relates vnl_sym_matrix
+// \relatesalso vnl_sym_matrix
template <class T> vcl_ostream& operator<< (vcl_ostream&, vnl_sym_matrix<T> const&);
@@ -231,7 +231,7 @@ template <class T>
bool operator==(const vnl_matrix<T> &a, const vnl_sym_matrix<T> &b);
//: Swap the contents of a and b.
-// \relates vnl_sym_matrix
+// \relatesalso vnl_sym_matrix
template <class T>
void swap(vnl_sym_matrix<T> &a, vnl_sym_matrix<T> &b)
{ a.swap(b); }
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sym_matrix.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sym_matrix.txx
index bb09049688465a8f493b2c8c3d956a9c65504f6a..82a5b2345c0bb747659866150f16e2e2b6adb1d5 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sym_matrix.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_sym_matrix.txx
@@ -6,7 +6,7 @@
#include "vnl_sym_matrix.h"
#include <vcl_iostream.h>
-
+#include <vnl/vnl_config.h> // for VNL_CONFIG_CHECK_BOUNDS
// ==========================================================================
//: Replaces the symmetric submatrix of THIS matrix, starting at top left corner, by the elements of matrix m.
@@ -15,13 +15,13 @@ template<class T>
vnl_sym_matrix<T>& vnl_sym_matrix<T>::update (vnl_sym_matrix<T> const& m,
unsigned diagonal_start)
{
- unsigned int end = diagonal_start + m.nn_;
+ unsigned int end_val = diagonal_start + m.nn_;
#if VNL_CONFIG_CHECK_BOUNDS && (!defined NDEBUG)
- if (this->nn_ < end)
+ if (this->nn_ < end_val)
vnl_error_matrix_dimension ("vnl_sym_matrix::update",
- end, end, m.nn_, m.nn_);
+ end_val, end_val, m.nn_, m.nn_);
#endif
- for (unsigned int i = diagonal_start; i < end; i++)
+ for (unsigned int i = diagonal_start; i < end_val; i++)
for (unsigned int j = diagonal_start; j <= i; j++)
this->fast(i,j) = m.fast(i-diagonal_start,j-diagonal_start);
return *this;
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_tag.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_tag.h
index 0f0d654a9db8dbf9534bf22bf3c28119c44c1e6b..7452a0344c3316fdf43f67e0ddfee57637837705 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_tag.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_tag.h
@@ -7,8 +7,8 @@
//
// These tags are used as argument to some private vnl_matrix and vnl_vector
// constructors to take advantage of the C++ return value optimization.
-// \relates vnl_matrix
-// \relates vnl_vector
+// \relatesalso vnl_matrix
+// \relatesalso vnl_vector
struct vnl_tag_add { };
struct vnl_tag_sub { };
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_trace.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_trace.h
index 2611eb379460a26312cad5af89e1040c9db69203..bc7863d24d73599dd1bb6576e43809fe1f8a882d 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_trace.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_trace.h
@@ -19,7 +19,7 @@
#include <vnl/vnl_matrix_fixed.h>
//: Calculate trace of a matrix
-// \relates vnl_matrix
+// \relatesalso vnl_matrix
template <class T>
T vnl_trace(vnl_matrix<T> const& M)
{
@@ -31,7 +31,7 @@ T vnl_trace(vnl_matrix<T> const& M)
}
//: Calculate trace of a matrix
-// \relates vnl_matrix_fixed
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned int N1, unsigned int N2>
T vnl_trace(vnl_matrix_fixed<T,N1,N2> const& M)
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_unary_function.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_unary_function.txx
index 57480865d120657ea16124c47f8fcfabf1603062..e4d8c78ff2a1e82d25170740323d20987b4d4063 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_unary_function.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_unary_function.txx
@@ -6,12 +6,12 @@
// \brief Abstract 1D map
// vnl_unary_function is an abstract map between two types (read spaces).
// \author Andrew W. Fitzgibbon, Oxford RRG
-// \date 28 Nov 98
+// \date 28 Nov 1998
//
// \verbatim
// Modifications
// 981128 AWF Initial version.
-// LSB Manchester 19/3/01 Documentation tidied
+// LSB Manchester 19/Mar/2001 Documentation tidied
// Feb.2002 - Peter Vanroose - brief doxygen comment placed on single line
// Oct.2003 - Ian Scott - Move the use of vcl_limits out of the .h file, to
// solve stupid MSVC6.0 problems.
@@ -19,8 +19,8 @@
//
//-----------------------------------------------------------------------------
-#include <vcl_limits.h>
#include "vnl_unary_function.h"
+#include <vcl_limits.h>
//: Return bounding cube of range (outputs)
template <class RETURN, class ARGUMENT>
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector.h
index ab862af05703467a69fdfd50948e05470cc884af..ef38bbd3722cce36550629a1f71712d1d3f50160 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector.h
@@ -13,6 +13,8 @@
// Comments re-written by Tim Cootes, for his sins.
// Feb.2002 - Peter Vanroose - brief doxygen comment placed on single line
// Mar.2004 - Peter Vanroose - deprecated fixed-size constructors now compile only when VNL_CONFIG_LEGACY_METHODS==1
+// Mar.2009 - Peter Vanroose - added arg_min() and arg_max()
+// Oct.2010 - Peter Vanroose - mutators and setters now return *this
// \endverbatim
#include <vcl_iosfwd.h>
@@ -145,20 +147,19 @@ class vnl_vector
inline T get(unsigned int i) const;
//: Set all values to v
- void fill(T const& v);
+ vnl_vector& fill(T const& v);
//: Sets elements to ptr[i]
// Note: ptr[i] must be valid for i=0..size()-1
- void copy_in(T const * ptr);
+ vnl_vector& copy_in(T const * ptr);
//: Copy elements to ptr[i]
// Note: ptr[i] must be valid for i=0..size()-1
void copy_out(T *) const; // from vector to array[].
-
//: Sets elements to ptr[i]
// Note: ptr[i] must be valid for i=0..size()-1
- void set(T const *ptr) { copy_in(ptr); }
+ vnl_vector& set(T const *ptr) { return copy_in(ptr); }
//: Return reference to the element at specified index.
// There are assert style boundary checks - #define NDEBUG to turn them off.
@@ -194,7 +195,7 @@ class vnl_vector
vnl_vector<T>& operator+=(T );
//: Subtract scalar value from all elements
- vnl_vector<T>& operator-=(T value) { return *this += (-value); }
+ vnl_vector<T>& operator-=(T value) { return *this += T(-value); }
//: Multiply all elements by scalar
vnl_vector<T>& operator*=(T );
@@ -249,6 +250,8 @@ class vnl_vector
//: Type defs for iterators
typedef T element_type;
+ typedef unsigned size_type;
+
//: Type defs for iterators
typedef T *iterator;
//: Iterator pointing to start of data
@@ -306,7 +309,7 @@ class vnl_vector
vnl_vector<T>& normalize() { vnl_c_vector<T>::normalize(begin(), size()); return *this; }
// These next 6 functions are should really be helper functions since they aren't
- // really proper functions on a vector in a philosophial sense.
+ // really proper functions on a vector in a philosophical sense.
//: Root Mean Squares of values
abs_t rms() const { return vnl_c_vector<T>::rms_norm(begin(), size()); }
@@ -317,6 +320,12 @@ class vnl_vector
//: Largest value
T max_value() const { return vnl_c_vector<T>::max_value(begin(), size()); }
+ //: Location of smallest value
+ unsigned arg_min() const { return vnl_c_vector<T>::arg_min(begin(), size()); }
+
+ //: Location of largest value
+ unsigned arg_max() const { return vnl_c_vector<T>::arg_max(begin(), size()); }
+
//: Mean of values in vector
T mean() const { return vnl_c_vector<T>::mean(begin(), size()); }
@@ -325,7 +334,7 @@ class vnl_vector
//: Reverse the order of the elements
// Element i swaps with element size()-1-i
- void flip();
+ vnl_vector& flip();
//: Set this to that and that to this
void swap(vnl_vector<T> & that);
@@ -362,6 +371,8 @@ class vnl_vector
void assert_size(unsigned sz) const {
#ifndef NDEBUG
assert_size_internal(sz);
+#else
+ (void)sz;
#endif
}
@@ -373,7 +384,7 @@ class vnl_vector
#endif
}
- //: Return true if its finite
+ //: Return true if it's finite
bool is_finite() const;
//: Return true iff all the entries are zero.
@@ -382,6 +393,9 @@ class vnl_vector
//: Return true iff the size is zero.
bool empty() const { return !data || !num_elmts; }
+ //: Return true if all elements of vectors are equal, within given tolerance
+ bool is_equal(vnl_vector<T> const& rhs, double tol) const;
+
//: Return true if *this == v
bool operator_eq(vnl_vector<T> const& v) const;
@@ -399,7 +413,6 @@ class vnl_vector
//: Make the vector as if it had been default-constructed.
void clear();
-
//: Read from text stream
bool read_ascii(vcl_istream& s);
@@ -477,8 +490,8 @@ inline void vnl_vector<T>::put(unsigned int index, T const& value)
}
//: multiply matrix and (column) vector. O(m*n).
-// \relates vnl_vector
-// \relates vnl_matrix
+// \relatesalso vnl_vector
+// \relatesalso vnl_matrix
template<class T>
inline vnl_vector<T> operator*(vnl_matrix<T> const& m, vnl_vector<T> const& v)
{
@@ -486,7 +499,7 @@ inline vnl_vector<T> operator*(vnl_matrix<T> const& m, vnl_vector<T> const& v)
}
//: add scalar and vector. O(n).
-// \relates vnl_vector
+// \relatesalso vnl_vector
template<class T>
inline vnl_vector<T> operator+(T s, vnl_vector<T> const& v)
{
@@ -494,7 +507,7 @@ inline vnl_vector<T> operator+(T s, vnl_vector<T> const& v)
}
//: subtract vector from scalar. O(n).
-// \relates vnl_vector
+// \relatesalso vnl_vector
template<class T>
inline vnl_vector<T> operator-(T s, vnl_vector<T> const& v)
{
@@ -502,7 +515,7 @@ inline vnl_vector<T> operator-(T s, vnl_vector<T> const& v)
}
//: multiply scalar and vector. O(n).
-// \relates vnl_vector
+// \relatesalso vnl_vector
template<class T>
inline vnl_vector<T> operator*(T s, vnl_vector<T> const& v)
{
@@ -510,13 +523,13 @@ inline vnl_vector<T> operator*(T s, vnl_vector<T> const& v)
}
//: Interchange the two vectors
-// \relates vnl_vector
+// \relatesalso vnl_vector
template<class T>
inline void swap(vnl_vector<T> &a, vnl_vector<T> &b) { a.swap(b); }
//: Euclidean Distance between two vectors.
// Sum of Differences squared.
-// \relates vnl_vector
+// \relatesalso vnl_vector
template<class T>
inline T vnl_vector_ssd(vnl_vector<T> const& v1, vnl_vector<T> const& v2)
{
@@ -530,10 +543,10 @@ inline T vnl_vector_ssd(vnl_vector<T> const& v1, vnl_vector<T> const& v2)
// Non-vector functions which are nevertheless very useful.
//: Write vector to a vcl_ostream
-// \relates vnl_vector
+// \relatesalso vnl_vector
export template <class T> vcl_ostream& operator<<(vcl_ostream &, vnl_vector<T> const&);
//: Read vector from a vcl_istream
-// \relates vnl_vector
+// \relatesalso vnl_vector
export template <class T> vcl_istream& operator>>(vcl_istream &, vnl_vector<T> &);
#endif // vnl_vector_h_
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector.txx
index a942a418c63f40dd66dbcc0cb7869eb902399f10..cdf42284c5fe1fff579864d9863c5d8d356db11e 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector.txx
@@ -3,8 +3,9 @@
#define vnl_vector_txx_
//:
// \file
-//
-// \date VDN 02/21/92 new lite version adapted from Matrix.h
+// \author VDN
+// \date Feb 21, 1992
+// \brief new lite version adapted from Matrix.h
//
// The parameterized vnl_vector<T> class implements 1D arithmetic vectors of a
// user specified type. The only constraint placed on the type is that
@@ -57,22 +58,23 @@
#else
# define vnl_vector_construct_hack()
#endif
-
+
// This macro allocates the dynamic storage used by a vnl_vector.
#define vnl_vector_alloc_blah(size) \
do { \
this->num_elmts = (size); \
- this->data = vnl_c_vector<T>::allocate_T(size); \
+ this->data = size ? vnl_c_vector<T>::allocate_T(size) : 0; \
} while (false)
// This macro deallocates the dynamic storage used by a vnl_vector.
#define vnl_vector_free_blah \
do { \
- vnl_c_vector<T>::deallocate(this->data, this->num_elmts); \
+ if (this->data) \
+ vnl_c_vector<T>::deallocate(this->data, this->num_elmts); \
} while (false)
-
+
//: Creates a vector with specified length. O(n).
// Elements are not initialized.
@@ -351,19 +353,23 @@ vnl_vector<T> vnl_vector<T>::read(vcl_istream& s)
//: Sets all elements of a vector to a specified fill value. O(n).
template<class T>
-void vnl_vector<T>::fill (T const& value)
+vnl_vector<T>&
+vnl_vector<T>::fill (T const& value)
{
for (unsigned i = 0; i < this->num_elmts; i++)
this->data[i] = value;
+ return *this;
}
//: Sets elements of a vector to those in an array. O(n).
template<class T>
-void vnl_vector<T>::copy_in (T const *ptr)
+vnl_vector<T>&
+vnl_vector<T>::copy_in (T const *ptr)
{
for (unsigned i = 0; i < num_elmts; ++i)
data[i] = ptr[i];
+ return *this;
}
//: Sets elements of an array to those in vector. O(n).
@@ -467,11 +473,10 @@ vnl_vector<T>& vnl_vector<T>::pre_multiply (vnl_matrix<T> const& m)
vnl_error_vector_dimension ("operator*=", this->num_elmts, m.columns());
#endif
T* temp= vnl_c_vector<T>::allocate_T(m.rows()); // Temporary
- vnl_matrix<T>& mm = (vnl_matrix<T>&) m; // Drop const for get()
for (unsigned i = 0; i < m.rows(); i++) { // For each index
temp[i] = (T)0; // Initialize element value
for (unsigned k = 0; k < this->num_elmts; k++) // Loop over column values
- temp[i] += (mm.get(i,k) * this->data[k]); // Multiply
+ temp[i] += (m.get(i,k) * this->data[k]); // Multiply
}
vnl_c_vector<T>::deallocate(this->data, this->num_elmts); // Free up the data space
num_elmts = m.rows(); // Set new num_elmts
@@ -490,11 +495,10 @@ vnl_vector<T>& vnl_vector<T>::post_multiply (vnl_matrix<T> const& m)
vnl_error_vector_dimension ("operator*=", this->num_elmts, m.rows());
#endif
T* temp= vnl_c_vector<T>::allocate_T(m.columns()); // Temporary
- vnl_matrix<T>& mm = (vnl_matrix<T>&) m; // Drop const for get()
for (unsigned i = 0; i < m.columns(); i++) { // For each index
temp[i] = (T)0; // Initialize element value
for (unsigned k = 0; k < this->num_elmts; k++) // Loop over column values
- temp[i] += (this->data[k] * mm.get(k,i)); // Multiply
+ temp[i] += (this->data[k] * m.get(k,i)); // Multiply
}
vnl_c_vector<T>::deallocate(this->data, num_elmts); // Free up the data space
num_elmts = m.columns(); // Set new num_elmts
@@ -525,11 +529,10 @@ vnl_vector<T> operator* (vnl_matrix<T> const& m, vnl_vector<T> const& v)
vnl_error_vector_dimension ("operator*", m.columns(), v.size());
#endif
vnl_vector<T> result(m.rows()); // Temporary
- vnl_matrix<T>& mm = (vnl_matrix<T>&) m; // Drop const for get()
for (unsigned i = 0; i < m.rows(); i++) { // For each index
result[i] = (T)0; // Initialize element value
for (unsigned k = 0; k < v.size(); k++) // Loop over column values
- result[i] += (mm.get(i,k) * v[k]); // Multiply
+ result[i] += (m.get(i,k) * v[k]); // Multiply
}
return result;
}
@@ -552,11 +555,10 @@ vnl_vector<T> vnl_vector<T>::operator* (vnl_matrix<T> const&m) const
vnl_error_vector_dimension ("operator*", num_elmts, m.rows());
#endif
vnl_vector<T> result(m.columns()); // Temporary
- vnl_matrix<T>& mm = (vnl_matrix<T>&) m; // Drop const for get()
for (unsigned i = 0; i < m.columns(); i++) { // For each index
result.data[i] = (T)0; // Initialize element value
for (unsigned k = 0; k < num_elmts; k++) // Loop over column values
- result.data[i] += (data[k] * mm.get(k,i)); // Multiply
+ result.data[i] += (data[k] * m.get(k,i)); // Multiply
}
return result;
}
@@ -604,11 +606,11 @@ vnl_vector<T> element_product (vnl_vector<T> const& v1, vnl_vector<T> const& v2)
if (v1.size() != v2.size())
vnl_error_vector_dimension ("element_product", v1.size(), v2.size());
#endif
-
+
vnl_vector<T> result(v1.size());
-
+
vnl_sse<T>::element_product(v1.begin(), v2.begin(), result.begin(), v1.size());
-
+
return result;
}
@@ -707,13 +709,15 @@ vnl_matrix<T> outer_product (vnl_vector<T> const& v1,
//--------------------------------------------------------------------------------
template <class T>
-void vnl_vector<T>::flip()
+vnl_vector<T>&
+vnl_vector<T>::flip()
{
for (unsigned i=0;i<num_elmts/2;i++) {
T tmp=data[i];
data[i]=data[num_elmts-1-i];
data[num_elmts-1-i]=tmp;
}
+ return *this;
}
template <class T>
@@ -805,6 +809,22 @@ void vnl_vector<T>::assert_size_internal(unsigned sz) const
}
}
+template <class T>
+bool vnl_vector<T>::is_equal(vnl_vector<T> const& rhs, double tol) const
+{
+ if (this == &rhs) //Same object ? => equal.
+ return true;
+
+ if (this->size() != rhs.size()) //Size different ?
+ return false;
+ for (unsigned i = 0; i < size(); i++)
+ if (vnl_math_abs(this->data[i] - rhs.data[i]) > tol) //Element different ?
+ return false;
+
+ return true;
+
+}
+
template<class T>
bool vnl_vector<T>::operator_eq (vnl_vector<T> const& rhs) const
{
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed.h
index 96e73853d1f339712b111980bef4be40f044f38a..415d39a3b6228171d1ff0775c6393282beb2599f 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed.h
@@ -24,6 +24,8 @@
// removed duplicate cross_3d
// Jun.2003 - Peter Vanroose - added cross_2d
// Oct.2003 - Peter Vanroose - removed deprecated x(), y(), z(), t()
+// Mar.2009 - Peter Vanroose - added arg_min() and arg_max()
+// Oct.2010 - Peter Vanroose - mutators and setters now return *this
// \endverbatim
#include <vcl_cstring.h> // memcpy()
@@ -31,8 +33,9 @@
#include <vcl_iosfwd.h>
#include "vnl_vector.h"
#include "vnl_vector_ref.h"
-#include "vnl_c_vector.h"
-#include "vnl_matrix.h" // outerproduct
+#include <vnl/vnl_c_vector.h>
+#include <vnl/vnl_matrix.h> // outerproduct
+#include <vnl/vnl_config.h> // for VNL_CONFIG_CHECK_BOUNDS
export template <class T, unsigned int n> class vnl_vector_fixed;
export template <class T, unsigned int num_rows, unsigned int num_cols> class vnl_matrix_fixed;
@@ -81,16 +84,15 @@ export template <class T, unsigned int num_rows, unsigned int num_cols> class vn
template <class T, unsigned int n>
class vnl_vector_fixed
{
+ protected:
+ T data_[n];
+
public:
typedef vnl_vector_fixed<T,n> self;
typedef unsigned int size_type;
// Compile-time accessible attribute to get the dimensionality of the vector.
- enum{ SIZE = n };
-
- protected:
- T data_[n];
+ enum { SIZE = n };
- public:
// Don't out-of-line the constructors, as extra the function call
// adds a significant overhead. (memcpy is often implemented with a
// couple of assembly instructions.)
@@ -116,7 +118,7 @@ class vnl_vector_fixed
//: Constructs n-vector with all elements initialised to \a v
explicit vnl_vector_fixed( const T& v ) { fill( v ); }
- //: Construct an fixed-n-vector initialized from \a datablck
+ //: Construct a fixed-n-vector initialized from \a datablck
// The data *must* have enough data. No checks performed.
explicit vnl_vector_fixed( const T* datablck )
{
@@ -127,10 +129,18 @@ class vnl_vector_fixed
// While this constructor is sometimes useful, consider using
// vnl_double_2 or vnl_float_2 instead.
vnl_vector_fixed( const T& x0, const T& x1 )
- {
+ {
assert( n == 2 );
- data_[0] = x0; data_[1] = x1;
- }
+ if(n == 2)
+ {
+ data_[0] = x0;
+ data_[1] = x1;
+ }
+ else
+ {
+ //Throw exception?
+ }
+ }
//: Convenience constructor for 3-D vectors
// While this constructor is sometimes useful, consider using
@@ -138,15 +148,34 @@ class vnl_vector_fixed
vnl_vector_fixed( const T& x0, const T& x1, const T& x2 )
{
assert( n == 3 );
- data_[0] = x0; data_[1] = x1; data_[2] = x2;
+ if( n == 3)
+ {
+ data_[0] = x0;
+ data_[1] = x1;
+ data_[2] = x2;
+ }
+ else
+ {
+ //Throw exception?
+ }
}
//: Convenience constructor for 4-D vectors
vnl_vector_fixed( const T& x0, const T& x1, const T& x2, const T& x3 )
- {
+ {
assert( n == 4 );
- data_[0] = x0; data_[1] = x1; data_[2] = x2; data_[3] = x3;
- }
+ if( n == 4 )
+ {
+ data_[0] = x0;
+ data_[1] = x1;
+ data_[2] = x2;
+ data_[3] = x3;
+ }
+ else
+ {
+ //Throw exception?
+ }
+ }
//: Copy operator
vnl_vector_fixed<T,n>& operator=( const vnl_vector_fixed<T,n>& rhs ) {
@@ -173,18 +202,20 @@ class vnl_vector_fixed
T get (unsigned int i) const { return data_[i]; }
//: Set all values to v
- void fill( T const& v )
+ vnl_vector_fixed& fill( T const& v )
{
for ( size_type i = 0; i < n; ++i )
data_[i] = v;
+ return *this;
}
//: Sets elements to ptr[i]
// Note: ptr[i] must be valid for i=0..size()-1
- void copy_in( T const * ptr )
+ vnl_vector_fixed& copy_in( T const * ptr )
{
for ( size_type i = 0; i < n; ++i )
data_[i] = ptr[i];
+ return *this;
}
//: Copy elements to ptr[i]
@@ -197,8 +228,7 @@ class vnl_vector_fixed
//: Sets elements to ptr[i]
// Note: ptr[i] must be valid for i=0..size()-1
- void set( T const *ptr ) { copy_in(ptr); }
-
+ vnl_vector_fixed& set( T const *ptr ) { return copy_in(ptr); }
//: Return reference to the element at specified index.
// There are assert style boundary checks - #define NDEBUG to turn them off.
@@ -374,6 +404,12 @@ class vnl_vector_fixed
//: Largest value
T max_value () const { return vnl_c_vector<T>::max_value(begin(), size()); }
+ //: Location of smallest value
+ unsigned arg_min() const { return vnl_c_vector<T>::arg_min(begin(), size()); }
+
+ //: Location of largest value
+ unsigned arg_max() const { return vnl_c_vector<T>::arg_max(begin(), size()); }
+
//: Mean of values in vector
T mean() const { return vnl_c_vector<T>::mean(begin(), size()); }
@@ -382,7 +418,7 @@ class vnl_vector_fixed
//: Reverse the order of the elements
// Element i swaps with element size()-1-i
- void flip();
+ vnl_vector_fixed& flip();
//: Check that size()==sz if not, abort();
// This function does or tests nothing if NDEBUG is defined
@@ -397,7 +433,7 @@ class vnl_vector_fixed
#endif
}
- //: Return true if its finite
+ //: Return true if it's finite
bool is_finite() const;
//: Return true iff all the entries are zero.
@@ -500,7 +536,7 @@ class vnl_vector_fixed
// --- Vector-scalar operators ----------------------------------------
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator+( const vnl_vector_fixed<T,n>& v, T s )
{
@@ -510,7 +546,7 @@ inline vnl_vector_fixed<T,n> operator+( const vnl_vector_fixed<T,n>& v, T s )
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator+( const T& s,
const vnl_vector_fixed<T,n>& v )
@@ -521,7 +557,7 @@ inline vnl_vector_fixed<T,n> operator+( const T& s,
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator-( const vnl_vector_fixed<T,n>& v, T s )
{
@@ -531,7 +567,7 @@ inline vnl_vector_fixed<T,n> operator-( const vnl_vector_fixed<T,n>& v, T s )
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator-( const T& s,
const vnl_vector_fixed<T,n>& v )
@@ -542,7 +578,7 @@ inline vnl_vector_fixed<T,n> operator-( const T& s,
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator*( const vnl_vector_fixed<T,n>& v, T s )
{
@@ -552,7 +588,7 @@ inline vnl_vector_fixed<T,n> operator*( const vnl_vector_fixed<T,n>& v, T s )
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator*( const T& s,
const vnl_vector_fixed<T,n>& v )
@@ -563,7 +599,7 @@ inline vnl_vector_fixed<T,n> operator*( const T& s,
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator/( const vnl_vector_fixed<T,n>& v, T s )
{
@@ -580,7 +616,7 @@ inline vnl_vector_fixed<T,n> operator/( const vnl_vector_fixed<T,n>& v, T s )
// be automatically converted to a non-fixed-ref. These do it for you.
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator+( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -590,8 +626,8 @@ inline vnl_vector_fixed<T,n> operator+( const vnl_vector_fixed<T,n>& a, const vn
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector<T> operator+( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
{
@@ -599,8 +635,8 @@ inline vnl_vector<T> operator+( const vnl_vector_fixed<T,n>& a, const vnl_vector
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector<T> operator+( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -608,7 +644,7 @@ inline vnl_vector<T> operator+( const vnl_vector<T>& a, const vnl_vector_fixed<T
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator-( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -618,8 +654,8 @@ inline vnl_vector_fixed<T,n> operator-( const vnl_vector_fixed<T,n>& a, const vn
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector<T> operator-( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
{
@@ -627,8 +663,8 @@ inline vnl_vector<T> operator-( const vnl_vector_fixed<T,n>& a, const vnl_vector
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector<T> operator-( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -636,7 +672,7 @@ inline vnl_vector<T> operator-( const vnl_vector<T>& a, const vnl_vector_fixed<T
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> element_product( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -646,8 +682,8 @@ inline vnl_vector_fixed<T,n> element_product( const vnl_vector_fixed<T,n>& a, co
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector<T> element_product( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
{
@@ -658,8 +694,8 @@ inline vnl_vector<T> element_product( const vnl_vector_fixed<T,n>& a, const vnl_
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector<T> element_product( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -670,7 +706,7 @@ inline vnl_vector<T> element_product( const vnl_vector<T>& a, const vnl_vector_f
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> element_quotient( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -680,8 +716,8 @@ inline vnl_vector_fixed<T,n> element_quotient( const vnl_vector_fixed<T,n>& a, c
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector<T> element_quotient( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
{
@@ -692,8 +728,8 @@ inline vnl_vector<T> element_quotient( const vnl_vector_fixed<T,n>& a, const vnl
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector<T> element_quotient( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -704,7 +740,7 @@ inline vnl_vector<T> element_quotient( const vnl_vector<T>& a, const vnl_vector_
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned n>
inline T dot_product( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -712,8 +748,8 @@ inline T dot_product( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned n>
inline T dot_product( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
{
@@ -721,8 +757,8 @@ inline T dot_product( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned n>
inline T dot_product( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -730,8 +766,8 @@ inline T dot_product( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_matrix<T> outer_product( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -739,8 +775,8 @@ inline vnl_matrix<T> outer_product( const vnl_vector<T>& a, const vnl_vector_fix
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_matrix<T> outer_product( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
{
@@ -748,7 +784,7 @@ inline vnl_matrix<T> outer_product( const vnl_vector_fixed<T,n>& a, const vnl_ve
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned n>
inline T angle( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -756,8 +792,8 @@ inline T angle( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n>& b )
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned n>
inline T angle( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
{
@@ -765,8 +801,8 @@ inline T angle( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned n>
inline T angle( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -775,7 +811,7 @@ inline T angle( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned n>
inline T vnl_vector_ssd( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -783,8 +819,8 @@ inline T vnl_vector_ssd( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned n>
inline T vnl_vector_ssd( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b )
{
@@ -792,8 +828,8 @@ inline T vnl_vector_ssd( const vnl_vector_fixed<T,n>& a, const vnl_vector<T>& b
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned n>
inline T vnl_vector_ssd( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -802,7 +838,7 @@ inline T vnl_vector_ssd( const vnl_vector<T>& a, const vnl_vector_fixed<T,n>& b
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline bool operator==( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -810,8 +846,8 @@ inline bool operator==( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline bool operator==( vnl_vector_fixed<T,n> const& a, vnl_vector<T> const& b )
{
@@ -819,8 +855,8 @@ inline bool operator==( vnl_vector_fixed<T,n> const& a, vnl_vector<T> const& b )
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline bool operator==( vnl_vector<T> const& a, vnl_vector_fixed<T,n> const& b )
{
@@ -828,7 +864,7 @@ inline bool operator==( vnl_vector<T> const& a, vnl_vector_fixed<T,n> const& b )
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline bool operator!=( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T,n>& b )
{
@@ -836,8 +872,8 @@ inline bool operator!=( const vnl_vector_fixed<T,n>& a, const vnl_vector_fixed<T
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline bool operator!=( vnl_vector_fixed<T,n> const& a, vnl_vector<T> const& b )
{
@@ -845,8 +881,8 @@ inline bool operator!=( vnl_vector_fixed<T,n> const& a, vnl_vector<T> const& b )
}
//:
-// \relates vnl_vector
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline bool operator!=( vnl_vector<T> const& a, vnl_vector_fixed<T,n> const& b )
{
@@ -858,7 +894,7 @@ inline bool operator!=( vnl_vector<T> const& a, vnl_vector_fixed<T,n> const& b )
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline
vcl_ostream& operator<< ( vcl_ostream& ostr, const vnl_vector_fixed<T,n>& v )
@@ -868,7 +904,7 @@ vcl_ostream& operator<< ( vcl_ostream& ostr, const vnl_vector_fixed<T,n>& v )
}
//:
-// \relates vnl_vector_fixed
+// \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline
vcl_istream& operator>> ( vcl_istream& ostr, vnl_vector_fixed<T,n>& v )
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed.txx
index cbb0bc27312552ae4a464dc3a697ec686be9cd7d..b94224ac8a2350e1e66ca12098ceef6f4841203b 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed.txx
@@ -53,11 +53,12 @@ vnl_vector_fixed<T,n>::update( const vnl_vector<T>& v, unsigned int start )
}
template <class T, unsigned int n>
-void
+vnl_vector_fixed<T,n>&
vnl_vector_fixed<T,n>::flip()
{
for ( unsigned int i=0; 2*i+1 < n; ++i )
vcl_swap( data_[i], data_[n-1-i] );
+ return *this;
}
template <class T, unsigned int n>
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed_ref.h b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed_ref.h
index 6e5a8bcbe8a018aebd748ddd94730fa030264aec..f916e6488c534a31e2df8079bf3b90c8fbd8efc3 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed_ref.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed_ref.h
@@ -15,7 +15,9 @@
//
// \verbatim
// Modifications
-// 4-Jul-2003 Paul Smyth - general cleanup and rewrite; interface now as vnl_vector_fixed
+// 4-Jul-2003 - Paul Smyth - general cleanup and rewrite; interface now as vnl_vector_fixed
+// 30-Mar-2009 - Peter Vanroose - added arg_min() and arg_max()
+// 24-Oct-2010 - Peter Vanroose - mutators and setters now return *this
// \endverbatim
#include <vcl_cassert.h>
@@ -26,13 +28,12 @@
template <class T, unsigned int n>
class vnl_vector_fixed_ref_const
{
- public:
- typedef unsigned int size_type;
-
protected:
const T* data_;
public:
+ typedef unsigned int size_type;
+
vnl_vector_fixed_ref_const(vnl_vector_fixed<T,n> const& rhs) : data_(rhs.data_block()) {}
explicit vnl_vector_fixed_ref_const(const T * dataptr) : data_(dataptr) {}
@@ -41,7 +42,6 @@ class vnl_vector_fixed_ref_const
const T * data_block() const { return data_; }
- public:
// Don't out-of-line the constructors, as the extra function call
// adds a significant overhead. (memcpy is often implemented with a
// couple of assembly instructions.)
@@ -166,6 +166,12 @@ class vnl_vector_fixed_ref_const
//: Largest value
T max_value () const { return vnl_c_vector<T>::max_value(begin(), n); }
+ //: Location of smallest value
+ unsigned arg_min() const { return vnl_c_vector<T>::arg_min(begin(), n); }
+
+ //: Location of largest value
+ unsigned arg_max() const { return vnl_c_vector<T>::arg_max(begin(), n); }
+
//: Mean of values in vector
T mean() const { return vnl_c_vector<T>::mean(begin(), n); }
@@ -185,7 +191,7 @@ class vnl_vector_fixed_ref_const
#endif
}
- //: Return true if its finite
+ //: Return true if it's finite
bool is_finite() const;
//: Return true iff all the entries are zero.
@@ -328,16 +334,23 @@ class vnl_vector_fixed_ref : public vnl_vector_fixed_ref_const<T,n>
void put (unsigned int i, T const& v) const { data_block()[i] = v; }
//: Set all values to v
- void fill( T const& v ) { for ( size_type i = 0; i < n; ++i ) data_block()[i] = v; }
+ vnl_vector_fixed_ref& fill( T const& v )
+ {
+ for ( size_type i = 0; i < n; ++i ) data_block()[i] = v;
+ return *this;
+ }
//: Sets elements to ptr[i]
// Note: ptr[i] must be valid for i=0..size()-1
- void copy_in( T const * ptr ) const { for ( size_type i = 0; i < n; ++i ) data_block()[i] = ptr[i]; }
+ vnl_vector_fixed_ref const& copy_in( T const * ptr ) const
+ {
+ for ( size_type i = 0; i < n; ++i ) data_block()[i] = ptr[i];
+ return *this;
+ }
//: Sets elements to ptr[i]
// Note: ptr[i] must be valid for i=0..size()-1
- void set( T const *ptr ) const { copy_in(ptr); }
-
+ vnl_vector_fixed_ref const& set( T const *ptr ) const { copy_in(ptr); return *this; }
//: Return reference to the element at specified index.
// There are assert style boundary checks - #define NDEBUG to turn them off.
@@ -368,7 +381,7 @@ class vnl_vector_fixed_ref : public vnl_vector_fixed_ref_const<T,n>
//: Read from text stream
bool read_ascii(vcl_istream& s) const;
- void flip() const;
+ vnl_vector_fixed_ref const& flip() const;
//:
vnl_vector_fixed_ref<T,n> const & operator+=( T s ) const {
@@ -421,7 +434,7 @@ class vnl_vector_fixed_ref : public vnl_vector_fixed_ref_const<T,n>
// --- Vector-scalar operators ----------------------------------------
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator+( const vnl_vector_fixed_ref_const<T,n>& v, T s )
{
@@ -430,7 +443,7 @@ inline vnl_vector_fixed<T,n> operator+( const vnl_vector_fixed_ref_const<T,n>& v
return r;
}
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator+( T s, const vnl_vector_fixed_ref_const<T,n>& v )
{
@@ -439,7 +452,7 @@ inline vnl_vector_fixed<T,n> operator+( T s, const vnl_vector_fixed_ref_const<T,
return r;
}
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator-( const vnl_vector_fixed_ref_const<T,n>& v, T s )
{
@@ -448,7 +461,7 @@ inline vnl_vector_fixed<T,n> operator-( const vnl_vector_fixed_ref_const<T,n>& v
return r;
}
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator-( T s, const vnl_vector_fixed_ref_const<T,n>& v )
{
@@ -457,7 +470,7 @@ inline vnl_vector_fixed<T,n> operator-( T s, const vnl_vector_fixed_ref_const<T,
return r;
}
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator*( const vnl_vector_fixed_ref_const<T,n>& v, T s )
{
@@ -466,7 +479,7 @@ inline vnl_vector_fixed<T,n> operator*( const vnl_vector_fixed_ref_const<T,n>& v
return r;
}
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator*( T s, const vnl_vector_fixed_ref_const<T,n>& v )
{
@@ -475,7 +488,7 @@ inline vnl_vector_fixed<T,n> operator*( T s, const vnl_vector_fixed_ref_const<T,
return r;
}
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator/( const vnl_vector_fixed_ref_const<T,n>& v, T s )
{
@@ -488,7 +501,7 @@ inline vnl_vector_fixed<T,n> operator/( const vnl_vector_fixed_ref_const<T,n>& v
// --- Vector-vector operators ----------------------------------------
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator+( const vnl_vector_fixed_ref_const<T,n>& a, const vnl_vector_fixed_ref_const<T,n>& b )
{
@@ -497,7 +510,7 @@ inline vnl_vector_fixed<T,n> operator+( const vnl_vector_fixed_ref_const<T,n>& a
return r;
}
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline vnl_vector_fixed<T,n> operator-( const vnl_vector_fixed_ref_const<T,n>& a, const vnl_vector_fixed_ref_const<T,n>& b )
{
@@ -653,7 +666,7 @@ inline T vnl_vector_ssd( const vnl_vector<T>& a, const vnl_vector_fixed_ref_cons
// --- I/O operators -------------------------------------------------
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline
vcl_ostream& operator<<(vcl_ostream& o,const vnl_vector_fixed_ref_const<T,n>& v)
@@ -662,7 +675,7 @@ vcl_ostream& operator<<(vcl_ostream& o,const vnl_vector_fixed_ref_const<T,n>& v)
return o;
}
-//: \relates vnl_vector_fixed
+//: \relatesalso vnl_vector_fixed
template<class T, unsigned int n>
inline
vcl_istream& operator>>(vcl_istream& i, const vnl_vector_fixed_ref<T,n>& v)
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed_ref.txx b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed_ref.txx
index efceaaaac86a6926fb6ccc6fb9b1fd994b779845..40c6b80deb812fc7a600535db961ab41e55e0631 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed_ref.txx
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/vnl_vector_fixed_ref.txx
@@ -1,7 +1,7 @@
// This is core/vnl/vnl_vector_fixed_ref.txx
#ifndef vnl_vector_fixed_ref_txx_
#define vnl_vector_fixed_ref_txx_
-// Author: Paul P. Smyth, Vicon Motion Systems Ltd.
+// Author: Paul P. Smyth, Vicon Motion Systems Ltd.
// Created: 02 May 2001
//
#include "vnl_vector_fixed_ref.h"
@@ -55,11 +55,12 @@ vnl_vector_fixed_ref<T,n>::update( const vnl_vector<T>& v, unsigned int start )
}
template <class T, unsigned int n>
-void
+vnl_vector_fixed_ref<T,n> const&
vnl_vector_fixed_ref<T,n>::flip() const
{
for ( unsigned int i=0; 2*i+1 < n; ++i )
vcl_swap( data_block()[i], data_block()[n-1-i] );
+ return *this;
}
template <class T, unsigned int n>
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_matrix_fixed.h b/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_matrix_fixed.h
index 93f0eb5dd553756ad2f5c2c7fd7f98fde4748246..08c357cbd2dcc4072ee06f185b137f39bdefb018 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_matrix_fixed.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_matrix_fixed.h
@@ -6,14 +6,14 @@
// \author Gamze D. Tunali
// \date 22-Dec-2005
-//#include <vsl/vsl_binary_io.h>
#include <vnl/vnl_matrix_fixed.h>
#include <vcl_string.h>
#include <vcl_iosfwd.h>
//: XML save vnl_matrix_fixed to stream.
+// \relatesalso vnl_matrix_fixed
template <class T, unsigned m, unsigned n>
-void x_write(vcl_ostream & os, const vnl_matrix_fixed<T,m,n> & v,
+void x_write(vcl_ostream & os, const vnl_matrix_fixed<T,m,n> & v,
vcl_string name="vnl_matrix_fixed");
#endif // vnl_xio_matrix_fixed_h
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_quaternion.h b/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_quaternion.h
index e4abb19066b51913234d73b2c6640ed5d525c460..2fe80f4e64c5a79744a20be31b1b4f42f65d532f 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_quaternion.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_quaternion.h
@@ -6,14 +6,14 @@
// \author Gamze D. Tunali
// \date 22-Dec-2005
-//#include <vsl/vsl_binary_io.h>
#include <vnl/vnl_quaternion.h>
#include <vcl_string.h>
#include <vcl_iosfwd.h>
//: XML save vnl_quaternion to stream.
+// \relatesalso vnl_quaternion
template <class T>
-void x_write(vcl_ostream & os, const vnl_quaternion<T> & v,
+void x_write(vcl_ostream & os, const vnl_quaternion<T> & v,
vcl_string name="vnl_quaternion");
#endif // vnl_xio_quaternion_h
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_vector.h b/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_vector.h
index 778f741d99ff9c742b2ecd25640f8b38e2ab66bd..1925e95a261b14d1605007f33940e9c3ac3904c0 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_vector.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_vector.h
@@ -6,14 +6,14 @@
// \author Gamze Tunali
// \date 30-Dec-2005
-//#include <vsl/vsl_fwd.h>
#include <vnl/vnl_vector.h>
#include <vcl_string.h>
-#include <vcl_iostream.h>
+#include <vcl_iosfwd.h>
//: XML save vnl_vector_fixed to stream.
+// \relatesalso vnl_vector
template <class T>
-void x_write(vcl_ostream & os, const vnl_vector<T> & v,
+void x_write(vcl_ostream & os, const vnl_vector<T> & v,
vcl_string name="vnl_vector");
#endif // vnl_xio_vector_h
diff --git a/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_vector_fixed.h b/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_vector_fixed.h
index 4e7ad0bf6f6c98e56a5f1d2690caa3ac75c61590..24e502fe886b252dbb65a21965986d83d20f8753 100644
--- a/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_vector_fixed.h
+++ b/Utilities/ITK/Utilities/vxl/core/vnl/xio/vnl_xio_vector_fixed.h
@@ -4,7 +4,7 @@
//:
// \file
// \author Gamze Tunali
-// \date 12/28/2005
+// \date Dec 28, 2005
#include <vsl/vsl_fwd.h>
#include <vnl/vnl_vector_fixed.h>
@@ -12,8 +12,9 @@
#include <vcl_string.h>
//: XML save vnl_vector_fixed to stream.
+// \relatesalso vnl_vector_fixed
template <class T, unsigned n>
-void x_write(vcl_ostream & os, const vnl_vector_fixed<T,n> & v,
+void x_write(vcl_ostream & os, const vnl_vector_fixed<T,n> & v,
vcl_string name="vnl_vector_fixed");
#endif // vnl_xio_vector_fixed_h
diff --git a/Utilities/ITK/Utilities/vxl/core/vxl_config.h.in b/Utilities/ITK/Utilities/vxl/core/vxl_config.h.in
index 696009d240859301ebe1b427faf0f24dd34e6121..73ab8fa193c06cb9ed26a76cd17c7c4c848f221a 100644
--- a/Utilities/ITK/Utilities/vxl/core/vxl_config.h.in
+++ b/Utilities/ITK/Utilities/vxl/core/vxl_config.h.in
@@ -5,23 +5,27 @@
/* -------------------- machine word characteristics */
-/* what byte order */
+/* machine byte order */
+#if defined(__APPLE__)
/* All compilers that support Mac OS X define either __BIG_ENDIAN__ or
__LITTLE_ENDIAN__ to match the endianness of the architecture being
- compiled for. This is not necessarily the same as the architecture of
- the machine doing the building. In order to support Universal Binaries on
- Mac OS X, we prefer those defines to decide the endianness.
- On other platform, we use the result of the TRY_RUN. */
-#if !defined(__APPLE__)
- /* these are 0 or 1, never empty. */
- #define VXL_LITTLE_ENDIAN @VXL_LITTLE_ENDIAN@
- #define VXL_BIG_ENDIAN @VXL_BIG_ENDIAN@
-#elif defined(__BIG_ENDIAN__)
- #define VXL_BIG_ENDIAN 1
- #define VXL_LITTLE_ENDIAN 0
+ compiled for. This is not necessarily the same as the architecture
+ of the machine doing the building. In order to support Universal
+ Binaries on Mac OS X, we prefer those defines to decide the
+ endianness. Elsewhere use the platform check result. */
+# if defined(__BIG_ENDIAN__)
+# define VXL_BIG_ENDIAN 1
+# define VXL_LITTLE_ENDIAN 0
+# elif defined(__LITTLE_ENDIAN__)
+# define VXL_BIG_ENDIAN 0
+# define VXL_LITTLE_ENDIAN 1
+# else
+# error "Cannot determine machine byte order!"
+# endif
#else
- #define VXL_BIG_ENDIAN 0
- #define VXL_LITTLE_ENDIAN 1
+/* these are 0 or 1, never empty. */
+# define VXL_LITTLE_ENDIAN @VXL_LITTLE_ENDIAN@
+# define VXL_BIG_ENDIAN @VXL_BIG_ENDIAN@
#endif
/* we can't just use typedefs, because on systems where there are */
@@ -76,20 +80,39 @@
# define vxl_uint_32 void
#endif
-#define VXL_HAS_INT_64 @VXL_HAS_INT_64@
-#define VXL_INT_64_STRING "@VXL_INT_64@"
-#if @VXL_HAS_INT_64@
+/* Mac OS X Universal binary support requires a preprocessor test. */
+#if defined(__APPLE__)
+# define VXL_HAS_INT_64 1
+# if __LONG_MAX__ == 0x7fffffff
+# define VXL_INT_64_STRING "long long"
+ typedef long long vxl_int_64;
+ typedef signed long long vxl_sint_64;
+ typedef unsigned long long vxl_uint_64;
+# define VXL_INT_64_IS_LONG 0
+# elif __LONG_MAX__>>32 == 0x7fffffff
+# define VXL_INT_64_STRING "long"
+ typedef long vxl_int_64;
+ typedef signed long vxl_sint_64;
+ typedef unsigned long vxl_uint_64;
+# define VXL_INT_64_IS_LONG 1
+# else
+# error "Cannot determine sizeof(long) from __LONG_MAX__."
+# endif
+#else
+# define VXL_HAS_INT_64 @VXL_HAS_INT_64@
+# define VXL_INT_64_STRING "@VXL_INT_64@"
+# if @VXL_HAS_INT_64@
typedef @VXL_INT_64@ vxl_int_64;
typedef signed @VXL_INT_64@ vxl_sint_64;
typedef unsigned @VXL_INT_64@ vxl_uint_64;
-#else
-# define vxl_int_64 void
-# define vxl_sint_64 void
-# define vxl_uint_64 void
+# else
+# define vxl_int_64 void
+# define vxl_sint_64 void
+# define vxl_uint_64 void
+# endif
+# define VXL_INT_64_IS_LONG @VXL_INT_64_IS_LONG@
#endif
-#define VXL_INT_64_IS_LONG @VXL_INT_64_IS_LONG@
-
#define VXL_HAS_IEEE_32 @VXL_HAS_IEEE_32@
#define VXL_IEEE_32_STRING "@VXL_IEEE_32@"
#if @VXL_HAS_IEEE_32@
@@ -122,6 +145,8 @@
# define vxl_ieee_128 void
#endif
+#cmakedefine VXL_ADDRESS_BITS @VXL_ADDRESS_BITS@
+
/* -------------------- operating system services */
#define VXL_HAS_PTHREAD_H @VXL_HAS_PTHREAD_H@
@@ -202,4 +227,7 @@
/* true if memalign is defined */
#define VXL_HAS_POSIX_MEMALIGN @VXL_HAS_POSIX_MEMALIGN@
+/* true if wchar_t overloading functions are supported on Windows */
+#define VXL_USE_WIN_WCHAR_T @VXL_USE_WIN_WCHAR_T@
+
#endif /* vxl_config_h_ */
diff --git a/Utilities/ITK/Utilities/vxl/core/vxl_version.h b/Utilities/ITK/Utilities/vxl/core/vxl_version.h
index 7535f2273cd328edd483781bed89ccec9e21c53b..602d50828b784c5184507eb983ae56aa120a573c 100644
--- a/Utilities/ITK/Utilities/vxl/core/vxl_version.h
+++ b/Utilities/ITK/Utilities/vxl/core/vxl_version.h
@@ -8,17 +8,17 @@
// core libraries.
//: Major version number.
-// This will only increase after major changes, or an large accumulation of
+// This will only increase after major changes, or a large accumulation of
// significant smaller ones.
#define VXL_VERSION_MAJOR 1
//: Minor version number.
// This increments between versions. There is no
-// "even = release, odd = developement" pattern, or anything like that.
-#define VXL_VERSION_MINOR 9
+// "even = release, odd = development" pattern, or anything like that.
+#define VXL_VERSION_MINOR 15
//: Patch number.
-// This is only likely to be non-zero if an serious bug is found soon after the
+// This is only likely to be non-zero if a serious bug is found soon after the
// release of x.y.0. The VXL-maintainers do not usually distinguish between bug fixes
// and feature improvements, so the fix for most known bugs will first be released
// in x.(y+1).0
@@ -26,16 +26,13 @@
//: Version date. This is updated every day.
// Formats are year=CCYY, month=MM, day=DD
-#define VXL_VERSION_DATE_YEAR 2007
-#define VXL_VERSION_DATE_MONTH 11
-#define VXL_VERSION_DATE_DAY 09
+#define VXL_VERSION_DATE_YEAR 2011
+#define VXL_VERSION_DATE_MONTH 04
+#define VXL_VERSION_DATE_DAY 28
//: ITK Modification: Defined to indicate this vxl is in ITK.
#define VXL_VERSION_ITK
-//: This can either be "RELEASE" or "CVS"
-#define VXL_SOURCE "CVS"
-
//: Helper macros to create strings with the preprocessor.
#define VXL_VERSION_TO_STRING(s) VXL_VERSION_TO_STRING0(s)
#define VXL_VERSION_TO_STRING0(s) #s
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/v3p/netlib/CMakeLists.txt
index 4e2b00d30057016bd9217e8f7aa4a1c134777d72..6e4da9c87a6e9c8f5056d39cc1ff9938d0d706ac 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/CMakeLists.txt
@@ -24,7 +24,7 @@ PROJECT( netlib C )
#
IF(BUILD_TESTING)
- SUBDIRS(tests)
+# SUBDIRS(tests)
ENDIF(BUILD_TESTING)
# Allow sources in subdirectories to see the include files.
@@ -62,6 +62,7 @@ SET(V3P_NETLIB_libf2c_SOURCES
libf2c/pow_di.c
libf2c/pow_ii.c
libf2c/pow_ri.c
+ libf2c/pow_zi.c
libf2c/r_cnjg.c
libf2c/r_imag.c
libf2c/r_sign.c
@@ -124,6 +125,7 @@ SET(V3P_NETLIB_blas_SOURCES
blas/zgemm.c blas/zgemm.h
blas/zgemv.c blas/zgemv.h
blas/zgerc.c blas/zgerc.h
+ blas/zgeru.c blas/zgeru.h
blas/zscal.c blas/zscal.h
blas/zswap.c blas/zswap.h
blas/ztrmm.c blas/ztrmm.h
@@ -197,6 +199,20 @@ SET(V3P_NETLIB_laso_SOURCES
laso/dvsort.c laso/dvsort.h
laso/urand.c laso/urand.h
)
+SET(V3P_NETLIB_arpack_SOURCES
+ arpack/dgetv0.c arpack/dgetv0.h
+ arpack/dsaitr.c arpack/dsaitr.h
+ arpack/dsapps.c arpack/dsapps.h
+ arpack/dsaup2.c arpack/dsaup2.h
+ arpack/dsaupd.c arpack/dsaupd.h
+ arpack/dsconv.c arpack/dsconv.h
+ arpack/dseigt.c arpack/dseigt.h
+ arpack/dsesrt.c arpack/dsesrt.h
+ arpack/dseupd.c arpack/dseupd.h
+ arpack/dsgets.c arpack/dsgets.h
+ arpack/dsortr.c arpack/dsortr.h
+ arpack/dstqrb.c arpack/dstqrb.h
+ )
SET(V3P_NETLIB_lapack_SOURCES
lapack/complex16/zgebak.c lapack/complex16/zgebak.h
lapack/complex16/zgebal.c lapack/complex16/zgebal.h
@@ -224,6 +240,33 @@ SET(V3P_NETLIB_lapack_SOURCES
lapack/complex16/zung2r.c lapack/complex16/zung2r.h
lapack/complex16/zunghr.c lapack/complex16/zunghr.h
lapack/complex16/zungqr.c lapack/complex16/zungqr.h
+ lapack/complex16/ztgsyl.c lapack/complex16/ztgsyl.h
+ lapack/complex16/zrot.c lapack/complex16/zrot.h
+ lapack/complex16/zlatdf.c lapack/complex16/zlatdf.h
+ lapack/complex16/zlacn2.c lapack/complex16/zlacn2.h
+ lapack/complex16/ztgsy2.c lapack/complex16/ztgsy2.h
+ lapack/complex16/ztgexc.c lapack/complex16/ztgexc.h
+ lapack/complex16/zggbak.c lapack/complex16/zggbak.h
+ lapack/complex16/zgetc2.c lapack/complex16/zgetc2.h
+ lapack/complex16/zhgeqz.c lapack/complex16/zhgeqz.h
+ lapack/complex16/zgges.c lapack/complex16/zgges.h
+ lapack/complex16/zlaswp.c lapack/complex16/zlaswp.h
+ lapack/complex16/zdrscl.c lapack/complex16/zdrscl.h
+ lapack/complex16/zlartg.c lapack/complex16/zlartg.h
+ lapack/complex16/zggbal.c lapack/complex16/zggbal.h
+ lapack/complex16/zgeqr2.c lapack/complex16/zgeqr2.h
+ lapack/complex16/zgecon.c lapack/complex16/zgecon.h
+ lapack/complex16/zunmqr.c lapack/complex16/zunmqr.h
+ lapack/complex16/zunm2r.c lapack/complex16/zunm2r.h
+ lapack/complex16/zgeqrf.c lapack/complex16/zgeqrf.h
+ lapack/complex16/ztgex2.c lapack/complex16/ztgex2.h
+ lapack/complex16/zgesc2.c lapack/complex16/zgesc2.h
+ lapack/complex16/ztgsen.c lapack/complex16/ztgsen.h
+ lapack/complex16/zgghrd.c lapack/complex16/zgghrd.h
+ lapack/complex16/zgees.c lapack/complex16/zgees.h
+ lapack/complex16/ztrexc.c lapack/complex16/ztrexc.h
+ lapack/complex16/ztrsen.c lapack/complex16/ztrsen.h
+ lapack/complex16/ztrsyl.c lapack/complex16/ztrsyl.h
lapack/double/dgecon.c lapack/double/dgecon.h
lapack/double/dgeqr2.c lapack/double/dgeqr2.h
lapack/double/dgeqrf.c lapack/double/dgeqrf.h
@@ -273,6 +316,14 @@ SET(V3P_NETLIB_lapack_SOURCES
lapack/double/dtgsen.c lapack/double/dtgsen.h
lapack/double/dtgsy2.c lapack/double/dtgsy2.h
lapack/double/dtgsyl.c lapack/double/dtgsyl.h
+ lapack/double/dlae2.c lapack/double/dlae2.h
+ lapack/double/dlanst.c lapack/double/dlanst.h
+ lapack/double/dlarnv.c lapack/double/dlarnv.h
+ lapack/double/dlaruv.c lapack/double/dlaruv.h
+ lapack/double/dlasr.c lapack/double/dlasr.h
+ lapack/double/dlasrt.c lapack/double/dlasrt.h
+ lapack/double/dsteqr.c lapack/double/dsteqr.h
+ lapack/double/dzsum1.c lapack/double/dzsum1.h
lapack/single/sgeqpf.c lapack/single/sgeqpf.h
lapack/single/sgeqr2.c lapack/single/sgeqr2.h
lapack/single/sgerq2.c lapack/single/sgerq2.h
@@ -297,6 +348,7 @@ SET(V3P_NETLIB_lapack_SOURCES
lapack/single/stgsja.c lapack/single/stgsja.h
lapack/util/ieeeck.c lapack/util/ieeeck.h
lapack/util/ilaenv.c lapack/util/ilaenv.h
+ lapack/util/izmax1.c lapack/util/izmax1.h
lapack/util/lsame.c lapack/util/lsame.h
)
SET(V3P_NETLIB_napack_SOURCES
@@ -344,6 +396,7 @@ SET(v3p_netlib_sources
${V3P_NETLIB_base_SOURCES}
${V3P_NETLIB_libf2c_SOURCES}
${V3P_NETLIB_blas_SOURCES}
+ ${V3P_NETLIB_arpack_SOURCES}
${V3P_NETLIB_linpack_SOURCES}
${V3P_NETLIB_temperton_SOURCES}
${V3P_NETLIB_eispack_SOURCES}
@@ -406,7 +459,7 @@ IF(CMAKE_COMPILER_IS_GNUCC)
)
ENDIF(CMAKE_COMPILER_IS_GNUCC)
-IF(CMAKE_C_COMPILER MATCHES "icc")
+IF(CMAKE_C_COMPILER MATCHES "^icc")
# Adjust optimization of floating point computation for some sources.
SET_SOURCE_FILES_PROPERTIES(
blas/slamch.c
@@ -414,7 +467,7 @@ IF(CMAKE_C_COMPILER MATCHES "icc")
# PROPERTIES COMPILE_FLAGS -O0
PROPERTIES COMPILE_FLAGS -fp_port
)
-ENDIF(CMAKE_C_COMPILER MATCHES "icc")
+ENDIF(CMAKE_C_COMPILER MATCHES "^icc")
# Create a netlib library with mangled symbols.
@@ -428,12 +481,13 @@ ENDIF(ITK_LIBRARY_PROPERTIES)
IF(NOT VXL_INSTALL_NO_LIBRARIES)
INSTALL(TARGETS itkv3p_netlib
- RUNTIME DESTINATION ${VXL_INSTALL_BIN_DIR_CM24} COMPONENT RuntimeLibraries
- LIBRARY DESTINATION ${VXL_INSTALL_LIB_DIR_CM24} COMPONENT RuntimeLibraries
- ARCHIVE DESTINATION ${VXL_INSTALL_LIB_DIR_CM24} COMPONENT Development)
+ EXPORT ${VXL_INSTALL_EXPORT_NAME}
+ RUNTIME DESTINATION ${VXL_INSTALL_RUNTIME_DIR} COMPONENT RuntimeLibraries
+ LIBRARY DESTINATION ${VXL_INSTALL_LIBRARY_DIR} COMPONENT RuntimeLibraries
+ ARCHIVE DESTINATION ${VXL_INSTALL_ARCHIVE_DIR} COMPONENT Development)
ENDIF(NOT VXL_INSTALL_NO_LIBRARIES)
IF(NOT VXL_INSTALL_NO_DEVELOPMENT)
- INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_ROOT}/v3p/netlib ${v3p_netlib_sources})
+ INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_INCLUDE_DIR} ${v3p_netlib_sources})
ENDIF(NOT VXL_INSTALL_NO_DEVELOPMENT)
SUBDIRS(linalg)
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/README b/Utilities/ITK/Utilities/vxl/v3p/netlib/README
index 62acd3387855760246bee87d36b4b631ffd041b1..3d053f87ca9cd46622aa0f5c02e256bb0c53179f 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/README
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/README
@@ -78,12 +78,12 @@ The other directories were created as follows:
4.) Commit the original fortran sources.
- cvs commit -m "Adding original fortran code for this function."
+ svn commit -m "Adding original fortran code for this function."
5.) Convert the sources to C using f2c and replace the f2c.h header
inclusion with v3p_netlib.h:
-for d in blas linpack temperton eispack laso lapack/complex16 lapack/double lapack/single lapack/util napack minpack opt linalg toms datapac mathews; do
+for d in blas linpack temperton eispack laso arpack lapack/complex16 lapack/double lapack/single lapack/util napack minpack opt linalg toms datapac mathews; do
for f in ${d}/*.f; do
b=`echo "$f" | sed 's/.f$//'`
if [ ! -f "${b}.c" ]; then
@@ -95,7 +95,7 @@ for d in blas linpack temperton eispack laso lapack/complex16 lapack/double lapa
done
done
- cvs commit -m "Converted function from fortran to C."
+ svn commit -m "Converted function from fortran to C."
Note the use of options to f2c:
@@ -129,7 +129,7 @@ done
v3p_netlib_prototypes.h.
echo "/* Include prototype headers. */" > v3p_netlib_prototypes.h
-for f in blas/*.P linpack/*.P temperton/*.P eispack/*.P laso/*.P lapack/*/*.P napack/*.P minpack/*.P opt/*.P linalg/*.P toms/*.P datapac/*.P mathews/*.P; do
+for f in blas/*.P linpack/*.P temperton/*.P eispack/*.P laso/*.P arpack/*.P lapack/*/*.P napack/*.P minpack/*.P opt/*.P linalg/*.P toms/*.P datapac/*.P mathews/*.P; do
b=`echo "$f" | sed 's/.P//'`
if [ ! -f "${b}.h" ] ; then
echo "Converting prototype $b"
@@ -164,7 +164,7 @@ for f in blas/*.P linpack/*.P temperton/*.P eispack/*.P laso/*.P lapack/*/*.P na
echo "#include \"${b}.h\"" >> v3p_netlib_prototypes.h
done
-cvs commit -m "Converted .P file prototypes generated by f2c to v3p_netlib_-mangled protytypes in header files."
+svn commit -m "Converted .P file prototypes generated by f2c to v3p_netlib_-mangled protytypes in header files."
Some of these prototype header files have been manually edited to add
v3p_netlib_const to some of the arguments. This is a hack to allow
@@ -174,9 +174,9 @@ allows the f2c-converted code to compile without manual conversion to
const-correctness. The macro is defined to "const" when compiling
other sources which enforces const-correctness for code calling the
routines. Since the interface is extern "C" code, the symbol names
-are not changed by the precense or absence of const.
+are not changed by the presence or absence of const.
-cvs -q commit -m "Manually documented prototype and added v3p_netlib_const to appropriate arguments."
+svn -q commit -m "Manually documented prototype and added v3p_netlib_const to appropriate arguments."
------------------------------------------------------------------------------
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.P
new file mode 100644
index 0000000000000000000000000000000000000000..bd0735535b64aa5a635671ac55893d95aa09030f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.P
@@ -0,0 +1,9 @@
+extern int dgetv0_(integer *ido, char *bmat, integer *itry, logical *initv, integer *n, integer *j, doublereal *v, integer *ldv, doublereal *resid, doublereal *rnorm, integer *ipntr, doublereal *workd, integer *ierr, ftnlen bmat_len);
+/* comlen debug_ 96 */
+/* comlen timing_ 124 */
+/*:ref: second_ 14 1 6 */
+/*:ref: dlarnv_ 14 4 4 4 4 7 */
+/*:ref: dcopy_ 14 5 4 7 4 7 4 */
+/*:ref: ddot_ 7 5 4 7 4 7 4 */
+/*:ref: dnrm2_ 7 3 4 7 4 */
+/*:ref: dgemv_ 14 12 13 4 4 7 7 4 7 4 7 7 4 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.c
new file mode 100644
index 0000000000000000000000000000000000000000..71e33123bc4030a16d9168e3ad18e84172ad0a4e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.c
@@ -0,0 +1,641 @@
+/* arpack/dgetv0.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Common Block Declarations */
+
+/*Extern struct { */
+/* integer logfil, ndigit, mgetv0, msaupd, msaup2, msaitr, mseigt, msapps, */
+/* msgets, mseupd, mnaupd, mnaup2, mnaitr, mneigh, mnapps, mngets, */
+/* mneupd, mcaupd, mcaup2, mcaitr, mceigh, mcapps, mcgets, mceupd; */
+/*} debug_; */
+
+/*#define debug_1 debug_ */
+
+/*Extern struct { */
+/* integer nopx, nbx, nrorth, nitref, nrstrt; */
+/* real tsaupd, tsaup2, tsaitr, tseigt, tsgets, tsapps, tsconv, tnaupd, */
+/* tnaup2, tnaitr, tneigh, tngets, tnapps, tnconv, tcaupd, tcaup2, */
+/* tcaitr, tceigh, tcgets, tcapps, tcconv, tmvopx, tmvbx, tgetv0, */
+/* titref, trvec; */
+/*} timing_; */
+
+/*#define timing_1 timing_ */
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+static doublereal c_b24 = 1.;
+static doublereal c_b26 = 0.;
+static doublereal c_b29 = -1.;
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dgetv0 */
+
+/* \Description: */
+/* Generate a random initial residual vector for the Arnoldi process. */
+/* Force the residual vector to be in the range of the operator OP. */
+
+/* \Usage: */
+/* call dgetv0 */
+/* ( IDO, BMAT, ITRY, INITV, N, J, V, LDV, RESID, RNORM, */
+/* IPNTR, WORKD, IERR ) */
+
+/* \Arguments */
+/* IDO Integer. (INPUT/OUTPUT) */
+/* Reverse communication flag. IDO must be zero on the first */
+/* call to dgetv0. */
+/* ------------------------------------------------------------- */
+/* IDO = 0: first call to the reverse communication interface */
+/* IDO = -1: compute Y = OP * X where */
+/* IPNTR(1) is the pointer into WORKD for X, */
+/* IPNTR(2) is the pointer into WORKD for Y. */
+/* This is for the initialization phase to force the */
+/* starting vector into the range of OP. */
+/* IDO = 2: compute Y = B * X where */
+/* IPNTR(1) is the pointer into WORKD for X, */
+/* IPNTR(2) is the pointer into WORKD for Y. */
+/* IDO = 99: done */
+/* ------------------------------------------------------------- */
+
+/* BMAT Character*1. (INPUT) */
+/* BMAT specifies the type of the matrix B in the (generalized) */
+/* eigenvalue problem A*x = lambda*B*x. */
+/* B = 'I' -> standard eigenvalue problem A*x = lambda*x */
+/* B = 'G' -> generalized eigenvalue problem A*x = lambda*B*x */
+
+/* ITRY Integer. (INPUT) */
+/* ITRY counts the number of times that dgetv0 is called. */
+/* It should be set to 1 on the initial call to dgetv0. */
+
+/* INITV Logical variable. (INPUT) */
+/* .TRUE. => the initial residual vector is given in RESID. */
+/* .FALSE. => generate a random initial residual vector. */
+
+/* N Integer. (INPUT) */
+/* Dimension of the problem. */
+
+/* J Integer. (INPUT) */
+/* Index of the residual vector to be generated, with respect to */
+/* the Arnoldi process. J > 1 in case of a "restart". */
+
+/* V Double precision N by J array. (INPUT) */
+/* The first J-1 columns of V contain the current Arnoldi basis */
+/* if this is a "restart". */
+
+/* LDV Integer. (INPUT) */
+/* Leading dimension of V exactly as declared in the calling */
+/* program. */
+
+/* RESID Double precision array of length N. (INPUT/OUTPUT) */
+/* Initial residual vector to be generated. If RESID is */
+/* provided, force RESID into the range of the operator OP. */
+
+/* RNORM Double precision scalar. (OUTPUT) */
+/* B-norm of the generated residual. */
+
+/* IPNTR Integer array of length 3. (OUTPUT) */
+
+/* WORKD Double precision work array of length 2*N. (REVERSE COMMUNICATION). */
+/* On exit, WORK(1:N) = B*RESID to be used in SSAITR. */
+
+/* IERR Integer. (OUTPUT) */
+/* = 0: Normal exit. */
+/* = -1: Cannot generate a nontrivial restarted residual vector */
+/* in the range of the operator OP. */
+
+/* \EndDoc */
+
+/* ----------------------------------------------------------------------- */
+
+/* \BeginLib */
+
+/* \Local variables: */
+/* xxxxxx real */
+
+/* \References: */
+/* 1. D.C. Sorensen, "Implicit Application of Polynomial Filters in */
+/* a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992), */
+/* pp 357-385. */
+/* 2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly */
+/* Restarted Arnoldi Iteration", Rice University Technical Report */
+/* TR95-13, Department of Computational and Applied Mathematics. */
+
+/* \Routines called: */
+/* second ARPACK utility routine for timing. */
+/* dlarnv LAPACK routine for generating a random vector. */
+/* dgemv Level 2 BLAS routine for matrix vector multiplication. */
+/* dcopy Level 1 BLAS that copies one vector to another. */
+/* ddot Level 1 BLAS that computes the scalar product of two vectors. */
+/* dnrm2 Level 1 BLAS that computes the norm of a vector. */
+
+/* \Author */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \SCCS Information: @(#) */
+/* FILE: getv0.F SID: 2.6 DATE OF SID: 8/27/96 RELEASE: 2 */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< >*/
+/* Subroutine */ int dgetv0_(integer *ido, char *bmat, integer *itry, logical
+ *initv, integer *n, integer *j, doublereal *v, integer *ldv,
+ doublereal *resid, doublereal *rnorm, integer *ipntr, doublereal *
+ workd, integer *ierr, ftnlen bmat_len)
+{
+ /* Initialized data */
+
+ static logical inits = TRUE_;
+
+ /* System generated locals */
+ integer v_dim1, v_offset, i__1;
+
+ /* Builtin functions */
+ double sqrt(doublereal);
+
+ /* Local variables */
+/* static real t0, t1, t2, t3; */
+ integer jj;
+ extern doublereal ddot_(integer *, doublereal *, integer *, doublereal *,
+ integer *);
+ static integer iter;
+ static logical orth;
+ extern doublereal dnrm2_(integer *, doublereal *, integer *);
+ static integer iseed[4];
+ extern /* Subroutine */ int dgemv_(char *, integer *, integer *,
+ doublereal *, doublereal *, integer *, doublereal *, integer *,
+ doublereal *, doublereal *, integer *, ftnlen);
+ integer idist;
+ extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
+ doublereal *, integer *);
+ static logical first;
+ static doublereal rnorm0;
+/* static integer msglvl; */
+ extern /* Subroutine */ int dlarnv_(integer *, integer *, integer *,
+ doublereal *);
+
+
+/* %----------------------------------------------------% */
+/* | Include files for debugging and timing information | */
+/* %----------------------------------------------------% */
+
+/*< include 'debug.h' >*/
+/*< include 'stat.h' >*/
+
+/* \SCCS Information: @(#) */
+/* FILE: debug.h SID: 2.3 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/* %---------------------------------% */
+/* | See debug.doc for documentation | */
+/* %---------------------------------% */
+/*< >*/
+/*< character bmat*1 >*/
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/* %--------------------------------% */
+/* | See stat.doc for documentation | */
+/* %--------------------------------% */
+
+/* \SCCS Information: @(#) */
+/* FILE: stat.h SID: 2.2 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/*< save t0, t1, t2, t3, t4, t5 >*/
+
+/*< integer nopx, nbx, nrorth, nitref, nrstrt >*/
+/*< >*/
+/*< >*/
+/*< logical initv >*/
+/*< integer ido, ierr, itry, j, ldv, n >*/
+/*< >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< integer ipntr(3) >*/
+/*< >*/
+
+/* %------------% */
+/* | Parameters | */
+/* %------------% */
+
+/*< >*/
+/*< parameter (one = 1.0D+0, zero = 0.0D+0) >*/
+
+/* %------------------------% */
+/* | Local Scalars & Arrays | */
+/* %------------------------% */
+
+/*< logical first, inits, orth >*/
+/*< integer idist, iseed(4), iter, msglvl, jj >*/
+/*< >*/
+/*< save first, iseed, inits, iter, msglvl, orth, rnorm0 >*/
+
+/* %----------------------% */
+/* | External Subroutines | */
+/* %----------------------% */
+
+/*< external dlarnv, dcopy, dgemv, second >*/
+
+/* %--------------------% */
+/* | External Functions | */
+/* %--------------------% */
+
+/*< >*/
+/*< external ddot, dnrm2 >*/
+
+/* %---------------------% */
+/* | Intrinsic Functions | */
+/* %---------------------% */
+
+/*< intrinsic abs, sqrt >*/
+
+/* %-----------------% */
+/* | Data Statements | */
+/* %-----------------% */
+
+/*< data inits /.true./ >*/
+ /* Parameter adjustments */
+ --workd;
+ --resid;
+ v_dim1 = *ldv;
+ v_offset = 1 + v_dim1;
+ v -= v_offset;
+ --ipntr;
+
+ /* Function Body */
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+
+/* %-----------------------------------% */
+/* | Initialize the seed of the LAPACK | */
+/* | random number generator | */
+/* %-----------------------------------% */
+
+/*< if (inits) then >*/
+ if (inits) {
+/*< iseed(1) = 1 >*/
+ iseed[0] = 1;
+/*< iseed(2) = 3 >*/
+ iseed[1] = 3;
+/*< iseed(3) = 5 >*/
+ iseed[2] = 5;
+/*< iseed(4) = 7 >*/
+ iseed[3] = 7;
+/*< inits = .false. >*/
+ inits = FALSE_;
+/*< end if >*/
+ }
+
+/*< if (ido .eq. 0) then >*/
+ if (*ido == 0) {
+
+/* %-------------------------------% */
+/* | Initialize timing statistics | */
+/* | & message level for debugging | */
+/* %-------------------------------% */
+
+/*< call second (t0) >*/
+/* second_(&t0); */
+/*< msglvl = mgetv0 >*/
+/* msglvl = debug_1.mgetv0; */
+
+/*< ierr = 0 >*/
+ *ierr = 0;
+/*< iter = 0 >*/
+ iter = 0;
+/*< first = .FALSE. >*/
+ first = FALSE_;
+/*< orth = .FALSE. >*/
+ orth = FALSE_;
+
+/* %-----------------------------------------------------% */
+/* | Possibly generate a random starting vector in RESID | */
+/* | Use a LAPACK random number generator used by the | */
+/* | matrix generation routines. | */
+/* | idist = 1: uniform (0,1) distribution; | */
+/* | idist = 2: uniform (-1,1) distribution; | */
+/* | idist = 3: normal (0,1) distribution; | */
+/* %-----------------------------------------------------% */
+
+/*< if (.not.initv) then >*/
+ if (! (*initv)) {
+/*< idist = 2 >*/
+ idist = 2;
+/*< call dlarnv (idist, iseed, n, resid) >*/
+ dlarnv_(&idist, iseed, n, &resid[1]);
+/*< end if >*/
+ }
+
+/* %----------------------------------------------------------% */
+/* | Force the starting vector into the range of OP to handle | */
+/* | the generalized problem when B is possibly (singular). | */
+/* %----------------------------------------------------------% */
+
+/*< call second (t2) >*/
+/* second_(&t2); */
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< nopx = nopx + 1 >*/
+/* ++timing_1.nopx; */
+/*< ipntr(1) = 1 >*/
+ ipntr[1] = 1;
+/*< ipntr(2) = n + 1 >*/
+ ipntr[2] = *n + 1;
+/*< call dcopy (n, resid, 1, workd, 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[1], &c__1);
+/*< ido = -1 >*/
+ *ido = -1;
+/*< go to 9000 >*/
+ goto L9000;
+/*< end if >*/
+ }
+/*< end if >*/
+ }
+
+/* %-----------------------------------------% */
+/* | Back from computing OP*(initial-vector) | */
+/* %-----------------------------------------% */
+
+/*< if (first) go to 20 >*/
+ if (first) {
+ goto L20;
+ }
+
+/* %-----------------------------------------------% */
+/* | Back from computing B*(orthogonalized-vector) | */
+/* %-----------------------------------------------% */
+
+/*< if (orth) go to 40 >*/
+ if (orth) {
+ goto L40;
+ }
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< call second (t3) >*/
+/* second_(&t3); */
+/*< tmvopx = tmvopx + (t3 - t2) >*/
+/* timing_1.tmvopx += t3 - t2; */
+/*< end if >*/
+ }
+
+/* %------------------------------------------------------% */
+/* | Starting vector is now in the range of OP; r = OP*r; | */
+/* | Compute B-norm of starting vector. | */
+/* %------------------------------------------------------% */
+
+/*< call second (t2) >*/
+/* second_(&t2); */
+/*< first = .TRUE. >*/
+ first = TRUE_;
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< nbx = nbx + 1 >*/
+/* ++timing_1.nbx; */
+/*< call dcopy (n, workd(n+1), 1, resid, 1) >*/
+ dcopy_(n, &workd[*n + 1], &c__1, &resid[1], &c__1);
+/*< ipntr(1) = n + 1 >*/
+ ipntr[1] = *n + 1;
+/*< ipntr(2) = 1 >*/
+ ipntr[2] = 1;
+/*< ido = 2 >*/
+ *ido = 2;
+/*< go to 9000 >*/
+ goto L9000;
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< call dcopy (n, resid, 1, workd, 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[1], &c__1);
+/*< end if >*/
+ }
+
+/*< 20 continue >*/
+L20:
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< call second (t3) >*/
+/* second_(&t3); */
+/*< tmvbx = tmvbx + (t3 - t2) >*/
+/* timing_1.tmvbx += t3 - t2; */
+/*< end if >*/
+ }
+
+/*< first = .FALSE. >*/
+ first = FALSE_;
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< rnorm0 = ddot (n, resid, 1, workd, 1) >*/
+ rnorm0 = ddot_(n, &resid[1], &c__1, &workd[1], &c__1);
+/*< rnorm0 = sqrt(abs(rnorm0)) >*/
+ rnorm0 = sqrt((abs(rnorm0)));
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< rnorm0 = dnrm2(n, resid, 1) >*/
+ rnorm0 = dnrm2_(n, &resid[1], &c__1);
+/*< end if >*/
+ }
+/*< rnorm = rnorm0 >*/
+ *rnorm = rnorm0;
+
+/* %---------------------------------------------% */
+/* | Exit if this is the very first Arnoldi step | */
+/* %---------------------------------------------% */
+
+/*< if (j .eq. 1) go to 50 >*/
+ if (*j == 1) {
+ goto L50;
+ }
+
+/* %---------------------------------------------------------------- */
+/* | Otherwise need to B-orthogonalize the starting vector against | */
+/* | the current Arnoldi basis using Gram-Schmidt with iter. ref. | */
+/* | This is the case where an invariant subspace is encountered | */
+/* | in the middle of the Arnoldi factorization. | */
+/* | | */
+/* | s = V^{T}*B*r; r = r - V*s; | */
+/* | | */
+/* | Stopping criteria used for iter. ref. is discussed in | */
+/* | Parlett's book, page 107 and in Gragg & Reichel TOMS paper. | */
+/* %---------------------------------------------------------------% */
+
+/*< orth = .TRUE. >*/
+ orth = TRUE_;
+/*< 30 continue >*/
+L30:
+
+/*< >*/
+ i__1 = *j - 1;
+ dgemv_("T", n, &i__1, &c_b24, &v[v_offset], ldv, &workd[1], &c__1, &c_b26,
+ &workd[*n + 1], &c__1, (ftnlen)1);
+/*< >*/
+ i__1 = *j - 1;
+ dgemv_("N", n, &i__1, &c_b29, &v[v_offset], ldv, &workd[*n + 1], &c__1, &
+ c_b24, &resid[1], &c__1, (ftnlen)1);
+
+/* %----------------------------------------------------------% */
+/* | Compute the B-norm of the orthogonalized starting vector | */
+/* %----------------------------------------------------------% */
+
+/*< call second (t2) >*/
+/* second_(&t2); */
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< nbx = nbx + 1 >*/
+/* ++timing_1.nbx; */
+/*< call dcopy (n, resid, 1, workd(n+1), 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[*n + 1], &c__1);
+/*< ipntr(1) = n + 1 >*/
+ ipntr[1] = *n + 1;
+/*< ipntr(2) = 1 >*/
+ ipntr[2] = 1;
+/*< ido = 2 >*/
+ *ido = 2;
+/*< go to 9000 >*/
+ goto L9000;
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< call dcopy (n, resid, 1, workd, 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[1], &c__1);
+/*< end if >*/
+ }
+
+/*< 40 continue >*/
+L40:
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< call second (t3) >*/
+/* second_(&t3); */
+/*< tmvbx = tmvbx + (t3 - t2) >*/
+/* timing_1.tmvbx += t3 - t2; */
+/*< end if >*/
+ }
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< rnorm = ddot (n, resid, 1, workd, 1) >*/
+ *rnorm = ddot_(n, &resid[1], &c__1, &workd[1], &c__1);
+/*< rnorm = sqrt(abs(rnorm)) >*/
+ *rnorm = sqrt((abs(*rnorm)));
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< rnorm = dnrm2(n, resid, 1) >*/
+ *rnorm = dnrm2_(n, &resid[1], &c__1);
+/*< end if >*/
+ }
+
+/* %--------------------------------------% */
+/* | Check for further orthogonalization. | */
+/* %--------------------------------------% */
+
+/* if (msglvl .gt. 2) then */
+/* call dvout (logfil, 1, rnorm0, ndigit, */
+/* & '_getv0: re-orthonalization ; rnorm0 is') */
+/* call dvout (logfil, 1, rnorm, ndigit, */
+/* & '_getv0: re-orthonalization ; rnorm is') */
+/* end if */
+
+/*< if (rnorm .gt. 0.717*rnorm0) go to 50 >*/
+ if (*rnorm > rnorm0 * (float).717) {
+ goto L50;
+ }
+
+/*< iter = iter + 1 >*/
+ ++iter;
+/*< if (iter .le. 1) then >*/
+ if (iter <= 1) {
+
+/* %-----------------------------------% */
+/* | Perform iterative refinement step | */
+/* %-----------------------------------% */
+
+/*< rnorm0 = rnorm >*/
+ rnorm0 = *rnorm;
+/*< go to 30 >*/
+ goto L30;
+/*< else >*/
+ } else {
+
+/* %------------------------------------% */
+/* | Iterative refinement step "failed" | */
+/* %------------------------------------% */
+
+/*< do 45 jj = 1, n >*/
+ i__1 = *n;
+ for (jj = 1; jj <= i__1; ++jj) {
+/*< resid(jj) = zero >*/
+ resid[jj] = 0.;
+/*< 45 continue >*/
+/* L45: */
+ }
+/*< rnorm = zero >*/
+ *rnorm = 0.;
+/*< ierr = -1 >*/
+ *ierr = -1;
+/*< end if >*/
+ }
+
+/*< 50 continue >*/
+L50:
+
+/* if (msglvl .gt. 0) then */
+/* call dvout (logfil, 1, rnorm, ndigit, */
+/* & '_getv0: B-norm of initial / restarted starting vector') */
+/* end if */
+/* if (msglvl .gt. 2) then */
+/* call dvout (logfil, n, resid, ndigit, */
+/* & '_getv0: initial / restarted starting vector') */
+/* end if */
+/*< ido = 99 >*/
+ *ido = 99;
+
+/*< call second (t1) >*/
+/* second_(&t1); */
+/*< tgetv0 = tgetv0 + (t1 - t0) >*/
+/* timing_1.tgetv0 += t1 - t0; */
+
+/*< 9000 continue >*/
+L9000:
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dgetv0 | */
+/* %---------------% */
+
+/*< end >*/
+} /* dgetv0_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.f
new file mode 100644
index 0000000000000000000000000000000000000000..2b643e3608bfbf4669d727cfb0f1623c3af3463e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.f
@@ -0,0 +1,418 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dgetv0
+c
+c\Description:
+c Generate a random initial residual vector for the Arnoldi process.
+c Force the residual vector to be in the range of the operator OP.
+c
+c\Usage:
+c call dgetv0
+c ( IDO, BMAT, ITRY, INITV, N, J, V, LDV, RESID, RNORM,
+c IPNTR, WORKD, IERR )
+c
+c\Arguments
+c IDO Integer. (INPUT/OUTPUT)
+c Reverse communication flag. IDO must be zero on the first
+c call to dgetv0.
+c -------------------------------------------------------------
+c IDO = 0: first call to the reverse communication interface
+c IDO = -1: compute Y = OP * X where
+c IPNTR(1) is the pointer into WORKD for X,
+c IPNTR(2) is the pointer into WORKD for Y.
+c This is for the initialization phase to force the
+c starting vector into the range of OP.
+c IDO = 2: compute Y = B * X where
+c IPNTR(1) is the pointer into WORKD for X,
+c IPNTR(2) is the pointer into WORKD for Y.
+c IDO = 99: done
+c -------------------------------------------------------------
+c
+c BMAT Character*1. (INPUT)
+c BMAT specifies the type of the matrix B in the (generalized)
+c eigenvalue problem A*x = lambda*B*x.
+c B = 'I' -> standard eigenvalue problem A*x = lambda*x
+c B = 'G' -> generalized eigenvalue problem A*x = lambda*B*x
+c
+c ITRY Integer. (INPUT)
+c ITRY counts the number of times that dgetv0 is called.
+c It should be set to 1 on the initial call to dgetv0.
+c
+c INITV Logical variable. (INPUT)
+c .TRUE. => the initial residual vector is given in RESID.
+c .FALSE. => generate a random initial residual vector.
+c
+c N Integer. (INPUT)
+c Dimension of the problem.
+c
+c J Integer. (INPUT)
+c Index of the residual vector to be generated, with respect to
+c the Arnoldi process. J > 1 in case of a "restart".
+c
+c V Double precision N by J array. (INPUT)
+c The first J-1 columns of V contain the current Arnoldi basis
+c if this is a "restart".
+c
+c LDV Integer. (INPUT)
+c Leading dimension of V exactly as declared in the calling
+c program.
+c
+c RESID Double precision array of length N. (INPUT/OUTPUT)
+c Initial residual vector to be generated. If RESID is
+c provided, force RESID into the range of the operator OP.
+c
+c RNORM Double precision scalar. (OUTPUT)
+c B-norm of the generated residual.
+c
+c IPNTR Integer array of length 3. (OUTPUT)
+c
+c WORKD Double precision work array of length 2*N. (REVERSE COMMUNICATION).
+c On exit, WORK(1:N) = B*RESID to be used in SSAITR.
+c
+c IERR Integer. (OUTPUT)
+c = 0: Normal exit.
+c = -1: Cannot generate a nontrivial restarted residual vector
+c in the range of the operator OP.
+c
+c\EndDoc
+c
+c-----------------------------------------------------------------------
+c
+c\BeginLib
+c
+c\Local variables:
+c xxxxxx real
+c
+c\References:
+c 1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
+c a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
+c pp 357-385.
+c 2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly
+c Restarted Arnoldi Iteration", Rice University Technical Report
+c TR95-13, Department of Computational and Applied Mathematics.
+c
+c\Routines called:
+c second ARPACK utility routine for timing.
+c dlarnv LAPACK routine for generating a random vector.
+c dgemv Level 2 BLAS routine for matrix vector multiplication.
+c dcopy Level 1 BLAS that copies one vector to another.
+c ddot Level 1 BLAS that computes the scalar product of two vectors.
+c dnrm2 Level 1 BLAS that computes the norm of a vector.
+c
+c\Author
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\SCCS Information: @(#)
+c FILE: getv0.F SID: 2.6 DATE OF SID: 8/27/96 RELEASE: 2
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dgetv0
+ & ( ido, bmat, itry, initv, n, j, v, ldv, resid, rnorm,
+ & ipntr, workd, ierr )
+c
+c %----------------------------------------------------%
+c | Include files for debugging and timing information |
+c %----------------------------------------------------%
+c
+ include 'debug.h'
+ include 'stat.h'
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ character bmat*1
+ logical initv
+ integer ido, ierr, itry, j, ldv, n
+ Double precision
+ & rnorm
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ integer ipntr(3)
+ Double precision
+ & resid(n), v(ldv,j), workd(2*n)
+c
+c %------------%
+c | Parameters |
+c %------------%
+c
+ Double precision
+ & one, zero
+ parameter (one = 1.0D+0, zero = 0.0D+0)
+c
+c %------------------------%
+c | Local Scalars & Arrays |
+c %------------------------%
+c
+ logical first, inits, orth
+ integer idist, iseed(4), iter, msglvl, jj
+ Double precision
+ & rnorm0
+ save first, iseed, inits, iter, msglvl, orth, rnorm0
+c
+c %----------------------%
+c | External Subroutines |
+c %----------------------%
+c
+ external dlarnv, dcopy, dgemv, second
+c
+c %--------------------%
+c | External Functions |
+c %--------------------%
+c
+ Double precision
+ & ddot, dnrm2
+ external ddot, dnrm2
+c
+c %---------------------%
+c | Intrinsic Functions |
+c %---------------------%
+c
+ intrinsic abs, sqrt
+c
+c %-----------------%
+c | Data Statements |
+c %-----------------%
+c
+ data inits /.true./
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+c
+c %-----------------------------------%
+c | Initialize the seed of the LAPACK |
+c | random number generator |
+c %-----------------------------------%
+c
+ if (inits) then
+ iseed(1) = 1
+ iseed(2) = 3
+ iseed(3) = 5
+ iseed(4) = 7
+ inits = .false.
+ end if
+c
+ if (ido .eq. 0) then
+c
+c %-------------------------------%
+c | Initialize timing statistics |
+c | & message level for debugging |
+c %-------------------------------%
+c
+ call second (t0)
+ msglvl = mgetv0
+c
+ ierr = 0
+ iter = 0
+ first = .FALSE.
+ orth = .FALSE.
+c
+c %-----------------------------------------------------%
+c | Possibly generate a random starting vector in RESID |
+c | Use a LAPACK random number generator used by the |
+c | matrix generation routines. |
+c | idist = 1: uniform (0,1) distribution; |
+c | idist = 2: uniform (-1,1) distribution; |
+c | idist = 3: normal (0,1) distribution; |
+c %-----------------------------------------------------%
+c
+ if (.not.initv) then
+ idist = 2
+ call dlarnv (idist, iseed, n, resid)
+ end if
+c
+c %----------------------------------------------------------%
+c | Force the starting vector into the range of OP to handle |
+c | the generalized problem when B is possibly (singular). |
+c %----------------------------------------------------------%
+c
+ call second (t2)
+ if (bmat .eq. 'G') then
+ nopx = nopx + 1
+ ipntr(1) = 1
+ ipntr(2) = n + 1
+ call dcopy (n, resid, 1, workd, 1)
+ ido = -1
+ go to 9000
+ end if
+ end if
+c
+c %-----------------------------------------%
+c | Back from computing OP*(initial-vector) |
+c %-----------------------------------------%
+c
+ if (first) go to 20
+c
+c %-----------------------------------------------%
+c | Back from computing B*(orthogonalized-vector) |
+c %-----------------------------------------------%
+c
+ if (orth) go to 40
+c
+ if (bmat .eq. 'G') then
+ call second (t3)
+ tmvopx = tmvopx + (t3 - t2)
+ end if
+c
+c %------------------------------------------------------%
+c | Starting vector is now in the range of OP; r = OP*r; |
+c | Compute B-norm of starting vector. |
+c %------------------------------------------------------%
+c
+ call second (t2)
+ first = .TRUE.
+ if (bmat .eq. 'G') then
+ nbx = nbx + 1
+ call dcopy (n, workd(n+1), 1, resid, 1)
+ ipntr(1) = n + 1
+ ipntr(2) = 1
+ ido = 2
+ go to 9000
+ else if (bmat .eq. 'I') then
+ call dcopy (n, resid, 1, workd, 1)
+ end if
+c
+ 20 continue
+c
+ if (bmat .eq. 'G') then
+ call second (t3)
+ tmvbx = tmvbx + (t3 - t2)
+ end if
+c
+ first = .FALSE.
+ if (bmat .eq. 'G') then
+ rnorm0 = ddot (n, resid, 1, workd, 1)
+ rnorm0 = sqrt(abs(rnorm0))
+ else if (bmat .eq. 'I') then
+ rnorm0 = dnrm2(n, resid, 1)
+ end if
+ rnorm = rnorm0
+c
+c %---------------------------------------------%
+c | Exit if this is the very first Arnoldi step |
+c %---------------------------------------------%
+c
+ if (j .eq. 1) go to 50
+c
+c %----------------------------------------------------------------
+c | Otherwise need to B-orthogonalize the starting vector against |
+c | the current Arnoldi basis using Gram-Schmidt with iter. ref. |
+c | This is the case where an invariant subspace is encountered |
+c | in the middle of the Arnoldi factorization. |
+c | |
+c | s = V^{T}*B*r; r = r - V*s; |
+c | |
+c | Stopping criteria used for iter. ref. is discussed in |
+c | Parlett's book, page 107 and in Gragg & Reichel TOMS paper. |
+c %---------------------------------------------------------------%
+c
+ orth = .TRUE.
+ 30 continue
+c
+ call dgemv ('T', n, j-1, one, v, ldv, workd, 1,
+ & zero, workd(n+1), 1)
+ call dgemv ('N', n, j-1, -one, v, ldv, workd(n+1), 1,
+ & one, resid, 1)
+c
+c %----------------------------------------------------------%
+c | Compute the B-norm of the orthogonalized starting vector |
+c %----------------------------------------------------------%
+c
+ call second (t2)
+ if (bmat .eq. 'G') then
+ nbx = nbx + 1
+ call dcopy (n, resid, 1, workd(n+1), 1)
+ ipntr(1) = n + 1
+ ipntr(2) = 1
+ ido = 2
+ go to 9000
+ else if (bmat .eq. 'I') then
+ call dcopy (n, resid, 1, workd, 1)
+ end if
+c
+ 40 continue
+c
+ if (bmat .eq. 'G') then
+ call second (t3)
+ tmvbx = tmvbx + (t3 - t2)
+ end if
+c
+ if (bmat .eq. 'G') then
+ rnorm = ddot (n, resid, 1, workd, 1)
+ rnorm = sqrt(abs(rnorm))
+ else if (bmat .eq. 'I') then
+ rnorm = dnrm2(n, resid, 1)
+ end if
+c
+c %--------------------------------------%
+c | Check for further orthogonalization. |
+c %--------------------------------------%
+c
+c if (msglvl .gt. 2) then
+c call dvout (logfil, 1, rnorm0, ndigit,
+c & '_getv0: re-orthonalization ; rnorm0 is')
+c call dvout (logfil, 1, rnorm, ndigit,
+c & '_getv0: re-orthonalization ; rnorm is')
+c end if
+c
+ if (rnorm .gt. 0.717*rnorm0) go to 50
+c
+ iter = iter + 1
+ if (iter .le. 1) then
+c
+c %-----------------------------------%
+c | Perform iterative refinement step |
+c %-----------------------------------%
+c
+ rnorm0 = rnorm
+ go to 30
+ else
+c
+c %------------------------------------%
+c | Iterative refinement step "failed" |
+c %------------------------------------%
+c
+ do 45 jj = 1, n
+ resid(jj) = zero
+ 45 continue
+ rnorm = zero
+ ierr = -1
+ end if
+c
+ 50 continue
+c
+c if (msglvl .gt. 0) then
+c call dvout (logfil, 1, rnorm, ndigit,
+c & '_getv0: B-norm of initial / restarted starting vector')
+c end if
+c if (msglvl .gt. 2) then
+c call dvout (logfil, n, resid, ndigit,
+c & '_getv0: initial / restarted starting vector')
+c end if
+ ido = 99
+c
+ call second (t1)
+ tgetv0 = tgetv0 + (t1 - t0)
+c
+ 9000 continue
+ return
+c
+c %---------------%
+c | End of dgetv0 |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.h
new file mode 100644
index 0000000000000000000000000000000000000000..50a61d542e2c83025a19b6a57961c332e37c6936
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dgetv0.h
@@ -0,0 +1,16 @@
+extern int v3p_netlib_dgetv0_(
+ v3p_netlib_integer *ido,
+ char *bmat,
+ v3p_netlib_integer *itry,
+ v3p_netlib_logical *initv,
+ v3p_netlib_integer *n,
+ v3p_netlib_integer *j,
+ v3p_netlib_doublereal *v,
+ v3p_netlib_integer *ldv,
+ v3p_netlib_doublereal *resid,
+ v3p_netlib_doublereal *rnorm,
+ v3p_netlib_integer *ipntr,
+ v3p_netlib_doublereal *workd,
+ v3p_netlib_integer *ierr,
+ v3p_netlib_ftnlen bmat_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.P
new file mode 100644
index 0000000000000000000000000000000000000000..4772a8ebeb0d76a265a4e0eeb5455b859752b5ed
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.P
@@ -0,0 +1,12 @@
+extern int dsaitr_(integer *ido, char *bmat, integer *n, integer *k, integer *np, integer *mode, doublereal *resid, doublereal *rnorm, doublereal *v, integer *ldv, doublereal *h__, integer *ldh, integer *ipntr, doublereal *workd, integer *info, ftnlen bmat_len);
+/* comlen debug_ 96 */
+/* comlen timing_ 124 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: second_ 14 1 6 */
+/*:ref: dgetv0_ 14 14 4 13 4 12 4 4 7 4 7 7 4 7 4 124 */
+/*:ref: dcopy_ 14 5 4 7 4 7 4 */
+/*:ref: dscal_ 14 4 4 7 7 4 */
+/*:ref: dlascl_ 14 11 13 4 4 7 7 4 4 7 4 4 124 */
+/*:ref: ddot_ 7 5 4 7 4 7 4 */
+/*:ref: dnrm2_ 7 3 4 7 4 */
+/*:ref: dgemv_ 14 12 13 4 4 7 7 4 7 4 7 7 4 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.c
new file mode 100644
index 0000000000000000000000000000000000000000..bf98ee081d3bf0ecdce8228d8e8c68a99c862bc1
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.c
@@ -0,0 +1,1197 @@
+/* arpack/dsaitr.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Common Block Declarations */
+
+/*Extern struct { */
+/* integer logfil, ndigit, mgetv0, msaupd, msaup2, msaitr, mseigt, msapps, */
+/* msgets, mseupd, mnaupd, mnaup2, mnaitr, mneigh, mnapps, mngets, */
+/* mneupd, mcaupd, mcaup2, mcaitr, mceigh, mcapps, mcgets, mceupd; */
+/*} debug_; */
+
+/*#define debug_1 debug_ */
+
+/*Extern struct { */
+/* integer nopx, nbx, nrorth, nitref, nrstrt; */
+/* real tsaupd, tsaup2, tsaitr, tseigt, tsgets, tsapps, tsconv, tnaupd, */
+/* tnaup2, tnaitr, tneigh, tngets, tnapps, tnconv, tcaupd, tcaup2, */
+/* tcaitr, tceigh, tcgets, tcapps, tcconv, tmvopx, tmvbx, tgetv0, */
+/* titref, trvec; */
+/*} timing_; */
+
+/*#define timing_1 timing_ */
+
+/* Table of constant values */
+
+static logical c_false = FALSE_;
+static integer c__1 = 1;
+static doublereal c_b18 = 1.;
+static doublereal c_b43 = 0.;
+static doublereal c_b51 = -1.;
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dsaitr */
+
+/* \Description: */
+/* Reverse communication interface for applying NP additional steps to */
+/* a K step symmetric Arnoldi factorization. */
+
+/* Input: OP*V_{k} - V_{k}*H = r_{k}*e_{k}^T */
+
+/* with (V_{k}^T)*B*V_{k} = I, (V_{k}^T)*B*r_{k} = 0. */
+
+/* Output: OP*V_{k+p} - V_{k+p}*H = r_{k+p}*e_{k+p}^T */
+
+/* with (V_{k+p}^T)*B*V_{k+p} = I, (V_{k+p}^T)*B*r_{k+p} = 0. */
+
+/* where OP and B are as in dsaupd. The B-norm of r_{k+p} is also */
+/* computed and returned. */
+
+/* \Usage: */
+/* call dsaitr */
+/* ( IDO, BMAT, N, K, NP, MODE, RESID, RNORM, V, LDV, H, LDH, */
+/* IPNTR, WORKD, INFO ) */
+
+/* \Arguments */
+/* IDO Integer. (INPUT/OUTPUT) */
+/* Reverse communication flag. */
+/* ------------------------------------------------------------- */
+/* IDO = 0: first call to the reverse communication interface */
+/* IDO = -1: compute Y = OP * X where */
+/* IPNTR(1) is the pointer into WORK for X, */
+/* IPNTR(2) is the pointer into WORK for Y. */
+/* This is for the restart phase to force the new */
+/* starting vector into the range of OP. */
+/* IDO = 1: compute Y = OP * X where */
+/* IPNTR(1) is the pointer into WORK for X, */
+/* IPNTR(2) is the pointer into WORK for Y, */
+/* IPNTR(3) is the pointer into WORK for B * X. */
+/* IDO = 2: compute Y = B * X where */
+/* IPNTR(1) is the pointer into WORK for X, */
+/* IPNTR(2) is the pointer into WORK for Y. */
+/* IDO = 99: done */
+/* ------------------------------------------------------------- */
+/* When the routine is used in the "shift-and-invert" mode, the */
+/* vector B * Q is already available and does not need to be */
+/* recomputed in forming OP * Q. */
+
+/* BMAT Character*1. (INPUT) */
+/* BMAT specifies the type of matrix B that defines the */
+/* semi-inner product for the operator OP. See dsaupd. */
+/* B = 'I' -> standard eigenvalue problem A*x = lambda*x */
+/* B = 'G' -> generalized eigenvalue problem A*x = lambda*M*x */
+
+/* N Integer. (INPUT) */
+/* Dimension of the eigenproblem. */
+
+/* K Integer. (INPUT) */
+/* Current order of H and the number of columns of V. */
+
+/* NP Integer. (INPUT) */
+/* Number of additional Arnoldi steps to take. */
+
+/* MODE Integer. (INPUT) */
+/* Signifies which form for "OP". If MODE=2 then */
+/* a reduction in the number of B matrix vector multiplies */
+/* is possible since the B-norm of OP*x is equivalent to */
+/* the inv(B)-norm of A*x. */
+
+/* RESID Double precision array of length N. (INPUT/OUTPUT) */
+/* On INPUT: RESID contains the residual vector r_{k}. */
+/* On OUTPUT: RESID contains the residual vector r_{k+p}. */
+
+/* RNORM Double precision scalar. (INPUT/OUTPUT) */
+/* On INPUT the B-norm of r_{k}. */
+/* On OUTPUT the B-norm of the updated residual r_{k+p}. */
+
+/* V Double precision N by K+NP array. (INPUT/OUTPUT) */
+/* On INPUT: V contains the Arnoldi vectors in the first K */
+/* columns. */
+/* On OUTPUT: V contains the new NP Arnoldi vectors in the next */
+/* NP columns. The first K columns are unchanged. */
+
+/* LDV Integer. (INPUT) */
+/* Leading dimension of V exactly as declared in the calling */
+/* program. */
+
+/* H Double precision (K+NP) by 2 array. (INPUT/OUTPUT) */
+/* H is used to store the generated symmetric tridiagonal matrix */
+/* with the subdiagonal in the first column starting at H(2,1) */
+/* and the main diagonal in the second column. */
+
+/* LDH Integer. (INPUT) */
+/* Leading dimension of H exactly as declared in the calling */
+/* program. */
+
+/* IPNTR Integer array of length 3. (OUTPUT) */
+/* Pointer to mark the starting locations in the WORK for */
+/* vectors used by the Arnoldi iteration. */
+/* ------------------------------------------------------------- */
+/* IPNTR(1): pointer to the current operand vector X. */
+/* IPNTR(2): pointer to the current result vector Y. */
+/* IPNTR(3): pointer to the vector B * X when used in the */
+/* shift-and-invert mode. X is the current operand. */
+/* ------------------------------------------------------------- */
+
+/* WORKD Double precision work array of length 3*N. (REVERSE COMMUNICATION) */
+/* Distributed array to be used in the basic Arnoldi iteration */
+/* for reverse communication. The calling program should not */
+/* use WORKD as temporary workspace during the iteration !!!!!! */
+/* On INPUT, WORKD(1:N) = B*RESID where RESID is associated */
+/* with the K step Arnoldi factorization. Used to save some */
+/* computation at the first step. */
+/* On OUTPUT, WORKD(1:N) = B*RESID where RESID is associated */
+/* with the K+NP step Arnoldi factorization. */
+
+/* INFO Integer. (OUTPUT) */
+/* = 0: Normal exit. */
+/* > 0: Size of an invariant subspace of OP is found that is */
+/* less than K + NP. */
+
+/* \EndDoc */
+
+/* ----------------------------------------------------------------------- */
+
+/* \BeginLib */
+
+/* \Local variables: */
+/* xxxxxx real */
+
+/* \Routines called: */
+/* dgetv0 ARPACK routine to generate the initial vector. */
+/* ivout ARPACK utility routine that prints integers. */
+/* dmout ARPACK utility routine that prints matrices. */
+/* dlamch LAPACK routine that determines machine constants. */
+/* dlascl LAPACK routine for careful scaling of a matrix. */
+/* dgemv Level 2 BLAS routine for matrix vector multiplication. */
+/* daxpy Level 1 BLAS that computes a vector triad. */
+/* dscal Level 1 BLAS that scales a vector. */
+/* dcopy Level 1 BLAS that copies one vector to another . */
+/* ddot Level 1 BLAS that computes the scalar product of two vectors. */
+/* dnrm2 Level 1 BLAS that computes the norm of a vector. */
+
+/* \Author */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \Revision history: */
+/* xx/xx/93: Version ' 2.4' */
+
+/* \SCCS Information: @(#) */
+/* FILE: saitr.F SID: 2.6 DATE OF SID: 8/28/96 RELEASE: 2 */
+
+/* \Remarks */
+/* The algorithm implemented is: */
+
+/* restart = .false. */
+/* Given V_{k} = [v_{1}, ..., v_{k}], r_{k}; */
+/* r_{k} contains the initial residual vector even for k = 0; */
+/* Also assume that rnorm = || B*r_{k} || and B*r_{k} are already */
+/* computed by the calling program. */
+
+/* betaj = rnorm ; p_{k+1} = B*r_{k} ; */
+/* For j = k+1, ..., k+np Do */
+/* 1) if ( betaj < tol ) stop or restart depending on j. */
+/* if ( restart ) generate a new starting vector. */
+/* 2) v_{j} = r(j-1)/betaj; V_{j} = [V_{j-1}, v_{j}]; */
+/* p_{j} = p_{j}/betaj */
+/* 3) r_{j} = OP*v_{j} where OP is defined as in dsaupd */
+/* For shift-invert mode p_{j} = B*v_{j} is already available. */
+/* wnorm = || OP*v_{j} || */
+/* 4) Compute the j-th step residual vector. */
+/* w_{j} = V_{j}^T * B * OP * v_{j} */
+/* r_{j} = OP*v_{j} - V_{j} * w_{j} */
+/* alphaj <- j-th component of w_{j} */
+/* rnorm = || r_{j} || */
+/* betaj+1 = rnorm */
+/* If (rnorm > 0.717*wnorm) accept step and go back to 1) */
+/* 5) Re-orthogonalization step: */
+/* s = V_{j}'*B*r_{j} */
+/* r_{j} = r_{j} - V_{j}*s; rnorm1 = || r_{j} || */
+/* alphaj = alphaj + s_{j}; */
+/* 6) Iterative refinement step: */
+/* If (rnorm1 > 0.717*rnorm) then */
+/* rnorm = rnorm1 */
+/* accept step and go back to 1) */
+/* Else */
+/* rnorm = rnorm1 */
+/* If this is the first time in step 6), go to 5) */
+/* Else r_{j} lies in the span of V_{j} numerically. */
+/* Set r_{j} = 0 and rnorm = 0; go to 1) */
+/* EndIf */
+/* End Do */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< >*/
+/* Subroutine */ int dsaitr_(integer *ido, char *bmat, integer *n, integer *k,
+ integer *np, integer *mode, doublereal *resid, doublereal *rnorm,
+ doublereal *v, integer *ldv, doublereal *h__, integer *ldh, integer *
+ ipntr, doublereal *workd, integer *info, ftnlen bmat_len)
+{
+ /* Initialized data */
+
+ static logical first = TRUE_;
+
+ /* System generated locals */
+ integer h_dim1, h_offset, v_dim1, v_offset, i__1;
+
+ /* Builtin functions */
+ double sqrt(doublereal);
+
+ /* Local variables */
+ integer i__;
+ static integer j;
+/* static real t0, t1, t2, t3, t4, t5; */
+ integer jj;
+ static integer ipj, irj, ivj;
+ extern doublereal ddot_(integer *, doublereal *, integer *, doublereal *,
+ integer *);
+ static integer ierr, iter, itry;
+ extern doublereal dnrm2_(integer *, doublereal *, integer *);
+ doublereal temp1;
+ static logical orth1, orth2, step3, step4;
+ extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
+ integer *), dgemv_(char *, integer *, integer *, doublereal *,
+ doublereal *, integer *, doublereal *, integer *, doublereal *,
+ doublereal *, integer *, ftnlen);
+ integer infol;
+ extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
+ doublereal *, integer *);
+/* doublereal xtemp[2]; */
+ static doublereal wnorm;
+ extern /* Subroutine */ int dgetv0_(integer *, char *, integer *, logical
+ *, integer *, integer *, doublereal *, integer *, doublereal *,
+ doublereal *, integer *, doublereal *, integer *, ftnlen);
+ static doublereal rnorm1;
+ extern doublereal dlamch_(char *, ftnlen);
+ extern /* Subroutine */ int dlascl_(char *, integer *, integer *,
+ doublereal *, doublereal *, integer *, integer *, doublereal *,
+ integer *, integer *, ftnlen), second_(real *);
+ static doublereal safmin;
+ static logical rstart;
+/* static integer msglvl; */
+
+
+/* %----------------------------------------------------% */
+/* | Include files for debugging and timing information | */
+/* %----------------------------------------------------% */
+
+/*< include 'debug.h' >*/
+/*< include 'stat.h' >*/
+
+/* \SCCS Information: @(#) */
+/* FILE: debug.h SID: 2.3 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/* %---------------------------------% */
+/* | See debug.doc for documentation | */
+/* %---------------------------------% */
+/*< >*/
+/*< character bmat*1 >*/
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/* %--------------------------------% */
+/* | See stat.doc for documentation | */
+/* %--------------------------------% */
+
+/* \SCCS Information: @(#) */
+/* FILE: stat.h SID: 2.2 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/*< save t0, t1, t2, t3, t4, t5 >*/
+
+/*< integer nopx, nbx, nrorth, nitref, nrstrt >*/
+/*< >*/
+/*< >*/
+/*< integer ido, info, k, ldh, ldv, n, mode, np >*/
+/*< >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< integer ipntr(3) >*/
+/*< >*/
+
+/* %------------% */
+/* | Parameters | */
+/* %------------% */
+
+/*< >*/
+/*< parameter (one = 1.0D+0, zero = 0.0D+0) >*/
+
+/* %---------------% */
+/* | Local Scalars | */
+/* %---------------% */
+
+/*< logical first, orth1, orth2, rstart, step3, step4 >*/
+/*< >*/
+/*< >*/
+/*< >*/
+
+/* %-----------------------% */
+/* | Local Array Arguments | */
+/* %-----------------------% */
+
+/*< >*/
+
+/* %----------------------% */
+/* | External Subroutines | */
+/* %----------------------% */
+
+/*< >*/
+
+/* %--------------------% */
+/* | External Functions | */
+/* %--------------------% */
+
+/*< >*/
+/*< external ddot, dnrm2, dlamch >*/
+
+/* %-----------------% */
+/* | Data statements | */
+/* %-----------------% */
+
+/*< data first / .true. / >*/
+ /* Parameter adjustments */
+ --workd;
+ --resid;
+ v_dim1 = *ldv;
+ v_offset = 1 + v_dim1;
+ v -= v_offset;
+ h_dim1 = *ldh;
+ h_offset = 1 + h_dim1;
+ h__ -= h_offset;
+ --ipntr;
+
+ /* Function Body */
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+/*< if (first) then >*/
+ if (first) {
+/*< first = .false. >*/
+ first = FALSE_;
+
+/* %--------------------------------% */
+/* | safmin = safe minimum is such | */
+/* | that 1/sfmin does not overflow | */
+/* %--------------------------------% */
+
+/*< safmin = dlamch('safmin') >*/
+ safmin = dlamch_("safmin", (ftnlen)6);
+/*< end if >*/
+ }
+
+/*< if (ido .eq. 0) then >*/
+ if (*ido == 0) {
+
+/* %-------------------------------% */
+/* | Initialize timing statistics | */
+/* | & message level for debugging | */
+/* %-------------------------------% */
+
+/*< call second (t0) >*/
+/* second_(&t0); */
+/*< msglvl = msaitr >*/
+/* msglvl = debug_1.msaitr; */
+
+/* %------------------------------% */
+/* | Initial call to this routine | */
+/* %------------------------------% */
+
+/*< info = 0 >*/
+ *info = 0;
+/*< step3 = .false. >*/
+ step3 = FALSE_;
+/*< step4 = .false. >*/
+ step4 = FALSE_;
+/*< rstart = .false. >*/
+ rstart = FALSE_;
+/*< orth1 = .false. >*/
+ orth1 = FALSE_;
+/*< orth2 = .false. >*/
+ orth2 = FALSE_;
+
+/* %--------------------------------% */
+/* | Pointer to the current step of | */
+/* | the factorization to build | */
+/* %--------------------------------% */
+
+/*< j = k + 1 >*/
+ j = *k + 1;
+
+/* %------------------------------------------% */
+/* | Pointers used for reverse communication | */
+/* | when using WORKD. | */
+/* %------------------------------------------% */
+
+/*< ipj = 1 >*/
+ ipj = 1;
+/*< irj = ipj + n >*/
+ irj = ipj + *n;
+/*< ivj = irj + n >*/
+ ivj = irj + *n;
+/*< end if >*/
+ }
+
+/* %-------------------------------------------------% */
+/* | When in reverse communication mode one of: | */
+/* | STEP3, STEP4, ORTH1, ORTH2, RSTART | */
+/* | will be .true. | */
+/* | STEP3: return from computing OP*v_{j}. | */
+/* | STEP4: return from computing B-norm of OP*v_{j} | */
+/* | ORTH1: return from computing B-norm of r_{j+1} | */
+/* | ORTH2: return from computing B-norm of | */
+/* | correction to the residual vector. | */
+/* | RSTART: return from OP computations needed by | */
+/* | dgetv0. | */
+/* %-------------------------------------------------% */
+
+/*< if (step3) go to 50 >*/
+ if (step3) {
+ goto L50;
+ }
+/*< if (step4) go to 60 >*/
+ if (step4) {
+ goto L60;
+ }
+/*< if (orth1) go to 70 >*/
+ if (orth1) {
+ goto L70;
+ }
+/*< if (orth2) go to 90 >*/
+ if (orth2) {
+ goto L90;
+ }
+/*< if (rstart) go to 30 >*/
+ if (rstart) {
+ goto L30;
+ }
+
+/* %------------------------------% */
+/* | Else this is the first step. | */
+/* %------------------------------% */
+
+/* %--------------------------------------------------------------% */
+/* | | */
+/* | A R N O L D I I T E R A T I O N L O O P | */
+/* | | */
+/* | Note: B*r_{j-1} is already in WORKD(1:N)=WORKD(IPJ:IPJ+N-1) | */
+/* %--------------------------------------------------------------% */
+
+/*< 1000 continue >*/
+L1000:
+
+/* if (msglvl .gt. 2) then */
+/* call ivout (logfil, 1, j, ndigit, */
+/* & '_saitr: generating Arnoldi vector no.') */
+/* call dvout (logfil, 1, rnorm, ndigit, */
+/* & '_saitr: B-norm of the current residual =') */
+/* end if */
+
+/* %---------------------------------------------------------% */
+/* | Check for exact zero. Equivalent to determining whether | */
+/* | a j-step Arnoldi factorization is present. | */
+/* %---------------------------------------------------------% */
+
+/*< if (rnorm .gt. zero) go to 40 >*/
+ if (*rnorm > 0.) {
+ goto L40;
+ }
+
+/* %---------------------------------------------------% */
+/* | Invariant subspace found, generate a new starting | */
+/* | vector which is orthogonal to the current Arnoldi | */
+/* | basis and continue the iteration. | */
+/* %---------------------------------------------------% */
+
+/* if (msglvl .gt. 0) then */
+/* call ivout (logfil, 1, j, ndigit, */
+/* & '_saitr: ****** restart at step ******') */
+/* end if */
+
+/* %---------------------------------------------% */
+/* | ITRY is the loop variable that controls the | */
+/* | maximum amount of times that a restart is | */
+/* | attempted. NRSTRT is used by stat.h | */
+/* %---------------------------------------------% */
+
+/*< nrstrt = nrstrt + 1 >*/
+/* ++timing_1.nrstrt; */
+/*< itry = 1 >*/
+ itry = 1;
+/*< 20 continue >*/
+L20:
+/*< rstart = .true. >*/
+ rstart = TRUE_;
+/*< ido = 0 >*/
+ *ido = 0;
+/*< 30 continue >*/
+L30:
+
+/* %--------------------------------------% */
+/* | If in reverse communication mode and | */
+/* | RSTART = .true. flow returns here. | */
+/* %--------------------------------------% */
+
+/*< >*/
+ dgetv0_(ido, bmat, &itry, &c_false, n, &j, &v[v_offset], ldv, &resid[1],
+ rnorm, &ipntr[1], &workd[1], &ierr, (ftnlen)1);
+/*< if (ido .ne. 99) go to 9000 >*/
+ if (*ido != 99) {
+ goto L9000;
+ }
+/*< if (ierr .lt. 0) then >*/
+ if (ierr < 0) {
+/*< itry = itry + 1 >*/
+ ++itry;
+/*< if (itry .le. 3) go to 20 >*/
+ if (itry <= 3) {
+ goto L20;
+ }
+
+/* %------------------------------------------------% */
+/* | Give up after several restart attempts. | */
+/* | Set INFO to the size of the invariant subspace | */
+/* | which spans OP and exit. | */
+/* %------------------------------------------------% */
+
+/*< info = j - 1 >*/
+ *info = j - 1;
+/*< call second (t1) >*/
+/* second_(&t1); */
+/*< tsaitr = tsaitr + (t1 - t0) >*/
+/* timing_1.tsaitr += t1 - t0; */
+/*< ido = 99 >*/
+ *ido = 99;
+/*< go to 9000 >*/
+ goto L9000;
+/*< end if >*/
+ }
+
+/*< 40 continue >*/
+L40:
+
+/* %---------------------------------------------------------% */
+/* | STEP 2: v_{j} = r_{j-1}/rnorm and p_{j} = p_{j}/rnorm | */
+/* | Note that p_{j} = B*r_{j-1}. In order to avoid overflow | */
+/* | when reciprocating a small RNORM, test against lower | */
+/* | machine bound. | */
+/* %---------------------------------------------------------% */
+
+/*< call dcopy (n, resid, 1, v(1,j), 1) >*/
+ dcopy_(n, &resid[1], &c__1, &v[j * v_dim1 + 1], &c__1);
+/*< if (rnorm .ge. safmin) then >*/
+ if (*rnorm >= safmin) {
+/*< temp1 = one / rnorm >*/
+ temp1 = 1. / *rnorm;
+/*< call dscal (n, temp1, v(1,j), 1) >*/
+ dscal_(n, &temp1, &v[j * v_dim1 + 1], &c__1);
+/*< call dscal (n, temp1, workd(ipj), 1) >*/
+ dscal_(n, &temp1, &workd[ipj], &c__1);
+/*< else >*/
+ } else {
+
+/* %-----------------------------------------% */
+/* | To scale both v_{j} and p_{j} carefully | */
+/* | use LAPACK routine SLASCL | */
+/* %-----------------------------------------% */
+
+/*< >*/
+ dlascl_("General", &i__, &i__, rnorm, &c_b18, n, &c__1, &v[j * v_dim1
+ + 1], n, &infol, (ftnlen)7);
+/*< >*/
+ dlascl_("General", &i__, &i__, rnorm, &c_b18, n, &c__1, &workd[ipj],
+ n, &infol, (ftnlen)7);
+/*< end if >*/
+ }
+
+/* %------------------------------------------------------% */
+/* | STEP 3: r_{j} = OP*v_{j}; Note that p_{j} = B*v_{j} | */
+/* | Note that this is not quite yet r_{j}. See STEP 4 | */
+/* %------------------------------------------------------% */
+
+/*< step3 = .true. >*/
+ step3 = TRUE_;
+/*< nopx = nopx + 1 >*/
+/* ++timing_1.nopx; */
+/*< call second (t2) >*/
+/* second_(&t2); */
+/*< call dcopy (n, v(1,j), 1, workd(ivj), 1) >*/
+ dcopy_(n, &v[j * v_dim1 + 1], &c__1, &workd[ivj], &c__1);
+/*< ipntr(1) = ivj >*/
+ ipntr[1] = ivj;
+/*< ipntr(2) = irj >*/
+ ipntr[2] = irj;
+/*< ipntr(3) = ipj >*/
+ ipntr[3] = ipj;
+/*< ido = 1 >*/
+ *ido = 1;
+
+/* %-----------------------------------% */
+/* | Exit in order to compute OP*v_{j} | */
+/* %-----------------------------------% */
+
+/*< go to 9000 >*/
+ goto L9000;
+/*< 50 continue >*/
+L50:
+
+/* %-----------------------------------% */
+/* | Back from reverse communication; | */
+/* | WORKD(IRJ:IRJ+N-1) := OP*v_{j}. | */
+/* %-----------------------------------% */
+
+/*< call second (t3) >*/
+/* second_(&t3); */
+/*< tmvopx = tmvopx + (t3 - t2) >*/
+/* timing_1.tmvopx += t3 - t2; */
+
+/*< step3 = .false. >*/
+ step3 = FALSE_;
+
+/* %------------------------------------------% */
+/* | Put another copy of OP*v_{j} into RESID. | */
+/* %------------------------------------------% */
+
+/*< call dcopy (n, workd(irj), 1, resid, 1) >*/
+ dcopy_(n, &workd[irj], &c__1, &resid[1], &c__1);
+
+/* %-------------------------------------------% */
+/* | STEP 4: Finish extending the symmetric | */
+/* | Arnoldi to length j. If MODE = 2 | */
+/* | then B*OP = B*inv(B)*A = A and | */
+/* | we don't need to compute B*OP. | */
+/* | NOTE: If MODE = 2 WORKD(IVJ:IVJ+N-1) is | */
+/* | assumed to have A*v_{j}. | */
+/* %-------------------------------------------% */
+
+/*< if (mode .eq. 2) go to 65 >*/
+ if (*mode == 2) {
+ goto L65;
+ }
+/*< call second (t2) >*/
+/* second_(&t2); */
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< nbx = nbx + 1 >*/
+/* ++timing_1.nbx; */
+/*< step4 = .true. >*/
+ step4 = TRUE_;
+/*< ipntr(1) = irj >*/
+ ipntr[1] = irj;
+/*< ipntr(2) = ipj >*/
+ ipntr[2] = ipj;
+/*< ido = 2 >*/
+ *ido = 2;
+
+/* %-------------------------------------% */
+/* | Exit in order to compute B*OP*v_{j} | */
+/* %-------------------------------------% */
+
+/*< go to 9000 >*/
+ goto L9000;
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< call dcopy(n, resid, 1 , workd(ipj), 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[ipj], &c__1);
+/*< end if >*/
+ }
+/*< 60 continue >*/
+L60:
+
+/* %-----------------------------------% */
+/* | Back from reverse communication; | */
+/* | WORKD(IPJ:IPJ+N-1) := B*OP*v_{j}. | */
+/* %-----------------------------------% */
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< call second (t3) >*/
+/* second_(&t3); */
+/*< tmvbx = tmvbx + (t3 - t2) >*/
+/* timing_1.tmvbx += t3 - t2; */
+/*< end if >*/
+ }
+
+/*< step4 = .false. >*/
+ step4 = FALSE_;
+
+/* %-------------------------------------% */
+/* | The following is needed for STEP 5. | */
+/* | Compute the B-norm of OP*v_{j}. | */
+/* %-------------------------------------% */
+
+/*< 65 continue >*/
+L65:
+/*< if (mode .eq. 2) then >*/
+ if (*mode == 2) {
+
+/* %----------------------------------% */
+/* | Note that the B-norm of OP*v_{j} | */
+/* | is the inv(B)-norm of A*v_{j}. | */
+/* %----------------------------------% */
+
+/*< wnorm = ddot (n, resid, 1, workd(ivj), 1) >*/
+ wnorm = ddot_(n, &resid[1], &c__1, &workd[ivj], &c__1);
+/*< wnorm = sqrt(abs(wnorm)) >*/
+ wnorm = sqrt((abs(wnorm)));
+/*< else if (bmat .eq. 'G') then >*/
+ } else if (*(unsigned char *)bmat == 'G') {
+/*< wnorm = ddot (n, resid, 1, workd(ipj), 1) >*/
+ wnorm = ddot_(n, &resid[1], &c__1, &workd[ipj], &c__1);
+/*< wnorm = sqrt(abs(wnorm)) >*/
+ wnorm = sqrt((abs(wnorm)));
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< wnorm = dnrm2(n, resid, 1) >*/
+ wnorm = dnrm2_(n, &resid[1], &c__1);
+/*< end if >*/
+ }
+
+/* %-----------------------------------------% */
+/* | Compute the j-th residual corresponding | */
+/* | to the j step factorization. | */
+/* | Use Classical Gram Schmidt and compute: | */
+/* | w_{j} <- V_{j}^T * B * OP * v_{j} | */
+/* | r_{j} <- OP*v_{j} - V_{j} * w_{j} | */
+/* %-----------------------------------------% */
+
+
+/* %------------------------------------------% */
+/* | Compute the j Fourier coefficients w_{j} | */
+/* | WORKD(IPJ:IPJ+N-1) contains B*OP*v_{j}. | */
+/* %------------------------------------------% */
+
+/*< if (mode .ne. 2 ) then >*/
+ if (*mode != 2) {
+/*< >*/
+ dgemv_("T", n, &j, &c_b18, &v[v_offset], ldv, &workd[ipj], &c__1, &
+ c_b43, &workd[irj], &c__1, (ftnlen)1);
+/*< else if (mode .eq. 2) then >*/
+ } else if (*mode == 2) {
+/*< >*/
+ dgemv_("T", n, &j, &c_b18, &v[v_offset], ldv, &workd[ivj], &c__1, &
+ c_b43, &workd[irj], &c__1, (ftnlen)1);
+/*< end if >*/
+ }
+
+/* %--------------------------------------% */
+/* | Orthgonalize r_{j} against V_{j}. | */
+/* | RESID contains OP*v_{j}. See STEP 3. | */
+/* %--------------------------------------% */
+
+/*< >*/
+ dgemv_("N", n, &j, &c_b51, &v[v_offset], ldv, &workd[irj], &c__1, &c_b18,
+ &resid[1], &c__1, (ftnlen)1);
+
+/* %--------------------------------------% */
+/* | Extend H to have j rows and columns. | */
+/* %--------------------------------------% */
+
+/*< h(j,2) = workd(irj + j - 1) >*/
+ h__[j + (h_dim1 << 1)] = workd[irj + j - 1];
+/*< if (j .eq. 1 .or. rstart) then >*/
+ if (j == 1 || rstart) {
+/*< h(j,1) = zero >*/
+ h__[j + h_dim1] = 0.;
+/*< else >*/
+ } else {
+/*< h(j,1) = rnorm >*/
+ h__[j + h_dim1] = *rnorm;
+/*< end if >*/
+ }
+/*< call second (t4) >*/
+/* second_(&t4); */
+
+/*< orth1 = .true. >*/
+ orth1 = TRUE_;
+/*< iter = 0 >*/
+ iter = 0;
+
+/*< call second (t2) >*/
+/* second_(&t2); */
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< nbx = nbx + 1 >*/
+/* ++timing_1.nbx; */
+/*< call dcopy (n, resid, 1, workd(irj), 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[irj], &c__1);
+/*< ipntr(1) = irj >*/
+ ipntr[1] = irj;
+/*< ipntr(2) = ipj >*/
+ ipntr[2] = ipj;
+/*< ido = 2 >*/
+ *ido = 2;
+
+/* %----------------------------------% */
+/* | Exit in order to compute B*r_{j} | */
+/* %----------------------------------% */
+
+/*< go to 9000 >*/
+ goto L9000;
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< call dcopy (n, resid, 1, workd(ipj), 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[ipj], &c__1);
+/*< end if >*/
+ }
+/*< 70 continue >*/
+L70:
+
+/* %---------------------------------------------------% */
+/* | Back from reverse communication if ORTH1 = .true. | */
+/* | WORKD(IPJ:IPJ+N-1) := B*r_{j}. | */
+/* %---------------------------------------------------% */
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< call second (t3) >*/
+/* second_(&t3); */
+/*< tmvbx = tmvbx + (t3 - t2) >*/
+/* timing_1.tmvbx += t3 - t2; */
+/*< end if >*/
+ }
+
+/*< orth1 = .false. >*/
+ orth1 = FALSE_;
+
+/* %------------------------------% */
+/* | Compute the B-norm of r_{j}. | */
+/* %------------------------------% */
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< rnorm = ddot (n, resid, 1, workd(ipj), 1) >*/
+ *rnorm = ddot_(n, &resid[1], &c__1, &workd[ipj], &c__1);
+/*< rnorm = sqrt(abs(rnorm)) >*/
+ *rnorm = sqrt((abs(*rnorm)));
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< rnorm = dnrm2(n, resid, 1) >*/
+ *rnorm = dnrm2_(n, &resid[1], &c__1);
+/*< end if >*/
+ }
+
+/* %-----------------------------------------------------------% */
+/* | STEP 5: Re-orthogonalization / Iterative refinement phase | */
+/* | Maximum NITER_ITREF tries. | */
+/* | | */
+/* | s = V_{j}^T * B * r_{j} | */
+/* | r_{j} = r_{j} - V_{j}*s | */
+/* | alphaj = alphaj + s_{j} | */
+/* | | */
+/* | The stopping criteria used for iterative refinement is | */
+/* | discussed in Parlett's book SEP, page 107 and in Gragg & | */
+/* | Reichel ACM TOMS paper; Algorithm 686, Dec. 1990. | */
+/* | Determine if we need to correct the residual. The goal is | */
+/* | to enforce ||v(:,1:j)^T * r_{j}|| .le. eps * || r_{j} || | */
+/* %-----------------------------------------------------------% */
+
+/*< if (rnorm .gt. 0.717*wnorm) go to 100 >*/
+ if (*rnorm > wnorm * (float).717) {
+ goto L100;
+ }
+/*< nrorth = nrorth + 1 >*/
+/* ++timing_1.nrorth; */
+
+/* %---------------------------------------------------% */
+/* | Enter the Iterative refinement phase. If further | */
+/* | refinement is necessary, loop back here. The loop | */
+/* | variable is ITER. Perform a step of Classical | */
+/* | Gram-Schmidt using all the Arnoldi vectors V_{j} | */
+/* %---------------------------------------------------% */
+
+/*< 80 continue >*/
+L80:
+
+/*< if (msglvl .gt. 2) then >*/
+/* if (msglvl > 2) { */
+/*< xtemp(1) = wnorm >*/
+/* xtemp[0] = wnorm; */
+/*< xtemp(2) = rnorm >*/
+/* xtemp[1] = *rnorm; */
+/* call dvout (logfil, 2, xtemp, ndigit, */
+/* & '_saitr: re-orthonalization ; wnorm and rnorm are') */
+/*< end if >*/
+/* } */
+
+/* %----------------------------------------------------% */
+/* | Compute V_{j}^T * B * r_{j}. | */
+/* | WORKD(IRJ:IRJ+J-1) = v(:,1:J)'*WORKD(IPJ:IPJ+N-1). | */
+/* %----------------------------------------------------% */
+
+/*< >*/
+ dgemv_("T", n, &j, &c_b18, &v[v_offset], ldv, &workd[ipj], &c__1, &c_b43,
+ &workd[irj], &c__1, (ftnlen)1);
+
+/* %----------------------------------------------% */
+/* | Compute the correction to the residual: | */
+/* | r_{j} = r_{j} - V_{j} * WORKD(IRJ:IRJ+J-1). | */
+/* | The correction to H is v(:,1:J)*H(1:J,1:J) + | */
+/* | v(:,1:J)*WORKD(IRJ:IRJ+J-1)*e'_j, but only | */
+/* | H(j,j) is updated. | */
+/* %----------------------------------------------% */
+
+/*< >*/
+ dgemv_("N", n, &j, &c_b51, &v[v_offset], ldv, &workd[irj], &c__1, &c_b18,
+ &resid[1], &c__1, (ftnlen)1);
+
+/*< if (j .eq. 1 .or. rstart) h(j,1) = zero >*/
+ if (j == 1 || rstart) {
+ h__[j + h_dim1] = 0.;
+ }
+/*< h(j,2) = h(j,2) + workd(irj + j - 1) >*/
+ h__[j + (h_dim1 << 1)] += workd[irj + j - 1];
+
+/*< orth2 = .true. >*/
+ orth2 = TRUE_;
+/*< call second (t2) >*/
+/* second_(&t2); */
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< nbx = nbx + 1 >*/
+/* ++timing_1.nbx; */
+/*< call dcopy (n, resid, 1, workd(irj), 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[irj], &c__1);
+/*< ipntr(1) = irj >*/
+ ipntr[1] = irj;
+/*< ipntr(2) = ipj >*/
+ ipntr[2] = ipj;
+/*< ido = 2 >*/
+ *ido = 2;
+
+/* %-----------------------------------% */
+/* | Exit in order to compute B*r_{j}. | */
+/* | r_{j} is the corrected residual. | */
+/* %-----------------------------------% */
+
+/*< go to 9000 >*/
+ goto L9000;
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< call dcopy (n, resid, 1, workd(ipj), 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[ipj], &c__1);
+/*< end if >*/
+ }
+/*< 90 continue >*/
+L90:
+
+/* %---------------------------------------------------% */
+/* | Back from reverse communication if ORTH2 = .true. | */
+/* %---------------------------------------------------% */
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< call second (t3) >*/
+/* second_(&t3); */
+/*< tmvbx = tmvbx + (t3 - t2) >*/
+/* timing_1.tmvbx += t3 - t2; */
+/*< end if >*/
+ }
+
+/* %-----------------------------------------------------% */
+/* | Compute the B-norm of the corrected residual r_{j}. | */
+/* %-----------------------------------------------------% */
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< rnorm1 = ddot (n, resid, 1, workd(ipj), 1) >*/
+ rnorm1 = ddot_(n, &resid[1], &c__1, &workd[ipj], &c__1);
+/*< rnorm1 = sqrt(abs(rnorm1)) >*/
+ rnorm1 = sqrt((abs(rnorm1)));
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< rnorm1 = dnrm2(n, resid, 1) >*/
+ rnorm1 = dnrm2_(n, &resid[1], &c__1);
+/*< end if >*/
+ }
+
+/* if (msglvl .gt. 0 .and. iter .gt. 0) then */
+/* call ivout (logfil, 1, j, ndigit, */
+/* & '_saitr: Iterative refinement for Arnoldi residual') */
+/* if (msglvl .gt. 2) then */
+/* xtemp(1) = rnorm */
+/* xtemp(2) = rnorm1 */
+/* call dvout (logfil, 2, xtemp, ndigit, */
+/* & '_saitr: iterative refinement ; rnorm and rnorm1 are') */
+/* end if */
+/* end if */
+
+/* %-----------------------------------------% */
+/* | Determine if we need to perform another | */
+/* | step of re-orthogonalization. | */
+/* %-----------------------------------------% */
+
+/*< if (rnorm1 .gt. 0.717*rnorm) then >*/
+ if (rnorm1 > *rnorm * (float).717) {
+
+/* %--------------------------------% */
+/* | No need for further refinement | */
+/* %--------------------------------% */
+
+/*< rnorm = rnorm1 >*/
+ *rnorm = rnorm1;
+
+/*< else >*/
+ } else {
+
+/* %-------------------------------------------% */
+/* | Another step of iterative refinement step | */
+/* | is required. NITREF is used by stat.h | */
+/* %-------------------------------------------% */
+
+/*< nitref = nitref + 1 >*/
+/* ++timing_1.nitref; */
+/*< rnorm = rnorm1 >*/
+ *rnorm = rnorm1;
+/*< iter = iter + 1 >*/
+ ++iter;
+/*< if (iter .le. 1) go to 80 >*/
+ if (iter <= 1) {
+ goto L80;
+ }
+
+/* %-------------------------------------------------% */
+/* | Otherwise RESID is numerically in the span of V | */
+/* %-------------------------------------------------% */
+
+/*< do 95 jj = 1, n >*/
+ i__1 = *n;
+ for (jj = 1; jj <= i__1; ++jj) {
+/*< resid(jj) = zero >*/
+ resid[jj] = 0.;
+/*< 95 continue >*/
+/* L95: */
+ }
+/*< rnorm = zero >*/
+ *rnorm = 0.;
+/*< end if >*/
+ }
+
+/* %----------------------------------------------% */
+/* | Branch here directly if iterative refinement | */
+/* | wasn't necessary or after at most NITER_REF | */
+/* | steps of iterative refinement. | */
+/* %----------------------------------------------% */
+
+/*< 100 continue >*/
+L100:
+
+/*< rstart = .false. >*/
+ rstart = FALSE_;
+/*< orth2 = .false. >*/
+ orth2 = FALSE_;
+
+/*< call second (t5) >*/
+/* second_(&t5); */
+/*< titref = titref + (t5 - t4) >*/
+/* timing_1.titref += t5 - t4; */
+
+/* %----------------------------------------------------------% */
+/* | Make sure the last off-diagonal element is non negative | */
+/* | If not perform a similarity transformation on H(1:j,1:j) | */
+/* | and scale v(:,j) by -1. | */
+/* %----------------------------------------------------------% */
+
+/*< if (h(j,1) .lt. zero) then >*/
+ if (h__[j + h_dim1] < 0.) {
+/*< h(j,1) = -h(j,1) >*/
+ h__[j + h_dim1] = -h__[j + h_dim1];
+/*< if ( j .lt. k+np) then >*/
+ if (j < *k + *np) {
+/*< call dscal(n, -one, v(1,j+1), 1) >*/
+ dscal_(n, &c_b51, &v[(j + 1) * v_dim1 + 1], &c__1);
+/*< else >*/
+ } else {
+/*< call dscal(n, -one, resid, 1) >*/
+ dscal_(n, &c_b51, &resid[1], &c__1);
+/*< end if >*/
+ }
+/*< end if >*/
+ }
+
+/* %------------------------------------% */
+/* | STEP 6: Update j = j+1; Continue | */
+/* %------------------------------------% */
+
+/*< j = j + 1 >*/
+ ++j;
+/*< if (j .gt. k+np) then >*/
+ if (j > *k + *np) {
+/*< call second (t1) >*/
+/* second_(&t1); */
+/*< tsaitr = tsaitr + (t1 - t0) >*/
+/* timing_1.tsaitr += t1 - t0; */
+/*< ido = 99 >*/
+ *ido = 99;
+
+/* if (msglvl .gt. 1) then */
+/* call dvout (logfil, k+np, h(1,2), ndigit, */
+/* & '_saitr: main diagonal of matrix H of step K+NP.') */
+/* if (k+np .gt. 1) then */
+/* call dvout (logfil, k+np-1, h(2,1), ndigit, */
+/* & '_saitr: sub diagonal of matrix H of step K+NP.') */
+/* end if */
+/* end if */
+
+/*< go to 9000 >*/
+ goto L9000;
+/*< end if >*/
+ }
+
+/* %--------------------------------------------------------% */
+/* | Loop back to extend the factorization by another step. | */
+/* %--------------------------------------------------------% */
+
+/*< go to 1000 >*/
+ goto L1000;
+
+/* %---------------------------------------------------------------% */
+/* | | */
+/* | E N D O F M A I N I T E R A T I O N L O O P | */
+/* | | */
+/* %---------------------------------------------------------------% */
+
+/*< 9000 continue >*/
+L9000:
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dsaitr | */
+/* %---------------% */
+
+/*< end >*/
+} /* dsaitr_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.f
new file mode 100644
index 0000000000000000000000000000000000000000..2a7e0c2e7eff72b300d69a824d2f9a01d867a6b5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.f
@@ -0,0 +1,852 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dsaitr
+c
+c\Description:
+c Reverse communication interface for applying NP additional steps to
+c a K step symmetric Arnoldi factorization.
+c
+c Input: OP*V_{k} - V_{k}*H = r_{k}*e_{k}^T
+c
+c with (V_{k}^T)*B*V_{k} = I, (V_{k}^T)*B*r_{k} = 0.
+c
+c Output: OP*V_{k+p} - V_{k+p}*H = r_{k+p}*e_{k+p}^T
+c
+c with (V_{k+p}^T)*B*V_{k+p} = I, (V_{k+p}^T)*B*r_{k+p} = 0.
+c
+c where OP and B are as in dsaupd. The B-norm of r_{k+p} is also
+c computed and returned.
+c
+c\Usage:
+c call dsaitr
+c ( IDO, BMAT, N, K, NP, MODE, RESID, RNORM, V, LDV, H, LDH,
+c IPNTR, WORKD, INFO )
+c
+c\Arguments
+c IDO Integer. (INPUT/OUTPUT)
+c Reverse communication flag.
+c -------------------------------------------------------------
+c IDO = 0: first call to the reverse communication interface
+c IDO = -1: compute Y = OP * X where
+c IPNTR(1) is the pointer into WORK for X,
+c IPNTR(2) is the pointer into WORK for Y.
+c This is for the restart phase to force the new
+c starting vector into the range of OP.
+c IDO = 1: compute Y = OP * X where
+c IPNTR(1) is the pointer into WORK for X,
+c IPNTR(2) is the pointer into WORK for Y,
+c IPNTR(3) is the pointer into WORK for B * X.
+c IDO = 2: compute Y = B * X where
+c IPNTR(1) is the pointer into WORK for X,
+c IPNTR(2) is the pointer into WORK for Y.
+c IDO = 99: done
+c -------------------------------------------------------------
+c When the routine is used in the "shift-and-invert" mode, the
+c vector B * Q is already available and does not need to be
+c recomputed in forming OP * Q.
+c
+c BMAT Character*1. (INPUT)
+c BMAT specifies the type of matrix B that defines the
+c semi-inner product for the operator OP. See dsaupd.
+c B = 'I' -> standard eigenvalue problem A*x = lambda*x
+c B = 'G' -> generalized eigenvalue problem A*x = lambda*M*x
+c
+c N Integer. (INPUT)
+c Dimension of the eigenproblem.
+c
+c K Integer. (INPUT)
+c Current order of H and the number of columns of V.
+c
+c NP Integer. (INPUT)
+c Number of additional Arnoldi steps to take.
+c
+c MODE Integer. (INPUT)
+c Signifies which form for "OP". If MODE=2 then
+c a reduction in the number of B matrix vector multiplies
+c is possible since the B-norm of OP*x is equivalent to
+c the inv(B)-norm of A*x.
+c
+c RESID Double precision array of length N. (INPUT/OUTPUT)
+c On INPUT: RESID contains the residual vector r_{k}.
+c On OUTPUT: RESID contains the residual vector r_{k+p}.
+c
+c RNORM Double precision scalar. (INPUT/OUTPUT)
+c On INPUT the B-norm of r_{k}.
+c On OUTPUT the B-norm of the updated residual r_{k+p}.
+c
+c V Double precision N by K+NP array. (INPUT/OUTPUT)
+c On INPUT: V contains the Arnoldi vectors in the first K
+c columns.
+c On OUTPUT: V contains the new NP Arnoldi vectors in the next
+c NP columns. The first K columns are unchanged.
+c
+c LDV Integer. (INPUT)
+c Leading dimension of V exactly as declared in the calling
+c program.
+c
+c H Double precision (K+NP) by 2 array. (INPUT/OUTPUT)
+c H is used to store the generated symmetric tridiagonal matrix
+c with the subdiagonal in the first column starting at H(2,1)
+c and the main diagonal in the second column.
+c
+c LDH Integer. (INPUT)
+c Leading dimension of H exactly as declared in the calling
+c program.
+c
+c IPNTR Integer array of length 3. (OUTPUT)
+c Pointer to mark the starting locations in the WORK for
+c vectors used by the Arnoldi iteration.
+c -------------------------------------------------------------
+c IPNTR(1): pointer to the current operand vector X.
+c IPNTR(2): pointer to the current result vector Y.
+c IPNTR(3): pointer to the vector B * X when used in the
+c shift-and-invert mode. X is the current operand.
+c -------------------------------------------------------------
+c
+c WORKD Double precision work array of length 3*N. (REVERSE COMMUNICATION)
+c Distributed array to be used in the basic Arnoldi iteration
+c for reverse communication. The calling program should not
+c use WORKD as temporary workspace during the iteration !!!!!!
+c On INPUT, WORKD(1:N) = B*RESID where RESID is associated
+c with the K step Arnoldi factorization. Used to save some
+c computation at the first step.
+c On OUTPUT, WORKD(1:N) = B*RESID where RESID is associated
+c with the K+NP step Arnoldi factorization.
+c
+c INFO Integer. (OUTPUT)
+c = 0: Normal exit.
+c > 0: Size of an invariant subspace of OP is found that is
+c less than K + NP.
+c
+c\EndDoc
+c
+c-----------------------------------------------------------------------
+c
+c\BeginLib
+c
+c\Local variables:
+c xxxxxx real
+c
+c\Routines called:
+c dgetv0 ARPACK routine to generate the initial vector.
+c ivout ARPACK utility routine that prints integers.
+c dmout ARPACK utility routine that prints matrices.
+c dlamch LAPACK routine that determines machine constants.
+c dlascl LAPACK routine for careful scaling of a matrix.
+c dgemv Level 2 BLAS routine for matrix vector multiplication.
+c daxpy Level 1 BLAS that computes a vector triad.
+c dscal Level 1 BLAS that scales a vector.
+c dcopy Level 1 BLAS that copies one vector to another .
+c ddot Level 1 BLAS that computes the scalar product of two vectors.
+c dnrm2 Level 1 BLAS that computes the norm of a vector.
+c
+c\Author
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\Revision history:
+c xx/xx/93: Version ' 2.4'
+c
+c\SCCS Information: @(#)
+c FILE: saitr.F SID: 2.6 DATE OF SID: 8/28/96 RELEASE: 2
+c
+c\Remarks
+c The algorithm implemented is:
+c
+c restart = .false.
+c Given V_{k} = [v_{1}, ..., v_{k}], r_{k};
+c r_{k} contains the initial residual vector even for k = 0;
+c Also assume that rnorm = || B*r_{k} || and B*r_{k} are already
+c computed by the calling program.
+c
+c betaj = rnorm ; p_{k+1} = B*r_{k} ;
+c For j = k+1, ..., k+np Do
+c 1) if ( betaj < tol ) stop or restart depending on j.
+c if ( restart ) generate a new starting vector.
+c 2) v_{j} = r(j-1)/betaj; V_{j} = [V_{j-1}, v_{j}];
+c p_{j} = p_{j}/betaj
+c 3) r_{j} = OP*v_{j} where OP is defined as in dsaupd
+c For shift-invert mode p_{j} = B*v_{j} is already available.
+c wnorm = || OP*v_{j} ||
+c 4) Compute the j-th step residual vector.
+c w_{j} = V_{j}^T * B * OP * v_{j}
+c r_{j} = OP*v_{j} - V_{j} * w_{j}
+c alphaj <- j-th component of w_{j}
+c rnorm = || r_{j} ||
+c betaj+1 = rnorm
+c If (rnorm > 0.717*wnorm) accept step and go back to 1)
+c 5) Re-orthogonalization step:
+c s = V_{j}'*B*r_{j}
+c r_{j} = r_{j} - V_{j}*s; rnorm1 = || r_{j} ||
+c alphaj = alphaj + s_{j};
+c 6) Iterative refinement step:
+c If (rnorm1 > 0.717*rnorm) then
+c rnorm = rnorm1
+c accept step and go back to 1)
+c Else
+c rnorm = rnorm1
+c If this is the first time in step 6), go to 5)
+c Else r_{j} lies in the span of V_{j} numerically.
+c Set r_{j} = 0 and rnorm = 0; go to 1)
+c EndIf
+c End Do
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dsaitr
+ & (ido, bmat, n, k, np, mode, resid, rnorm, v, ldv, h, ldh,
+ & ipntr, workd, info)
+c
+c %----------------------------------------------------%
+c | Include files for debugging and timing information |
+c %----------------------------------------------------%
+c
+ include 'debug.h'
+ include 'stat.h'
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ character bmat*1
+ integer ido, info, k, ldh, ldv, n, mode, np
+ Double precision
+ & rnorm
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ integer ipntr(3)
+ Double precision
+ & h(ldh,2), resid(n), v(ldv,k+np), workd(3*n)
+c
+c %------------%
+c | Parameters |
+c %------------%
+c
+ Double precision
+ & one, zero
+ parameter (one = 1.0D+0, zero = 0.0D+0)
+c
+c %---------------%
+c | Local Scalars |
+c %---------------%
+c
+ logical first, orth1, orth2, rstart, step3, step4
+ integer i, ierr, ipj, irj, ivj, iter, itry, j, msglvl,
+ & infol, jj
+ Double precision
+ & rnorm1, wnorm, safmin, temp1
+ save orth1, orth2, rstart, step3, step4,
+ & ierr, ipj, irj, ivj, iter, itry, j, msglvl,
+ & rnorm1, safmin, wnorm
+c
+c %-----------------------%
+c | Local Array Arguments |
+c %-----------------------%
+c
+ Double precision
+ & xtemp(2)
+c
+c %----------------------%
+c | External Subroutines |
+c %----------------------%
+c
+ external daxpy, dcopy, dscal, dgemv, dgetv0, dmout,
+ & dlascl, second
+c
+c %--------------------%
+c | External Functions |
+c %--------------------%
+c
+ Double precision
+ & ddot, dnrm2, dlamch
+ external ddot, dnrm2, dlamch
+c
+c %-----------------%
+c | Data statements |
+c %-----------------%
+c
+ data first / .true. /
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+ if (first) then
+ first = .false.
+c
+c %--------------------------------%
+c | safmin = safe minimum is such |
+c | that 1/sfmin does not overflow |
+c %--------------------------------%
+c
+ safmin = dlamch('safmin')
+ end if
+c
+ if (ido .eq. 0) then
+c
+c %-------------------------------%
+c | Initialize timing statistics |
+c | & message level for debugging |
+c %-------------------------------%
+c
+ call second (t0)
+ msglvl = msaitr
+c
+c %------------------------------%
+c | Initial call to this routine |
+c %------------------------------%
+c
+ info = 0
+ step3 = .false.
+ step4 = .false.
+ rstart = .false.
+ orth1 = .false.
+ orth2 = .false.
+c
+c %--------------------------------%
+c | Pointer to the current step of |
+c | the factorization to build |
+c %--------------------------------%
+c
+ j = k + 1
+c
+c %------------------------------------------%
+c | Pointers used for reverse communication |
+c | when using WORKD. |
+c %------------------------------------------%
+c
+ ipj = 1
+ irj = ipj + n
+ ivj = irj + n
+ end if
+c
+c %-------------------------------------------------%
+c | When in reverse communication mode one of: |
+c | STEP3, STEP4, ORTH1, ORTH2, RSTART |
+c | will be .true. |
+c | STEP3: return from computing OP*v_{j}. |
+c | STEP4: return from computing B-norm of OP*v_{j} |
+c | ORTH1: return from computing B-norm of r_{j+1} |
+c | ORTH2: return from computing B-norm of |
+c | correction to the residual vector. |
+c | RSTART: return from OP computations needed by |
+c | dgetv0. |
+c %-------------------------------------------------%
+c
+ if (step3) go to 50
+ if (step4) go to 60
+ if (orth1) go to 70
+ if (orth2) go to 90
+ if (rstart) go to 30
+c
+c %------------------------------%
+c | Else this is the first step. |
+c %------------------------------%
+c
+c %--------------------------------------------------------------%
+c | |
+c | A R N O L D I I T E R A T I O N L O O P |
+c | |
+c | Note: B*r_{j-1} is already in WORKD(1:N)=WORKD(IPJ:IPJ+N-1) |
+c %--------------------------------------------------------------%
+c
+ 1000 continue
+c
+c if (msglvl .gt. 2) then
+c call ivout (logfil, 1, j, ndigit,
+c & '_saitr: generating Arnoldi vector no.')
+c call dvout (logfil, 1, rnorm, ndigit,
+c & '_saitr: B-norm of the current residual =')
+c end if
+c
+c %---------------------------------------------------------%
+c | Check for exact zero. Equivalent to determining whether |
+c | a j-step Arnoldi factorization is present. |
+c %---------------------------------------------------------%
+c
+ if (rnorm .gt. zero) go to 40
+c
+c %---------------------------------------------------%
+c | Invariant subspace found, generate a new starting |
+c | vector which is orthogonal to the current Arnoldi |
+c | basis and continue the iteration. |
+c %---------------------------------------------------%
+c
+c if (msglvl .gt. 0) then
+c call ivout (logfil, 1, j, ndigit,
+c & '_saitr: ****** restart at step ******')
+c end if
+c
+c %---------------------------------------------%
+c | ITRY is the loop variable that controls the |
+c | maximum amount of times that a restart is |
+c | attempted. NRSTRT is used by stat.h |
+c %---------------------------------------------%
+c
+ nrstrt = nrstrt + 1
+ itry = 1
+ 20 continue
+ rstart = .true.
+ ido = 0
+ 30 continue
+c
+c %--------------------------------------%
+c | If in reverse communication mode and |
+c | RSTART = .true. flow returns here. |
+c %--------------------------------------%
+c
+ call dgetv0 (ido, bmat, itry, .false., n, j, v, ldv,
+ & resid, rnorm, ipntr, workd, ierr)
+ if (ido .ne. 99) go to 9000
+ if (ierr .lt. 0) then
+ itry = itry + 1
+ if (itry .le. 3) go to 20
+c
+c %------------------------------------------------%
+c | Give up after several restart attempts. |
+c | Set INFO to the size of the invariant subspace |
+c | which spans OP and exit. |
+c %------------------------------------------------%
+c
+ info = j - 1
+ call second (t1)
+ tsaitr = tsaitr + (t1 - t0)
+ ido = 99
+ go to 9000
+ end if
+c
+ 40 continue
+c
+c %---------------------------------------------------------%
+c | STEP 2: v_{j} = r_{j-1}/rnorm and p_{j} = p_{j}/rnorm |
+c | Note that p_{j} = B*r_{j-1}. In order to avoid overflow |
+c | when reciprocating a small RNORM, test against lower |
+c | machine bound. |
+c %---------------------------------------------------------%
+c
+ call dcopy (n, resid, 1, v(1,j), 1)
+ if (rnorm .ge. safmin) then
+ temp1 = one / rnorm
+ call dscal (n, temp1, v(1,j), 1)
+ call dscal (n, temp1, workd(ipj), 1)
+ else
+c
+c %-----------------------------------------%
+c | To scale both v_{j} and p_{j} carefully |
+c | use LAPACK routine SLASCL |
+c %-----------------------------------------%
+c
+ call dlascl ('General', i, i, rnorm, one, n, 1,
+ & v(1,j), n, infol)
+ call dlascl ('General', i, i, rnorm, one, n, 1,
+ & workd(ipj), n, infol)
+ end if
+c
+c %------------------------------------------------------%
+c | STEP 3: r_{j} = OP*v_{j}; Note that p_{j} = B*v_{j} |
+c | Note that this is not quite yet r_{j}. See STEP 4 |
+c %------------------------------------------------------%
+c
+ step3 = .true.
+ nopx = nopx + 1
+ call second (t2)
+ call dcopy (n, v(1,j), 1, workd(ivj), 1)
+ ipntr(1) = ivj
+ ipntr(2) = irj
+ ipntr(3) = ipj
+ ido = 1
+c
+c %-----------------------------------%
+c | Exit in order to compute OP*v_{j} |
+c %-----------------------------------%
+c
+ go to 9000
+ 50 continue
+c
+c %-----------------------------------%
+c | Back from reverse communication; |
+c | WORKD(IRJ:IRJ+N-1) := OP*v_{j}. |
+c %-----------------------------------%
+c
+ call second (t3)
+ tmvopx = tmvopx + (t3 - t2)
+c
+ step3 = .false.
+c
+c %------------------------------------------%
+c | Put another copy of OP*v_{j} into RESID. |
+c %------------------------------------------%
+c
+ call dcopy (n, workd(irj), 1, resid, 1)
+c
+c %-------------------------------------------%
+c | STEP 4: Finish extending the symmetric |
+c | Arnoldi to length j. If MODE = 2 |
+c | then B*OP = B*inv(B)*A = A and |
+c | we don't need to compute B*OP. |
+c | NOTE: If MODE = 2 WORKD(IVJ:IVJ+N-1) is |
+c | assumed to have A*v_{j}. |
+c %-------------------------------------------%
+c
+ if (mode .eq. 2) go to 65
+ call second (t2)
+ if (bmat .eq. 'G') then
+ nbx = nbx + 1
+ step4 = .true.
+ ipntr(1) = irj
+ ipntr(2) = ipj
+ ido = 2
+c
+c %-------------------------------------%
+c | Exit in order to compute B*OP*v_{j} |
+c %-------------------------------------%
+c
+ go to 9000
+ else if (bmat .eq. 'I') then
+ call dcopy(n, resid, 1 , workd(ipj), 1)
+ end if
+ 60 continue
+c
+c %-----------------------------------%
+c | Back from reverse communication; |
+c | WORKD(IPJ:IPJ+N-1) := B*OP*v_{j}. |
+c %-----------------------------------%
+c
+ if (bmat .eq. 'G') then
+ call second (t3)
+ tmvbx = tmvbx + (t3 - t2)
+ end if
+c
+ step4 = .false.
+c
+c %-------------------------------------%
+c | The following is needed for STEP 5. |
+c | Compute the B-norm of OP*v_{j}. |
+c %-------------------------------------%
+c
+ 65 continue
+ if (mode .eq. 2) then
+c
+c %----------------------------------%
+c | Note that the B-norm of OP*v_{j} |
+c | is the inv(B)-norm of A*v_{j}. |
+c %----------------------------------%
+c
+ wnorm = ddot (n, resid, 1, workd(ivj), 1)
+ wnorm = sqrt(abs(wnorm))
+ else if (bmat .eq. 'G') then
+ wnorm = ddot (n, resid, 1, workd(ipj), 1)
+ wnorm = sqrt(abs(wnorm))
+ else if (bmat .eq. 'I') then
+ wnorm = dnrm2(n, resid, 1)
+ end if
+c
+c %-----------------------------------------%
+c | Compute the j-th residual corresponding |
+c | to the j step factorization. |
+c | Use Classical Gram Schmidt and compute: |
+c | w_{j} <- V_{j}^T * B * OP * v_{j} |
+c | r_{j} <- OP*v_{j} - V_{j} * w_{j} |
+c %-----------------------------------------%
+c
+c
+c %------------------------------------------%
+c | Compute the j Fourier coefficients w_{j} |
+c | WORKD(IPJ:IPJ+N-1) contains B*OP*v_{j}. |
+c %------------------------------------------%
+c
+ if (mode .ne. 2 ) then
+ call dgemv('T', n, j, one, v, ldv, workd(ipj), 1, zero,
+ & workd(irj), 1)
+ else if (mode .eq. 2) then
+ call dgemv('T', n, j, one, v, ldv, workd(ivj), 1, zero,
+ & workd(irj), 1)
+ end if
+c
+c %--------------------------------------%
+c | Orthgonalize r_{j} against V_{j}. |
+c | RESID contains OP*v_{j}. See STEP 3. |
+c %--------------------------------------%
+c
+ call dgemv('N', n, j, -one, v, ldv, workd(irj), 1, one,
+ & resid, 1)
+c
+c %--------------------------------------%
+c | Extend H to have j rows and columns. |
+c %--------------------------------------%
+c
+ h(j,2) = workd(irj + j - 1)
+ if (j .eq. 1 .or. rstart) then
+ h(j,1) = zero
+ else
+ h(j,1) = rnorm
+ end if
+ call second (t4)
+c
+ orth1 = .true.
+ iter = 0
+c
+ call second (t2)
+ if (bmat .eq. 'G') then
+ nbx = nbx + 1
+ call dcopy (n, resid, 1, workd(irj), 1)
+ ipntr(1) = irj
+ ipntr(2) = ipj
+ ido = 2
+c
+c %----------------------------------%
+c | Exit in order to compute B*r_{j} |
+c %----------------------------------%
+c
+ go to 9000
+ else if (bmat .eq. 'I') then
+ call dcopy (n, resid, 1, workd(ipj), 1)
+ end if
+ 70 continue
+c
+c %---------------------------------------------------%
+c | Back from reverse communication if ORTH1 = .true. |
+c | WORKD(IPJ:IPJ+N-1) := B*r_{j}. |
+c %---------------------------------------------------%
+c
+ if (bmat .eq. 'G') then
+ call second (t3)
+ tmvbx = tmvbx + (t3 - t2)
+ end if
+c
+ orth1 = .false.
+c
+c %------------------------------%
+c | Compute the B-norm of r_{j}. |
+c %------------------------------%
+c
+ if (bmat .eq. 'G') then
+ rnorm = ddot (n, resid, 1, workd(ipj), 1)
+ rnorm = sqrt(abs(rnorm))
+ else if (bmat .eq. 'I') then
+ rnorm = dnrm2(n, resid, 1)
+ end if
+c
+c %-----------------------------------------------------------%
+c | STEP 5: Re-orthogonalization / Iterative refinement phase |
+c | Maximum NITER_ITREF tries. |
+c | |
+c | s = V_{j}^T * B * r_{j} |
+c | r_{j} = r_{j} - V_{j}*s |
+c | alphaj = alphaj + s_{j} |
+c | |
+c | The stopping criteria used for iterative refinement is |
+c | discussed in Parlett's book SEP, page 107 and in Gragg & |
+c | Reichel ACM TOMS paper; Algorithm 686, Dec. 1990. |
+c | Determine if we need to correct the residual. The goal is |
+c | to enforce ||v(:,1:j)^T * r_{j}|| .le. eps * || r_{j} || |
+c %-----------------------------------------------------------%
+c
+ if (rnorm .gt. 0.717*wnorm) go to 100
+ nrorth = nrorth + 1
+c
+c %---------------------------------------------------%
+c | Enter the Iterative refinement phase. If further |
+c | refinement is necessary, loop back here. The loop |
+c | variable is ITER. Perform a step of Classical |
+c | Gram-Schmidt using all the Arnoldi vectors V_{j} |
+c %---------------------------------------------------%
+c
+ 80 continue
+c
+ if (msglvl .gt. 2) then
+ xtemp(1) = wnorm
+ xtemp(2) = rnorm
+c call dvout (logfil, 2, xtemp, ndigit,
+c & '_saitr: re-orthonalization ; wnorm and rnorm are')
+ end if
+c
+c %----------------------------------------------------%
+c | Compute V_{j}^T * B * r_{j}. |
+c | WORKD(IRJ:IRJ+J-1) = v(:,1:J)'*WORKD(IPJ:IPJ+N-1). |
+c %----------------------------------------------------%
+c
+ call dgemv ('T', n, j, one, v, ldv, workd(ipj), 1,
+ & zero, workd(irj), 1)
+c
+c %----------------------------------------------%
+c | Compute the correction to the residual: |
+c | r_{j} = r_{j} - V_{j} * WORKD(IRJ:IRJ+J-1). |
+c | The correction to H is v(:,1:J)*H(1:J,1:J) + |
+c | v(:,1:J)*WORKD(IRJ:IRJ+J-1)*e'_j, but only |
+c | H(j,j) is updated. |
+c %----------------------------------------------%
+c
+ call dgemv ('N', n, j, -one, v, ldv, workd(irj), 1,
+ & one, resid, 1)
+c
+ if (j .eq. 1 .or. rstart) h(j,1) = zero
+ h(j,2) = h(j,2) + workd(irj + j - 1)
+c
+ orth2 = .true.
+ call second (t2)
+ if (bmat .eq. 'G') then
+ nbx = nbx + 1
+ call dcopy (n, resid, 1, workd(irj), 1)
+ ipntr(1) = irj
+ ipntr(2) = ipj
+ ido = 2
+c
+c %-----------------------------------%
+c | Exit in order to compute B*r_{j}. |
+c | r_{j} is the corrected residual. |
+c %-----------------------------------%
+c
+ go to 9000
+ else if (bmat .eq. 'I') then
+ call dcopy (n, resid, 1, workd(ipj), 1)
+ end if
+ 90 continue
+c
+c %---------------------------------------------------%
+c | Back from reverse communication if ORTH2 = .true. |
+c %---------------------------------------------------%
+c
+ if (bmat .eq. 'G') then
+ call second (t3)
+ tmvbx = tmvbx + (t3 - t2)
+ end if
+c
+c %-----------------------------------------------------%
+c | Compute the B-norm of the corrected residual r_{j}. |
+c %-----------------------------------------------------%
+c
+ if (bmat .eq. 'G') then
+ rnorm1 = ddot (n, resid, 1, workd(ipj), 1)
+ rnorm1 = sqrt(abs(rnorm1))
+ else if (bmat .eq. 'I') then
+ rnorm1 = dnrm2(n, resid, 1)
+ end if
+c
+c if (msglvl .gt. 0 .and. iter .gt. 0) then
+c call ivout (logfil, 1, j, ndigit,
+c & '_saitr: Iterative refinement for Arnoldi residual')
+c if (msglvl .gt. 2) then
+c xtemp(1) = rnorm
+c xtemp(2) = rnorm1
+c call dvout (logfil, 2, xtemp, ndigit,
+c & '_saitr: iterative refinement ; rnorm and rnorm1 are')
+c end if
+c end if
+c
+c %-----------------------------------------%
+c | Determine if we need to perform another |
+c | step of re-orthogonalization. |
+c %-----------------------------------------%
+c
+ if (rnorm1 .gt. 0.717*rnorm) then
+c
+c %--------------------------------%
+c | No need for further refinement |
+c %--------------------------------%
+c
+ rnorm = rnorm1
+c
+ else
+c
+c %-------------------------------------------%
+c | Another step of iterative refinement step |
+c | is required. NITREF is used by stat.h |
+c %-------------------------------------------%
+c
+ nitref = nitref + 1
+ rnorm = rnorm1
+ iter = iter + 1
+ if (iter .le. 1) go to 80
+c
+c %-------------------------------------------------%
+c | Otherwise RESID is numerically in the span of V |
+c %-------------------------------------------------%
+c
+ do 95 jj = 1, n
+ resid(jj) = zero
+ 95 continue
+ rnorm = zero
+ end if
+c
+c %----------------------------------------------%
+c | Branch here directly if iterative refinement |
+c | wasn't necessary or after at most NITER_REF |
+c | steps of iterative refinement. |
+c %----------------------------------------------%
+c
+ 100 continue
+c
+ rstart = .false.
+ orth2 = .false.
+c
+ call second (t5)
+ titref = titref + (t5 - t4)
+c
+c %----------------------------------------------------------%
+c | Make sure the last off-diagonal element is non negative |
+c | If not perform a similarity transformation on H(1:j,1:j) |
+c | and scale v(:,j) by -1. |
+c %----------------------------------------------------------%
+c
+ if (h(j,1) .lt. zero) then
+ h(j,1) = -h(j,1)
+ if ( j .lt. k+np) then
+ call dscal(n, -one, v(1,j+1), 1)
+ else
+ call dscal(n, -one, resid, 1)
+ end if
+ end if
+c
+c %------------------------------------%
+c | STEP 6: Update j = j+1; Continue |
+c %------------------------------------%
+c
+ j = j + 1
+ if (j .gt. k+np) then
+ call second (t1)
+ tsaitr = tsaitr + (t1 - t0)
+ ido = 99
+c
+c if (msglvl .gt. 1) then
+c call dvout (logfil, k+np, h(1,2), ndigit,
+c & '_saitr: main diagonal of matrix H of step K+NP.')
+c if (k+np .gt. 1) then
+c call dvout (logfil, k+np-1, h(2,1), ndigit,
+c & '_saitr: sub diagonal of matrix H of step K+NP.')
+c end if
+c end if
+c
+ go to 9000
+ end if
+c
+c %--------------------------------------------------------%
+c | Loop back to extend the factorization by another step. |
+c %--------------------------------------------------------%
+c
+ go to 1000
+c
+c %---------------------------------------------------------------%
+c | |
+c | E N D O F M A I N I T E R A T I O N L O O P |
+c | |
+c %---------------------------------------------------------------%
+c
+ 9000 continue
+ return
+c
+c %---------------%
+c | End of dsaitr |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.h
new file mode 100644
index 0000000000000000000000000000000000000000..27f8aca5825e83ccd65eb80aec806cfbbf85f1da
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaitr.h
@@ -0,0 +1,18 @@
+extern int v3p_netlib_dsaitr_(
+ v3p_netlib_integer *ido,
+ char *bmat,
+ v3p_netlib_integer *n,
+ v3p_netlib_integer *k,
+ v3p_netlib_integer *np,
+ v3p_netlib_integer *mode,
+ v3p_netlib_doublereal *resid,
+ v3p_netlib_doublereal *rnorm,
+ v3p_netlib_doublereal *v,
+ v3p_netlib_integer *ldv,
+ v3p_netlib_doublereal *h__,
+ v3p_netlib_integer *ldh,
+ v3p_netlib_integer *ipntr,
+ v3p_netlib_doublereal *workd,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen bmat_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.P
new file mode 100644
index 0000000000000000000000000000000000000000..f443f4cfe337fdfa50aa782cf59b58c6b15c277e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.P
@@ -0,0 +1,12 @@
+extern int dsapps_(integer *n, integer *kev, integer *np, doublereal *shift, doublereal *v, integer *ldv, doublereal *h__, integer *ldh, doublereal *resid, doublereal *q, integer *ldq, doublereal *workd);
+/* comlen debug_ 96 */
+/* comlen timing_ 124 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: second_ 14 1 6 */
+/*:ref: dlaset_ 14 8 13 4 4 7 7 7 4 124 */
+/*:ref: dlartg_ 14 5 7 7 7 7 7 */
+/*:ref: dscal_ 14 4 4 7 7 4 */
+/*:ref: dgemv_ 14 12 13 4 4 7 7 4 7 4 7 7 4 124 */
+/*:ref: dcopy_ 14 5 4 7 4 7 4 */
+/*:ref: dlacpy_ 14 8 13 4 4 7 4 7 4 124 */
+/*:ref: daxpy_ 14 6 4 7 7 4 7 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.c
new file mode 100644
index 0000000000000000000000000000000000000000..04c0a5b34d35b7c4a9fbc7761875e7b4edfa42a4
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.c
@@ -0,0 +1,772 @@
+/* arpack/dsapps.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Common Block Declarations */
+
+/*Extern struct { */
+/* integer logfil, ndigit, mgetv0, msaupd, msaup2, msaitr, mseigt, msapps, */
+/* msgets, mseupd, mnaupd, mnaup2, mnaitr, mneigh, mnapps, mngets, */
+/* mneupd, mcaupd, mcaup2, mcaitr, mceigh, mcapps, mcgets, mceupd; */
+/*} debug_; */
+
+/*#define debug_1 debug_ */
+
+/*Extern struct { */
+/* integer nopx, nbx, nrorth, nitref, nrstrt; */
+/* real tsaupd, tsaup2, tsaitr, tseigt, tsgets, tsapps, tsconv, tnaupd, */
+/* tnaup2, tnaitr, tneigh, tngets, tnapps, tnconv, tcaupd, tcaup2, */
+/* tcaitr, tceigh, tcgets, tcapps, tcconv, tmvopx, tmvbx, tgetv0, */
+/* titref, trvec; */
+/*} timing_; */
+
+/*#define timing_1 timing_ */
+
+/* Table of constant values */
+
+static doublereal c_b4 = 0.;
+static doublereal c_b5 = 1.;
+static doublereal c_b14 = -1.;
+static integer c__1 = 1;
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dsapps */
+
+/* \Description: */
+/* Given the Arnoldi factorization */
+
+/* A*V_{k} - V_{k}*H_{k} = r_{k+p}*e_{k+p}^T, */
+
+/* apply NP shifts implicitly resulting in */
+
+/* A*(V_{k}*Q) - (V_{k}*Q)*(Q^T* H_{k}*Q) = r_{k+p}*e_{k+p}^T * Q */
+
+/* where Q is an orthogonal matrix of order KEV+NP. Q is the product of */
+/* rotations resulting from the NP bulge chasing sweeps. The updated Arnoldi */
+/* factorization becomes: */
+
+/* A*VNEW_{k} - VNEW_{k}*HNEW_{k} = rnew_{k}*e_{k}^T. */
+
+/* \Usage: */
+/* call dsapps */
+/* ( N, KEV, NP, SHIFT, V, LDV, H, LDH, RESID, Q, LDQ, WORKD ) */
+
+/* \Arguments */
+/* N Integer. (INPUT) */
+/* Problem size, i.e. dimension of matrix A. */
+
+/* KEV Integer. (INPUT) */
+/* INPUT: KEV+NP is the size of the input matrix H. */
+/* OUTPUT: KEV is the size of the updated matrix HNEW. */
+
+/* NP Integer. (INPUT) */
+/* Number of implicit shifts to be applied. */
+
+/* SHIFT Double precision array of length NP. (INPUT) */
+/* The shifts to be applied. */
+
+/* V Double precision N by (KEV+NP) array. (INPUT/OUTPUT) */
+/* INPUT: V contains the current KEV+NP Arnoldi vectors. */
+/* OUTPUT: VNEW = V(1:n,1:KEV); the updated Arnoldi vectors */
+/* are in the first KEV columns of V. */
+
+/* LDV Integer. (INPUT) */
+/* Leading dimension of V exactly as declared in the calling */
+/* program. */
+
+/* H Double precision (KEV+NP) by 2 array. (INPUT/OUTPUT) */
+/* INPUT: H contains the symmetric tridiagonal matrix of the */
+/* Arnoldi factorization with the subdiagonal in the 1st column */
+/* starting at H(2,1) and the main diagonal in the 2nd column. */
+/* OUTPUT: H contains the updated tridiagonal matrix in the */
+/* KEV leading submatrix. */
+
+/* LDH Integer. (INPUT) */
+/* Leading dimension of H exactly as declared in the calling */
+/* program. */
+
+/* RESID Double precision array of length (N). (INPUT/OUTPUT) */
+/* INPUT: RESID contains the the residual vector r_{k+p}. */
+/* OUTPUT: RESID is the updated residual vector rnew_{k}. */
+
+/* Q Double precision KEV+NP by KEV+NP work array. (WORKSPACE) */
+/* Work array used to accumulate the rotations during the bulge */
+/* chase sweep. */
+
+/* LDQ Integer. (INPUT) */
+/* Leading dimension of Q exactly as declared in the calling */
+/* program. */
+
+/* WORKD Double precision work array of length 2*N. (WORKSPACE) */
+/* Distributed array used in the application of the accumulated */
+/* orthogonal matrix Q. */
+
+/* \EndDoc */
+
+/* ----------------------------------------------------------------------- */
+
+/* \BeginLib */
+
+/* \Local variables: */
+/* xxxxxx real */
+
+/* \References: */
+/* 1. D.C. Sorensen, "Implicit Application of Polynomial Filters in */
+/* a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992), */
+/* pp 357-385. */
+/* 2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly */
+/* Restarted Arnoldi Iteration", Rice University Technical Report */
+/* TR95-13, Department of Computational and Applied Mathematics. */
+
+/* \Routines called: */
+/* second ARPACK utility routine for timing. */
+/* dlamch LAPACK routine that determines machine constants. */
+/* dlartg LAPACK Givens rotation construction routine. */
+/* dlacpy LAPACK matrix copy routine. */
+/* dlaset LAPACK matrix initialization routine. */
+/* dgemv Level 2 BLAS routine for matrix vector multiplication. */
+/* daxpy Level 1 BLAS that computes a vector triad. */
+/* dcopy Level 1 BLAS that copies one vector to another. */
+/* dscal Level 1 BLAS that scales a vector. */
+
+/* \Author */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \Revision history: */
+/* 12/16/93: Version ' 2.1' */
+
+/* \SCCS Information: @(#) */
+/* FILE: sapps.F SID: 2.5 DATE OF SID: 4/19/96 RELEASE: 2 */
+
+/* \Remarks */
+/* 1. In this version, each shift is applied to all the subblocks of */
+/* the tridiagonal matrix H and not just to the submatrix that it */
+/* comes from. This routine assumes that the subdiagonal elements */
+/* of H that are stored in h(1:kev+np,1) are nonegative upon input */
+/* and enforce this condition upon output. This version incorporates */
+/* deflation. See code for documentation. */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< >*/
+/* Subroutine */ int dsapps_(integer *n, integer *kev, integer *np,
+ doublereal *shift, doublereal *v, integer *ldv, doublereal *h__,
+ integer *ldh, doublereal *resid, doublereal *q, integer *ldq,
+ doublereal *workd)
+{
+ /* Initialized data */
+
+ static logical first = TRUE_;
+
+ /* System generated locals */
+ integer h_dim1, h_offset, q_dim1, q_offset, v_dim1, v_offset, i__1, i__2,
+ i__3, i__4;
+ doublereal d__1, d__2;
+
+ /* Local variables */
+ doublereal c__, f, g;
+ integer i__, j;
+ doublereal r__, s, a1, a2, a3, a4;
+/* static real t0, t1; */
+ integer jj;
+ doublereal big;
+ integer iend, itop;
+ extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
+ integer *), dgemv_(char *, integer *, integer *, doublereal *,
+ doublereal *, integer *, doublereal *, integer *, doublereal *,
+ doublereal *, integer *, ftnlen), dcopy_(integer *, doublereal *,
+ integer *, doublereal *, integer *), daxpy_(integer *, doublereal
+ *, doublereal *, integer *, doublereal *, integer *);
+ extern doublereal dlamch_(char *, ftnlen);
+ extern /* Subroutine */ int second_(real *);
+ static doublereal epsmch;
+ integer istart, kplusp /*, msglvl */;
+ extern /* Subroutine */ int dlacpy_(char *, integer *, integer *,
+ doublereal *, integer *, doublereal *, integer *, ftnlen),
+ dlartg_(doublereal *, doublereal *, doublereal *, doublereal *,
+ doublereal *), dlaset_(char *, integer *, integer *, doublereal *,
+ doublereal *, doublereal *, integer *, ftnlen);
+
+
+/* %----------------------------------------------------% */
+/* | Include files for debugging and timing information | */
+/* %----------------------------------------------------% */
+
+/*< include 'debug.h' >*/
+/*< include 'stat.h' >*/
+
+/* \SCCS Information: @(#) */
+/* FILE: debug.h SID: 2.3 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/* %---------------------------------% */
+/* | See debug.doc for documentation | */
+/* %---------------------------------% */
+/*< >*/
+/*< integer kev, ldh, ldq, ldv, n, np >*/
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/* %--------------------------------% */
+/* | See stat.doc for documentation | */
+/* %--------------------------------% */
+
+/* \SCCS Information: @(#) */
+/* FILE: stat.h SID: 2.2 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/*< save t0, t1, t2, t3, t4, t5 >*/
+
+/*< integer nopx, nbx, nrorth, nitref, nrstrt >*/
+/*< >*/
+/*< >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< >*/
+
+/* %------------% */
+/* | Parameters | */
+/* %------------% */
+
+/*< >*/
+/*< parameter (one = 1.0D+0, zero = 0.0D+0) >*/
+
+/* %---------------% */
+/* | Local Scalars | */
+/* %---------------% */
+
+/*< integer i, iend, istart, itop, j, jj, kplusp, msglvl >*/
+/*< logical first >*/
+/*< >*/
+/*< save epsmch, first >*/
+
+
+/* %----------------------% */
+/* | External Subroutines | */
+/* %----------------------% */
+
+/*< >*/
+
+/* %--------------------% */
+/* | External Functions | */
+/* %--------------------% */
+
+/*< >*/
+/*< external dlamch >*/
+
+/* %----------------------% */
+/* | Intrinsics Functions | */
+/* %----------------------% */
+
+/*< intrinsic abs >*/
+
+/* %----------------% */
+/* | Data statments | */
+/* %----------------% */
+
+/*< data first / .true. / >*/
+ /* Parameter adjustments */
+ --workd;
+ --resid;
+ --shift;
+ v_dim1 = *ldv;
+ v_offset = 1 + v_dim1;
+ v -= v_offset;
+ h_dim1 = *ldh;
+ h_offset = 1 + h_dim1;
+ h__ -= h_offset;
+ q_dim1 = *ldq;
+ q_offset = 1 + q_dim1;
+ q -= q_offset;
+
+ /* Function Body */
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+/*< if (first) then >*/
+ if (first) {
+/*< epsmch = dlamch('Epsilon-Machine') >*/
+ epsmch = dlamch_("Epsilon-Machine", (ftnlen)15);
+/*< first = .false. >*/
+ first = FALSE_;
+/*< end if >*/
+ }
+/*< itop = 1 >*/
+ itop = 1;
+
+/* %-------------------------------% */
+/* | Initialize timing statistics | */
+/* | & message level for debugging | */
+/* %-------------------------------% */
+
+/*< call second (t0) >*/
+/* second_(&t0); */
+/*< msglvl = msapps >*/
+/* msglvl = debug_1.msapps; */
+
+/*< kplusp = kev + np >*/
+ kplusp = *kev + *np;
+
+/* %----------------------------------------------% */
+/* | Initialize Q to the identity matrix of order | */
+/* | kplusp used to accumulate the rotations. | */
+/* %----------------------------------------------% */
+
+/*< call dlaset ('All', kplusp, kplusp, zero, one, q, ldq) >*/
+ dlaset_("All", &kplusp, &kplusp, &c_b4, &c_b5, &q[q_offset], ldq, (ftnlen)
+ 3);
+
+/* %----------------------------------------------% */
+/* | Quick return if there are no shifts to apply | */
+/* %----------------------------------------------% */
+
+/*< if (np .eq. 0) go to 9000 >*/
+ if (*np == 0) {
+ goto L9000;
+ }
+
+/* %----------------------------------------------------------% */
+/* | Apply the np shifts implicitly. Apply each shift to the | */
+/* | whole matrix and not just to the submatrix from which it | */
+/* | comes. | */
+/* %----------------------------------------------------------% */
+
+/*< do 90 jj = 1, np >*/
+ i__1 = *np;
+ for (jj = 1; jj <= i__1; ++jj) {
+
+/*< istart = itop >*/
+ istart = itop;
+
+/* %----------------------------------------------------------% */
+/* | Check for splitting and deflation. Currently we consider | */
+/* | an off-diagonal element h(i+1,1) negligible if | */
+/* | h(i+1,1) .le. epsmch*( |h(i,2)| + |h(i+1,2)| ) | */
+/* | for i=1:KEV+NP-1. | */
+/* | If above condition tests true then we set h(i+1,1) = 0. | */
+/* | Note that h(1:KEV+NP,1) are assumed to be non negative. | */
+/* %----------------------------------------------------------% */
+
+/*< 20 continue >*/
+L20:
+
+/* %------------------------------------------------% */
+/* | The following loop exits early if we encounter | */
+/* | a negligible off diagonal element. | */
+/* %------------------------------------------------% */
+
+/*< do 30 i = istart, kplusp-1 >*/
+ i__2 = kplusp - 1;
+ for (i__ = istart; i__ <= i__2; ++i__) {
+/*< big = abs(h(i,2)) + abs(h(i+1,2)) >*/
+ big = (d__1 = h__[i__ + (h_dim1 << 1)], abs(d__1)) + (d__2 = h__[
+ i__ + 1 + (h_dim1 << 1)], abs(d__2));
+/*< if (h(i+1,1) .le. epsmch*big) then >*/
+ if (h__[i__ + 1 + h_dim1] <= epsmch * big) {
+/* if (msglvl .gt. 0) then */
+/* call ivout (logfil, 1, i, ndigit, */
+/* & '_sapps: deflation at row/column no.') */
+/* call ivout (logfil, 1, jj, ndigit, */
+/* & '_sapps: occurred before shift number.') */
+/* call dvout (logfil, 1, h(i+1,1), ndigit, */
+/* & '_sapps: the corresponding off diagonal element') */
+/* end if */
+/*< h(i+1,1) = zero >*/
+ h__[i__ + 1 + h_dim1] = 0.;
+/*< iend = i >*/
+ iend = i__;
+/*< go to 40 >*/
+ goto L40;
+/*< end if >*/
+ }
+/*< 30 continue >*/
+/* L30: */
+ }
+/*< iend = kplusp >*/
+ iend = kplusp;
+/*< 40 continue >*/
+L40:
+
+/*< if (istart .lt. iend) then >*/
+ if (istart < iend) {
+
+/* %--------------------------------------------------------% */
+/* | Construct the plane rotation G'(istart,istart+1,theta) | */
+/* | that attempts to drive h(istart+1,1) to zero. | */
+/* %--------------------------------------------------------% */
+
+/*< f = h(istart,2) - shift(jj) >*/
+ f = h__[istart + (h_dim1 << 1)] - shift[jj];
+/*< g = h(istart+1,1) >*/
+ g = h__[istart + 1 + h_dim1];
+/*< call dlartg (f, g, c, s, r) >*/
+ dlartg_(&f, &g, &c__, &s, &r__);
+
+/* %-------------------------------------------------------% */
+/* | Apply rotation to the left and right of H; | */
+/* | H <- G' * H * G, where G = G(istart,istart+1,theta). | */
+/* | This will create a "bulge". | */
+/* %-------------------------------------------------------% */
+
+/*< a1 = c*h(istart,2) + s*h(istart+1,1) >*/
+ a1 = c__ * h__[istart + (h_dim1 << 1)] + s * h__[istart + 1 +
+ h_dim1];
+/*< a2 = c*h(istart+1,1) + s*h(istart+1,2) >*/
+ a2 = c__ * h__[istart + 1 + h_dim1] + s * h__[istart + 1 + (
+ h_dim1 << 1)];
+/*< a4 = c*h(istart+1,2) - s*h(istart+1,1) >*/
+ a4 = c__ * h__[istart + 1 + (h_dim1 << 1)] - s * h__[istart + 1 +
+ h_dim1];
+/*< a3 = c*h(istart+1,1) - s*h(istart,2) >*/
+ a3 = c__ * h__[istart + 1 + h_dim1] - s * h__[istart + (h_dim1 <<
+ 1)];
+/*< h(istart,2) = c*a1 + s*a2 >*/
+ h__[istart + (h_dim1 << 1)] = c__ * a1 + s * a2;
+/*< h(istart+1,2) = c*a4 - s*a3 >*/
+ h__[istart + 1 + (h_dim1 << 1)] = c__ * a4 - s * a3;
+/*< h(istart+1,1) = c*a3 + s*a4 >*/
+ h__[istart + 1 + h_dim1] = c__ * a3 + s * a4;
+
+/* %----------------------------------------------------% */
+/* | Accumulate the rotation in the matrix Q; Q <- Q*G | */
+/* %----------------------------------------------------% */
+
+/*< do 60 j = 1, min(istart+jj,kplusp) >*/
+/* Computing MIN */
+ i__3 = istart + jj;
+ i__2 = min(i__3,kplusp);
+ for (j = 1; j <= i__2; ++j) {
+/*< a1 = c*q(j,istart) + s*q(j,istart+1) >*/
+ a1 = c__ * q[j + istart * q_dim1] + s * q[j + (istart + 1) *
+ q_dim1];
+/*< q(j,istart+1) = - s*q(j,istart) + c*q(j,istart+1) >*/
+ q[j + (istart + 1) * q_dim1] = -s * q[j + istart * q_dim1] +
+ c__ * q[j + (istart + 1) * q_dim1];
+/*< q(j,istart) = a1 >*/
+ q[j + istart * q_dim1] = a1;
+/*< 60 continue >*/
+/* L60: */
+ }
+
+
+/* %----------------------------------------------% */
+/* | The following loop chases the bulge created. | */
+/* | Note that the previous rotation may also be | */
+/* | done within the following loop. But it is | */
+/* | kept separate to make the distinction among | */
+/* | the bulge chasing sweeps and the first plane | */
+/* | rotation designed to drive h(istart+1,1) to | */
+/* | zero. | */
+/* %----------------------------------------------% */
+
+/*< do 70 i = istart+1, iend-1 >*/
+ i__2 = iend - 1;
+ for (i__ = istart + 1; i__ <= i__2; ++i__) {
+
+/* %----------------------------------------------% */
+/* | Construct the plane rotation G'(i,i+1,theta) | */
+/* | that zeros the i-th bulge that was created | */
+/* | by G(i-1,i,theta). g represents the bulge. | */
+/* %----------------------------------------------% */
+
+/*< f = h(i,1) >*/
+ f = h__[i__ + h_dim1];
+/*< g = s*h(i+1,1) >*/
+ g = s * h__[i__ + 1 + h_dim1];
+
+/* %----------------------------------% */
+/* | Final update with G(i-1,i,theta) | */
+/* %----------------------------------% */
+
+/*< h(i+1,1) = c*h(i+1,1) >*/
+ h__[i__ + 1 + h_dim1] = c__ * h__[i__ + 1 + h_dim1];
+/*< call dlartg (f, g, c, s, r) >*/
+ dlartg_(&f, &g, &c__, &s, &r__);
+
+/* %-------------------------------------------% */
+/* | The following ensures that h(1:iend-1,1), | */
+/* | the first iend-2 off diagonal of elements | */
+/* | H, remain non negative. | */
+/* %-------------------------------------------% */
+
+/*< if (r .lt. zero) then >*/
+ if (r__ < 0.) {
+/*< r = -r >*/
+ r__ = -r__;
+/*< c = -c >*/
+ c__ = -c__;
+/*< s = -s >*/
+ s = -s;
+/*< end if >*/
+ }
+
+/* %--------------------------------------------% */
+/* | Apply rotation to the left and right of H; | */
+/* | H <- G * H * G', where G = G(i,i+1,theta) | */
+/* %--------------------------------------------% */
+
+/*< h(i,1) = r >*/
+ h__[i__ + h_dim1] = r__;
+
+/*< a1 = c*h(i,2) + s*h(i+1,1) >*/
+ a1 = c__ * h__[i__ + (h_dim1 << 1)] + s * h__[i__ + 1 +
+ h_dim1];
+/*< a2 = c*h(i+1,1) + s*h(i+1,2) >*/
+ a2 = c__ * h__[i__ + 1 + h_dim1] + s * h__[i__ + 1 + (h_dim1
+ << 1)];
+/*< a3 = c*h(i+1,1) - s*h(i,2) >*/
+ a3 = c__ * h__[i__ + 1 + h_dim1] - s * h__[i__ + (h_dim1 << 1)
+ ];
+/*< a4 = c*h(i+1,2) - s*h(i+1,1) >*/
+ a4 = c__ * h__[i__ + 1 + (h_dim1 << 1)] - s * h__[i__ + 1 +
+ h_dim1];
+
+/*< h(i,2) = c*a1 + s*a2 >*/
+ h__[i__ + (h_dim1 << 1)] = c__ * a1 + s * a2;
+/*< h(i+1,2) = c*a4 - s*a3 >*/
+ h__[i__ + 1 + (h_dim1 << 1)] = c__ * a4 - s * a3;
+/*< h(i+1,1) = c*a3 + s*a4 >*/
+ h__[i__ + 1 + h_dim1] = c__ * a3 + s * a4;
+
+/* %----------------------------------------------------% */
+/* | Accumulate the rotation in the matrix Q; Q <- Q*G | */
+/* %----------------------------------------------------% */
+
+/*< do 50 j = 1, min( j+jj, kplusp ) >*/
+/* Computing MIN */
+ i__4 = j + jj;
+ i__3 = min(i__4,kplusp);
+ for (j = 1; j <= i__3; ++j) {
+/*< a1 = c*q(j,i) + s*q(j,i+1) >*/
+ a1 = c__ * q[j + i__ * q_dim1] + s * q[j + (i__ + 1) *
+ q_dim1];
+/*< q(j,i+1) = - s*q(j,i) + c*q(j,i+1) >*/
+ q[j + (i__ + 1) * q_dim1] = -s * q[j + i__ * q_dim1] +
+ c__ * q[j + (i__ + 1) * q_dim1];
+/*< q(j,i) = a1 >*/
+ q[j + i__ * q_dim1] = a1;
+/*< 50 continue >*/
+/* L50: */
+ }
+
+/*< 70 continue >*/
+/* L70: */
+ }
+
+/*< end if >*/
+ }
+
+/* %--------------------------% */
+/* | Update the block pointer | */
+/* %--------------------------% */
+
+/*< istart = iend + 1 >*/
+ istart = iend + 1;
+
+/* %------------------------------------------% */
+/* | Make sure that h(iend,1) is non-negative | */
+/* | If not then set h(iend,1) <-- -h(iend,1) | */
+/* | and negate the last column of Q. | */
+/* | We have effectively carried out a | */
+/* | similarity on transformation H | */
+/* %------------------------------------------% */
+
+/*< if (h(iend,1) .lt. zero) then >*/
+ if (h__[iend + h_dim1] < 0.) {
+/*< h(iend,1) = -h(iend,1) >*/
+ h__[iend + h_dim1] = -h__[iend + h_dim1];
+/*< call dscal(kplusp, -one, q(1,iend), 1) >*/
+ dscal_(&kplusp, &c_b14, &q[iend * q_dim1 + 1], &c__1);
+/*< end if >*/
+ }
+
+/* %--------------------------------------------------------% */
+/* | Apply the same shift to the next block if there is any | */
+/* %--------------------------------------------------------% */
+
+/*< if (iend .lt. kplusp) go to 20 >*/
+ if (iend < kplusp) {
+ goto L20;
+ }
+
+/* %-----------------------------------------------------% */
+/* | Check if we can increase the the start of the block | */
+/* %-----------------------------------------------------% */
+
+/*< do 80 i = itop, kplusp-1 >*/
+ i__2 = kplusp - 1;
+ for (i__ = itop; i__ <= i__2; ++i__) {
+/*< if (h(i+1,1) .gt. zero) go to 90 >*/
+ if (h__[i__ + 1 + h_dim1] > 0.) {
+ goto L90;
+ }
+/*< itop = itop + 1 >*/
+ ++itop;
+/*< 80 continue >*/
+/* L80: */
+ }
+
+/* %-----------------------------------% */
+/* | Finished applying the jj-th shift | */
+/* %-----------------------------------% */
+
+/*< 90 continue >*/
+L90:
+ ;
+ }
+
+/* %------------------------------------------% */
+/* | All shifts have been applied. Check for | */
+/* | more possible deflation that might occur | */
+/* | after the last shift is applied. | */
+/* %------------------------------------------% */
+
+/*< do 100 i = itop, kplusp-1 >*/
+ i__1 = kplusp - 1;
+ for (i__ = itop; i__ <= i__1; ++i__) {
+/*< big = abs(h(i,2)) + abs(h(i+1,2)) >*/
+ big = (d__1 = h__[i__ + (h_dim1 << 1)], abs(d__1)) + (d__2 = h__[i__
+ + 1 + (h_dim1 << 1)], abs(d__2));
+/*< if (h(i+1,1) .le. epsmch*big) then >*/
+ if (h__[i__ + 1 + h_dim1] <= epsmch * big) {
+/* if (msglvl .gt. 0) then */
+/* call ivout (logfil, 1, i, ndigit, */
+/* & '_sapps: deflation at row/column no.') */
+/* call dvout (logfil, 1, h(i+1,1), ndigit, */
+/* & '_sapps: the corresponding off diagonal element') */
+/* end if */
+/*< h(i+1,1) = zero >*/
+ h__[i__ + 1 + h_dim1] = 0.;
+/*< end if >*/
+ }
+/*< 100 continue >*/
+/* L100: */
+ }
+
+/* %-------------------------------------------------% */
+/* | Compute the (kev+1)-st column of (V*Q) and | */
+/* | temporarily store the result in WORKD(N+1:2*N). | */
+/* | This is not necessary if h(kev+1,1) = 0. | */
+/* %-------------------------------------------------% */
+
+/*< >*/
+ if (h__[*kev + 1 + h_dim1] > 0.) {
+ dgemv_("N", n, &kplusp, &c_b5, &v[v_offset], ldv, &q[(*kev + 1) *
+ q_dim1 + 1], &c__1, &c_b4, &workd[*n + 1], &c__1, (ftnlen)1);
+ }
+
+/* %-------------------------------------------------------% */
+/* | Compute column 1 to kev of (V*Q) in backward order | */
+/* | taking advantage that Q is an upper triangular matrix | */
+/* | with lower bandwidth np. | */
+/* | Place results in v(:,kplusp-kev:kplusp) temporarily. | */
+/* %-------------------------------------------------------% */
+
+/*< do 130 i = 1, kev >*/
+ i__1 = *kev;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< >*/
+ i__2 = kplusp - i__ + 1;
+ dgemv_("N", n, &i__2, &c_b5, &v[v_offset], ldv, &q[(*kev - i__ + 1) *
+ q_dim1 + 1], &c__1, &c_b4, &workd[1], &c__1, (ftnlen)1);
+/*< call dcopy (n, workd, 1, v(1,kplusp-i+1), 1) >*/
+ dcopy_(n, &workd[1], &c__1, &v[(kplusp - i__ + 1) * v_dim1 + 1], &
+ c__1);
+/*< 130 continue >*/
+/* L130: */
+ }
+
+/* %-------------------------------------------------% */
+/* | Move v(:,kplusp-kev+1:kplusp) into v(:,1:kev). | */
+/* %-------------------------------------------------% */
+
+/*< call dlacpy ('All', n, kev, v(1,np+1), ldv, v, ldv) >*/
+ dlacpy_("All", n, kev, &v[(*np + 1) * v_dim1 + 1], ldv, &v[v_offset], ldv,
+ (ftnlen)3);
+
+/* %--------------------------------------------% */
+/* | Copy the (kev+1)-st column of (V*Q) in the | */
+/* | appropriate place if h(kev+1,1) .ne. zero. | */
+/* %--------------------------------------------% */
+
+/*< >*/
+ if (h__[*kev + 1 + h_dim1] > 0.) {
+ dcopy_(n, &workd[*n + 1], &c__1, &v[(*kev + 1) * v_dim1 + 1], &c__1);
+ }
+
+/* %-------------------------------------% */
+/* | Update the residual vector: | */
+/* | r <- sigmak*r + betak*v(:,kev+1) | */
+/* | where | */
+/* | sigmak = (e_{kev+p}'*Q)*e_{kev} | */
+/* | betak = e_{kev+1}'*H*e_{kev} | */
+/* %-------------------------------------% */
+
+/*< call dscal (n, q(kplusp,kev), resid, 1) >*/
+ dscal_(n, &q[kplusp + *kev * q_dim1], &resid[1], &c__1);
+/*< >*/
+ if (h__[*kev + 1 + h_dim1] > 0.) {
+ daxpy_(n, &h__[*kev + 1 + h_dim1], &v[(*kev + 1) * v_dim1 + 1], &c__1,
+ &resid[1], &c__1);
+ }
+
+/* if (msglvl .gt. 1) then */
+/* call dvout (logfil, 1, q(kplusp,kev), ndigit, */
+/* & '_sapps: sigmak of the updated residual vector') */
+/* call dvout (logfil, 1, h(kev+1,1), ndigit, */
+/* & '_sapps: betak of the updated residual vector') */
+/* call dvout (logfil, kev, h(1,2), ndigit, */
+/* & '_sapps: updated main diagonal of H for next iteration') */
+/* if (kev .gt. 1) then */
+/* call dvout (logfil, kev-1, h(2,1), ndigit, */
+/* & '_sapps: updated sub diagonal of H for next iteration') */
+/* end if */
+/* end if */
+
+/*< call second (t1) >*/
+/* second_(&t1); */
+/*< tsapps = tsapps + (t1 - t0) >*/
+/* timing_1.tsapps += t1 - t0; */
+
+/*< 9000 continue >*/
+L9000:
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dsapps | */
+/* %---------------% */
+
+/*< end >*/
+} /* dsapps_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.f
new file mode 100644
index 0000000000000000000000000000000000000000..eb43137c04d0d238b627c76676bac762d6312233
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.f
@@ -0,0 +1,514 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dsapps
+c
+c\Description:
+c Given the Arnoldi factorization
+c
+c A*V_{k} - V_{k}*H_{k} = r_{k+p}*e_{k+p}^T,
+c
+c apply NP shifts implicitly resulting in
+c
+c A*(V_{k}*Q) - (V_{k}*Q)*(Q^T* H_{k}*Q) = r_{k+p}*e_{k+p}^T * Q
+c
+c where Q is an orthogonal matrix of order KEV+NP. Q is the product of
+c rotations resulting from the NP bulge chasing sweeps. The updated Arnoldi
+c factorization becomes:
+c
+c A*VNEW_{k} - VNEW_{k}*HNEW_{k} = rnew_{k}*e_{k}^T.
+c
+c\Usage:
+c call dsapps
+c ( N, KEV, NP, SHIFT, V, LDV, H, LDH, RESID, Q, LDQ, WORKD )
+c
+c\Arguments
+c N Integer. (INPUT)
+c Problem size, i.e. dimension of matrix A.
+c
+c KEV Integer. (INPUT)
+c INPUT: KEV+NP is the size of the input matrix H.
+c OUTPUT: KEV is the size of the updated matrix HNEW.
+c
+c NP Integer. (INPUT)
+c Number of implicit shifts to be applied.
+c
+c SHIFT Double precision array of length NP. (INPUT)
+c The shifts to be applied.
+c
+c V Double precision N by (KEV+NP) array. (INPUT/OUTPUT)
+c INPUT: V contains the current KEV+NP Arnoldi vectors.
+c OUTPUT: VNEW = V(1:n,1:KEV); the updated Arnoldi vectors
+c are in the first KEV columns of V.
+c
+c LDV Integer. (INPUT)
+c Leading dimension of V exactly as declared in the calling
+c program.
+c
+c H Double precision (KEV+NP) by 2 array. (INPUT/OUTPUT)
+c INPUT: H contains the symmetric tridiagonal matrix of the
+c Arnoldi factorization with the subdiagonal in the 1st column
+c starting at H(2,1) and the main diagonal in the 2nd column.
+c OUTPUT: H contains the updated tridiagonal matrix in the
+c KEV leading submatrix.
+c
+c LDH Integer. (INPUT)
+c Leading dimension of H exactly as declared in the calling
+c program.
+c
+c RESID Double precision array of length (N). (INPUT/OUTPUT)
+c INPUT: RESID contains the the residual vector r_{k+p}.
+c OUTPUT: RESID is the updated residual vector rnew_{k}.
+c
+c Q Double precision KEV+NP by KEV+NP work array. (WORKSPACE)
+c Work array used to accumulate the rotations during the bulge
+c chase sweep.
+c
+c LDQ Integer. (INPUT)
+c Leading dimension of Q exactly as declared in the calling
+c program.
+c
+c WORKD Double precision work array of length 2*N. (WORKSPACE)
+c Distributed array used in the application of the accumulated
+c orthogonal matrix Q.
+c
+c\EndDoc
+c
+c-----------------------------------------------------------------------
+c
+c\BeginLib
+c
+c\Local variables:
+c xxxxxx real
+c
+c\References:
+c 1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
+c a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
+c pp 357-385.
+c 2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly
+c Restarted Arnoldi Iteration", Rice University Technical Report
+c TR95-13, Department of Computational and Applied Mathematics.
+c
+c\Routines called:
+c second ARPACK utility routine for timing.
+c dlamch LAPACK routine that determines machine constants.
+c dlartg LAPACK Givens rotation construction routine.
+c dlacpy LAPACK matrix copy routine.
+c dlaset LAPACK matrix initialization routine.
+c dgemv Level 2 BLAS routine for matrix vector multiplication.
+c daxpy Level 1 BLAS that computes a vector triad.
+c dcopy Level 1 BLAS that copies one vector to another.
+c dscal Level 1 BLAS that scales a vector.
+c
+c\Author
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\Revision history:
+c 12/16/93: Version ' 2.1'
+c
+c\SCCS Information: @(#)
+c FILE: sapps.F SID: 2.5 DATE OF SID: 4/19/96 RELEASE: 2
+c
+c\Remarks
+c 1. In this version, each shift is applied to all the subblocks of
+c the tridiagonal matrix H and not just to the submatrix that it
+c comes from. This routine assumes that the subdiagonal elements
+c of H that are stored in h(1:kev+np,1) are nonegative upon input
+c and enforce this condition upon output. This version incorporates
+c deflation. See code for documentation.
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dsapps
+ & ( n, kev, np, shift, v, ldv, h, ldh, resid, q, ldq, workd )
+c
+c %----------------------------------------------------%
+c | Include files for debugging and timing information |
+c %----------------------------------------------------%
+c
+ include 'debug.h'
+ include 'stat.h'
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ integer kev, ldh, ldq, ldv, n, np
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ Double precision
+ & h(ldh,2), q(ldq,kev+np), resid(n), shift(np),
+ & v(ldv,kev+np), workd(2*n)
+c
+c %------------%
+c | Parameters |
+c %------------%
+c
+ Double precision
+ & one, zero
+ parameter (one = 1.0D+0, zero = 0.0D+0)
+c
+c %---------------%
+c | Local Scalars |
+c %---------------%
+c
+ integer i, iend, istart, itop, j, jj, kplusp, msglvl
+ logical first
+ Double precision
+ & a1, a2, a3, a4, big, c, epsmch, f, g, r, s
+ save epsmch, first
+c
+c
+c %----------------------%
+c | External Subroutines |
+c %----------------------%
+c
+ external daxpy, dcopy, dscal, dlacpy, dlartg, dlaset,
+ & second, dgemv
+c
+c %--------------------%
+c | External Functions |
+c %--------------------%
+c
+ Double precision
+ & dlamch
+ external dlamch
+c
+c %----------------------%
+c | Intrinsics Functions |
+c %----------------------%
+c
+ intrinsic abs
+c
+c %----------------%
+c | Data statments |
+c %----------------%
+c
+ data first / .true. /
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+ if (first) then
+ epsmch = dlamch('Epsilon-Machine')
+ first = .false.
+ end if
+ itop = 1
+c
+c %-------------------------------%
+c | Initialize timing statistics |
+c | & message level for debugging |
+c %-------------------------------%
+c
+ call second (t0)
+ msglvl = msapps
+c
+ kplusp = kev + np
+c
+c %----------------------------------------------%
+c | Initialize Q to the identity matrix of order |
+c | kplusp used to accumulate the rotations. |
+c %----------------------------------------------%
+c
+ call dlaset ('All', kplusp, kplusp, zero, one, q, ldq)
+c
+c %----------------------------------------------%
+c | Quick return if there are no shifts to apply |
+c %----------------------------------------------%
+c
+ if (np .eq. 0) go to 9000
+c
+c %----------------------------------------------------------%
+c | Apply the np shifts implicitly. Apply each shift to the |
+c | whole matrix and not just to the submatrix from which it |
+c | comes. |
+c %----------------------------------------------------------%
+c
+ do 90 jj = 1, np
+c
+ istart = itop
+c
+c %----------------------------------------------------------%
+c | Check for splitting and deflation. Currently we consider |
+c | an off-diagonal element h(i+1,1) negligible if |
+c | h(i+1,1) .le. epsmch*( |h(i,2)| + |h(i+1,2)| ) |
+c | for i=1:KEV+NP-1. |
+c | If above condition tests true then we set h(i+1,1) = 0. |
+c | Note that h(1:KEV+NP,1) are assumed to be non negative. |
+c %----------------------------------------------------------%
+c
+ 20 continue
+c
+c %------------------------------------------------%
+c | The following loop exits early if we encounter |
+c | a negligible off diagonal element. |
+c %------------------------------------------------%
+c
+ do 30 i = istart, kplusp-1
+ big = abs(h(i,2)) + abs(h(i+1,2))
+ if (h(i+1,1) .le. epsmch*big) then
+c if (msglvl .gt. 0) then
+c call ivout (logfil, 1, i, ndigit,
+c & '_sapps: deflation at row/column no.')
+c call ivout (logfil, 1, jj, ndigit,
+c & '_sapps: occurred before shift number.')
+c call dvout (logfil, 1, h(i+1,1), ndigit,
+c & '_sapps: the corresponding off diagonal element')
+c end if
+ h(i+1,1) = zero
+ iend = i
+ go to 40
+ end if
+ 30 continue
+ iend = kplusp
+ 40 continue
+c
+ if (istart .lt. iend) then
+c
+c %--------------------------------------------------------%
+c | Construct the plane rotation G'(istart,istart+1,theta) |
+c | that attempts to drive h(istart+1,1) to zero. |
+c %--------------------------------------------------------%
+c
+ f = h(istart,2) - shift(jj)
+ g = h(istart+1,1)
+ call dlartg (f, g, c, s, r)
+c
+c %-------------------------------------------------------%
+c | Apply rotation to the left and right of H; |
+c | H <- G' * H * G, where G = G(istart,istart+1,theta). |
+c | This will create a "bulge". |
+c %-------------------------------------------------------%
+c
+ a1 = c*h(istart,2) + s*h(istart+1,1)
+ a2 = c*h(istart+1,1) + s*h(istart+1,2)
+ a4 = c*h(istart+1,2) - s*h(istart+1,1)
+ a3 = c*h(istart+1,1) - s*h(istart,2)
+ h(istart,2) = c*a1 + s*a2
+ h(istart+1,2) = c*a4 - s*a3
+ h(istart+1,1) = c*a3 + s*a4
+c
+c %----------------------------------------------------%
+c | Accumulate the rotation in the matrix Q; Q <- Q*G |
+c %----------------------------------------------------%
+c
+ do 60 j = 1, min(istart+jj,kplusp)
+ a1 = c*q(j,istart) + s*q(j,istart+1)
+ q(j,istart+1) = - s*q(j,istart) + c*q(j,istart+1)
+ q(j,istart) = a1
+ 60 continue
+c
+c
+c %----------------------------------------------%
+c | The following loop chases the bulge created. |
+c | Note that the previous rotation may also be |
+c | done within the following loop. But it is |
+c | kept separate to make the distinction among |
+c | the bulge chasing sweeps and the first plane |
+c | rotation designed to drive h(istart+1,1) to |
+c | zero. |
+c %----------------------------------------------%
+c
+ do 70 i = istart+1, iend-1
+c
+c %----------------------------------------------%
+c | Construct the plane rotation G'(i,i+1,theta) |
+c | that zeros the i-th bulge that was created |
+c | by G(i-1,i,theta). g represents the bulge. |
+c %----------------------------------------------%
+c
+ f = h(i,1)
+ g = s*h(i+1,1)
+c
+c %----------------------------------%
+c | Final update with G(i-1,i,theta) |
+c %----------------------------------%
+c
+ h(i+1,1) = c*h(i+1,1)
+ call dlartg (f, g, c, s, r)
+c
+c %-------------------------------------------%
+c | The following ensures that h(1:iend-1,1), |
+c | the first iend-2 off diagonal of elements |
+c | H, remain non negative. |
+c %-------------------------------------------%
+c
+ if (r .lt. zero) then
+ r = -r
+ c = -c
+ s = -s
+ end if
+c
+c %--------------------------------------------%
+c | Apply rotation to the left and right of H; |
+c | H <- G * H * G', where G = G(i,i+1,theta) |
+c %--------------------------------------------%
+c
+ h(i,1) = r
+c
+ a1 = c*h(i,2) + s*h(i+1,1)
+ a2 = c*h(i+1,1) + s*h(i+1,2)
+ a3 = c*h(i+1,1) - s*h(i,2)
+ a4 = c*h(i+1,2) - s*h(i+1,1)
+c
+ h(i,2) = c*a1 + s*a2
+ h(i+1,2) = c*a4 - s*a3
+ h(i+1,1) = c*a3 + s*a4
+c
+c %----------------------------------------------------%
+c | Accumulate the rotation in the matrix Q; Q <- Q*G |
+c %----------------------------------------------------%
+c
+ do 50 j = 1, min( j+jj, kplusp )
+ a1 = c*q(j,i) + s*q(j,i+1)
+ q(j,i+1) = - s*q(j,i) + c*q(j,i+1)
+ q(j,i) = a1
+ 50 continue
+c
+ 70 continue
+c
+ end if
+c
+c %--------------------------%
+c | Update the block pointer |
+c %--------------------------%
+c
+ istart = iend + 1
+c
+c %------------------------------------------%
+c | Make sure that h(iend,1) is non-negative |
+c | If not then set h(iend,1) <-- -h(iend,1) |
+c | and negate the last column of Q. |
+c | We have effectively carried out a |
+c | similarity on transformation H |
+c %------------------------------------------%
+c
+ if (h(iend,1) .lt. zero) then
+ h(iend,1) = -h(iend,1)
+ call dscal(kplusp, -one, q(1,iend), 1)
+ end if
+c
+c %--------------------------------------------------------%
+c | Apply the same shift to the next block if there is any |
+c %--------------------------------------------------------%
+c
+ if (iend .lt. kplusp) go to 20
+c
+c %-----------------------------------------------------%
+c | Check if we can increase the the start of the block |
+c %-----------------------------------------------------%
+c
+ do 80 i = itop, kplusp-1
+ if (h(i+1,1) .gt. zero) go to 90
+ itop = itop + 1
+ 80 continue
+c
+c %-----------------------------------%
+c | Finished applying the jj-th shift |
+c %-----------------------------------%
+c
+ 90 continue
+c
+c %------------------------------------------%
+c | All shifts have been applied. Check for |
+c | more possible deflation that might occur |
+c | after the last shift is applied. |
+c %------------------------------------------%
+c
+ do 100 i = itop, kplusp-1
+ big = abs(h(i,2)) + abs(h(i+1,2))
+ if (h(i+1,1) .le. epsmch*big) then
+c if (msglvl .gt. 0) then
+c call ivout (logfil, 1, i, ndigit,
+c & '_sapps: deflation at row/column no.')
+c call dvout (logfil, 1, h(i+1,1), ndigit,
+c & '_sapps: the corresponding off diagonal element')
+c end if
+ h(i+1,1) = zero
+ end if
+ 100 continue
+c
+c %-------------------------------------------------%
+c | Compute the (kev+1)-st column of (V*Q) and |
+c | temporarily store the result in WORKD(N+1:2*N). |
+c | This is not necessary if h(kev+1,1) = 0. |
+c %-------------------------------------------------%
+c
+ if ( h(kev+1,1) .gt. zero )
+ & call dgemv ('N', n, kplusp, one, v, ldv,
+ & q(1,kev+1), 1, zero, workd(n+1), 1)
+c
+c %-------------------------------------------------------%
+c | Compute column 1 to kev of (V*Q) in backward order |
+c | taking advantage that Q is an upper triangular matrix |
+c | with lower bandwidth np. |
+c | Place results in v(:,kplusp-kev:kplusp) temporarily. |
+c %-------------------------------------------------------%
+c
+ do 130 i = 1, kev
+ call dgemv ('N', n, kplusp-i+1, one, v, ldv,
+ & q(1,kev-i+1), 1, zero, workd, 1)
+ call dcopy (n, workd, 1, v(1,kplusp-i+1), 1)
+ 130 continue
+c
+c %-------------------------------------------------%
+c | Move v(:,kplusp-kev+1:kplusp) into v(:,1:kev). |
+c %-------------------------------------------------%
+c
+ call dlacpy ('All', n, kev, v(1,np+1), ldv, v, ldv)
+c
+c %--------------------------------------------%
+c | Copy the (kev+1)-st column of (V*Q) in the |
+c | appropriate place if h(kev+1,1) .ne. zero. |
+c %--------------------------------------------%
+c
+ if ( h(kev+1,1) .gt. zero )
+ & call dcopy (n, workd(n+1), 1, v(1,kev+1), 1)
+c
+c %-------------------------------------%
+c | Update the residual vector: |
+c | r <- sigmak*r + betak*v(:,kev+1) |
+c | where |
+c | sigmak = (e_{kev+p}'*Q)*e_{kev} |
+c | betak = e_{kev+1}'*H*e_{kev} |
+c %-------------------------------------%
+c
+ call dscal (n, q(kplusp,kev), resid, 1)
+ if (h(kev+1,1) .gt. zero)
+ & call daxpy (n, h(kev+1,1), v(1,kev+1), 1, resid, 1)
+c
+c if (msglvl .gt. 1) then
+c call dvout (logfil, 1, q(kplusp,kev), ndigit,
+c & '_sapps: sigmak of the updated residual vector')
+c call dvout (logfil, 1, h(kev+1,1), ndigit,
+c & '_sapps: betak of the updated residual vector')
+c call dvout (logfil, kev, h(1,2), ndigit,
+c & '_sapps: updated main diagonal of H for next iteration')
+c if (kev .gt. 1) then
+c call dvout (logfil, kev-1, h(2,1), ndigit,
+c & '_sapps: updated sub diagonal of H for next iteration')
+c end if
+c end if
+c
+ call second (t1)
+ tsapps = tsapps + (t1 - t0)
+c
+ 9000 continue
+ return
+c
+c %---------------%
+c | End of dsapps |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.h
new file mode 100644
index 0000000000000000000000000000000000000000..4a38397759a7c78f4d34967e3181cce89569805e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsapps.h
@@ -0,0 +1,14 @@
+extern int v3p_netlib_dsapps_(
+ v3p_netlib_integer *n,
+ v3p_netlib_integer *kev,
+ v3p_netlib_integer *np,
+ v3p_netlib_doublereal *shift,
+ v3p_netlib_doublereal *v,
+ v3p_netlib_integer *ldv,
+ v3p_netlib_doublereal *h__,
+ v3p_netlib_integer *ldh,
+ v3p_netlib_doublereal *resid,
+ v3p_netlib_doublereal *q,
+ v3p_netlib_integer *ldq,
+ v3p_netlib_doublereal *workd
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.P
new file mode 100644
index 0000000000000000000000000000000000000000..4afd6b1564664762c4278b42ecddd2b0057b580f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.P
@@ -0,0 +1,16 @@
+extern int dsaup2_(integer *ido, char *bmat, integer *n, char *which, integer *nev, integer *np, doublereal *tol, doublereal *resid, integer *mode, integer *iupd, integer *ishift, integer *mxiter, doublereal *v, integer *ldv, doublereal *h__, integer *ldh, doublereal *ritz, doublereal *bounds, doublereal *q, integer *ldq, doublereal *workl, integer *ipntr, doublereal *workd, integer *info, ftnlen bmat_len, ftnlen which_len);
+/* comlen debug_ 96 */
+/* comlen timing_ 124 */
+/*:ref: second_ 14 1 6 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dgetv0_ 14 14 4 13 4 12 4 4 7 4 7 7 4 7 4 124 */
+/*:ref: dsaitr_ 14 16 4 13 4 4 4 4 7 7 7 4 7 4 4 7 4 124 */
+/*:ref: dseigt_ 14 8 7 4 7 4 7 7 7 4 */
+/*:ref: dcopy_ 14 5 4 7 4 7 4 */
+/*:ref: dsgets_ 14 8 4 13 4 4 7 7 7 124 */
+/*:ref: dsconv_ 14 5 4 7 7 7 4 */
+/*:ref: dsortr_ 14 6 13 12 4 7 7 124 */
+/*:ref: dswap_ 14 5 4 7 4 7 4 */
+/*:ref: dsapps_ 14 12 4 4 4 7 7 4 7 4 7 7 4 7 */
+/*:ref: ddot_ 7 5 4 7 4 7 4 */
+/*:ref: dnrm2_ 7 3 4 7 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.c
new file mode 100644
index 0000000000000000000000000000000000000000..dcfabefc2e4ab8a76c7fc6984d68045655973980
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.c
@@ -0,0 +1,1210 @@
+/* arpack/dsaup2.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Common Block Declarations */
+
+/*Extern struct { */
+/* integer logfil, ndigit, mgetv0, msaupd, msaup2, msaitr, mseigt, msapps, */
+/* msgets, mseupd, mnaupd, mnaup2, mnaitr, mneigh, mnapps, mngets, */
+/* mneupd, mcaupd, mcaup2, mcaitr, mceigh, mcapps, mcgets, mceupd; */
+/*} debug_; */
+
+/*#define debug_1 debug_ */
+
+/*Extern struct { */
+/* integer nopx, nbx, nrorth, nitref, nrstrt; */
+/* real tsaupd, tsaup2, tsaitr, tseigt, tsgets, tsapps, tsconv, tnaupd, */
+/* tnaup2, tnaitr, tneigh, tngets, tnapps, tnconv, tcaupd, tcaup2, */
+/* tcaitr, tceigh, tcgets, tcapps, tcconv, tmvopx, tmvbx, tgetv0, */
+/* titref, trvec; */
+/*} timing_; */
+
+/*#define timing_1 timing_ */
+
+/* Table of constant values */
+
+static doublereal c_b3 = .66666666666666663;
+static integer c__1 = 1;
+static integer c__0 = 0;
+static logical c_true = TRUE_;
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dsaup2 */
+
+/* \Description: */
+/* Intermediate level interface called by dsaupd. */
+
+/* \Usage: */
+/* call dsaup2 */
+/* ( IDO, BMAT, N, WHICH, NEV, NP, TOL, RESID, MODE, IUPD, */
+/* ISHIFT, MXITER, V, LDV, H, LDH, RITZ, BOUNDS, Q, LDQ, WORKL, */
+/* IPNTR, WORKD, INFO ) */
+
+/* \Arguments */
+
+/* IDO, BMAT, N, WHICH, NEV, TOL, RESID: same as defined in dsaupd. */
+/* MODE, ISHIFT, MXITER: see the definition of IPARAM in dsaupd. */
+
+/* NP Integer. (INPUT/OUTPUT) */
+/* Contains the number of implicit shifts to apply during */
+/* each Arnoldi/Lanczos iteration. */
+/* If ISHIFT=1, NP is adjusted dynamically at each iteration */
+/* to accelerate convergence and prevent stagnation. */
+/* This is also roughly equal to the number of matrix-vector */
+/* products (involving the operator OP) per Arnoldi iteration. */
+/* The logic for adjusting is contained within the current */
+/* subroutine. */
+/* If ISHIFT=0, NP is the number of shifts the user needs */
+/* to provide via reverse comunication. 0 < NP < NCV-NEV. */
+/* NP may be less than NCV-NEV since a leading block of the current */
+/* upper Tridiagonal matrix has split off and contains "unwanted" */
+/* Ritz values. */
+/* Upon termination of the IRA iteration, NP contains the number */
+/* of "converged" wanted Ritz values. */
+
+/* IUPD Integer. (INPUT) */
+/* IUPD .EQ. 0: use explicit restart instead implicit update. */
+/* IUPD .NE. 0: use implicit update. */
+
+/* V Double precision N by (NEV+NP) array. (INPUT/OUTPUT) */
+/* The Lanczos basis vectors. */
+
+/* LDV Integer. (INPUT) */
+/* Leading dimension of V exactly as declared in the calling */
+/* program. */
+
+/* H Double precision (NEV+NP) by 2 array. (OUTPUT) */
+/* H is used to store the generated symmetric tridiagonal matrix */
+/* The subdiagonal is stored in the first column of H starting */
+/* at H(2,1). The main diagonal is stored in the second column */
+/* of H starting at H(1,2). If dsaup2 converges store the */
+/* B-norm of the final residual vector in H(1,1). */
+
+/* LDH Integer. (INPUT) */
+/* Leading dimension of H exactly as declared in the calling */
+/* program. */
+
+/* RITZ Double precision array of length NEV+NP. (OUTPUT) */
+/* RITZ(1:NEV) contains the computed Ritz values of OP. */
+
+/* BOUNDS Double precision array of length NEV+NP. (OUTPUT) */
+/* BOUNDS(1:NEV) contain the error bounds corresponding to RITZ. */
+
+/* Q Double precision (NEV+NP) by (NEV+NP) array. (WORKSPACE) */
+/* Private (replicated) work array used to accumulate the */
+/* rotation in the shift application step. */
+
+/* LDQ Integer. (INPUT) */
+/* Leading dimension of Q exactly as declared in the calling */
+/* program. */
+
+/* WORKL Double precision array of length at least 3*(NEV+NP). (INPUT/WORKSPACE) */
+/* Private (replicated) array on each PE or array allocated on */
+/* the front end. It is used in the computation of the */
+/* tridiagonal eigenvalue problem, the calculation and */
+/* application of the shifts and convergence checking. */
+/* If ISHIFT .EQ. O and IDO .EQ. 3, the first NP locations */
+/* of WORKL are used in reverse communication to hold the user */
+/* supplied shifts. */
+
+/* IPNTR Integer array of length 3. (OUTPUT) */
+/* Pointer to mark the starting locations in the WORKD for */
+/* vectors used by the Lanczos iteration. */
+/* ------------------------------------------------------------- */
+/* IPNTR(1): pointer to the current operand vector X. */
+/* IPNTR(2): pointer to the current result vector Y. */
+/* IPNTR(3): pointer to the vector B * X when used in one of */
+/* the spectral transformation modes. X is the current */
+/* operand. */
+/* ------------------------------------------------------------- */
+
+/* WORKD Double precision work array of length 3*N. (REVERSE COMMUNICATION) */
+/* Distributed array to be used in the basic Lanczos iteration */
+/* for reverse communication. The user should not use WORKD */
+/* as temporary workspace during the iteration !!!!!!!!!! */
+/* See Data Distribution Note in dsaupd. */
+
+/* INFO Integer. (INPUT/OUTPUT) */
+/* If INFO .EQ. 0, a randomly initial residual vector is used. */
+/* If INFO .NE. 0, RESID contains the initial residual vector, */
+/* possibly from a previous run. */
+/* Error flag on output. */
+/* = 0: Normal return. */
+/* = 1: All possible eigenvalues of OP has been found. */
+/* NP returns the size of the invariant subspace */
+/* spanning the operator OP. */
+/* = 2: No shifts could be applied. */
+/* = -8: Error return from trid. eigenvalue calculation; */
+/* This should never happen. */
+/* = -9: Starting vector is zero. */
+/* = -9999: Could not build an Lanczos factorization. */
+/* Size that was built in returned in NP. */
+
+/* \EndDoc */
+
+/* ----------------------------------------------------------------------- */
+
+/* \BeginLib */
+
+/* \References: */
+/* 1. D.C. Sorensen, "Implicit Application of Polynomial Filters in */
+/* a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992), */
+/* pp 357-385. */
+/* 2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly */
+/* Restarted Arnoldi Iteration", Rice University Technical Report */
+/* TR95-13, Department of Computational and Applied Mathematics. */
+/* 3. B.N. Parlett, "The Symmetric Eigenvalue Problem". Prentice-Hall, */
+/* 1980. */
+/* 4. B.N. Parlett, B. Nour-Omid, "Towards a Black Box Lanczos Program", */
+/* Computer Physics Communications, 53 (1989), pp 169-179. */
+/* 5. B. Nour-Omid, B.N. Parlett, T. Ericson, P.S. Jensen, "How to */
+/* Implement the Spectral Transformation", Math. Comp., 48 (1987), */
+/* pp 663-673. */
+/* 6. R.G. Grimes, J.G. Lewis and H.D. Simon, "A Shifted Block Lanczos */
+/* Algorithm for Solving Sparse Symmetric Generalized Eigenproblems", */
+/* SIAM J. Matr. Anal. Apps., January (1993). */
+/* 7. L. Reichel, W.B. Gragg, "Algorithm 686: FORTRAN Subroutines */
+/* for Updating the QR decomposition", ACM TOMS, December 1990, */
+/* Volume 16 Number 4, pp 369-377. */
+
+/* \Routines called: */
+/* dgetv0 ARPACK initial vector generation routine. */
+/* dsaitr ARPACK Lanczos factorization routine. */
+/* dsapps ARPACK application of implicit shifts routine. */
+/* dsconv ARPACK convergence of Ritz values routine. */
+/* dseigt ARPACK compute Ritz values and error bounds routine. */
+/* dsgets ARPACK reorder Ritz values and error bounds routine. */
+/* dsortr ARPACK sorting routine. */
+/* second ARPACK utility routine for timing. */
+/* dlamch LAPACK routine that determines machine constants. */
+/* dcopy Level 1 BLAS that copies one vector to another. */
+/* ddot Level 1 BLAS that computes the scalar product of two vectors. */
+/* dnrm2 Level 1 BLAS that computes the norm of a vector. */
+/* dscal Level 1 BLAS that scales a vector. */
+/* dswap Level 1 BLAS that swaps two vectors. */
+
+/* \Author */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \Revision history: */
+/* 12/15/93: Version ' 2.4' */
+/* xx/xx/95: Version ' 2.4'. (R.B. Lehoucq) */
+
+/* \SCCS Information: @(#) */
+/* FILE: saup2.F SID: 2.6 DATE OF SID: 8/16/96 RELEASE: 2 */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< >*/
+/* Subroutine */ int dsaup2_(integer *ido, char *bmat, integer *n, char *
+ which, integer *nev, integer *np, doublereal *tol, doublereal *resid,
+ integer *mode, integer *iupd, integer *ishift, integer *mxiter,
+ doublereal *v, integer *ldv, doublereal *h__, integer *ldh,
+ doublereal *ritz, doublereal *bounds, doublereal *q, integer *ldq,
+ doublereal *workl, integer *ipntr, doublereal *workd, integer *info,
+ ftnlen bmat_len, ftnlen which_len)
+{
+ /* System generated locals */
+ integer h_dim1, h_offset, q_dim1, q_offset, v_dim1, v_offset, i__1, i__2,
+ i__3;
+ doublereal d__1, d__2, d__3;
+
+ /* Builtin functions */
+ double pow_dd(doublereal *, doublereal *);
+ integer s_cmp(char *, char *, ftnlen, ftnlen);
+ /* Subroutine */ int s_copy(char *, char *, ftnlen, ftnlen);
+ double sqrt(doublereal);
+
+ /* Local variables */
+ integer j;
+/* static real t0, t1, t2, t3; */
+/* integer kp[3]; */
+ static integer np0, nev0;
+ extern doublereal ddot_(integer *, doublereal *, integer *, doublereal *,
+ integer *);
+ static doublereal eps23;
+ integer ierr;
+ static integer iter;
+ doublereal temp;
+ integer nevd2;
+ extern doublereal dnrm2_(integer *, doublereal *, integer *);
+ static logical getv0;
+ integer nevm2;
+ static logical cnorm;
+ extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
+ doublereal *, integer *), dswap_(integer *, doublereal *, integer
+ *, doublereal *, integer *);
+ static integer nconv;
+ static logical initv;
+ static doublereal rnorm;
+ extern /* Subroutine */ int dgetv0_(integer *, char *, integer *, logical
+ *, integer *, integer *, doublereal *, integer *, doublereal *,
+ doublereal *, integer *, doublereal *, integer *, ftnlen);
+ extern doublereal dlamch_(char *, ftnlen);
+ integer nevbef;
+ extern /* Subroutine */ int second_(real *);
+ static logical update;
+ char wprime[2];
+ static logical ushift;
+ static integer kplusp /*, msglvl */;
+ integer nptemp;
+ extern /* Subroutine */ int dsaitr_(integer *, char *, integer *, integer
+ *, integer *, integer *, doublereal *, doublereal *, doublereal *,
+ integer *, doublereal *, integer *, integer *, doublereal *,
+ integer *, ftnlen), dsconv_(integer *, doublereal *, doublereal *,
+ doublereal *, integer *), dseigt_(doublereal *, integer *,
+ doublereal *, integer *, doublereal *, doublereal *, doublereal *,
+ integer *), dsgets_(integer *, char *, integer *, integer *,
+ doublereal *, doublereal *, doublereal *, ftnlen), dsapps_(
+ integer *, integer *, integer *, doublereal *, doublereal *,
+ integer *, doublereal *, integer *, doublereal *, doublereal *,
+ integer *, doublereal *), dsortr_(char *, logical *, integer *,
+ doublereal *, doublereal *, ftnlen);
+
+
+/* %----------------------------------------------------% */
+/* | Include files for debugging and timing information | */
+/* %----------------------------------------------------% */
+
+/*< include 'debug.h' >*/
+/*< include 'stat.h' >*/
+
+/* \SCCS Information: @(#) */
+/* FILE: debug.h SID: 2.3 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/* %---------------------------------% */
+/* | See debug.doc for documentation | */
+/* %---------------------------------% */
+/*< >*/
+/*< character bmat*1, which*2 >*/
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/* %--------------------------------% */
+/* | See stat.doc for documentation | */
+/* %--------------------------------% */
+
+/* \SCCS Information: @(#) */
+/* FILE: stat.h SID: 2.2 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/*< save t0, t1, t2, t3, t4, t5 >*/
+
+/*< integer nopx, nbx, nrorth, nitref, nrstrt >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< integer ipntr(3) >*/
+/*< >*/
+
+/* %------------% */
+/* | Parameters | */
+/* %------------% */
+
+/*< >*/
+/*< parameter (one = 1.0D+0, zero = 0.0D+0) >*/
+
+/* %---------------% */
+/* | Local Scalars | */
+/* %---------------% */
+
+/*< character wprime*2 >*/
+/*< logical cnorm, getv0, initv, update, ushift >*/
+/*< >*/
+/*< >*/
+/*< >*/
+
+/* %----------------------% */
+/* | External Subroutines | */
+/* %----------------------% */
+
+/*< >*/
+
+/* %--------------------% */
+/* | External Functions | */
+/* %--------------------% */
+
+/*< >*/
+/*< external ddot, dnrm2, dlamch >*/
+
+/* %---------------------% */
+/* | Intrinsic Functions | */
+/* %---------------------% */
+
+/*< intrinsic min >*/
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+/*< if (ido .eq. 0) then >*/
+ /* Parameter adjustments */
+ --workd;
+ --resid;
+ --workl;
+ --bounds;
+ --ritz;
+ v_dim1 = *ldv;
+ v_offset = 1 + v_dim1;
+ v -= v_offset;
+ h_dim1 = *ldh;
+ h_offset = 1 + h_dim1;
+ h__ -= h_offset;
+ q_dim1 = *ldq;
+ q_offset = 1 + q_dim1;
+ q -= q_offset;
+ --ipntr;
+
+ /* Function Body */
+ if (*ido == 0) {
+
+/* %-------------------------------% */
+/* | Initialize timing statistics | */
+/* | & message level for debugging | */
+/* %-------------------------------% */
+
+/*< call second (t0) >*/
+/* second_(&t0); */
+/*< msglvl = msaup2 >*/
+/* msglvl = debug_1.msaup2; */
+
+/* %---------------------------------% */
+/* | Set machine dependent constant. | */
+/* %---------------------------------% */
+
+/*< eps23 = dlamch('Epsilon-Machine') >*/
+ eps23 = dlamch_("Epsilon-Machine", (ftnlen)15);
+/*< eps23 = eps23**(2.0D+0/3.0D+0) >*/
+ eps23 = pow_dd(&eps23, &c_b3);
+
+/* %-------------------------------------% */
+/* | nev0 and np0 are integer variables | */
+/* | hold the initial values of NEV & NP | */
+/* %-------------------------------------% */
+
+/*< nev0 = nev >*/
+ nev0 = *nev;
+/*< np0 = np >*/
+ np0 = *np;
+
+/* %-------------------------------------% */
+/* | kplusp is the bound on the largest | */
+/* | Lanczos factorization built. | */
+/* | nconv is the current number of | */
+/* | "converged" eigenvlues. | */
+/* | iter is the counter on the current | */
+/* | iteration step. | */
+/* %-------------------------------------% */
+
+/*< kplusp = nev0 + np0 >*/
+ kplusp = nev0 + np0;
+/*< nconv = 0 >*/
+ nconv = 0;
+/*< iter = 0 >*/
+ iter = 0;
+
+/* %--------------------------------------------% */
+/* | Set flags for computing the first NEV steps | */
+/* | of the Lanczos factorization. | */
+/* %--------------------------------------------% */
+
+/*< getv0 = .true. >*/
+ getv0 = TRUE_;
+/*< update = .false. >*/
+ update = FALSE_;
+/*< ushift = .false. >*/
+ ushift = FALSE_;
+/*< cnorm = .false. >*/
+ cnorm = FALSE_;
+
+/*< if (info .ne. 0) then >*/
+ if (*info != 0) {
+
+/* %--------------------------------------------% */
+/* | User provides the initial residual vector. | */
+/* %--------------------------------------------% */
+
+/*< initv = .true. >*/
+ initv = TRUE_;
+/*< info = 0 >*/
+ *info = 0;
+/*< else >*/
+ } else {
+/*< initv = .false. >*/
+ initv = FALSE_;
+/*< end if >*/
+ }
+/*< end if >*/
+ }
+
+/* %---------------------------------------------% */
+/* | Get a possibly random starting vector and | */
+/* | force it into the range of the operator OP. | */
+/* %---------------------------------------------% */
+
+/*< 10 continue >*/
+/* L10: */
+
+/*< if (getv0) then >*/
+ if (getv0) {
+/*< >*/
+ dgetv0_(ido, bmat, &c__1, &initv, n, &c__1, &v[v_offset], ldv, &resid[
+ 1], &rnorm, &ipntr[1], &workd[1], info, (ftnlen)1);
+
+/*< if (ido .ne. 99) go to 9000 >*/
+ if (*ido != 99) {
+ goto L9000;
+ }
+
+/*< if (rnorm .eq. zero) then >*/
+ if (rnorm == 0.) {
+
+/* %-----------------------------------------% */
+/* | The initial vector is zero. Error exit. | */
+/* %-----------------------------------------% */
+
+/*< info = -9 >*/
+ *info = -9;
+/*< go to 1200 >*/
+ goto L1200;
+/*< end if >*/
+ }
+/*< getv0 = .false. >*/
+ getv0 = FALSE_;
+/*< ido = 0 >*/
+ *ido = 0;
+/*< end if >*/
+ }
+
+/* %------------------------------------------------------------% */
+/* | Back from reverse communication: continue with update step | */
+/* %------------------------------------------------------------% */
+
+/*< if (update) go to 20 >*/
+ if (update) {
+ goto L20;
+ }
+
+/* %-------------------------------------------% */
+/* | Back from computing user specified shifts | */
+/* %-------------------------------------------% */
+
+/*< if (ushift) go to 50 >*/
+ if (ushift) {
+ goto L50;
+ }
+
+/* %-------------------------------------% */
+/* | Back from computing residual norm | */
+/* | at the end of the current iteration | */
+/* %-------------------------------------% */
+
+/*< if (cnorm) go to 100 >*/
+ if (cnorm) {
+ goto L100;
+ }
+
+/* %----------------------------------------------------------% */
+/* | Compute the first NEV steps of the Lanczos factorization | */
+/* %----------------------------------------------------------% */
+
+/*< >*/
+ dsaitr_(ido, bmat, n, &c__0, &nev0, mode, &resid[1], &rnorm, &v[v_offset],
+ ldv, &h__[h_offset], ldh, &ipntr[1], &workd[1], info, (ftnlen)1);
+
+/* %---------------------------------------------------% */
+/* | ido .ne. 99 implies use of reverse communication | */
+/* | to compute operations involving OP and possibly B | */
+/* %---------------------------------------------------% */
+
+/*< if (ido .ne. 99) go to 9000 >*/
+ if (*ido != 99) {
+ goto L9000;
+ }
+
+/*< if (info .gt. 0) then >*/
+ if (*info > 0) {
+
+/* %-----------------------------------------------------% */
+/* | dsaitr was unable to build an Lanczos factorization | */
+/* | of length NEV0. INFO is returned with the size of | */
+/* | the factorization built. Exit main loop. | */
+/* %-----------------------------------------------------% */
+
+/*< np = info >*/
+ *np = *info;
+/*< mxiter = iter >*/
+ *mxiter = iter;
+/*< info = -9999 >*/
+ *info = -9999;
+/*< go to 1200 >*/
+ goto L1200;
+/*< end if >*/
+ }
+
+/* %--------------------------------------------------------------% */
+/* | | */
+/* | M A I N LANCZOS I T E R A T I O N L O O P | */
+/* | Each iteration implicitly restarts the Lanczos | */
+/* | factorization in place. | */
+/* | | */
+/* %--------------------------------------------------------------% */
+
+/*< 1000 continue >*/
+L1000:
+
+/*< iter = iter + 1 >*/
+ ++iter;
+
+/* if (msglvl .gt. 0) then */
+/* call ivout (logfil, 1, iter, ndigit, */
+/* & '_saup2: **** Start of major iteration number ****') */
+/* end if */
+/* if (msglvl .gt. 1) then */
+/* call ivout (logfil, 1, nev, ndigit, */
+/* & '_saup2: The length of the current Lanczos factorization') */
+/* call ivout (logfil, 1, np, ndigit, */
+/* & '_saup2: Extend the Lanczos factorization by') */
+/* end if */
+
+/* %------------------------------------------------------------% */
+/* | Compute NP additional steps of the Lanczos factorization. | */
+/* %------------------------------------------------------------% */
+
+/*< ido = 0 >*/
+ *ido = 0;
+/*< 20 continue >*/
+L20:
+/*< update = .true. >*/
+ update = TRUE_;
+
+/*< >*/
+ dsaitr_(ido, bmat, n, nev, np, mode, &resid[1], &rnorm, &v[v_offset], ldv,
+ &h__[h_offset], ldh, &ipntr[1], &workd[1], info, (ftnlen)1);
+
+/* %---------------------------------------------------% */
+/* | ido .ne. 99 implies use of reverse communication | */
+/* | to compute operations involving OP and possibly B | */
+/* %---------------------------------------------------% */
+
+/*< if (ido .ne. 99) go to 9000 >*/
+ if (*ido != 99) {
+ goto L9000;
+ }
+
+/*< if (info .gt. 0) then >*/
+ if (*info > 0) {
+
+/* %-----------------------------------------------------% */
+/* | dsaitr was unable to build an Lanczos factorization | */
+/* | of length NEV0+NP0. INFO is returned with the size | */
+/* | of the factorization built. Exit main loop. | */
+/* %-----------------------------------------------------% */
+
+/*< np = info >*/
+ *np = *info;
+/*< mxiter = iter >*/
+ *mxiter = iter;
+/*< info = -9999 >*/
+ *info = -9999;
+/*< go to 1200 >*/
+ goto L1200;
+/*< end if >*/
+ }
+/*< update = .false. >*/
+ update = FALSE_;
+
+/* if (msglvl .gt. 1) then */
+/* call dvout (logfil, 1, rnorm, ndigit, */
+/* & '_saup2: Current B-norm of residual for factorization') */
+/* end if */
+
+/* %--------------------------------------------------------% */
+/* | Compute the eigenvalues and corresponding error bounds | */
+/* | of the current symmetric tridiagonal matrix. | */
+/* %--------------------------------------------------------% */
+
+/*< call dseigt (rnorm, kplusp, h, ldh, ritz, bounds, workl, ierr) >*/
+ dseigt_(&rnorm, &kplusp, &h__[h_offset], ldh, &ritz[1], &bounds[1], &
+ workl[1], &ierr);
+
+/*< if (ierr .ne. 0) then >*/
+ if (ierr != 0) {
+/*< info = -8 >*/
+ *info = -8;
+/*< go to 1200 >*/
+ goto L1200;
+/*< end if >*/
+ }
+
+/* %----------------------------------------------------% */
+/* | Make a copy of eigenvalues and corresponding error | */
+/* | bounds obtained from _seigt. | */
+/* %----------------------------------------------------% */
+
+/*< call dcopy(kplusp, ritz, 1, workl(kplusp+1), 1) >*/
+ dcopy_(&kplusp, &ritz[1], &c__1, &workl[kplusp + 1], &c__1);
+/*< call dcopy(kplusp, bounds, 1, workl(2*kplusp+1), 1) >*/
+ dcopy_(&kplusp, &bounds[1], &c__1, &workl[(kplusp << 1) + 1], &c__1);
+
+/* %---------------------------------------------------% */
+/* | Select the wanted Ritz values and their bounds | */
+/* | to be used in the convergence test. | */
+/* | The selection is based on the requested number of | */
+/* | eigenvalues instead of the current NEV and NP to | */
+/* | prevent possible misconvergence. | */
+/* | * Wanted Ritz values := RITZ(NP+1:NEV+NP) | */
+/* | * Shifts := RITZ(1:NP) := WORKL(1:NP) | */
+/* %---------------------------------------------------% */
+
+/*< nev = nev0 >*/
+ *nev = nev0;
+/*< np = np0 >*/
+ *np = np0;
+/*< call dsgets (ishift, which, nev, np, ritz, bounds, workl) >*/
+ dsgets_(ishift, which, nev, np, &ritz[1], &bounds[1], &workl[1], (ftnlen)
+ 2);
+
+/* %-------------------% */
+/* | Convergence test. | */
+/* %-------------------% */
+
+/*< call dcopy (nev, bounds(np+1), 1, workl(np+1), 1) >*/
+ dcopy_(nev, &bounds[*np + 1], &c__1, &workl[*np + 1], &c__1);
+/*< call dsconv (nev, ritz(np+1), workl(np+1), tol, nconv) >*/
+ dsconv_(nev, &ritz[*np + 1], &workl[*np + 1], tol, &nconv);
+
+/*< if (msglvl .gt. 2) then >*/
+/* if (msglvl > 2) { */
+/*< kp(1) = nev >*/
+/* kp[0] = *nev; */
+/*< kp(2) = np >*/
+/* kp[1] = *np; */
+/*< kp(3) = nconv >*/
+/* kp[2] = nconv; */
+/* call ivout (logfil, 3, kp, ndigit, */
+/* & '_saup2: NEV, NP, NCONV are') */
+/* call dvout (logfil, kplusp, ritz, ndigit, */
+/* & '_saup2: The eigenvalues of H') */
+/* call dvout (logfil, kplusp, bounds, ndigit, */
+/* & '_saup2: Ritz estimates of the current NCV Ritz values') */
+/*< end if >*/
+/* } */
+
+/* %---------------------------------------------------------% */
+/* | Count the number of unwanted Ritz values that have zero | */
+/* | Ritz estimates. If any Ritz estimates are equal to zero | */
+/* | then a leading block of H of order equal to at least | */
+/* | the number of Ritz values with zero Ritz estimates has | */
+/* | split off. None of these Ritz values may be removed by | */
+/* | shifting. Decrease NP the number of shifts to apply. If | */
+/* | no shifts may be applied, then prepare to exit | */
+/* %---------------------------------------------------------% */
+
+/*< nptemp = np >*/
+ nptemp = *np;
+/*< do 30 j=1, nptemp >*/
+ i__1 = nptemp;
+ for (j = 1; j <= i__1; ++j) {
+/*< if (bounds(j) .eq. zero) then >*/
+ if (bounds[j] == 0.) {
+/*< np = np - 1 >*/
+ --(*np);
+/*< nev = nev + 1 >*/
+ ++(*nev);
+/*< end if >*/
+ }
+/*< 30 continue >*/
+/* L30: */
+ }
+
+/*< >*/
+ if (nconv >= nev0 || iter > *mxiter || *np == 0) {
+
+/* %------------------------------------------------% */
+/* | Prepare to exit. Put the converged Ritz values | */
+/* | and corresponding bounds in RITZ(1:NCONV) and | */
+/* | BOUNDS(1:NCONV) respectively. Then sort. Be | */
+/* | careful when NCONV > NP since we don't want to | */
+/* | swap overlapping locations. | */
+/* %------------------------------------------------% */
+
+/*< if (which .eq. 'BE') then >*/
+ if (s_cmp(which, "BE", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* %-----------------------------------------------------% */
+/* | Both ends of the spectrum are requested. | */
+/* | Sort the eigenvalues into algebraically decreasing | */
+/* | order first then swap low end of the spectrum next | */
+/* | to high end in appropriate locations. | */
+/* | NOTE: when np < floor(nev/2) be careful not to swap | */
+/* | overlapping locations. | */
+/* %-----------------------------------------------------% */
+
+/*< wprime = 'SA' >*/
+ s_copy(wprime, "SA", (ftnlen)2, (ftnlen)2);
+/*< call dsortr (wprime, .true., kplusp, ritz, bounds) >*/
+ dsortr_(wprime, &c_true, &kplusp, &ritz[1], &bounds[1], (ftnlen)2)
+ ;
+/*< nevd2 = nev / 2 >*/
+ nevd2 = *nev / 2;
+/*< nevm2 = nev - nevd2 >*/
+ nevm2 = *nev - nevd2;
+/*< if ( nev .gt. 1 ) then >*/
+ if (*nev > 1) {
+/*< >*/
+ i__1 = min(nevd2,*np);
+/* Computing MAX */
+ i__2 = kplusp - nevd2 + 1, i__3 = kplusp - *np + 1;
+ dswap_(&i__1, &ritz[nevm2 + 1], &c__1, &ritz[max(i__2,i__3)],
+ &c__1);
+/*< >*/
+ i__1 = min(nevd2,*np);
+/* Computing MAX */
+ i__2 = kplusp - nevd2 + 1, i__3 = kplusp - *np;
+ dswap_(&i__1, &bounds[nevm2 + 1], &c__1, &bounds[max(i__2,
+ i__3) + 1], &c__1);
+/*< end if >*/
+ }
+
+/*< else >*/
+ } else {
+
+/* %--------------------------------------------------% */
+/* | LM, SM, LA, SA case. | */
+/* | Sort the eigenvalues of H into the an order that | */
+/* | is opposite to WHICH, and apply the resulting | */
+/* | order to BOUNDS. The eigenvalues are sorted so | */
+/* | that the wanted part are always within the first | */
+/* | NEV locations. | */
+/* %--------------------------------------------------% */
+
+/*< if (which .eq. 'LM') wprime = 'SM' >*/
+ if (s_cmp(which, "LM", (ftnlen)2, (ftnlen)2) == 0) {
+ s_copy(wprime, "SM", (ftnlen)2, (ftnlen)2);
+ }
+/*< if (which .eq. 'SM') wprime = 'LM' >*/
+ if (s_cmp(which, "SM", (ftnlen)2, (ftnlen)2) == 0) {
+ s_copy(wprime, "LM", (ftnlen)2, (ftnlen)2);
+ }
+/*< if (which .eq. 'LA') wprime = 'SA' >*/
+ if (s_cmp(which, "LA", (ftnlen)2, (ftnlen)2) == 0) {
+ s_copy(wprime, "SA", (ftnlen)2, (ftnlen)2);
+ }
+/*< if (which .eq. 'SA') wprime = 'LA' >*/
+ if (s_cmp(which, "SA", (ftnlen)2, (ftnlen)2) == 0) {
+ s_copy(wprime, "LA", (ftnlen)2, (ftnlen)2);
+ }
+
+/*< call dsortr (wprime, .true., kplusp, ritz, bounds) >*/
+ dsortr_(wprime, &c_true, &kplusp, &ritz[1], &bounds[1], (ftnlen)2)
+ ;
+
+/*< end if >*/
+ }
+
+/* %--------------------------------------------------% */
+/* | Scale the Ritz estimate of each Ritz value | */
+/* | by 1 / max(eps23,magnitude of the Ritz value). | */
+/* %--------------------------------------------------% */
+
+/*< do 35 j = 1, nev0 >*/
+ i__1 = nev0;
+ for (j = 1; j <= i__1; ++j) {
+/*< temp = max( eps23, abs(ritz(j)) ) >*/
+/* Computing MAX */
+ d__2 = eps23, d__3 = (d__1 = ritz[j], abs(d__1));
+ temp = max(d__2,d__3);
+/*< bounds(j) = bounds(j)/temp >*/
+ bounds[j] /= temp;
+/*< 35 continue >*/
+/* L35: */
+ }
+
+/* %----------------------------------------------------% */
+/* | Sort the Ritz values according to the scaled Ritz | */
+/* | esitmates. This will push all the converged ones | */
+/* | towards the front of ritzr, ritzi, bounds | */
+/* | (in the case when NCONV < NEV.) | */
+/* %----------------------------------------------------% */
+
+/*< wprime = 'LA' >*/
+ s_copy(wprime, "LA", (ftnlen)2, (ftnlen)2);
+/*< call dsortr(wprime, .true., nev0, bounds, ritz) >*/
+ dsortr_(wprime, &c_true, &nev0, &bounds[1], &ritz[1], (ftnlen)2);
+
+/* %----------------------------------------------% */
+/* | Scale the Ritz estimate back to its original | */
+/* | value. | */
+/* %----------------------------------------------% */
+
+/*< do 40 j = 1, nev0 >*/
+ i__1 = nev0;
+ for (j = 1; j <= i__1; ++j) {
+/*< temp = max( eps23, abs(ritz(j)) ) >*/
+/* Computing MAX */
+ d__2 = eps23, d__3 = (d__1 = ritz[j], abs(d__1));
+ temp = max(d__2,d__3);
+/*< bounds(j) = bounds(j)*temp >*/
+ bounds[j] *= temp;
+/*< 40 continue >*/
+/* L40: */
+ }
+
+/* %--------------------------------------------------% */
+/* | Sort the "converged" Ritz values again so that | */
+/* | the "threshold" values and their associated Ritz | */
+/* | estimates appear at the appropriate position in | */
+/* | ritz and bound. | */
+/* %--------------------------------------------------% */
+
+/*< if (which .eq. 'BE') then >*/
+ if (s_cmp(which, "BE", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* %------------------------------------------------% */
+/* | Sort the "converged" Ritz values in increasing | */
+/* | order. The "threshold" values are in the | */
+/* | middle. | */
+/* %------------------------------------------------% */
+
+/*< wprime = 'LA' >*/
+ s_copy(wprime, "LA", (ftnlen)2, (ftnlen)2);
+/*< call dsortr(wprime, .true., nconv, ritz, bounds) >*/
+ dsortr_(wprime, &c_true, &nconv, &ritz[1], &bounds[1], (ftnlen)2);
+
+/*< else >*/
+ } else {
+
+/* %----------------------------------------------% */
+/* | In LM, SM, LA, SA case, sort the "converged" | */
+/* | Ritz values according to WHICH so that the | */
+/* | "threshold" value appears at the front of | */
+/* | ritz. | */
+/* %----------------------------------------------% */
+/*< call dsortr(which, .true., nconv, ritz, bounds) >*/
+ dsortr_(which, &c_true, &nconv, &ritz[1], &bounds[1], (ftnlen)2);
+
+/*< end if >*/
+ }
+
+/* %------------------------------------------% */
+/* | Use h( 1,1 ) as storage to communicate | */
+/* | rnorm to _seupd if needed | */
+/* %------------------------------------------% */
+
+/*< h(1,1) = rnorm >*/
+ h__[h_dim1 + 1] = rnorm;
+
+/* if (msglvl .gt. 1) then */
+/* call dvout (logfil, kplusp, ritz, ndigit, */
+/* & '_saup2: Sorted Ritz values.') */
+/* call dvout (logfil, kplusp, bounds, ndigit, */
+/* & '_saup2: Sorted ritz estimates.') */
+/* end if */
+
+/* %------------------------------------% */
+/* | Max iterations have been exceeded. | */
+/* %------------------------------------% */
+
+/*< if (iter .gt. mxiter .and. nconv .lt. nev) info = 1 >*/
+ if (iter > *mxiter && nconv < *nev) {
+ *info = 1;
+ }
+
+/* %---------------------% */
+/* | No shifts to apply. | */
+/* %---------------------% */
+
+/*< if (np .eq. 0 .and. nconv .lt. nev0) info = 2 >*/
+ if (*np == 0 && nconv < nev0) {
+ *info = 2;
+ }
+
+/*< np = nconv >*/
+ *np = nconv;
+/*< go to 1100 >*/
+ goto L1100;
+
+/*< else if (nconv .lt. nev .and. ishift .eq. 1) then >*/
+ } else if (nconv < *nev && *ishift == 1) {
+
+/* %---------------------------------------------------% */
+/* | Do not have all the requested eigenvalues yet. | */
+/* | To prevent possible stagnation, adjust the number | */
+/* | of Ritz values and the shifts. | */
+/* %---------------------------------------------------% */
+
+/*< nevbef = nev >*/
+ nevbef = *nev;
+/*< nev = nev + min (nconv, np/2) >*/
+/* Computing MIN */
+ i__1 = nconv, i__2 = *np / 2;
+ *nev += min(i__1,i__2);
+/*< if (nev .eq. 1 .and. kplusp .ge. 6) then >*/
+ if (*nev == 1 && kplusp >= 6) {
+/*< nev = kplusp / 2 >*/
+ *nev = kplusp / 2;
+/*< else if (nev .eq. 1 .and. kplusp .gt. 2) then >*/
+ } else if (*nev == 1 && kplusp > 2) {
+/*< nev = 2 >*/
+ *nev = 2;
+/*< end if >*/
+ }
+/*< np = kplusp - nev >*/
+ *np = kplusp - *nev;
+
+/* %---------------------------------------% */
+/* | If the size of NEV was just increased | */
+/* | resort the eigenvalues. | */
+/* %---------------------------------------% */
+
+/*< >*/
+ if (nevbef < *nev) {
+ dsgets_(ishift, which, nev, np, &ritz[1], &bounds[1], &workl[1], (
+ ftnlen)2);
+ }
+
+/*< end if >*/
+ }
+
+/*< if (msglvl .gt. 0) then >*/
+/* if (msglvl > 0) { */
+/* call ivout (logfil, 1, nconv, ndigit, */
+/* & '_saup2: no. of "converged" Ritz values at this iter.') */
+/*< if (msglvl .gt. 1) then >*/
+/* if (msglvl > 1) { */
+/*< kp(1) = nev >*/
+/* kp[0] = *nev; */
+/*< kp(2) = np >*/
+/* kp[1] = *np; */
+/* call ivout (logfil, 2, kp, ndigit, */
+/* & '_saup2: NEV and NP are') */
+/* call dvout (logfil, nev, ritz(np+1), ndigit, */
+/* & '_saup2: "wanted" Ritz values.') */
+/* call dvout (logfil, nev, bounds(np+1), ndigit, */
+/* & '_saup2: Ritz estimates of the "wanted" values ') */
+/*< end if >*/
+/* } */
+/*< end if >*/
+/* } */
+
+/*< if (ishift .eq. 0) then >*/
+ if (*ishift == 0) {
+
+/* %-----------------------------------------------------% */
+/* | User specified shifts: reverse communication to | */
+/* | compute the shifts. They are returned in the first | */
+/* | NP locations of WORKL. | */
+/* %-----------------------------------------------------% */
+
+/*< ushift = .true. >*/
+ ushift = TRUE_;
+/*< ido = 3 >*/
+ *ido = 3;
+/*< go to 9000 >*/
+ goto L9000;
+/*< end if >*/
+ }
+
+/*< 50 continue >*/
+L50:
+
+/* %------------------------------------% */
+/* | Back from reverse communication; | */
+/* | User specified shifts are returned | */
+/* | in WORKL(1:*NP) | */
+/* %------------------------------------% */
+
+/*< ushift = .false. >*/
+ ushift = FALSE_;
+
+
+/* %---------------------------------------------------------% */
+/* | Move the NP shifts to the first NP locations of RITZ to | */
+/* | free up WORKL. This is for the non-exact shift case; | */
+/* | in the exact shift case, dsgets already handles this. | */
+/* %---------------------------------------------------------% */
+
+/*< if (ishift .eq. 0) call dcopy (np, workl, 1, ritz, 1) >*/
+ if (*ishift == 0) {
+ dcopy_(np, &workl[1], &c__1, &ritz[1], &c__1);
+ }
+
+/* if (msglvl .gt. 2) then */
+/* call ivout (logfil, 1, np, ndigit, */
+/* & '_saup2: The number of shifts to apply ') */
+/* call dvout (logfil, np, workl, ndigit, */
+/* & '_saup2: shifts selected') */
+/* if (ishift .eq. 1) then */
+/* call dvout (logfil, np, bounds, ndigit, */
+/* & '_saup2: corresponding Ritz estimates') */
+/* end if */
+/* end if */
+
+/* %---------------------------------------------------------% */
+/* | Apply the NP0 implicit shifts by QR bulge chasing. | */
+/* | Each shift is applied to the entire tridiagonal matrix. | */
+/* | The first 2*N locations of WORKD are used as workspace. | */
+/* | After dsapps is done, we have a Lanczos | */
+/* | factorization of length NEV. | */
+/* %---------------------------------------------------------% */
+
+/*< >*/
+ dsapps_(n, nev, np, &ritz[1], &v[v_offset], ldv, &h__[h_offset], ldh, &
+ resid[1], &q[q_offset], ldq, &workd[1]);
+
+/* %---------------------------------------------% */
+/* | Compute the B-norm of the updated residual. | */
+/* | Keep B*RESID in WORKD(1:N) to be used in | */
+/* | the first step of the next call to dsaitr. | */
+/* %---------------------------------------------% */
+
+/*< cnorm = .true. >*/
+ cnorm = TRUE_;
+/*< call second (t2) >*/
+/* second_(&t2); */
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< nbx = nbx + 1 >*/
+/* ++timing_1.nbx; */
+/*< call dcopy (n, resid, 1, workd(n+1), 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[*n + 1], &c__1);
+/*< ipntr(1) = n + 1 >*/
+ ipntr[1] = *n + 1;
+/*< ipntr(2) = 1 >*/
+ ipntr[2] = 1;
+/*< ido = 2 >*/
+ *ido = 2;
+
+/* %----------------------------------% */
+/* | Exit in order to compute B*RESID | */
+/* %----------------------------------% */
+
+/*< go to 9000 >*/
+ goto L9000;
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< call dcopy (n, resid, 1, workd, 1) >*/
+ dcopy_(n, &resid[1], &c__1, &workd[1], &c__1);
+/*< end if >*/
+ }
+
+/*< 100 continue >*/
+L100:
+
+/* %----------------------------------% */
+/* | Back from reverse communication; | */
+/* | WORKD(1:N) := B*RESID | */
+/* %----------------------------------% */
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< call second (t3) >*/
+/* second_(&t3); */
+/*< tmvbx = tmvbx + (t3 - t2) >*/
+/* timing_1.tmvbx += t3 - t2; */
+/*< end if >*/
+ }
+
+/*< if (bmat .eq. 'G') then >*/
+ if (*(unsigned char *)bmat == 'G') {
+/*< rnorm = ddot (n, resid, 1, workd, 1) >*/
+ rnorm = ddot_(n, &resid[1], &c__1, &workd[1], &c__1);
+/*< rnorm = sqrt(abs(rnorm)) >*/
+ rnorm = sqrt((abs(rnorm)));
+/*< else if (bmat .eq. 'I') then >*/
+ } else if (*(unsigned char *)bmat == 'I') {
+/*< rnorm = dnrm2(n, resid, 1) >*/
+ rnorm = dnrm2_(n, &resid[1], &c__1);
+/*< end if >*/
+ }
+/*< cnorm = .false. >*/
+ cnorm = FALSE_;
+/*< 130 continue >*/
+/* L130: */
+
+/* if (msglvl .gt. 2) then */
+/* call dvout (logfil, 1, rnorm, ndigit, */
+/* & '_saup2: B-norm of residual for NEV factorization') */
+/* call dvout (logfil, nev, h(1,2), ndigit, */
+/* & '_saup2: main diagonal of compressed H matrix') */
+/* call dvout (logfil, nev-1, h(2,1), ndigit, */
+/* & '_saup2: subdiagonal of compressed H matrix') */
+/* end if */
+
+/*< go to 1000 >*/
+ goto L1000;
+
+/* %---------------------------------------------------------------% */
+/* | | */
+/* | E N D O F M A I N I T E R A T I O N L O O P | */
+/* | | */
+/* %---------------------------------------------------------------% */
+
+/*< 1100 continue >*/
+L1100:
+
+/*< mxiter = iter >*/
+ *mxiter = iter;
+/*< nev = nconv >*/
+ *nev = nconv;
+
+/*< 1200 continue >*/
+L1200:
+/*< ido = 99 >*/
+ *ido = 99;
+
+/* %------------% */
+/* | Error exit | */
+/* %------------% */
+
+/*< call second (t1) >*/
+/* second_(&t1); */
+/*< tsaup2 = t1 - t0 >*/
+/* timing_1.tsaup2 = t1 - t0; */
+
+/*< 9000 continue >*/
+L9000:
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dsaup2 | */
+/* %---------------% */
+
+/*< end >*/
+} /* dsaup2_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.f
new file mode 100644
index 0000000000000000000000000000000000000000..4f8c93fe78b5e8e4e70ea4b406f6e2640a2506f3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.f
@@ -0,0 +1,848 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dsaup2
+c
+c\Description:
+c Intermediate level interface called by dsaupd.
+c
+c\Usage:
+c call dsaup2
+c ( IDO, BMAT, N, WHICH, NEV, NP, TOL, RESID, MODE, IUPD,
+c ISHIFT, MXITER, V, LDV, H, LDH, RITZ, BOUNDS, Q, LDQ, WORKL,
+c IPNTR, WORKD, INFO )
+c
+c\Arguments
+c
+c IDO, BMAT, N, WHICH, NEV, TOL, RESID: same as defined in dsaupd.
+c MODE, ISHIFT, MXITER: see the definition of IPARAM in dsaupd.
+c
+c NP Integer. (INPUT/OUTPUT)
+c Contains the number of implicit shifts to apply during
+c each Arnoldi/Lanczos iteration.
+c If ISHIFT=1, NP is adjusted dynamically at each iteration
+c to accelerate convergence and prevent stagnation.
+c This is also roughly equal to the number of matrix-vector
+c products (involving the operator OP) per Arnoldi iteration.
+c The logic for adjusting is contained within the current
+c subroutine.
+c If ISHIFT=0, NP is the number of shifts the user needs
+c to provide via reverse comunication. 0 < NP < NCV-NEV.
+c NP may be less than NCV-NEV since a leading block of the current
+c upper Tridiagonal matrix has split off and contains "unwanted"
+c Ritz values.
+c Upon termination of the IRA iteration, NP contains the number
+c of "converged" wanted Ritz values.
+c
+c IUPD Integer. (INPUT)
+c IUPD .EQ. 0: use explicit restart instead implicit update.
+c IUPD .NE. 0: use implicit update.
+c
+c V Double precision N by (NEV+NP) array. (INPUT/OUTPUT)
+c The Lanczos basis vectors.
+c
+c LDV Integer. (INPUT)
+c Leading dimension of V exactly as declared in the calling
+c program.
+c
+c H Double precision (NEV+NP) by 2 array. (OUTPUT)
+c H is used to store the generated symmetric tridiagonal matrix
+c The subdiagonal is stored in the first column of H starting
+c at H(2,1). The main diagonal is stored in the second column
+c of H starting at H(1,2). If dsaup2 converges store the
+c B-norm of the final residual vector in H(1,1).
+c
+c LDH Integer. (INPUT)
+c Leading dimension of H exactly as declared in the calling
+c program.
+c
+c RITZ Double precision array of length NEV+NP. (OUTPUT)
+c RITZ(1:NEV) contains the computed Ritz values of OP.
+c
+c BOUNDS Double precision array of length NEV+NP. (OUTPUT)
+c BOUNDS(1:NEV) contain the error bounds corresponding to RITZ.
+c
+c Q Double precision (NEV+NP) by (NEV+NP) array. (WORKSPACE)
+c Private (replicated) work array used to accumulate the
+c rotation in the shift application step.
+c
+c LDQ Integer. (INPUT)
+c Leading dimension of Q exactly as declared in the calling
+c program.
+c
+c WORKL Double precision array of length at least 3*(NEV+NP). (INPUT/WORKSPACE)
+c Private (replicated) array on each PE or array allocated on
+c the front end. It is used in the computation of the
+c tridiagonal eigenvalue problem, the calculation and
+c application of the shifts and convergence checking.
+c If ISHIFT .EQ. O and IDO .EQ. 3, the first NP locations
+c of WORKL are used in reverse communication to hold the user
+c supplied shifts.
+c
+c IPNTR Integer array of length 3. (OUTPUT)
+c Pointer to mark the starting locations in the WORKD for
+c vectors used by the Lanczos iteration.
+c -------------------------------------------------------------
+c IPNTR(1): pointer to the current operand vector X.
+c IPNTR(2): pointer to the current result vector Y.
+c IPNTR(3): pointer to the vector B * X when used in one of
+c the spectral transformation modes. X is the current
+c operand.
+c -------------------------------------------------------------
+c
+c WORKD Double precision work array of length 3*N. (REVERSE COMMUNICATION)
+c Distributed array to be used in the basic Lanczos iteration
+c for reverse communication. The user should not use WORKD
+c as temporary workspace during the iteration !!!!!!!!!!
+c See Data Distribution Note in dsaupd.
+c
+c INFO Integer. (INPUT/OUTPUT)
+c If INFO .EQ. 0, a randomly initial residual vector is used.
+c If INFO .NE. 0, RESID contains the initial residual vector,
+c possibly from a previous run.
+c Error flag on output.
+c = 0: Normal return.
+c = 1: All possible eigenvalues of OP has been found.
+c NP returns the size of the invariant subspace
+c spanning the operator OP.
+c = 2: No shifts could be applied.
+c = -8: Error return from trid. eigenvalue calculation;
+c This should never happen.
+c = -9: Starting vector is zero.
+c = -9999: Could not build an Lanczos factorization.
+c Size that was built in returned in NP.
+c
+c\EndDoc
+c
+c-----------------------------------------------------------------------
+c
+c\BeginLib
+c
+c\References:
+c 1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
+c a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
+c pp 357-385.
+c 2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly
+c Restarted Arnoldi Iteration", Rice University Technical Report
+c TR95-13, Department of Computational and Applied Mathematics.
+c 3. B.N. Parlett, "The Symmetric Eigenvalue Problem". Prentice-Hall,
+c 1980.
+c 4. B.N. Parlett, B. Nour-Omid, "Towards a Black Box Lanczos Program",
+c Computer Physics Communications, 53 (1989), pp 169-179.
+c 5. B. Nour-Omid, B.N. Parlett, T. Ericson, P.S. Jensen, "How to
+c Implement the Spectral Transformation", Math. Comp., 48 (1987),
+c pp 663-673.
+c 6. R.G. Grimes, J.G. Lewis and H.D. Simon, "A Shifted Block Lanczos
+c Algorithm for Solving Sparse Symmetric Generalized Eigenproblems",
+c SIAM J. Matr. Anal. Apps., January (1993).
+c 7. L. Reichel, W.B. Gragg, "Algorithm 686: FORTRAN Subroutines
+c for Updating the QR decomposition", ACM TOMS, December 1990,
+c Volume 16 Number 4, pp 369-377.
+c
+c\Routines called:
+c dgetv0 ARPACK initial vector generation routine.
+c dsaitr ARPACK Lanczos factorization routine.
+c dsapps ARPACK application of implicit shifts routine.
+c dsconv ARPACK convergence of Ritz values routine.
+c dseigt ARPACK compute Ritz values and error bounds routine.
+c dsgets ARPACK reorder Ritz values and error bounds routine.
+c dsortr ARPACK sorting routine.
+c second ARPACK utility routine for timing.
+c dlamch LAPACK routine that determines machine constants.
+c dcopy Level 1 BLAS that copies one vector to another.
+c ddot Level 1 BLAS that computes the scalar product of two vectors.
+c dnrm2 Level 1 BLAS that computes the norm of a vector.
+c dscal Level 1 BLAS that scales a vector.
+c dswap Level 1 BLAS that swaps two vectors.
+c
+c\Author
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\Revision history:
+c 12/15/93: Version ' 2.4'
+c xx/xx/95: Version ' 2.4'. (R.B. Lehoucq)
+c
+c\SCCS Information: @(#)
+c FILE: saup2.F SID: 2.6 DATE OF SID: 8/16/96 RELEASE: 2
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dsaup2
+ & ( ido, bmat, n, which, nev, np, tol, resid, mode, iupd,
+ & ishift, mxiter, v, ldv, h, ldh, ritz, bounds,
+ & q, ldq, workl, ipntr, workd, info )
+c
+c %----------------------------------------------------%
+c | Include files for debugging and timing information |
+c %----------------------------------------------------%
+c
+ include 'debug.h'
+ include 'stat.h'
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ character bmat*1, which*2
+ integer ido, info, ishift, iupd, ldh, ldq, ldv, mxiter,
+ & n, mode, nev, np
+ Double precision
+ & tol
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ integer ipntr(3)
+ Double precision
+ & bounds(nev+np), h(ldh,2), q(ldq,nev+np), resid(n),
+ & ritz(nev+np), v(ldv,nev+np), workd(3*n),
+ & workl(3*(nev+np))
+c
+c %------------%
+c | Parameters |
+c %------------%
+c
+ Double precision
+ & one, zero
+ parameter (one = 1.0D+0, zero = 0.0D+0)
+c
+c %---------------%
+c | Local Scalars |
+c %---------------%
+c
+ character wprime*2
+ logical cnorm, getv0, initv, update, ushift
+ integer ierr, iter, j, kplusp, msglvl, nconv, nevbef, nev0,
+ & np0, nptemp, nevd2, nevm2, kp(3)
+ Double precision
+ & rnorm, temp, eps23
+ save cnorm, getv0, initv, update, ushift,
+ & iter, kplusp, msglvl, nconv, nev0, np0,
+ & rnorm, eps23
+c
+c %----------------------%
+c | External Subroutines |
+c %----------------------%
+c
+ external dcopy, dgetv0, dsaitr, dscal, dsconv, dseigt, dsgets,
+ & dsapps, dsortr, second, dswap
+c
+c %--------------------%
+c | External Functions |
+c %--------------------%
+c
+ Double precision
+ & ddot, dnrm2, dlamch
+ external ddot, dnrm2, dlamch
+c
+c %---------------------%
+c | Intrinsic Functions |
+c %---------------------%
+c
+ intrinsic min
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+ if (ido .eq. 0) then
+c
+c %-------------------------------%
+c | Initialize timing statistics |
+c | & message level for debugging |
+c %-------------------------------%
+c
+ call second (t0)
+ msglvl = msaup2
+c
+c %---------------------------------%
+c | Set machine dependent constant. |
+c %---------------------------------%
+c
+ eps23 = dlamch('Epsilon-Machine')
+ eps23 = eps23**(2.0D+0/3.0D+0)
+c
+c %-------------------------------------%
+c | nev0 and np0 are integer variables |
+c | hold the initial values of NEV & NP |
+c %-------------------------------------%
+c
+ nev0 = nev
+ np0 = np
+c
+c %-------------------------------------%
+c | kplusp is the bound on the largest |
+c | Lanczos factorization built. |
+c | nconv is the current number of |
+c | "converged" eigenvlues. |
+c | iter is the counter on the current |
+c | iteration step. |
+c %-------------------------------------%
+c
+ kplusp = nev0 + np0
+ nconv = 0
+ iter = 0
+c
+c %--------------------------------------------%
+c | Set flags for computing the first NEV steps |
+c | of the Lanczos factorization. |
+c %--------------------------------------------%
+c
+ getv0 = .true.
+ update = .false.
+ ushift = .false.
+ cnorm = .false.
+c
+ if (info .ne. 0) then
+c
+c %--------------------------------------------%
+c | User provides the initial residual vector. |
+c %--------------------------------------------%
+c
+ initv = .true.
+ info = 0
+ else
+ initv = .false.
+ end if
+ end if
+c
+c %---------------------------------------------%
+c | Get a possibly random starting vector and |
+c | force it into the range of the operator OP. |
+c %---------------------------------------------%
+c
+ 10 continue
+c
+ if (getv0) then
+ call dgetv0 (ido, bmat, 1, initv, n, 1, v, ldv, resid, rnorm,
+ & ipntr, workd, info)
+c
+ if (ido .ne. 99) go to 9000
+c
+ if (rnorm .eq. zero) then
+c
+c %-----------------------------------------%
+c | The initial vector is zero. Error exit. |
+c %-----------------------------------------%
+c
+ info = -9
+ go to 1200
+ end if
+ getv0 = .false.
+ ido = 0
+ end if
+c
+c %------------------------------------------------------------%
+c | Back from reverse communication: continue with update step |
+c %------------------------------------------------------------%
+c
+ if (update) go to 20
+c
+c %-------------------------------------------%
+c | Back from computing user specified shifts |
+c %-------------------------------------------%
+c
+ if (ushift) go to 50
+c
+c %-------------------------------------%
+c | Back from computing residual norm |
+c | at the end of the current iteration |
+c %-------------------------------------%
+c
+ if (cnorm) go to 100
+c
+c %----------------------------------------------------------%
+c | Compute the first NEV steps of the Lanczos factorization |
+c %----------------------------------------------------------%
+c
+ call dsaitr (ido, bmat, n, 0, nev0, mode, resid, rnorm, v, ldv,
+ & h, ldh, ipntr, workd, info)
+c
+c %---------------------------------------------------%
+c | ido .ne. 99 implies use of reverse communication |
+c | to compute operations involving OP and possibly B |
+c %---------------------------------------------------%
+c
+ if (ido .ne. 99) go to 9000
+c
+ if (info .gt. 0) then
+c
+c %-----------------------------------------------------%
+c | dsaitr was unable to build an Lanczos factorization |
+c | of length NEV0. INFO is returned with the size of |
+c | the factorization built. Exit main loop. |
+c %-----------------------------------------------------%
+c
+ np = info
+ mxiter = iter
+ info = -9999
+ go to 1200
+ end if
+c
+c %--------------------------------------------------------------%
+c | |
+c | M A I N LANCZOS I T E R A T I O N L O O P |
+c | Each iteration implicitly restarts the Lanczos |
+c | factorization in place. |
+c | |
+c %--------------------------------------------------------------%
+c
+ 1000 continue
+c
+ iter = iter + 1
+c
+c if (msglvl .gt. 0) then
+c call ivout (logfil, 1, iter, ndigit,
+c & '_saup2: **** Start of major iteration number ****')
+c end if
+c if (msglvl .gt. 1) then
+c call ivout (logfil, 1, nev, ndigit,
+c & '_saup2: The length of the current Lanczos factorization')
+c call ivout (logfil, 1, np, ndigit,
+c & '_saup2: Extend the Lanczos factorization by')
+c end if
+c
+c %------------------------------------------------------------%
+c | Compute NP additional steps of the Lanczos factorization. |
+c %------------------------------------------------------------%
+c
+ ido = 0
+ 20 continue
+ update = .true.
+c
+ call dsaitr (ido, bmat, n, nev, np, mode, resid, rnorm, v,
+ & ldv, h, ldh, ipntr, workd, info)
+c
+c %---------------------------------------------------%
+c | ido .ne. 99 implies use of reverse communication |
+c | to compute operations involving OP and possibly B |
+c %---------------------------------------------------%
+c
+ if (ido .ne. 99) go to 9000
+c
+ if (info .gt. 0) then
+c
+c %-----------------------------------------------------%
+c | dsaitr was unable to build an Lanczos factorization |
+c | of length NEV0+NP0. INFO is returned with the size |
+c | of the factorization built. Exit main loop. |
+c %-----------------------------------------------------%
+c
+ np = info
+ mxiter = iter
+ info = -9999
+ go to 1200
+ end if
+ update = .false.
+c
+c if (msglvl .gt. 1) then
+c call dvout (logfil, 1, rnorm, ndigit,
+c & '_saup2: Current B-norm of residual for factorization')
+c end if
+c
+c %--------------------------------------------------------%
+c | Compute the eigenvalues and corresponding error bounds |
+c | of the current symmetric tridiagonal matrix. |
+c %--------------------------------------------------------%
+c
+ call dseigt (rnorm, kplusp, h, ldh, ritz, bounds, workl, ierr)
+c
+ if (ierr .ne. 0) then
+ info = -8
+ go to 1200
+ end if
+c
+c %----------------------------------------------------%
+c | Make a copy of eigenvalues and corresponding error |
+c | bounds obtained from _seigt. |
+c %----------------------------------------------------%
+c
+ call dcopy(kplusp, ritz, 1, workl(kplusp+1), 1)
+ call dcopy(kplusp, bounds, 1, workl(2*kplusp+1), 1)
+c
+c %---------------------------------------------------%
+c | Select the wanted Ritz values and their bounds |
+c | to be used in the convergence test. |
+c | The selection is based on the requested number of |
+c | eigenvalues instead of the current NEV and NP to |
+c | prevent possible misconvergence. |
+c | * Wanted Ritz values := RITZ(NP+1:NEV+NP) |
+c | * Shifts := RITZ(1:NP) := WORKL(1:NP) |
+c %---------------------------------------------------%
+c
+ nev = nev0
+ np = np0
+ call dsgets (ishift, which, nev, np, ritz, bounds, workl)
+c
+c %-------------------%
+c | Convergence test. |
+c %-------------------%
+c
+ call dcopy (nev, bounds(np+1), 1, workl(np+1), 1)
+ call dsconv (nev, ritz(np+1), workl(np+1), tol, nconv)
+c
+ if (msglvl .gt. 2) then
+ kp(1) = nev
+ kp(2) = np
+ kp(3) = nconv
+c call ivout (logfil, 3, kp, ndigit,
+c & '_saup2: NEV, NP, NCONV are')
+c call dvout (logfil, kplusp, ritz, ndigit,
+c & '_saup2: The eigenvalues of H')
+c call dvout (logfil, kplusp, bounds, ndigit,
+c & '_saup2: Ritz estimates of the current NCV Ritz values')
+ end if
+c
+c %---------------------------------------------------------%
+c | Count the number of unwanted Ritz values that have zero |
+c | Ritz estimates. If any Ritz estimates are equal to zero |
+c | then a leading block of H of order equal to at least |
+c | the number of Ritz values with zero Ritz estimates has |
+c | split off. None of these Ritz values may be removed by |
+c | shifting. Decrease NP the number of shifts to apply. If |
+c | no shifts may be applied, then prepare to exit |
+c %---------------------------------------------------------%
+c
+ nptemp = np
+ do 30 j=1, nptemp
+ if (bounds(j) .eq. zero) then
+ np = np - 1
+ nev = nev + 1
+ end if
+ 30 continue
+c
+ if ( (nconv .ge. nev0) .or.
+ & (iter .gt. mxiter) .or.
+ & (np .eq. 0) ) then
+c
+c %------------------------------------------------%
+c | Prepare to exit. Put the converged Ritz values |
+c | and corresponding bounds in RITZ(1:NCONV) and |
+c | BOUNDS(1:NCONV) respectively. Then sort. Be |
+c | careful when NCONV > NP since we don't want to |
+c | swap overlapping locations. |
+c %------------------------------------------------%
+c
+ if (which .eq. 'BE') then
+c
+c %-----------------------------------------------------%
+c | Both ends of the spectrum are requested. |
+c | Sort the eigenvalues into algebraically decreasing |
+c | order first then swap low end of the spectrum next |
+c | to high end in appropriate locations. |
+c | NOTE: when np < floor(nev/2) be careful not to swap |
+c | overlapping locations. |
+c %-----------------------------------------------------%
+c
+ wprime = 'SA'
+ call dsortr (wprime, .true., kplusp, ritz, bounds)
+ nevd2 = nev / 2
+ nevm2 = nev - nevd2
+ if ( nev .gt. 1 ) then
+ call dswap ( min(nevd2,np), ritz(nevm2+1), 1,
+ & ritz( max(kplusp-nevd2+1,kplusp-np+1) ), 1)
+ call dswap ( min(nevd2,np), bounds(nevm2+1), 1,
+ & bounds( max(kplusp-nevd2+1,kplusp-np)+1 ), 1)
+ end if
+c
+ else
+c
+c %--------------------------------------------------%
+c | LM, SM, LA, SA case. |
+c | Sort the eigenvalues of H into the an order that |
+c | is opposite to WHICH, and apply the resulting |
+c | order to BOUNDS. The eigenvalues are sorted so |
+c | that the wanted part are always within the first |
+c | NEV locations. |
+c %--------------------------------------------------%
+c
+ if (which .eq. 'LM') wprime = 'SM'
+ if (which .eq. 'SM') wprime = 'LM'
+ if (which .eq. 'LA') wprime = 'SA'
+ if (which .eq. 'SA') wprime = 'LA'
+c
+ call dsortr (wprime, .true., kplusp, ritz, bounds)
+c
+ end if
+c
+c %--------------------------------------------------%
+c | Scale the Ritz estimate of each Ritz value |
+c | by 1 / max(eps23,magnitude of the Ritz value). |
+c %--------------------------------------------------%
+c
+ do 35 j = 1, nev0
+ temp = max( eps23, abs(ritz(j)) )
+ bounds(j) = bounds(j)/temp
+ 35 continue
+c
+c %----------------------------------------------------%
+c | Sort the Ritz values according to the scaled Ritz |
+c | esitmates. This will push all the converged ones |
+c | towards the front of ritzr, ritzi, bounds |
+c | (in the case when NCONV < NEV.) |
+c %----------------------------------------------------%
+c
+ wprime = 'LA'
+ call dsortr(wprime, .true., nev0, bounds, ritz)
+c
+c %----------------------------------------------%
+c | Scale the Ritz estimate back to its original |
+c | value. |
+c %----------------------------------------------%
+c
+ do 40 j = 1, nev0
+ temp = max( eps23, abs(ritz(j)) )
+ bounds(j) = bounds(j)*temp
+ 40 continue
+c
+c %--------------------------------------------------%
+c | Sort the "converged" Ritz values again so that |
+c | the "threshold" values and their associated Ritz |
+c | estimates appear at the appropriate position in |
+c | ritz and bound. |
+c %--------------------------------------------------%
+c
+ if (which .eq. 'BE') then
+c
+c %------------------------------------------------%
+c | Sort the "converged" Ritz values in increasing |
+c | order. The "threshold" values are in the |
+c | middle. |
+c %------------------------------------------------%
+c
+ wprime = 'LA'
+ call dsortr(wprime, .true., nconv, ritz, bounds)
+c
+ else
+c
+c %----------------------------------------------%
+c | In LM, SM, LA, SA case, sort the "converged" |
+c | Ritz values according to WHICH so that the |
+c | "threshold" value appears at the front of |
+c | ritz. |
+c %----------------------------------------------%
+
+ call dsortr(which, .true., nconv, ritz, bounds)
+c
+ end if
+c
+c %------------------------------------------%
+c | Use h( 1,1 ) as storage to communicate |
+c | rnorm to _seupd if needed |
+c %------------------------------------------%
+c
+ h(1,1) = rnorm
+c
+c if (msglvl .gt. 1) then
+c call dvout (logfil, kplusp, ritz, ndigit,
+c & '_saup2: Sorted Ritz values.')
+c call dvout (logfil, kplusp, bounds, ndigit,
+c & '_saup2: Sorted ritz estimates.')
+c end if
+c
+c %------------------------------------%
+c | Max iterations have been exceeded. |
+c %------------------------------------%
+c
+ if (iter .gt. mxiter .and. nconv .lt. nev) info = 1
+c
+c %---------------------%
+c | No shifts to apply. |
+c %---------------------%
+c
+ if (np .eq. 0 .and. nconv .lt. nev0) info = 2
+c
+ np = nconv
+ go to 1100
+c
+ else if (nconv .lt. nev .and. ishift .eq. 1) then
+c
+c %---------------------------------------------------%
+c | Do not have all the requested eigenvalues yet. |
+c | To prevent possible stagnation, adjust the number |
+c | of Ritz values and the shifts. |
+c %---------------------------------------------------%
+c
+ nevbef = nev
+ nev = nev + min (nconv, np/2)
+ if (nev .eq. 1 .and. kplusp .ge. 6) then
+ nev = kplusp / 2
+ else if (nev .eq. 1 .and. kplusp .gt. 2) then
+ nev = 2
+ end if
+ np = kplusp - nev
+c
+c %---------------------------------------%
+c | If the size of NEV was just increased |
+c | resort the eigenvalues. |
+c %---------------------------------------%
+c
+ if (nevbef .lt. nev)
+ & call dsgets (ishift, which, nev, np, ritz, bounds,
+ & workl)
+c
+ end if
+c
+ if (msglvl .gt. 0) then
+c call ivout (logfil, 1, nconv, ndigit,
+c & '_saup2: no. of "converged" Ritz values at this iter.')
+ if (msglvl .gt. 1) then
+ kp(1) = nev
+ kp(2) = np
+c call ivout (logfil, 2, kp, ndigit,
+c & '_saup2: NEV and NP are')
+c call dvout (logfil, nev, ritz(np+1), ndigit,
+c & '_saup2: "wanted" Ritz values.')
+c call dvout (logfil, nev, bounds(np+1), ndigit,
+c & '_saup2: Ritz estimates of the "wanted" values ')
+ end if
+ end if
+
+c
+ if (ishift .eq. 0) then
+c
+c %-----------------------------------------------------%
+c | User specified shifts: reverse communication to |
+c | compute the shifts. They are returned in the first |
+c | NP locations of WORKL. |
+c %-----------------------------------------------------%
+c
+ ushift = .true.
+ ido = 3
+ go to 9000
+ end if
+c
+ 50 continue
+c
+c %------------------------------------%
+c | Back from reverse communication; |
+c | User specified shifts are returned |
+c | in WORKL(1:*NP) |
+c %------------------------------------%
+c
+ ushift = .false.
+c
+c
+c %---------------------------------------------------------%
+c | Move the NP shifts to the first NP locations of RITZ to |
+c | free up WORKL. This is for the non-exact shift case; |
+c | in the exact shift case, dsgets already handles this. |
+c %---------------------------------------------------------%
+c
+ if (ishift .eq. 0) call dcopy (np, workl, 1, ritz, 1)
+c
+c if (msglvl .gt. 2) then
+c call ivout (logfil, 1, np, ndigit,
+c & '_saup2: The number of shifts to apply ')
+c call dvout (logfil, np, workl, ndigit,
+c & '_saup2: shifts selected')
+c if (ishift .eq. 1) then
+c call dvout (logfil, np, bounds, ndigit,
+c & '_saup2: corresponding Ritz estimates')
+c end if
+c end if
+c
+c %---------------------------------------------------------%
+c | Apply the NP0 implicit shifts by QR bulge chasing. |
+c | Each shift is applied to the entire tridiagonal matrix. |
+c | The first 2*N locations of WORKD are used as workspace. |
+c | After dsapps is done, we have a Lanczos |
+c | factorization of length NEV. |
+c %---------------------------------------------------------%
+c
+ call dsapps (n, nev, np, ritz, v, ldv, h, ldh, resid, q, ldq,
+ & workd)
+c
+c %---------------------------------------------%
+c | Compute the B-norm of the updated residual. |
+c | Keep B*RESID in WORKD(1:N) to be used in |
+c | the first step of the next call to dsaitr. |
+c %---------------------------------------------%
+c
+ cnorm = .true.
+ call second (t2)
+ if (bmat .eq. 'G') then
+ nbx = nbx + 1
+ call dcopy (n, resid, 1, workd(n+1), 1)
+ ipntr(1) = n + 1
+ ipntr(2) = 1
+ ido = 2
+c
+c %----------------------------------%
+c | Exit in order to compute B*RESID |
+c %----------------------------------%
+c
+ go to 9000
+ else if (bmat .eq. 'I') then
+ call dcopy (n, resid, 1, workd, 1)
+ end if
+c
+ 100 continue
+c
+c %----------------------------------%
+c | Back from reverse communication; |
+c | WORKD(1:N) := B*RESID |
+c %----------------------------------%
+c
+ if (bmat .eq. 'G') then
+ call second (t3)
+ tmvbx = tmvbx + (t3 - t2)
+ end if
+c
+ if (bmat .eq. 'G') then
+ rnorm = ddot (n, resid, 1, workd, 1)
+ rnorm = sqrt(abs(rnorm))
+ else if (bmat .eq. 'I') then
+ rnorm = dnrm2(n, resid, 1)
+ end if
+ cnorm = .false.
+ 130 continue
+c
+c if (msglvl .gt. 2) then
+c call dvout (logfil, 1, rnorm, ndigit,
+c & '_saup2: B-norm of residual for NEV factorization')
+c call dvout (logfil, nev, h(1,2), ndigit,
+c & '_saup2: main diagonal of compressed H matrix')
+c call dvout (logfil, nev-1, h(2,1), ndigit,
+c & '_saup2: subdiagonal of compressed H matrix')
+c end if
+c
+ go to 1000
+c
+c %---------------------------------------------------------------%
+c | |
+c | E N D O F M A I N I T E R A T I O N L O O P |
+c | |
+c %---------------------------------------------------------------%
+c
+ 1100 continue
+c
+ mxiter = iter
+ nev = nconv
+c
+ 1200 continue
+ ido = 99
+c
+c %------------%
+c | Error exit |
+c %------------%
+c
+ call second (t1)
+ tsaup2 = t1 - t0
+c
+ 9000 continue
+ return
+c
+c %---------------%
+c | End of dsaup2 |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.h
new file mode 100644
index 0000000000000000000000000000000000000000..70548b5be26a01f5204fa298251be088d97740cf
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaup2.h
@@ -0,0 +1,28 @@
+extern int v3p_netlib_dsaup2_(
+ v3p_netlib_integer *ido,
+ char *bmat,
+ v3p_netlib_integer *n,
+ char *which,
+ v3p_netlib_integer *nev,
+ v3p_netlib_integer *np,
+ v3p_netlib_doublereal *tol,
+ v3p_netlib_doublereal *resid,
+ v3p_netlib_integer *mode,
+ v3p_netlib_integer *iupd,
+ v3p_netlib_integer *ishift,
+ v3p_netlib_integer *mxiter,
+ v3p_netlib_doublereal *v,
+ v3p_netlib_integer *ldv,
+ v3p_netlib_doublereal *h__,
+ v3p_netlib_integer *ldh,
+ v3p_netlib_doublereal *ritz,
+ v3p_netlib_doublereal *bounds,
+ v3p_netlib_doublereal *q,
+ v3p_netlib_integer *ldq,
+ v3p_netlib_doublereal *workl,
+ v3p_netlib_integer *ipntr,
+ v3p_netlib_doublereal *workd,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen bmat_len,
+ v3p_netlib_ftnlen which_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.P
new file mode 100644
index 0000000000000000000000000000000000000000..dbf1106b1bbb20a6f9dfee8448ef3919e55d1620
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.P
@@ -0,0 +1,7 @@
+extern int dsaupd_(integer *ido, char *bmat, integer *n, char *which, integer *nev, doublereal *tol, doublereal *resid, integer *ncv, doublereal *v, integer *ldv, integer *iparam, integer *ipntr, doublereal *workd, doublereal *workl, integer *lworkl, integer *info, ftnlen bmat_len, ftnlen which_len);
+/* comlen debug_ 96 */
+/* comlen timing_ 124 */
+/*:ref: dstats_ 14 0 */
+/*:ref: second_ 14 1 6 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dsaup2_ 14 26 4 13 4 13 4 4 7 7 4 4 4 4 7 4 7 4 7 7 7 4 7 4 7 4 124 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.c
new file mode 100644
index 0000000000000000000000000000000000000000..261b4b63a81b85cb9435915d5e92f855e40ea851
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.c
@@ -0,0 +1,877 @@
+/* arpack/dsaupd.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Common Block Declarations */
+
+/*Extern struct { */
+/* integer logfil, ndigit, mgetv0, msaupd, msaup2, msaitr, mseigt, msapps, */
+/* msgets, mseupd, mnaupd, mnaup2, mnaitr, mneigh, mnapps, mngets, */
+/* mneupd, mcaupd, mcaup2, mcaitr, mceigh, mcapps, mcgets, mceupd; */
+/*} debug_; */
+
+/*#define debug_1 debug_ */
+
+/*Extern struct { */
+/* integer nopx, nbx, nrorth, nitref, nrstrt; */
+/* real tsaupd, tsaup2, tsaitr, tseigt, tsgets, tsapps, tsconv, tnaupd, */
+/* tnaup2, tnaitr, tneigh, tngets, tnapps, tnconv, tcaupd, tcaup2, */
+/* tcaitr, tceigh, tcgets, tcapps, tcconv, tmvopx, tmvbx, tgetv0, */
+/* titref, trvec; */
+/*} timing_; */
+
+/*#define timing_1 timing_ */
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dsaupd */
+
+/* \Description: */
+
+/* Reverse communication interface for the Implicitly Restarted Arnoldi */
+/* Iteration. For symmetric problems this reduces to a variant of the Lanczos */
+/* method. This method has been designed to compute approximations to a */
+/* few eigenpairs of a linear operator OP that is real and symmetric */
+/* with respect to a real positive semi-definite symmetric matrix B, */
+/* i.e. */
+
+/* B*OP = (OP')*B. */
+
+/* Another way to express this condition is */
+
+/* < x,OPy > = < OPx,y > where < z,w > = z'Bw . */
+
+/* In the standard eigenproblem B is the identity matrix. */
+/* ( A' denotes transpose of A) */
+
+/* The computed approximate eigenvalues are called Ritz values and */
+/* the corresponding approximate eigenvectors are called Ritz vectors. */
+
+/* dsaupd is usually called iteratively to solve one of the */
+/* following problems: */
+
+/* Mode 1: A*x = lambda*x, A symmetric */
+/* ===> OP = A and B = I. */
+
+/* Mode 2: A*x = lambda*M*x, A symmetric, M symmetric positive definite */
+/* ===> OP = inv[M]*A and B = M. */
+/* ===> (If M can be factored see remark 3 below) */
+
+/* Mode 3: K*x = lambda*M*x, K symmetric, M symmetric positive semi-definite */
+/* ===> OP = (inv[K - sigma*M])*M and B = M. */
+/* ===> Shift-and-Invert mode */
+
+/* Mode 4: K*x = lambda*KG*x, K symmetric positive semi-definite, */
+/* KG symmetric indefinite */
+/* ===> OP = (inv[K - sigma*KG])*K and B = K. */
+/* ===> Buckling mode */
+
+/* Mode 5: A*x = lambda*M*x, A symmetric, M symmetric positive semi-definite */
+/* ===> OP = inv[A - sigma*M]*[A + sigma*M] and B = M. */
+/* ===> Cayley transformed mode */
+
+/* NOTE: The action of w <- inv[A - sigma*M]*v or w <- inv[M]*v */
+/* should be accomplished either by a direct method */
+/* using a sparse matrix factorization and solving */
+
+/* [A - sigma*M]*w = v or M*w = v, */
+
+/* or through an iterative method for solving these */
+/* systems. If an iterative method is used, the */
+/* convergence test must be more stringent than */
+/* the accuracy requirements for the eigenvalue */
+/* approximations. */
+
+/* \Usage: */
+/* call dsaupd */
+/* ( IDO, BMAT, N, WHICH, NEV, TOL, RESID, NCV, V, LDV, IPARAM, */
+/* IPNTR, WORKD, WORKL, LWORKL, INFO ) */
+
+/* \Arguments */
+/* IDO Integer. (INPUT/OUTPUT) */
+/* Reverse communication flag. IDO must be zero on the first */
+/* call to dsaupd. IDO will be set internally to */
+/* indicate the type of operation to be performed. Control is */
+/* then given back to the calling routine which has the */
+/* responsibility to carry out the requested operation and call */
+/* dsaupd with the result. The operand is given in */
+/* WORKD(IPNTR(1)), the result must be put in WORKD(IPNTR(2)). */
+/* (If Mode = 2 see remark 5 below) */
+/* ------------------------------------------------------------- */
+/* IDO = 0: first call to the reverse communication interface */
+/* IDO = -1: compute Y = OP * X where */
+/* IPNTR(1) is the pointer into WORKD for X, */
+/* IPNTR(2) is the pointer into WORKD for Y. */
+/* This is for the initialization phase to force the */
+/* starting vector into the range of OP. */
+/* IDO = 1: compute Y = OP * X where */
+/* IPNTR(1) is the pointer into WORKD for X, */
+/* IPNTR(2) is the pointer into WORKD for Y. */
+/* In mode 3,4 and 5, the vector B * X is already */
+/* available in WORKD(ipntr(3)). It does not */
+/* need to be recomputed in forming OP * X. */
+/* IDO = 2: compute Y = B * X where */
+/* IPNTR(1) is the pointer into WORKD for X, */
+/* IPNTR(2) is the pointer into WORKD for Y. */
+/* IDO = 3: compute the IPARAM(8) shifts where */
+/* IPNTR(11) is the pointer into WORKL for */
+/* placing the shifts. See remark 6 below. */
+/* IDO = 99: done */
+/* ------------------------------------------------------------- */
+
+/* BMAT Character*1. (INPUT) */
+/* BMAT specifies the type of the matrix B that defines the */
+/* semi-inner product for the operator OP. */
+/* B = 'I' -> standard eigenvalue problem A*x = lambda*x */
+/* B = 'G' -> generalized eigenvalue problem A*x = lambda*B*x */
+
+/* N Integer. (INPUT) */
+/* Dimension of the eigenproblem. */
+
+/* WHICH Character*2. (INPUT) */
+/* Specify which of the Ritz values of OP to compute. */
+
+/* 'LA' - compute the NEV largest (algebraic) eigenvalues. */
+/* 'SA' - compute the NEV smallest (algebraic) eigenvalues. */
+/* 'LM' - compute the NEV largest (in magnitude) eigenvalues. */
+/* 'SM' - compute the NEV smallest (in magnitude) eigenvalues. */
+/* 'BE' - compute NEV eigenvalues, half from each end of the */
+/* spectrum. When NEV is odd, compute one more from the */
+/* high end than from the low end. */
+/* (see remark 1 below) */
+
+/* NEV Integer. (INPUT) */
+/* Number of eigenvalues of OP to be computed. 0 < NEV < N. */
+
+/* TOL Double precision scalar. (INPUT) */
+/* Stopping criterion: the relative accuracy of the Ritz value */
+/* is considered acceptable if BOUNDS(I) .LE. TOL*ABS(RITZ(I)). */
+/* If TOL .LE. 0. is passed a default is set: */
+/* DEFAULT = DLAMCH('EPS') (machine precision as computed */
+/* by the LAPACK auxiliary subroutine DLAMCH). */
+
+/* RESID Double precision array of length N. (INPUT/OUTPUT) */
+/* On INPUT: */
+/* If INFO .EQ. 0, a random initial residual vector is used. */
+/* If INFO .NE. 0, RESID contains the initial residual vector, */
+/* possibly from a previous run. */
+/* On OUTPUT: */
+/* RESID contains the final residual vector. */
+
+/* NCV Integer. (INPUT) */
+/* Number of columns of the matrix V (less than or equal to N). */
+/* This will indicate how many Lanczos vectors are generated */
+/* at each iteration. After the startup phase in which NEV */
+/* Lanczos vectors are generated, the algorithm generates */
+/* NCV-NEV Lanczos vectors at each subsequent update iteration. */
+/* Most of the cost in generating each Lanczos vector is in the */
+/* matrix-vector product OP*x. (See remark 4 below). */
+
+/* V Double precision N by NCV array. (OUTPUT) */
+/* The NCV columns of V contain the Lanczos basis vectors. */
+
+/* LDV Integer. (INPUT) */
+/* Leading dimension of V exactly as declared in the calling */
+/* program. */
+
+/* IPARAM Integer array of length 11. (INPUT/OUTPUT) */
+/* IPARAM(1) = ISHIFT: method for selecting the implicit shifts. */
+/* The shifts selected at each iteration are used to restart */
+/* the Arnoldi iteration in an implicit fashion. */
+/* ------------------------------------------------------------- */
+/* ISHIFT = 0: the shifts are provided by the user via */
+/* reverse communication. The NCV eigenvalues of */
+/* the current tridiagonal matrix T are returned in */
+/* the part of WORKL array corresponding to RITZ. */
+/* See remark 6 below. */
+/* ISHIFT = 1: exact shifts with respect to the reduced */
+/* tridiagonal matrix T. This is equivalent to */
+/* restarting the iteration with a starting vector */
+/* that is a linear combination of Ritz vectors */
+/* associated with the "wanted" Ritz values. */
+/* ------------------------------------------------------------- */
+
+/* IPARAM(2) = LEVEC */
+/* No longer referenced. See remark 2 below. */
+
+/* IPARAM(3) = MXITER */
+/* On INPUT: maximum number of Arnoldi update iterations allowed. */
+/* On OUTPUT: actual number of Arnoldi update iterations taken. */
+
+/* IPARAM(4) = NB: blocksize to be used in the recurrence. */
+/* The code currently works only for NB = 1. */
+
+/* IPARAM(5) = NCONV: number of "converged" Ritz values. */
+/* This represents the number of Ritz values that satisfy */
+/* the convergence criterion. */
+
+/* IPARAM(6) = IUPD */
+/* No longer referenced. Implicit restarting is ALWAYS used. */
+
+/* IPARAM(7) = MODE */
+/* On INPUT determines what type of eigenproblem is being solved. */
+/* Must be 1,2,3,4,5; See under \Description of dsaupd for the */
+/* five modes available. */
+
+/* IPARAM(8) = NP */
+/* When ido = 3 and the user provides shifts through reverse */
+/* communication (IPARAM(1)=0), dsaupd returns NP, the number */
+/* of shifts the user is to provide. 0 < NP <=NCV-NEV. See Remark */
+/* 6 below. */
+
+/* IPARAM(9) = NUMOP, IPARAM(10) = NUMOPB, IPARAM(11) = NUMREO, */
+/* OUTPUT: NUMOP = total number of OP*x operations, */
+/* NUMOPB = total number of B*x operations if BMAT='G', */
+/* NUMREO = total number of steps of re-orthogonalization. */
+
+/* IPNTR Integer array of length 11. (OUTPUT) */
+/* Pointer to mark the starting locations in the WORKD and WORKL */
+/* arrays for matrices/vectors used by the Lanczos iteration. */
+/* ------------------------------------------------------------- */
+/* IPNTR(1): pointer to the current operand vector X in WORKD. */
+/* IPNTR(2): pointer to the current result vector Y in WORKD. */
+/* IPNTR(3): pointer to the vector B * X in WORKD when used in */
+/* the shift-and-invert mode. */
+/* IPNTR(4): pointer to the next available location in WORKL */
+/* that is untouched by the program. */
+/* IPNTR(5): pointer to the NCV by 2 tridiagonal matrix T in WORKL. */
+/* IPNTR(6): pointer to the NCV RITZ values array in WORKL. */
+/* IPNTR(7): pointer to the Ritz estimates in array WORKL associated */
+/* with the Ritz values located in RITZ in WORKL. */
+/* IPNTR(11): pointer to the NP shifts in WORKL. See Remark 6 below. */
+
+/* Note: IPNTR(8:10) is only referenced by dseupd. See Remark 2. */
+/* IPNTR(8): pointer to the NCV RITZ values of the original system. */
+/* IPNTR(9): pointer to the NCV corresponding error bounds. */
+/* IPNTR(10): pointer to the NCV by NCV matrix of eigenvectors */
+/* of the tridiagonal matrix T. Only referenced by */
+/* dseupd if RVEC = .TRUE. See Remarks. */
+/* ------------------------------------------------------------- */
+
+/* WORKD Double precision work array of length 3*N. (REVERSE COMMUNICATION) */
+/* Distributed array to be used in the basic Arnoldi iteration */
+/* for reverse communication. The user should not use WORKD */
+/* as temporary workspace during the iteration. Upon termination */
+/* WORKD(1:N) contains B*RESID(1:N). If the Ritz vectors are desired */
+/* subroutine dseupd uses this output. */
+/* See Data Distribution Note below. */
+
+/* WORKL Double precision work array of length LWORKL. (OUTPUT/WORKSPACE) */
+/* Private (replicated) array on each PE or array allocated on */
+/* the front end. See Data Distribution Note below. */
+
+/* LWORKL Integer. (INPUT) */
+/* LWORKL must be at least NCV**2 + 8*NCV . */
+
+/* INFO Integer. (INPUT/OUTPUT) */
+/* If INFO .EQ. 0, a randomly initial residual vector is used. */
+/* If INFO .NE. 0, RESID contains the initial residual vector, */
+/* possibly from a previous run. */
+/* Error flag on output. */
+/* = 0: Normal exit. */
+/* = 1: Maximum number of iterations taken. */
+/* All possible eigenvalues of OP has been found. IPARAM(5) */
+/* returns the number of wanted converged Ritz values. */
+/* = 2: No longer an informational error. Deprecated starting */
+/* with release 2 of ARPACK. */
+/* = 3: No shifts could be applied during a cycle of the */
+/* Implicitly restarted Arnoldi iteration. One possibility */
+/* is to increase the size of NCV relative to NEV. */
+/* See remark 4 below. */
+/* = -1: N must be positive. */
+/* = -2: NEV must be positive. */
+/* = -3: NCV must be greater than NEV and less than or equal to N. */
+/* = -4: The maximum number of Arnoldi update iterations allowed */
+/* must be greater than zero. */
+/* = -5: WHICH must be one of 'LM', 'SM', 'LA', 'SA' or 'BE'. */
+/* = -6: BMAT must be one of 'I' or 'G'. */
+/* = -7: Length of private work array WORKL is not sufficient. */
+/* = -8: Error return from trid. eigenvalue calculation; */
+/* Informatinal error from LAPACK routine dsteqr. */
+/* = -9: Starting vector is zero. */
+/* = -10: IPARAM(7) must be 1,2,3,4,5. */
+/* = -11: IPARAM(7) = 1 and BMAT = 'G' are incompatable. */
+/* = -12: IPARAM(1) must be equal to 0 or 1. */
+/* = -13: NEV and WHICH = 'BE' are incompatable. */
+/* = -9999: Could not build an Arnoldi factorization. */
+/* IPARAM(5) returns the size of the current Arnoldi */
+/* factorization. The user is advised to check that */
+/* enough workspace and array storage has been allocated. */
+
+
+/* \Remarks */
+/* 1. The converged Ritz values are always returned in ascending */
+/* algebraic order. The computed Ritz values are approximate */
+/* eigenvalues of OP. The selection of WHICH should be made */
+/* with this in mind when Mode = 3,4,5. After convergence, */
+/* approximate eigenvalues of the original problem may be obtained */
+/* with the ARPACK subroutine dseupd. */
+
+/* 2. If the Ritz vectors corresponding to the converged Ritz values */
+/* are needed, the user must call dseupd immediately following completion */
+/* of dsaupd. This is new starting with version 2.1 of ARPACK. */
+
+/* 3. If M can be factored into a Cholesky factorization M = LL' */
+/* then Mode = 2 should not be selected. Instead one should use */
+/* Mode = 1 with OP = inv(L)*A*inv(L'). Appropriate triangular */
+/* linear systems should be solved with L and L' rather */
+/* than computing inverses. After convergence, an approximate */
+/* eigenvector z of the original problem is recovered by solving */
+/* L'z = x where x is a Ritz vector of OP. */
+
+/* 4. At present there is no a-priori analysis to guide the selection */
+/* of NCV relative to NEV. The only formal requirement is that NCV > NEV. */
+/* However, it is recommended that NCV .ge. 2*NEV. If many problems of */
+/* the same type are to be solved, one should experiment with increasing */
+/* NCV while keeping NEV fixed for a given test problem. This will */
+/* usually decrease the required number of OP*x operations but it */
+/* also increases the work and storage required to maintain the orthogonal */
+/* basis vectors. The optimal "cross-over" with respect to CPU time */
+/* is problem dependent and must be determined empirically. */
+
+/* 5. If IPARAM(7) = 2 then in the Reverse commuication interface the user */
+/* must do the following. When IDO = 1, Y = OP * X is to be computed. */
+/* When IPARAM(7) = 2 OP = inv(B)*A. After computing A*X the user */
+/* must overwrite X with A*X. Y is then the solution to the linear set */
+/* of equations B*Y = A*X. */
+
+/* 6. When IPARAM(1) = 0, and IDO = 3, the user needs to provide the */
+/* NP = IPARAM(8) shifts in locations: */
+/* 1 WORKL(IPNTR(11)) */
+/* 2 WORKL(IPNTR(11)+1) */
+/* . */
+/* . */
+/* . */
+/* NP WORKL(IPNTR(11)+NP-1). */
+
+/* The eigenvalues of the current tridiagonal matrix are located in */
+/* WORKL(IPNTR(6)) through WORKL(IPNTR(6)+NCV-1). They are in the */
+/* order defined by WHICH. The associated Ritz estimates are located in */
+/* WORKL(IPNTR(8)), WORKL(IPNTR(8)+1), ... , WORKL(IPNTR(8)+NCV-1). */
+
+/* ----------------------------------------------------------------------- */
+
+/* \Data Distribution Note: */
+
+/* Fortran-D syntax: */
+/* ================ */
+/* REAL RESID(N), V(LDV,NCV), WORKD(3*N), WORKL(LWORKL) */
+/* DECOMPOSE D1(N), D2(N,NCV) */
+/* ALIGN RESID(I) with D1(I) */
+/* ALIGN V(I,J) with D2(I,J) */
+/* ALIGN WORKD(I) with D1(I) range (1:N) */
+/* ALIGN WORKD(I) with D1(I-N) range (N+1:2*N) */
+/* ALIGN WORKD(I) with D1(I-2*N) range (2*N+1:3*N) */
+/* DISTRIBUTE D1(BLOCK), D2(BLOCK,:) */
+/* REPLICATED WORKL(LWORKL) */
+
+/* Cray MPP syntax: */
+/* =============== */
+/* REAL RESID(N), V(LDV,NCV), WORKD(N,3), WORKL(LWORKL) */
+/* SHARED RESID(BLOCK), V(BLOCK,:), WORKD(BLOCK,:) */
+/* REPLICATED WORKL(LWORKL) */
+
+
+/* \BeginLib */
+
+/* \References: */
+/* 1. D.C. Sorensen, "Implicit Application of Polynomial Filters in */
+/* a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992), */
+/* pp 357-385. */
+/* 2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly */
+/* Restarted Arnoldi Iteration", Rice University Technical Report */
+/* TR95-13, Department of Computational and Applied Mathematics. */
+/* 3. B.N. Parlett, "The Symmetric Eigenvalue Problem". Prentice-Hall, */
+/* 1980. */
+/* 4. B.N. Parlett, B. Nour-Omid, "Towards a Black Box Lanczos Program", */
+/* Computer Physics Communications, 53 (1989), pp 169-179. */
+/* 5. B. Nour-Omid, B.N. Parlett, T. Ericson, P.S. Jensen, "How to */
+/* Implement the Spectral Transformation", Math. Comp., 48 (1987), */
+/* pp 663-673. */
+/* 6. R.G. Grimes, J.G. Lewis and H.D. Simon, "A Shifted Block Lanczos */
+/* Algorithm for Solving Sparse Symmetric Generalized Eigenproblems", */
+/* SIAM J. Matr. Anal. Apps., January (1993). */
+/* 7. L. Reichel, W.B. Gragg, "Algorithm 686: FORTRAN Subroutines */
+/* for Updating the QR decomposition", ACM TOMS, December 1990, */
+/* Volume 16 Number 4, pp 369-377. */
+/* 8. R.B. Lehoucq, D.C. Sorensen, "Implementation of Some Spectral */
+/* Transformations in a k-Step Arnoldi Method". In Preparation. */
+
+/* \Routines called: */
+/* dsaup2 ARPACK routine that implements the Implicitly Restarted */
+/* Arnoldi Iteration. */
+/* dstats ARPACK routine that initialize timing and other statistics */
+/* variables. */
+/* second ARPACK utility routine for timing. */
+/* dlamch LAPACK routine that determines machine constants. */
+
+/* \Authors */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \Revision history: */
+/* 12/15/93: Version ' 2.4' */
+
+/* \SCCS Information: @(#) */
+/* FILE: saupd.F SID: 2.7 DATE OF SID: 8/27/96 RELEASE: 2 */
+
+/* \Remarks */
+/* 1. None */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< >*/
+/* Subroutine */ int dsaupd_(integer *ido, char *bmat, integer *n, char *
+ which, integer *nev, doublereal *tol, doublereal *resid, integer *ncv,
+ doublereal *v, integer *ldv, integer *iparam, integer *ipntr,
+ doublereal *workd, doublereal *workl, integer *lworkl, integer *info,
+ ftnlen bmat_len, ftnlen which_len)
+{
+ /* System generated locals */
+ integer v_dim1, v_offset, i__1, i__2;
+
+ /* Builtin functions */
+ integer s_cmp(char *, char *, ftnlen, ftnlen);
+
+ /* Local variables */
+ integer j;
+/* static real t0, t1; */
+ static integer nb, ih, iq, np, iw, ldh, ldq, nev0, mode, ierr, iupd, next,
+ ritz;
+ extern /* Subroutine */ int dsaup2_(integer *, char *, integer *, char *,
+ integer *, integer *, doublereal *, doublereal *, integer *,
+ integer *, integer *, integer *, doublereal *, integer *,
+ doublereal *, integer *, doublereal *, doublereal *, doublereal *,
+ integer *, doublereal *, integer *, doublereal *, integer *,
+ ftnlen, ftnlen);
+ extern doublereal dlamch_(char *, ftnlen);
+ extern /* Subroutine */ int second_(real *);
+ static integer bounds, ishift, /* msglvl, */ mxiter;
+ extern /* Subroutine */ int dstats_();
+
+
+/* %----------------------------------------------------% */
+/* | Include files for debugging and timing information | */
+/* %----------------------------------------------------% */
+
+/*< include 'debug.h' >*/
+/*< include 'stat.h' >*/
+
+/* \SCCS Information: @(#) */
+/* FILE: debug.h SID: 2.3 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/* %---------------------------------% */
+/* | See debug.doc for documentation | */
+/* %---------------------------------% */
+/*< >*/
+/*< character bmat*1, which*2 >*/
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/* %--------------------------------% */
+/* | See stat.doc for documentation | */
+/* %--------------------------------% */
+
+/* \SCCS Information: @(#) */
+/* FILE: stat.h SID: 2.2 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/*< save t0, t1, t2, t3, t4, t5 >*/
+
+/*< integer nopx, nbx, nrorth, nitref, nrstrt >*/
+/*< >*/
+/*< >*/
+/*< integer ido, info, ldv, lworkl, n, ncv, nev >*/
+/*< >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< integer iparam(11), ipntr(11) >*/
+/*< >*/
+
+/* %------------% */
+/* | Parameters | */
+/* %------------% */
+
+/*< >*/
+/*< parameter (one = 1.0D+0, zero = 0.0D+0) >*/
+
+/* %---------------% */
+/* | Local Scalars | */
+/* %---------------% */
+
+/*< >*/
+/*< >*/
+
+/* %----------------------% */
+/* | External Subroutines | */
+/* %----------------------% */
+
+/*< external dsaup2, second, dstats >*/
+
+/* %--------------------% */
+/* | External Functions | */
+/* %--------------------% */
+
+/*< >*/
+/*< external dlamch >*/
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+/*< if (ido .eq. 0) then >*/
+ /* Parameter adjustments */
+ --workd;
+ --resid;
+ v_dim1 = *ldv;
+ v_offset = 1 + v_dim1;
+ v -= v_offset;
+ --iparam;
+ --ipntr;
+ --workl;
+
+ /* Function Body */
+ if (*ido == 0) {
+
+/* %-------------------------------% */
+/* | Initialize timing statistics | */
+/* | & message level for debugging | */
+/* %-------------------------------% */
+
+/*< call dstats >*/
+/* dstats_(); */
+/*< call second (t0) >*/
+/* second_(&t0); */
+/*< msglvl = msaupd >*/
+/* msglvl = debug_1.msaupd; */
+
+/*< ierr = 0 >*/
+ ierr = 0;
+/*< ishift = iparam(1) >*/
+ ishift = iparam[1];
+/*< mxiter = iparam(3) >*/
+ mxiter = iparam[3];
+/*< nb = iparam(4) >*/
+ nb = iparam[4];
+
+/* %--------------------------------------------% */
+/* | Revision 2 performs only implicit restart. | */
+/* %--------------------------------------------% */
+
+/*< iupd = 1 >*/
+ iupd = 1;
+/*< mode = iparam(7) >*/
+ mode = iparam[7];
+
+/* %----------------% */
+/* | Error checking | */
+/* %----------------% */
+
+/*< if (n .le. 0) then >*/
+ if (*n <= 0) {
+/*< ierr = -1 >*/
+ ierr = -1;
+/*< else if (nev .le. 0) then >*/
+ } else if (*nev <= 0) {
+/*< ierr = -2 >*/
+ ierr = -2;
+/*< else if (ncv .le. nev .or. ncv .gt. n) then >*/
+ } else if (*ncv <= *nev || *ncv > *n) {
+/*< ierr = -3 >*/
+ ierr = -3;
+/*< end if >*/
+ }
+
+/* %----------------------------------------------% */
+/* | NP is the number of additional steps to | */
+/* | extend the length NEV Lanczos factorization. | */
+/* %----------------------------------------------% */
+
+/*< np = ncv - nev >*/
+ np = *ncv - *nev;
+
+/*< if (mxiter .le. 0) ierr = -4 >*/
+ if (mxiter <= 0) {
+ ierr = -4;
+ }
+/*< >*/
+ if (s_cmp(which, "LM", (ftnlen)2, (ftnlen)2) != 0 && s_cmp(which,
+ "SM", (ftnlen)2, (ftnlen)2) != 0 && s_cmp(which, "LA", (
+ ftnlen)2, (ftnlen)2) != 0 && s_cmp(which, "SA", (ftnlen)2, (
+ ftnlen)2) != 0 && s_cmp(which, "BE", (ftnlen)2, (ftnlen)2) !=
+ 0) {
+ ierr = -5;
+ }
+/*< if (bmat .ne. 'I' .and. bmat .ne. 'G') ierr = -6 >*/
+ if (*(unsigned char *)bmat != 'I' && *(unsigned char *)bmat != 'G') {
+ ierr = -6;
+ }
+
+/*< if (lworkl .lt. ncv**2 + 8*ncv) ierr = -7 >*/
+/* Computing 2nd power */
+ i__1 = *ncv;
+ if (*lworkl < i__1 * i__1 + (*ncv << 3)) {
+ ierr = -7;
+ }
+/*< if (mode .lt. 1 .or. mode .gt. 5) then >*/
+ if (mode < 1 || mode > 5) {
+/*< ierr = -10 >*/
+ ierr = -10;
+/*< else if (mode .eq. 1 .and. bmat .eq. 'G') then >*/
+ } else if (mode == 1 && *(unsigned char *)bmat == 'G') {
+/*< ierr = -11 >*/
+ ierr = -11;
+/*< else if (ishift .lt. 0 .or. ishift .gt. 1) then >*/
+ } else if (ishift < 0 || ishift > 1) {
+/*< ierr = -12 >*/
+ ierr = -12;
+/*< else if (nev .eq. 1 .and. which .eq. 'BE') then >*/
+ } else if (*nev == 1 && s_cmp(which, "BE", (ftnlen)2, (ftnlen)2) == 0)
+ {
+/*< ierr = -13 >*/
+ ierr = -13;
+/*< end if >*/
+ }
+
+/* %------------% */
+/* | Error Exit | */
+/* %------------% */
+
+/*< if (ierr .ne. 0) then >*/
+ if (ierr != 0) {
+/*< info = ierr >*/
+ *info = ierr;
+/*< ido = 99 >*/
+ *ido = 99;
+/*< go to 9000 >*/
+ goto L9000;
+/*< end if >*/
+ }
+
+/* %------------------------% */
+/* | Set default parameters | */
+/* %------------------------% */
+
+/*< if (nb .le. 0) nb = 1 >*/
+ if (nb <= 0) {
+ nb = 1;
+ }
+/*< if (tol .le. zero) tol = dlamch('EpsMach') >*/
+ if (*tol <= 0.) {
+ *tol = dlamch_("EpsMach", (ftnlen)7);
+ }
+
+/* %----------------------------------------------% */
+/* | NP is the number of additional steps to | */
+/* | extend the length NEV Lanczos factorization. | */
+/* | NEV0 is the local variable designating the | */
+/* | size of the invariant subspace desired. | */
+/* %----------------------------------------------% */
+
+/*< np = ncv - nev >*/
+ np = *ncv - *nev;
+/*< nev0 = nev >*/
+ nev0 = *nev;
+
+/* %-----------------------------% */
+/* | Zero out internal workspace | */
+/* %-----------------------------% */
+
+/*< do 10 j = 1, ncv**2 + 8*ncv >*/
+/* Computing 2nd power */
+ i__2 = *ncv;
+ i__1 = i__2 * i__2 + (*ncv << 3);
+ for (j = 1; j <= i__1; ++j) {
+/*< workl(j) = zero >*/
+ workl[j] = 0.;
+/*< 10 continue >*/
+/* L10: */
+ }
+
+/* %-------------------------------------------------------% */
+/* | Pointer into WORKL for address of H, RITZ, BOUNDS, Q | */
+/* | etc... and the remaining workspace. | */
+/* | Also update pointer to be used on output. | */
+/* | Memory is laid out as follows: | */
+/* | workl(1:2*ncv) := generated tridiagonal matrix | */
+/* | workl(2*ncv+1:2*ncv+ncv) := ritz values | */
+/* | workl(3*ncv+1:3*ncv+ncv) := computed error bounds | */
+/* | workl(4*ncv+1:4*ncv+ncv*ncv) := rotation matrix Q | */
+/* | workl(4*ncv+ncv*ncv+1:7*ncv+ncv*ncv) := workspace | */
+/* %-------------------------------------------------------% */
+
+/*< ldh = ncv >*/
+ ldh = *ncv;
+/*< ldq = ncv >*/
+ ldq = *ncv;
+/*< ih = 1 >*/
+ ih = 1;
+/*< ritz = ih + 2*ldh >*/
+ ritz = ih + (ldh << 1);
+/*< bounds = ritz + ncv >*/
+ bounds = ritz + *ncv;
+/*< iq = bounds + ncv >*/
+ iq = bounds + *ncv;
+/*< iw = iq + ncv**2 >*/
+/* Computing 2nd power */
+ i__1 = *ncv;
+ iw = iq + i__1 * i__1;
+/*< next = iw + 3*ncv >*/
+ next = iw + *ncv * 3;
+
+/*< ipntr(4) = next >*/
+ ipntr[4] = next;
+/*< ipntr(5) = ih >*/
+ ipntr[5] = ih;
+/*< ipntr(6) = ritz >*/
+ ipntr[6] = ritz;
+/*< ipntr(7) = bounds >*/
+ ipntr[7] = bounds;
+/*< ipntr(11) = iw >*/
+ ipntr[11] = iw;
+/*< end if >*/
+ }
+
+/* %-------------------------------------------------------% */
+/* | Carry out the Implicitly restarted Lanczos Iteration. | */
+/* %-------------------------------------------------------% */
+
+/*< >*/
+ dsaup2_(ido, bmat, n, which, &nev0, &np, tol, &resid[1], &mode, &iupd, &
+ ishift, &mxiter, &v[v_offset], ldv, &workl[ih], &ldh, &workl[ritz]
+ , &workl[bounds], &workl[iq], &ldq, &workl[iw], &ipntr[1], &workd[
+ 1], info, (ftnlen)1, (ftnlen)2);
+
+/* %--------------------------------------------------% */
+/* | ido .ne. 99 implies use of reverse communication | */
+/* | to compute operations involving OP or shifts. | */
+/* %--------------------------------------------------% */
+
+/*< if (ido .eq. 3) iparam(8) = np >*/
+ if (*ido == 3) {
+ iparam[8] = np;
+ }
+/*< if (ido .ne. 99) go to 9000 >*/
+ if (*ido != 99) {
+ goto L9000;
+ }
+
+/*< iparam(3) = mxiter >*/
+ iparam[3] = mxiter;
+/*< iparam(5) = np >*/
+ iparam[5] = np;
+/*< iparam(9) = nopx >*/
+/* iparam[9] = timing_1.nopx; */
+/*< iparam(10) = nbx >*/
+/* iparam[10] = timing_1.nbx; */
+/*< iparam(11) = nrorth >*/
+/* iparam[11] = timing_1.nrorth; */
+
+/* %------------------------------------% */
+/* | Exit if there was an informational | */
+/* | error within dsaup2. | */
+/* %------------------------------------% */
+
+/*< if (info .lt. 0) go to 9000 >*/
+ if (*info < 0) {
+ goto L9000;
+ }
+/*< if (info .eq. 2) info = 3 >*/
+ if (*info == 2) {
+ *info = 3;
+ }
+
+/* if (msglvl .gt. 0) then */
+/* call ivout (logfil, 1, mxiter, ndigit, */
+/* & '_saupd: number of update iterations taken') */
+/* call ivout (logfil, 1, np, ndigit, */
+/* & '_saupd: number of "converged" Ritz values') */
+/* call dvout (logfil, np, workl(Ritz), ndigit, */
+/* & '_saupd: final Ritz values') */
+/* call dvout (logfil, np, workl(Bounds), ndigit, */
+/* & '_saupd: corresponding error bounds') */
+/* end if */
+
+/*< call second (t1) >*/
+/* second_(&t1); */
+/*< tsaupd = t1 - t0 >*/
+/* timing_1.tsaupd = t1 - t0; */
+
+/* if (msglvl .gt. 0) then */
+
+/* %--------------------------------------------------------% */
+/* | Version Number & Version Date are defined in version.h | */
+/* %--------------------------------------------------------% */
+
+/* write (6,1000) */
+/* write (6,1100) mxiter, nopx, nbx, nrorth, nitref, nrstrt, */
+/* & tmvopx, tmvbx, tsaupd, tsaup2, tsaitr, titref, */
+/* & tgetv0, tseigt, tsgets, tsapps, tsconv */
+/* 1000 format (//, */
+/* & 5x, '==========================================',/ */
+/* & 5x, '= Symmetric implicit Arnoldi update code =',/ */
+/* & 5x, '= Version Number:', ' 2.4', 19x, ' =',/ */
+/* & 5x, '= Version Date: ', ' 07/31/96', 14x, ' =',/ */
+/* & 5x, '==========================================',/ */
+/* & 5x, '= Summary of timing statistics =',/ */
+/* & 5x, '==========================================',//) */
+/* 1100 format ( */
+/* & 5x, 'Total number update iterations = ', i5,/ */
+/* & 5x, 'Total number of OP*x operations = ', i5,/ */
+/* & 5x, 'Total number of B*x operations = ', i5,/ */
+/* & 5x, 'Total number of reorthogonalization steps = ', i5,/ */
+/* & 5x, 'Total number of iterative refinement steps = ', i5,/ */
+/* & 5x, 'Total number of restart steps = ', i5,/ */
+/* & 5x, 'Total time in user OP*x operation = ', f12.6,/ */
+/* & 5x, 'Total time in user B*x operation = ', f12.6,/ */
+/* & 5x, 'Total time in Arnoldi update routine = ', f12.6,/ */
+/* & 5x, 'Total time in saup2 routine = ', f12.6,/ */
+/* & 5x, 'Total time in basic Arnoldi iteration loop = ', f12.6,/ */
+/* & 5x, 'Total time in reorthogonalization phase = ', f12.6,/ */
+/* & 5x, 'Total time in (re)start vector generation = ', f12.6,/ */
+/* & 5x, 'Total time in trid eigenvalue subproblem = ', f12.6,/ */
+/* & 5x, 'Total time in getting the shifts = ', f12.6,/ */
+/* & 5x, 'Total time in applying the shifts = ', f12.6,/ */
+/* & 5x, 'Total time in convergence testing = ', f12.6) */
+/* end if */
+
+/*< 9000 continue >*/
+L9000:
+
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dsaupd | */
+/* %---------------% */
+
+/*< end >*/
+} /* dsaupd_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.f
new file mode 100644
index 0000000000000000000000000000000000000000..a5a0338e8439c4c8c508069139d87f0a0418614c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.f
@@ -0,0 +1,687 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dsaupd
+c
+c\Description:
+c
+c Reverse communication interface for the Implicitly Restarted Arnoldi
+c Iteration. For symmetric problems this reduces to a variant of the Lanczos
+c method. This method has been designed to compute approximations to a
+c few eigenpairs of a linear operator OP that is real and symmetric
+c with respect to a real positive semi-definite symmetric matrix B,
+c i.e.
+c
+c B*OP = (OP')*B.
+c
+c Another way to express this condition is
+c
+c < x,OPy > = < OPx,y > where < z,w > = z'Bw .
+c
+c In the standard eigenproblem B is the identity matrix.
+c ( A' denotes transpose of A)
+c
+c The computed approximate eigenvalues are called Ritz values and
+c the corresponding approximate eigenvectors are called Ritz vectors.
+c
+c dsaupd is usually called iteratively to solve one of the
+c following problems:
+c
+c Mode 1: A*x = lambda*x, A symmetric
+c ===> OP = A and B = I.
+c
+c Mode 2: A*x = lambda*M*x, A symmetric, M symmetric positive definite
+c ===> OP = inv[M]*A and B = M.
+c ===> (If M can be factored see remark 3 below)
+c
+c Mode 3: K*x = lambda*M*x, K symmetric, M symmetric positive semi-definite
+c ===> OP = (inv[K - sigma*M])*M and B = M.
+c ===> Shift-and-Invert mode
+c
+c Mode 4: K*x = lambda*KG*x, K symmetric positive semi-definite,
+c KG symmetric indefinite
+c ===> OP = (inv[K - sigma*KG])*K and B = K.
+c ===> Buckling mode
+c
+c Mode 5: A*x = lambda*M*x, A symmetric, M symmetric positive semi-definite
+c ===> OP = inv[A - sigma*M]*[A + sigma*M] and B = M.
+c ===> Cayley transformed mode
+c
+c NOTE: The action of w <- inv[A - sigma*M]*v or w <- inv[M]*v
+c should be accomplished either by a direct method
+c using a sparse matrix factorization and solving
+c
+c [A - sigma*M]*w = v or M*w = v,
+c
+c or through an iterative method for solving these
+c systems. If an iterative method is used, the
+c convergence test must be more stringent than
+c the accuracy requirements for the eigenvalue
+c approximations.
+c
+c\Usage:
+c call dsaupd
+c ( IDO, BMAT, N, WHICH, NEV, TOL, RESID, NCV, V, LDV, IPARAM,
+c IPNTR, WORKD, WORKL, LWORKL, INFO )
+c
+c\Arguments
+c IDO Integer. (INPUT/OUTPUT)
+c Reverse communication flag. IDO must be zero on the first
+c call to dsaupd. IDO will be set internally to
+c indicate the type of operation to be performed. Control is
+c then given back to the calling routine which has the
+c responsibility to carry out the requested operation and call
+c dsaupd with the result. The operand is given in
+c WORKD(IPNTR(1)), the result must be put in WORKD(IPNTR(2)).
+c (If Mode = 2 see remark 5 below)
+c -------------------------------------------------------------
+c IDO = 0: first call to the reverse communication interface
+c IDO = -1: compute Y = OP * X where
+c IPNTR(1) is the pointer into WORKD for X,
+c IPNTR(2) is the pointer into WORKD for Y.
+c This is for the initialization phase to force the
+c starting vector into the range of OP.
+c IDO = 1: compute Y = OP * X where
+c IPNTR(1) is the pointer into WORKD for X,
+c IPNTR(2) is the pointer into WORKD for Y.
+c In mode 3,4 and 5, the vector B * X is already
+c available in WORKD(ipntr(3)). It does not
+c need to be recomputed in forming OP * X.
+c IDO = 2: compute Y = B * X where
+c IPNTR(1) is the pointer into WORKD for X,
+c IPNTR(2) is the pointer into WORKD for Y.
+c IDO = 3: compute the IPARAM(8) shifts where
+c IPNTR(11) is the pointer into WORKL for
+c placing the shifts. See remark 6 below.
+c IDO = 99: done
+c -------------------------------------------------------------
+c
+c BMAT Character*1. (INPUT)
+c BMAT specifies the type of the matrix B that defines the
+c semi-inner product for the operator OP.
+c B = 'I' -> standard eigenvalue problem A*x = lambda*x
+c B = 'G' -> generalized eigenvalue problem A*x = lambda*B*x
+c
+c N Integer. (INPUT)
+c Dimension of the eigenproblem.
+c
+c WHICH Character*2. (INPUT)
+c Specify which of the Ritz values of OP to compute.
+c
+c 'LA' - compute the NEV largest (algebraic) eigenvalues.
+c 'SA' - compute the NEV smallest (algebraic) eigenvalues.
+c 'LM' - compute the NEV largest (in magnitude) eigenvalues.
+c 'SM' - compute the NEV smallest (in magnitude) eigenvalues.
+c 'BE' - compute NEV eigenvalues, half from each end of the
+c spectrum. When NEV is odd, compute one more from the
+c high end than from the low end.
+c (see remark 1 below)
+c
+c NEV Integer. (INPUT)
+c Number of eigenvalues of OP to be computed. 0 < NEV < N.
+c
+c TOL Double precision scalar. (INPUT)
+c Stopping criterion: the relative accuracy of the Ritz value
+c is considered acceptable if BOUNDS(I) .LE. TOL*ABS(RITZ(I)).
+c If TOL .LE. 0. is passed a default is set:
+c DEFAULT = DLAMCH('EPS') (machine precision as computed
+c by the LAPACK auxiliary subroutine DLAMCH).
+c
+c RESID Double precision array of length N. (INPUT/OUTPUT)
+c On INPUT:
+c If INFO .EQ. 0, a random initial residual vector is used.
+c If INFO .NE. 0, RESID contains the initial residual vector,
+c possibly from a previous run.
+c On OUTPUT:
+c RESID contains the final residual vector.
+c
+c NCV Integer. (INPUT)
+c Number of columns of the matrix V (less than or equal to N).
+c This will indicate how many Lanczos vectors are generated
+c at each iteration. After the startup phase in which NEV
+c Lanczos vectors are generated, the algorithm generates
+c NCV-NEV Lanczos vectors at each subsequent update iteration.
+c Most of the cost in generating each Lanczos vector is in the
+c matrix-vector product OP*x. (See remark 4 below).
+c
+c V Double precision N by NCV array. (OUTPUT)
+c The NCV columns of V contain the Lanczos basis vectors.
+c
+c LDV Integer. (INPUT)
+c Leading dimension of V exactly as declared in the calling
+c program.
+c
+c IPARAM Integer array of length 11. (INPUT/OUTPUT)
+c IPARAM(1) = ISHIFT: method for selecting the implicit shifts.
+c The shifts selected at each iteration are used to restart
+c the Arnoldi iteration in an implicit fashion.
+c -------------------------------------------------------------
+c ISHIFT = 0: the shifts are provided by the user via
+c reverse communication. The NCV eigenvalues of
+c the current tridiagonal matrix T are returned in
+c the part of WORKL array corresponding to RITZ.
+c See remark 6 below.
+c ISHIFT = 1: exact shifts with respect to the reduced
+c tridiagonal matrix T. This is equivalent to
+c restarting the iteration with a starting vector
+c that is a linear combination of Ritz vectors
+c associated with the "wanted" Ritz values.
+c -------------------------------------------------------------
+c
+c IPARAM(2) = LEVEC
+c No longer referenced. See remark 2 below.
+c
+c IPARAM(3) = MXITER
+c On INPUT: maximum number of Arnoldi update iterations allowed.
+c On OUTPUT: actual number of Arnoldi update iterations taken.
+c
+c IPARAM(4) = NB: blocksize to be used in the recurrence.
+c The code currently works only for NB = 1.
+c
+c IPARAM(5) = NCONV: number of "converged" Ritz values.
+c This represents the number of Ritz values that satisfy
+c the convergence criterion.
+c
+c IPARAM(6) = IUPD
+c No longer referenced. Implicit restarting is ALWAYS used.
+c
+c IPARAM(7) = MODE
+c On INPUT determines what type of eigenproblem is being solved.
+c Must be 1,2,3,4,5; See under \Description of dsaupd for the
+c five modes available.
+c
+c IPARAM(8) = NP
+c When ido = 3 and the user provides shifts through reverse
+c communication (IPARAM(1)=0), dsaupd returns NP, the number
+c of shifts the user is to provide. 0 < NP <=NCV-NEV. See Remark
+c 6 below.
+c
+c IPARAM(9) = NUMOP, IPARAM(10) = NUMOPB, IPARAM(11) = NUMREO,
+c OUTPUT: NUMOP = total number of OP*x operations,
+c NUMOPB = total number of B*x operations if BMAT='G',
+c NUMREO = total number of steps of re-orthogonalization.
+c
+c IPNTR Integer array of length 11. (OUTPUT)
+c Pointer to mark the starting locations in the WORKD and WORKL
+c arrays for matrices/vectors used by the Lanczos iteration.
+c -------------------------------------------------------------
+c IPNTR(1): pointer to the current operand vector X in WORKD.
+c IPNTR(2): pointer to the current result vector Y in WORKD.
+c IPNTR(3): pointer to the vector B * X in WORKD when used in
+c the shift-and-invert mode.
+c IPNTR(4): pointer to the next available location in WORKL
+c that is untouched by the program.
+c IPNTR(5): pointer to the NCV by 2 tridiagonal matrix T in WORKL.
+c IPNTR(6): pointer to the NCV RITZ values array in WORKL.
+c IPNTR(7): pointer to the Ritz estimates in array WORKL associated
+c with the Ritz values located in RITZ in WORKL.
+c IPNTR(11): pointer to the NP shifts in WORKL. See Remark 6 below.
+c
+c Note: IPNTR(8:10) is only referenced by dseupd. See Remark 2.
+c IPNTR(8): pointer to the NCV RITZ values of the original system.
+c IPNTR(9): pointer to the NCV corresponding error bounds.
+c IPNTR(10): pointer to the NCV by NCV matrix of eigenvectors
+c of the tridiagonal matrix T. Only referenced by
+c dseupd if RVEC = .TRUE. See Remarks.
+c -------------------------------------------------------------
+c
+c WORKD Double precision work array of length 3*N. (REVERSE COMMUNICATION)
+c Distributed array to be used in the basic Arnoldi iteration
+c for reverse communication. The user should not use WORKD
+c as temporary workspace during the iteration. Upon termination
+c WORKD(1:N) contains B*RESID(1:N). If the Ritz vectors are desired
+c subroutine dseupd uses this output.
+c See Data Distribution Note below.
+c
+c WORKL Double precision work array of length LWORKL. (OUTPUT/WORKSPACE)
+c Private (replicated) array on each PE or array allocated on
+c the front end. See Data Distribution Note below.
+c
+c LWORKL Integer. (INPUT)
+c LWORKL must be at least NCV**2 + 8*NCV .
+c
+c INFO Integer. (INPUT/OUTPUT)
+c If INFO .EQ. 0, a randomly initial residual vector is used.
+c If INFO .NE. 0, RESID contains the initial residual vector,
+c possibly from a previous run.
+c Error flag on output.
+c = 0: Normal exit.
+c = 1: Maximum number of iterations taken.
+c All possible eigenvalues of OP has been found. IPARAM(5)
+c returns the number of wanted converged Ritz values.
+c = 2: No longer an informational error. Deprecated starting
+c with release 2 of ARPACK.
+c = 3: No shifts could be applied during a cycle of the
+c Implicitly restarted Arnoldi iteration. One possibility
+c is to increase the size of NCV relative to NEV.
+c See remark 4 below.
+c = -1: N must be positive.
+c = -2: NEV must be positive.
+c = -3: NCV must be greater than NEV and less than or equal to N.
+c = -4: The maximum number of Arnoldi update iterations allowed
+c must be greater than zero.
+c = -5: WHICH must be one of 'LM', 'SM', 'LA', 'SA' or 'BE'.
+c = -6: BMAT must be one of 'I' or 'G'.
+c = -7: Length of private work array WORKL is not sufficient.
+c = -8: Error return from trid. eigenvalue calculation;
+c Informatinal error from LAPACK routine dsteqr.
+c = -9: Starting vector is zero.
+c = -10: IPARAM(7) must be 1,2,3,4,5.
+c = -11: IPARAM(7) = 1 and BMAT = 'G' are incompatable.
+c = -12: IPARAM(1) must be equal to 0 or 1.
+c = -13: NEV and WHICH = 'BE' are incompatable.
+c = -9999: Could not build an Arnoldi factorization.
+c IPARAM(5) returns the size of the current Arnoldi
+c factorization. The user is advised to check that
+c enough workspace and array storage has been allocated.
+c
+c
+c\Remarks
+c 1. The converged Ritz values are always returned in ascending
+c algebraic order. The computed Ritz values are approximate
+c eigenvalues of OP. The selection of WHICH should be made
+c with this in mind when Mode = 3,4,5. After convergence,
+c approximate eigenvalues of the original problem may be obtained
+c with the ARPACK subroutine dseupd.
+c
+c 2. If the Ritz vectors corresponding to the converged Ritz values
+c are needed, the user must call dseupd immediately following completion
+c of dsaupd. This is new starting with version 2.1 of ARPACK.
+c
+c 3. If M can be factored into a Cholesky factorization M = LL'
+c then Mode = 2 should not be selected. Instead one should use
+c Mode = 1 with OP = inv(L)*A*inv(L'). Appropriate triangular
+c linear systems should be solved with L and L' rather
+c than computing inverses. After convergence, an approximate
+c eigenvector z of the original problem is recovered by solving
+c L'z = x where x is a Ritz vector of OP.
+c
+c 4. At present there is no a-priori analysis to guide the selection
+c of NCV relative to NEV. The only formal requirement is that NCV > NEV.
+c However, it is recommended that NCV .ge. 2*NEV. If many problems of
+c the same type are to be solved, one should experiment with increasing
+c NCV while keeping NEV fixed for a given test problem. This will
+c usually decrease the required number of OP*x operations but it
+c also increases the work and storage required to maintain the orthogonal
+c basis vectors. The optimal "cross-over" with respect to CPU time
+c is problem dependent and must be determined empirically.
+c
+c 5. If IPARAM(7) = 2 then in the Reverse commuication interface the user
+c must do the following. When IDO = 1, Y = OP * X is to be computed.
+c When IPARAM(7) = 2 OP = inv(B)*A. After computing A*X the user
+c must overwrite X with A*X. Y is then the solution to the linear set
+c of equations B*Y = A*X.
+c
+c 6. When IPARAM(1) = 0, and IDO = 3, the user needs to provide the
+c NP = IPARAM(8) shifts in locations:
+c 1 WORKL(IPNTR(11))
+c 2 WORKL(IPNTR(11)+1)
+c .
+c .
+c .
+c NP WORKL(IPNTR(11)+NP-1).
+c
+c The eigenvalues of the current tridiagonal matrix are located in
+c WORKL(IPNTR(6)) through WORKL(IPNTR(6)+NCV-1). They are in the
+c order defined by WHICH. The associated Ritz estimates are located in
+c WORKL(IPNTR(8)), WORKL(IPNTR(8)+1), ... , WORKL(IPNTR(8)+NCV-1).
+c
+c-----------------------------------------------------------------------
+c
+c\Data Distribution Note:
+c
+c Fortran-D syntax:
+c ================
+c REAL RESID(N), V(LDV,NCV), WORKD(3*N), WORKL(LWORKL)
+c DECOMPOSE D1(N), D2(N,NCV)
+c ALIGN RESID(I) with D1(I)
+c ALIGN V(I,J) with D2(I,J)
+c ALIGN WORKD(I) with D1(I) range (1:N)
+c ALIGN WORKD(I) with D1(I-N) range (N+1:2*N)
+c ALIGN WORKD(I) with D1(I-2*N) range (2*N+1:3*N)
+c DISTRIBUTE D1(BLOCK), D2(BLOCK,:)
+c REPLICATED WORKL(LWORKL)
+c
+c Cray MPP syntax:
+c ===============
+c REAL RESID(N), V(LDV,NCV), WORKD(N,3), WORKL(LWORKL)
+c SHARED RESID(BLOCK), V(BLOCK,:), WORKD(BLOCK,:)
+c REPLICATED WORKL(LWORKL)
+c
+c
+c\BeginLib
+c
+c\References:
+c 1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
+c a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
+c pp 357-385.
+c 2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly
+c Restarted Arnoldi Iteration", Rice University Technical Report
+c TR95-13, Department of Computational and Applied Mathematics.
+c 3. B.N. Parlett, "The Symmetric Eigenvalue Problem". Prentice-Hall,
+c 1980.
+c 4. B.N. Parlett, B. Nour-Omid, "Towards a Black Box Lanczos Program",
+c Computer Physics Communications, 53 (1989), pp 169-179.
+c 5. B. Nour-Omid, B.N. Parlett, T. Ericson, P.S. Jensen, "How to
+c Implement the Spectral Transformation", Math. Comp., 48 (1987),
+c pp 663-673.
+c 6. R.G. Grimes, J.G. Lewis and H.D. Simon, "A Shifted Block Lanczos
+c Algorithm for Solving Sparse Symmetric Generalized Eigenproblems",
+c SIAM J. Matr. Anal. Apps., January (1993).
+c 7. L. Reichel, W.B. Gragg, "Algorithm 686: FORTRAN Subroutines
+c for Updating the QR decomposition", ACM TOMS, December 1990,
+c Volume 16 Number 4, pp 369-377.
+c 8. R.B. Lehoucq, D.C. Sorensen, "Implementation of Some Spectral
+c Transformations in a k-Step Arnoldi Method". In Preparation.
+c
+c\Routines called:
+c dsaup2 ARPACK routine that implements the Implicitly Restarted
+c Arnoldi Iteration.
+c dstats ARPACK routine that initialize timing and other statistics
+c variables.
+c second ARPACK utility routine for timing.
+c dlamch LAPACK routine that determines machine constants.
+c
+c\Authors
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\Revision history:
+c 12/15/93: Version ' 2.4'
+c
+c\SCCS Information: @(#)
+c FILE: saupd.F SID: 2.7 DATE OF SID: 8/27/96 RELEASE: 2
+c
+c\Remarks
+c 1. None
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dsaupd
+ & ( ido, bmat, n, which, nev, tol, resid, ncv, v, ldv, iparam,
+ & ipntr, workd, workl, lworkl, info )
+c
+c %----------------------------------------------------%
+c | Include files for debugging and timing information |
+c %----------------------------------------------------%
+c
+ include 'debug.h'
+ include 'stat.h'
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ character bmat*1, which*2
+ integer ido, info, ldv, lworkl, n, ncv, nev
+ Double precision
+ & tol
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ integer iparam(11), ipntr(11)
+ Double precision
+ & resid(n), v(ldv,ncv), workd(3*n), workl(lworkl)
+c
+c %------------%
+c | Parameters |
+c %------------%
+c
+ Double precision
+ & one, zero
+ parameter (one = 1.0D+0, zero = 0.0D+0)
+c
+c %---------------%
+c | Local Scalars |
+c %---------------%
+c
+ integer bounds, ierr, ih, iq, ishift, iupd, iw,
+ & ldh, ldq, msglvl, mxiter, mode, nb,
+ & nev0, next, np, ritz, j
+ save bounds, ierr, ih, iq, ishift, iupd, iw,
+ & ldh, ldq, msglvl, mxiter, mode, nb,
+ & nev0, next, np, ritz
+c
+c %----------------------%
+c | External Subroutines |
+c %----------------------%
+c
+ external dsaup2, second, dstats
+c
+c %--------------------%
+c | External Functions |
+c %--------------------%
+c
+ Double precision
+ & dlamch
+ external dlamch
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+ if (ido .eq. 0) then
+c
+c %-------------------------------%
+c | Initialize timing statistics |
+c | & message level for debugging |
+c %-------------------------------%
+c
+ call dstats
+ call second (t0)
+ msglvl = msaupd
+c
+ ierr = 0
+ ishift = iparam(1)
+ mxiter = iparam(3)
+ nb = iparam(4)
+c
+c %--------------------------------------------%
+c | Revision 2 performs only implicit restart. |
+c %--------------------------------------------%
+c
+ iupd = 1
+ mode = iparam(7)
+c
+c %----------------%
+c | Error checking |
+c %----------------%
+c
+ if (n .le. 0) then
+ ierr = -1
+ else if (nev .le. 0) then
+ ierr = -2
+ else if (ncv .le. nev .or. ncv .gt. n) then
+ ierr = -3
+ end if
+c
+c %----------------------------------------------%
+c | NP is the number of additional steps to |
+c | extend the length NEV Lanczos factorization. |
+c %----------------------------------------------%
+c
+ np = ncv - nev
+c
+ if (mxiter .le. 0) ierr = -4
+ if (which .ne. 'LM' .and.
+ & which .ne. 'SM' .and.
+ & which .ne. 'LA' .and.
+ & which .ne. 'SA' .and.
+ & which .ne. 'BE') ierr = -5
+ if (bmat .ne. 'I' .and. bmat .ne. 'G') ierr = -6
+c
+ if (lworkl .lt. ncv**2 + 8*ncv) ierr = -7
+ if (mode .lt. 1 .or. mode .gt. 5) then
+ ierr = -10
+ else if (mode .eq. 1 .and. bmat .eq. 'G') then
+ ierr = -11
+ else if (ishift .lt. 0 .or. ishift .gt. 1) then
+ ierr = -12
+ else if (nev .eq. 1 .and. which .eq. 'BE') then
+ ierr = -13
+ end if
+c
+c %------------%
+c | Error Exit |
+c %------------%
+c
+ if (ierr .ne. 0) then
+ info = ierr
+ ido = 99
+ go to 9000
+ end if
+c
+c %------------------------%
+c | Set default parameters |
+c %------------------------%
+c
+ if (nb .le. 0) nb = 1
+ if (tol .le. zero) tol = dlamch('EpsMach')
+c
+c %----------------------------------------------%
+c | NP is the number of additional steps to |
+c | extend the length NEV Lanczos factorization. |
+c | NEV0 is the local variable designating the |
+c | size of the invariant subspace desired. |
+c %----------------------------------------------%
+c
+ np = ncv - nev
+ nev0 = nev
+c
+c %-----------------------------%
+c | Zero out internal workspace |
+c %-----------------------------%
+c
+ do 10 j = 1, ncv**2 + 8*ncv
+ workl(j) = zero
+ 10 continue
+c
+c %-------------------------------------------------------%
+c | Pointer into WORKL for address of H, RITZ, BOUNDS, Q |
+c | etc... and the remaining workspace. |
+c | Also update pointer to be used on output. |
+c | Memory is laid out as follows: |
+c | workl(1:2*ncv) := generated tridiagonal matrix |
+c | workl(2*ncv+1:2*ncv+ncv) := ritz values |
+c | workl(3*ncv+1:3*ncv+ncv) := computed error bounds |
+c | workl(4*ncv+1:4*ncv+ncv*ncv) := rotation matrix Q |
+c | workl(4*ncv+ncv*ncv+1:7*ncv+ncv*ncv) := workspace |
+c %-------------------------------------------------------%
+c
+ ldh = ncv
+ ldq = ncv
+ ih = 1
+ ritz = ih + 2*ldh
+ bounds = ritz + ncv
+ iq = bounds + ncv
+ iw = iq + ncv**2
+ next = iw + 3*ncv
+c
+ ipntr(4) = next
+ ipntr(5) = ih
+ ipntr(6) = ritz
+ ipntr(7) = bounds
+ ipntr(11) = iw
+ end if
+c
+c %-------------------------------------------------------%
+c | Carry out the Implicitly restarted Lanczos Iteration. |
+c %-------------------------------------------------------%
+c
+ call dsaup2
+ & ( ido, bmat, n, which, nev0, np, tol, resid, mode, iupd,
+ & ishift, mxiter, v, ldv, workl(ih), ldh, workl(ritz),
+ & workl(bounds), workl(iq), ldq, workl(iw), ipntr, workd,
+ & info )
+c
+c %--------------------------------------------------%
+c | ido .ne. 99 implies use of reverse communication |
+c | to compute operations involving OP or shifts. |
+c %--------------------------------------------------%
+c
+ if (ido .eq. 3) iparam(8) = np
+ if (ido .ne. 99) go to 9000
+c
+ iparam(3) = mxiter
+ iparam(5) = np
+ iparam(9) = nopx
+ iparam(10) = nbx
+ iparam(11) = nrorth
+c
+c %------------------------------------%
+c | Exit if there was an informational |
+c | error within dsaup2. |
+c %------------------------------------%
+c
+ if (info .lt. 0) go to 9000
+ if (info .eq. 2) info = 3
+c
+c if (msglvl .gt. 0) then
+c call ivout (logfil, 1, mxiter, ndigit,
+c & '_saupd: number of update iterations taken')
+c call ivout (logfil, 1, np, ndigit,
+c & '_saupd: number of "converged" Ritz values')
+c call dvout (logfil, np, workl(Ritz), ndigit,
+c & '_saupd: final Ritz values')
+c call dvout (logfil, np, workl(Bounds), ndigit,
+c & '_saupd: corresponding error bounds')
+c end if
+c
+ call second (t1)
+ tsaupd = t1 - t0
+c
+c if (msglvl .gt. 0) then
+c
+c %--------------------------------------------------------%
+c | Version Number & Version Date are defined in version.h |
+c %--------------------------------------------------------%
+c
+c write (6,1000)
+c write (6,1100) mxiter, nopx, nbx, nrorth, nitref, nrstrt,
+c & tmvopx, tmvbx, tsaupd, tsaup2, tsaitr, titref,
+c & tgetv0, tseigt, tsgets, tsapps, tsconv
+c 1000 format (//,
+c & 5x, '==========================================',/
+c & 5x, '= Symmetric implicit Arnoldi update code =',/
+c & 5x, '= Version Number:', ' 2.4', 19x, ' =',/
+c & 5x, '= Version Date: ', ' 07/31/96', 14x, ' =',/
+c & 5x, '==========================================',/
+c & 5x, '= Summary of timing statistics =',/
+c & 5x, '==========================================',//)
+c 1100 format (
+c & 5x, 'Total number update iterations = ', i5,/
+c & 5x, 'Total number of OP*x operations = ', i5,/
+c & 5x, 'Total number of B*x operations = ', i5,/
+c & 5x, 'Total number of reorthogonalization steps = ', i5,/
+c & 5x, 'Total number of iterative refinement steps = ', i5,/
+c & 5x, 'Total number of restart steps = ', i5,/
+c & 5x, 'Total time in user OP*x operation = ', f12.6,/
+c & 5x, 'Total time in user B*x operation = ', f12.6,/
+c & 5x, 'Total time in Arnoldi update routine = ', f12.6,/
+c & 5x, 'Total time in saup2 routine = ', f12.6,/
+c & 5x, 'Total time in basic Arnoldi iteration loop = ', f12.6,/
+c & 5x, 'Total time in reorthogonalization phase = ', f12.6,/
+c & 5x, 'Total time in (re)start vector generation = ', f12.6,/
+c & 5x, 'Total time in trid eigenvalue subproblem = ', f12.6,/
+c & 5x, 'Total time in getting the shifts = ', f12.6,/
+c & 5x, 'Total time in applying the shifts = ', f12.6,/
+c & 5x, 'Total time in convergence testing = ', f12.6)
+c end if
+c
+ 9000 continue
+c
+ return
+c
+c %---------------%
+c | End of dsaupd |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.h
new file mode 100644
index 0000000000000000000000000000000000000000..30a4b437c130c0e82c212d7af1ca4d3e6381f8f0
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsaupd.h
@@ -0,0 +1,20 @@
+extern int v3p_netlib_dsaupd_(
+ v3p_netlib_integer *ido,
+ char *bmat,
+ v3p_netlib_integer *n,
+ char *which,
+ v3p_netlib_integer *nev,
+ v3p_netlib_doublereal *tol,
+ v3p_netlib_doublereal *resid,
+ v3p_netlib_integer *ncv,
+ v3p_netlib_doublereal *v,
+ v3p_netlib_integer *ldv,
+ v3p_netlib_integer *iparam,
+ v3p_netlib_integer *ipntr,
+ v3p_netlib_doublereal *workd,
+ v3p_netlib_doublereal *workl,
+ v3p_netlib_integer *lworkl,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen bmat_len,
+ v3p_netlib_ftnlen which_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.P
new file mode 100644
index 0000000000000000000000000000000000000000..a1fb6a8cf9e39323bde544dc68f0ec6d725c972a
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.P
@@ -0,0 +1,5 @@
+extern int dsconv_(integer *n, doublereal *ritz, doublereal *bounds, doublereal *tol, integer *nconv);
+/* comlen debug_ 96 */
+/* comlen timing_ 124 */
+/*:ref: second_ 14 1 6 */
+/*:ref: dlamch_ 7 2 13 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.c
new file mode 100644
index 0000000000000000000000000000000000000000..89e372b2035980367266cacef4bb2a9b946c3936
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.c
@@ -0,0 +1,230 @@
+/* arpack/dsconv.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Common Block Declarations */
+
+/*Extern struct { */
+/* integer nopx, nbx, nrorth, nitref, nrstrt; */
+/* real tsaupd, tsaup2, tsaitr, tseigt, tsgets, tsapps, tsconv, tnaupd, */
+/* tnaup2, tnaitr, tneigh, tngets, tnapps, tnconv, tcaupd, tcaup2, */
+/* tcaitr, tceigh, tcgets, tcapps, tcconv, tmvopx, tmvbx, tgetv0, */
+/* titref, trvec; */
+/*} timing_; */
+
+/*#define timing_1 timing_ */
+
+/* Table of constant values */
+
+static doublereal c_b3 = .66666666666666663;
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dsconv */
+
+/* \Description: */
+/* Convergence testing for the symmetric Arnoldi eigenvalue routine. */
+
+/* \Usage: */
+/* call dsconv */
+/* ( N, RITZ, BOUNDS, TOL, NCONV ) */
+
+/* \Arguments */
+/* N Integer. (INPUT) */
+/* Number of Ritz values to check for convergence. */
+
+/* RITZ Double precision array of length N. (INPUT) */
+/* The Ritz values to be checked for convergence. */
+
+/* BOUNDS Double precision array of length N. (INPUT) */
+/* Ritz estimates associated with the Ritz values in RITZ. */
+
+/* TOL Double precision scalar. (INPUT) */
+/* Desired relative accuracy for a Ritz value to be considered */
+/* "converged". */
+
+/* NCONV Integer scalar. (OUTPUT) */
+/* Number of "converged" Ritz values. */
+
+/* \EndDoc */
+
+/* ----------------------------------------------------------------------- */
+
+/* \BeginLib */
+
+/* \Routines called: */
+/* second ARPACK utility routine for timing. */
+/* dlamch LAPACK routine that determines machine constants. */
+
+/* \Author */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \SCCS Information: @(#) */
+/* FILE: sconv.F SID: 2.4 DATE OF SID: 4/19/96 RELEASE: 2 */
+
+/* \Remarks */
+/* 1. Starting with version 2.4, this routine no longer uses the */
+/* Parlett strategy using the gap conditions. */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< subroutine dsconv (n, ritz, bounds, tol, nconv) >*/
+/* Subroutine */ int dsconv_(integer *n, doublereal *ritz, doublereal *bounds,
+ doublereal *tol, integer *nconv)
+{
+ /* System generated locals */
+ integer i__1;
+ doublereal d__1, d__2, d__3;
+
+ /* Builtin functions */
+ double pow_dd(doublereal *, doublereal *);
+
+ /* Local variables */
+ integer i__;
+/* static real t0, t1; */
+ doublereal eps23, temp;
+ extern doublereal dlamch_(char *, ftnlen);
+ extern /* Subroutine */ int second_(real *);
+
+
+/* %----------------------------------------------------% */
+/* | Include files for debugging and timing information | */
+/* %----------------------------------------------------% */
+
+/*< include 'debug.h' >*/
+/*< include 'stat.h' >*/
+
+/* \SCCS Information: @(#) */
+/* FILE: debug.h SID: 2.3 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/* %---------------------------------% */
+/* | See debug.doc for documentation | */
+/* %---------------------------------% */
+/*< >*/
+/*< integer n, nconv >*/
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/* %--------------------------------% */
+/* | See stat.doc for documentation | */
+/* %--------------------------------% */
+
+/* \SCCS Information: @(#) */
+/* FILE: stat.h SID: 2.2 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/*< save t0, t1, t2, t3, t4, t5 >*/
+
+/*< integer nopx, nbx, nrorth, nitref, nrstrt >*/
+/*< >*/
+/*< >*/
+/*< >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< >*/
+
+/* %---------------% */
+/* | Local Scalars | */
+/* %---------------% */
+
+/*< integer i >*/
+/*< >*/
+
+/* %-------------------% */
+/* | External routines | */
+/* %-------------------% */
+
+/*< >*/
+/*< external dlamch >*/
+/* %---------------------% */
+/* | Intrinsic Functions | */
+/* %---------------------% */
+
+/*< intrinsic abs >*/
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+/*< call second (t0) >*/
+ /* Parameter adjustments */
+ --bounds;
+ --ritz;
+
+ /* Function Body */
+/* second_(&t0); */
+
+/*< eps23 = dlamch('Epsilon-Machine') >*/
+ eps23 = dlamch_("Epsilon-Machine", (ftnlen)15);
+/*< eps23 = eps23**(2.0D+0 / 3.0D+0) >*/
+ eps23 = pow_dd(&eps23, &c_b3);
+
+/*< nconv = 0 >*/
+ *nconv = 0;
+/*< do 10 i = 1, n >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+
+/* %-----------------------------------------------------% */
+/* | The i-th Ritz value is considered "converged" | */
+/* | when: bounds(i) .le. TOL*max(eps23, abs(ritz(i))) | */
+/* %-----------------------------------------------------% */
+
+/*< temp = max( eps23, abs(ritz(i)) ) >*/
+/* Computing MAX */
+ d__2 = eps23, d__3 = (d__1 = ritz[i__], abs(d__1));
+ temp = max(d__2,d__3);
+/*< if ( bounds(i) .le. tol*temp ) then >*/
+ if (bounds[i__] <= *tol * temp) {
+/*< nconv = nconv + 1 >*/
+ ++(*nconv);
+/*< end if >*/
+ }
+
+/*< 10 continue >*/
+/* L10: */
+ }
+
+/*< call second (t1) >*/
+/* second_(&t1); */
+/*< tsconv = tsconv + (t1 - t0) >*/
+/* timing_1.tsconv += t1 - t0; */
+
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dsconv | */
+/* %---------------% */
+
+/*< end >*/
+} /* dsconv_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.f
new file mode 100644
index 0000000000000000000000000000000000000000..83df0183a57ddda8c38ede28b4c9f6ba2df0f1b9
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.f
@@ -0,0 +1,138 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dsconv
+c
+c\Description:
+c Convergence testing for the symmetric Arnoldi eigenvalue routine.
+c
+c\Usage:
+c call dsconv
+c ( N, RITZ, BOUNDS, TOL, NCONV )
+c
+c\Arguments
+c N Integer. (INPUT)
+c Number of Ritz values to check for convergence.
+c
+c RITZ Double precision array of length N. (INPUT)
+c The Ritz values to be checked for convergence.
+c
+c BOUNDS Double precision array of length N. (INPUT)
+c Ritz estimates associated with the Ritz values in RITZ.
+c
+c TOL Double precision scalar. (INPUT)
+c Desired relative accuracy for a Ritz value to be considered
+c "converged".
+c
+c NCONV Integer scalar. (OUTPUT)
+c Number of "converged" Ritz values.
+c
+c\EndDoc
+c
+c-----------------------------------------------------------------------
+c
+c\BeginLib
+c
+c\Routines called:
+c second ARPACK utility routine for timing.
+c dlamch LAPACK routine that determines machine constants.
+c
+c\Author
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\SCCS Information: @(#)
+c FILE: sconv.F SID: 2.4 DATE OF SID: 4/19/96 RELEASE: 2
+c
+c\Remarks
+c 1. Starting with version 2.4, this routine no longer uses the
+c Parlett strategy using the gap conditions.
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dsconv (n, ritz, bounds, tol, nconv)
+c
+c %----------------------------------------------------%
+c | Include files for debugging and timing information |
+c %----------------------------------------------------%
+c
+ include 'debug.h'
+ include 'stat.h'
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ integer n, nconv
+ Double precision
+ & tol
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ Double precision
+ & ritz(n), bounds(n)
+c
+c %---------------%
+c | Local Scalars |
+c %---------------%
+c
+ integer i
+ Double precision
+ & temp, eps23
+c
+c %-------------------%
+c | External routines |
+c %-------------------%
+c
+ Double precision
+ & dlamch
+ external dlamch
+
+c %---------------------%
+c | Intrinsic Functions |
+c %---------------------%
+c
+ intrinsic abs
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+ call second (t0)
+c
+ eps23 = dlamch('Epsilon-Machine')
+ eps23 = eps23**(2.0D+0 / 3.0D+0)
+c
+ nconv = 0
+ do 10 i = 1, n
+c
+c %-----------------------------------------------------%
+c | The i-th Ritz value is considered "converged" |
+c | when: bounds(i) .le. TOL*max(eps23, abs(ritz(i))) |
+c %-----------------------------------------------------%
+c
+ temp = max( eps23, abs(ritz(i)) )
+ if ( bounds(i) .le. tol*temp ) then
+ nconv = nconv + 1
+ end if
+c
+ 10 continue
+c
+ call second (t1)
+ tsconv = tsconv + (t1 - t0)
+c
+ return
+c
+c %---------------%
+c | End of dsconv |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.h
new file mode 100644
index 0000000000000000000000000000000000000000..e987e06615bc47c77c4352300a532e9a589a4d9d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsconv.h
@@ -0,0 +1,7 @@
+extern int v3p_netlib_dsconv_(
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *ritz,
+ v3p_netlib_doublereal *bounds,
+ v3p_netlib_doublereal *tol,
+ v3p_netlib_integer *nconv
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.P
new file mode 100644
index 0000000000000000000000000000000000000000..534eca71dd026bea0273da497b5dcfd53e985288
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.P
@@ -0,0 +1,6 @@
+extern int dseigt_(doublereal *rnorm, integer *n, doublereal *h__, integer *ldh, doublereal *eig, doublereal *bounds, doublereal *workl, integer *ierr);
+/* comlen debug_ 96 */
+/* comlen timing_ 124 */
+/*:ref: second_ 14 1 6 */
+/*:ref: dcopy_ 14 5 4 7 4 7 4 */
+/*:ref: dstqrb_ 14 6 4 7 7 7 7 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.c
new file mode 100644
index 0000000000000000000000000000000000000000..ac950c2eac139936a1b089bc635c4fcd82b38d32
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.c
@@ -0,0 +1,286 @@
+/* arpack/dseigt.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Common Block Declarations */
+
+/*Extern struct { */
+/* integer logfil, ndigit, mgetv0, msaupd, msaup2, msaitr, mseigt, msapps, */
+/* msgets, mseupd, mnaupd, mnaup2, mnaitr, mneigh, mnapps, mngets, */
+/* mneupd, mcaupd, mcaup2, mcaitr, mceigh, mcapps, mcgets, mceupd; */
+/*} debug_; */
+
+/*#define debug_1 debug_ */
+
+/*Extern struct { */
+/* integer nopx, nbx, nrorth, nitref, nrstrt; */
+/* real tsaupd, tsaup2, tsaitr, tseigt, tsgets, tsapps, tsconv, tnaupd, */
+/* tnaup2, tnaitr, tneigh, tngets, tnapps, tnconv, tcaupd, tcaup2, */
+/* tcaitr, tceigh, tcgets, tcapps, tcconv, tmvopx, tmvbx, tgetv0, */
+/* titref, trvec; */
+/*} timing_; */
+
+/*#define timing_1 timing_ */
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dseigt */
+
+/* \Description: */
+/* Compute the eigenvalues of the current symmetric tridiagonal matrix */
+/* and the corresponding error bounds given the current residual norm. */
+
+/* \Usage: */
+/* call dseigt */
+/* ( RNORM, N, H, LDH, EIG, BOUNDS, WORKL, IERR ) */
+
+/* \Arguments */
+/* RNORM Double precision scalar. (INPUT) */
+/* RNORM contains the residual norm corresponding to the current */
+/* symmetric tridiagonal matrix H. */
+
+/* N Integer. (INPUT) */
+/* Size of the symmetric tridiagonal matrix H. */
+
+/* H Double precision N by 2 array. (INPUT) */
+/* H contains the symmetric tridiagonal matrix with the */
+/* subdiagonal in the first column starting at H(2,1) and the */
+/* main diagonal in second column. */
+
+/* LDH Integer. (INPUT) */
+/* Leading dimension of H exactly as declared in the calling */
+/* program. */
+
+/* EIG Double precision array of length N. (OUTPUT) */
+/* On output, EIG contains the N eigenvalues of H possibly */
+/* unsorted. The BOUNDS arrays are returned in the */
+/* same sorted order as EIG. */
+
+/* BOUNDS Double precision array of length N. (OUTPUT) */
+/* On output, BOUNDS contains the error estimates corresponding */
+/* to the eigenvalues EIG. This is equal to RNORM times the */
+/* last components of the eigenvectors corresponding to the */
+/* eigenvalues in EIG. */
+
+/* WORKL Double precision work array of length 3*N. (WORKSPACE) */
+/* Private (replicated) array on each PE or array allocated on */
+/* the front end. */
+
+/* IERR Integer. (OUTPUT) */
+/* Error exit flag from dstqrb. */
+
+/* \EndDoc */
+
+/* ----------------------------------------------------------------------- */
+
+/* \BeginLib */
+
+/* \Local variables: */
+/* xxxxxx real */
+
+/* \Routines called: */
+/* dstqrb ARPACK routine that computes the eigenvalues and the */
+/* last components of the eigenvectors of a symmetric */
+/* and tridiagonal matrix. */
+/* second ARPACK utility routine for timing. */
+/* dcopy Level 1 BLAS that copies one vector to another. */
+
+/* \Author */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \Revision history: */
+/* xx/xx/92: Version ' 2.4' */
+
+/* \SCCS Information: @(#) */
+/* FILE: seigt.F SID: 2.4 DATE OF SID: 8/27/96 RELEASE: 2 */
+
+/* \Remarks */
+/* None */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< >*/
+/* Subroutine */ int dseigt_(doublereal *rnorm, integer *n, doublereal *h__,
+ integer *ldh, doublereal *eig, doublereal *bounds, doublereal *workl,
+ integer *ierr)
+{
+ /* System generated locals */
+ integer h_dim1, h_offset, i__1;
+ doublereal d__1;
+
+ /* Local variables */
+ integer k;
+/* static real t0, t1; */
+ extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
+ doublereal *, integer *), second_(real *);
+/* integer msglvl; */
+ extern /* Subroutine */ int dstqrb_(integer *, doublereal *, doublereal *,
+ doublereal *, doublereal *, integer *);
+
+
+/* %----------------------------------------------------% */
+/* | Include files for debugging and timing information | */
+/* %----------------------------------------------------% */
+
+/*< include 'debug.h' >*/
+/*< include 'stat.h' >*/
+
+/* \SCCS Information: @(#) */
+/* FILE: debug.h SID: 2.3 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/* %---------------------------------% */
+/* | See debug.doc for documentation | */
+/* %---------------------------------% */
+/*< >*/
+/*< integer ierr, ldh, n >*/
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/* %--------------------------------% */
+/* | See stat.doc for documentation | */
+/* %--------------------------------% */
+
+/* \SCCS Information: @(#) */
+/* FILE: stat.h SID: 2.2 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/*< save t0, t1, t2, t3, t4, t5 >*/
+
+/*< integer nopx, nbx, nrorth, nitref, nrstrt >*/
+/*< >*/
+/*< >*/
+/*< >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< >*/
+
+/* %------------% */
+/* | Parameters | */
+/* %------------% */
+
+/*< >*/
+/*< parameter (zero = 0.0D+0) >*/
+
+/* %---------------% */
+/* | Local Scalars | */
+/* %---------------% */
+
+/*< integer i, k, msglvl >*/
+
+/* %----------------------% */
+/* | External Subroutines | */
+/* %----------------------% */
+
+/*< external dcopy, dstqrb, second >*/
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+/* %-------------------------------% */
+/* | Initialize timing statistics | */
+/* | & message level for debugging | */
+/* %-------------------------------% */
+
+/*< call second (t0) >*/
+ /* Parameter adjustments */
+ --workl;
+ --bounds;
+ --eig;
+ h_dim1 = *ldh;
+ h_offset = 1 + h_dim1;
+ h__ -= h_offset;
+
+ /* Function Body */
+/* second_(&t0); */
+/*< msglvl = mseigt >*/
+/* msglvl = debug_1.mseigt; */
+
+/* if (msglvl .gt. 0) then */
+/* call dvout (logfil, n, h(1,2), ndigit, */
+/* & '_seigt: main diagonal of matrix H') */
+/* if (n .gt. 1) then */
+/* call dvout (logfil, n-1, h(2,1), ndigit, */
+/* & '_seigt: sub diagonal of matrix H') */
+/* end if */
+/* end if */
+
+/*< call dcopy (n, h(1,2), 1, eig, 1) >*/
+ dcopy_(n, &h__[(h_dim1 << 1) + 1], &c__1, &eig[1], &c__1);
+/*< call dcopy (n-1, h(2,1), 1, workl, 1) >*/
+ i__1 = *n - 1;
+ dcopy_(&i__1, &h__[h_dim1 + 2], &c__1, &workl[1], &c__1);
+/*< call dstqrb (n, eig, workl, bounds, workl(n+1), ierr) >*/
+ dstqrb_(n, &eig[1], &workl[1], &bounds[1], &workl[*n + 1], ierr);
+/*< if (ierr .ne. 0) go to 9000 >*/
+ if (*ierr != 0) {
+ goto L9000;
+ }
+/* if (msglvl .gt. 1) then */
+/* call dvout (logfil, n, bounds, ndigit, */
+/* & '_seigt: last row of the eigenvector matrix for H') */
+/* end if */
+
+/* %-----------------------------------------------% */
+/* | Finally determine the error bounds associated | */
+/* | with the n Ritz values of H. | */
+/* %-----------------------------------------------% */
+
+/*< do 30 k = 1, n >*/
+ i__1 = *n;
+ for (k = 1; k <= i__1; ++k) {
+/*< bounds(k) = rnorm*abs(bounds(k)) >*/
+ bounds[k] = *rnorm * (d__1 = bounds[k], abs(d__1));
+/*< 30 continue >*/
+/* L30: */
+ }
+
+/*< call second (t1) >*/
+/* second_(&t1); */
+/*< tseigt = tseigt + (t1 - t0) >*/
+/* timing_1.tseigt += t1 - t0; */
+
+/*< 9000 continue >*/
+L9000:
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dseigt | */
+/* %---------------% */
+
+/*< end >*/
+} /* dseigt_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.f
new file mode 100644
index 0000000000000000000000000000000000000000..2a6bfa839d19afc6fd38d4cf3197f20dedf6eb5f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.f
@@ -0,0 +1,180 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dseigt
+c
+c\Description:
+c Compute the eigenvalues of the current symmetric tridiagonal matrix
+c and the corresponding error bounds given the current residual norm.
+c
+c\Usage:
+c call dseigt
+c ( RNORM, N, H, LDH, EIG, BOUNDS, WORKL, IERR )
+c
+c\Arguments
+c RNORM Double precision scalar. (INPUT)
+c RNORM contains the residual norm corresponding to the current
+c symmetric tridiagonal matrix H.
+c
+c N Integer. (INPUT)
+c Size of the symmetric tridiagonal matrix H.
+c
+c H Double precision N by 2 array. (INPUT)
+c H contains the symmetric tridiagonal matrix with the
+c subdiagonal in the first column starting at H(2,1) and the
+c main diagonal in second column.
+c
+c LDH Integer. (INPUT)
+c Leading dimension of H exactly as declared in the calling
+c program.
+c
+c EIG Double precision array of length N. (OUTPUT)
+c On output, EIG contains the N eigenvalues of H possibly
+c unsorted. The BOUNDS arrays are returned in the
+c same sorted order as EIG.
+c
+c BOUNDS Double precision array of length N. (OUTPUT)
+c On output, BOUNDS contains the error estimates corresponding
+c to the eigenvalues EIG. This is equal to RNORM times the
+c last components of the eigenvectors corresponding to the
+c eigenvalues in EIG.
+c
+c WORKL Double precision work array of length 3*N. (WORKSPACE)
+c Private (replicated) array on each PE or array allocated on
+c the front end.
+c
+c IERR Integer. (OUTPUT)
+c Error exit flag from dstqrb.
+c
+c\EndDoc
+c
+c-----------------------------------------------------------------------
+c
+c\BeginLib
+c
+c\Local variables:
+c xxxxxx real
+c
+c\Routines called:
+c dstqrb ARPACK routine that computes the eigenvalues and the
+c last components of the eigenvectors of a symmetric
+c and tridiagonal matrix.
+c second ARPACK utility routine for timing.
+c dcopy Level 1 BLAS that copies one vector to another.
+c
+c\Author
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\Revision history:
+c xx/xx/92: Version ' 2.4'
+c
+c\SCCS Information: @(#)
+c FILE: seigt.F SID: 2.4 DATE OF SID: 8/27/96 RELEASE: 2
+c
+c\Remarks
+c None
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dseigt
+ & ( rnorm, n, h, ldh, eig, bounds, workl, ierr )
+c
+c %----------------------------------------------------%
+c | Include files for debugging and timing information |
+c %----------------------------------------------------%
+c
+ include 'debug.h'
+ include 'stat.h'
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ integer ierr, ldh, n
+ Double precision
+ & rnorm
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ Double precision
+ & eig(n), bounds(n), h(ldh,2), workl(3*n)
+c
+c %------------%
+c | Parameters |
+c %------------%
+c
+ Double precision
+ & zero
+ parameter (zero = 0.0D+0)
+c
+c %---------------%
+c | Local Scalars |
+c %---------------%
+c
+ integer i, k, msglvl
+c
+c %----------------------%
+c | External Subroutines |
+c %----------------------%
+c
+ external dcopy, dstqrb, second
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+c %-------------------------------%
+c | Initialize timing statistics |
+c | & message level for debugging |
+c %-------------------------------%
+c
+ call second (t0)
+ msglvl = mseigt
+c
+c if (msglvl .gt. 0) then
+c call dvout (logfil, n, h(1,2), ndigit,
+c & '_seigt: main diagonal of matrix H')
+c if (n .gt. 1) then
+c call dvout (logfil, n-1, h(2,1), ndigit,
+c & '_seigt: sub diagonal of matrix H')
+c end if
+c end if
+c
+ call dcopy (n, h(1,2), 1, eig, 1)
+ call dcopy (n-1, h(2,1), 1, workl, 1)
+ call dstqrb (n, eig, workl, bounds, workl(n+1), ierr)
+ if (ierr .ne. 0) go to 9000
+c if (msglvl .gt. 1) then
+c call dvout (logfil, n, bounds, ndigit,
+c & '_seigt: last row of the eigenvector matrix for H')
+c end if
+c
+c %-----------------------------------------------%
+c | Finally determine the error bounds associated |
+c | with the n Ritz values of H. |
+c %-----------------------------------------------%
+c
+ do 30 k = 1, n
+ bounds(k) = rnorm*abs(bounds(k))
+ 30 continue
+c
+ call second (t1)
+ tseigt = tseigt + (t1 - t0)
+c
+ 9000 continue
+ return
+c
+c %---------------%
+c | End of dseigt |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.h
new file mode 100644
index 0000000000000000000000000000000000000000..a279a095ec6c1234250a6d66558c805ab7f1aa88
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseigt.h
@@ -0,0 +1,10 @@
+extern int v3p_netlib_dseigt_(
+ v3p_netlib_doublereal *rnorm,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *h__,
+ v3p_netlib_integer *ldh,
+ v3p_netlib_doublereal *eig,
+ v3p_netlib_doublereal *bounds,
+ v3p_netlib_doublereal *workl,
+ v3p_netlib_integer *ierr
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.P
new file mode 100644
index 0000000000000000000000000000000000000000..5810bc1d6acd9aaecee6d1880b18e133b99dedde
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.P
@@ -0,0 +1,2 @@
+extern int dsesrt_(char *which, logical *apply, integer *n, doublereal *x, integer *na, doublereal *a, integer *lda, ftnlen which_len);
+/*:ref: dswap_ 14 5 4 7 4 7 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.c
new file mode 100644
index 0000000000000000000000000000000000000000..a87e35279260fcc0d46bbd18cc3d933c71df2541
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.c
@@ -0,0 +1,388 @@
+/* arpack/dsesrt.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dsesrt */
+
+/* \Description: */
+/* Sort the array X in the order specified by WHICH and optionally */
+/* apply the permutation to the columns of the matrix A. */
+
+/* \Usage: */
+/* call dsesrt */
+/* ( WHICH, APPLY, N, X, NA, A, LDA) */
+
+/* \Arguments */
+/* WHICH Character*2. (Input) */
+/* 'LM' -> X is sorted into increasing order of magnitude. */
+/* 'SM' -> X is sorted into decreasing order of magnitude. */
+/* 'LA' -> X is sorted into increasing order of algebraic. */
+/* 'SA' -> X is sorted into decreasing order of algebraic. */
+
+/* APPLY Logical. (Input) */
+/* APPLY = .TRUE. -> apply the sorted order to A. */
+/* APPLY = .FALSE. -> do not apply the sorted order to A. */
+
+/* N Integer. (INPUT) */
+/* Dimension of the array X. */
+
+/* X Double precision array of length N. (INPUT/OUTPUT) */
+/* The array to be sorted. */
+
+/* NA Integer. (INPUT) */
+/* Number of rows of the matrix A. */
+
+/* A Double precision array of length NA by N. (INPUT/OUTPUT) */
+
+/* LDA Integer. (INPUT) */
+/* Leading dimension of A. */
+
+/* \EndDoc */
+
+/* ----------------------------------------------------------------------- */
+
+/* \BeginLib */
+
+/* \Routines */
+/* dswap Level 1 BLAS that swaps the contents of two vectors. */
+
+/* \Authors */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \Revision history: */
+/* 12/15/93: Version ' 2.1'. */
+/* Adapted from the sort routine in LANSO and */
+/* the ARPACK code dsortr */
+
+/* \SCCS Information: @(#) */
+/* FILE: sesrt.F SID: 2.3 DATE OF SID: 4/19/96 RELEASE: 2 */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< subroutine dsesrt (which, apply, n, x, na, a, lda) >*/
+/* Subroutine */ int dsesrt_(char *which, logical *apply, integer *n,
+ doublereal *x, integer *na, doublereal *a, integer *lda, ftnlen
+ which_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, i__1;
+ doublereal d__1, d__2;
+
+ /* Builtin functions */
+ integer s_cmp(char *, char *, ftnlen, ftnlen);
+
+ /* Local variables */
+ integer i__, j, igap;
+ doublereal temp;
+ extern /* Subroutine */ int dswap_(integer *, doublereal *, integer *,
+ doublereal *, integer *);
+
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/*< character*2 which >*/
+/*< logical apply >*/
+/*< integer lda, n, na >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< >*/
+
+/* %---------------% */
+/* | Local Scalars | */
+/* %---------------% */
+
+/*< integer i, igap, j >*/
+/*< >*/
+
+/* %----------------------% */
+/* | External Subroutines | */
+/* %----------------------% */
+
+/*< external dswap >*/
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+/*< igap = n / 2 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1 * 0;
+ a -= a_offset;
+
+ /* Function Body */
+ igap = *n / 2;
+
+/*< if (which .eq. 'SA') then >*/
+ if (s_cmp(which, "SA", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* X is sorted into decreasing order of algebraic. */
+
+/*< 10 continue >*/
+L10:
+/*< if (igap .eq. 0) go to 9000 >*/
+ if (igap == 0) {
+ goto L9000;
+ }
+/*< do 30 i = igap, n-1 >*/
+ i__1 = *n - 1;
+ for (i__ = igap; i__ <= i__1; ++i__) {
+/*< j = i-igap >*/
+ j = i__ - igap;
+/*< 20 continue >*/
+L20:
+
+/*< if (j.lt.0) go to 30 >*/
+ if (j < 0) {
+ goto L30;
+ }
+
+/*< if (x(j).lt.x(j+igap)) then >*/
+ if (x[j] < x[j + igap]) {
+/*< temp = x(j) >*/
+ temp = x[j];
+/*< x(j) = x(j+igap) >*/
+ x[j] = x[j + igap];
+/*< x(j+igap) = temp >*/
+ x[j + igap] = temp;
+/*< if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1) >*/
+ if (*apply) {
+ dswap_(na, &a[j * a_dim1 + 1], &c__1, &a[(j + igap) *
+ a_dim1 + 1], &c__1);
+ }
+/*< else >*/
+ } else {
+/*< go to 30 >*/
+ goto L30;
+/*< endif >*/
+ }
+/*< j = j-igap >*/
+ j -= igap;
+/*< go to 20 >*/
+ goto L20;
+/*< 30 continue >*/
+L30:
+ ;
+ }
+/*< igap = igap / 2 >*/
+ igap /= 2;
+/*< go to 10 >*/
+ goto L10;
+
+/*< else if (which .eq. 'SM') then >*/
+ } else if (s_cmp(which, "SM", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* X is sorted into decreasing order of magnitude. */
+
+/*< 40 continue >*/
+L40:
+/*< if (igap .eq. 0) go to 9000 >*/
+ if (igap == 0) {
+ goto L9000;
+ }
+/*< do 60 i = igap, n-1 >*/
+ i__1 = *n - 1;
+ for (i__ = igap; i__ <= i__1; ++i__) {
+/*< j = i-igap >*/
+ j = i__ - igap;
+/*< 50 continue >*/
+L50:
+
+/*< if (j.lt.0) go to 60 >*/
+ if (j < 0) {
+ goto L60;
+ }
+
+/*< if (abs(x(j)).lt.abs(x(j+igap))) then >*/
+ if ((d__1 = x[j], abs(d__1)) < (d__2 = x[j + igap], abs(d__2))) {
+/*< temp = x(j) >*/
+ temp = x[j];
+/*< x(j) = x(j+igap) >*/
+ x[j] = x[j + igap];
+/*< x(j+igap) = temp >*/
+ x[j + igap] = temp;
+/*< if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1) >*/
+ if (*apply) {
+ dswap_(na, &a[j * a_dim1 + 1], &c__1, &a[(j + igap) *
+ a_dim1 + 1], &c__1);
+ }
+/*< else >*/
+ } else {
+/*< go to 60 >*/
+ goto L60;
+/*< endif >*/
+ }
+/*< j = j-igap >*/
+ j -= igap;
+/*< go to 50 >*/
+ goto L50;
+/*< 60 continue >*/
+L60:
+ ;
+ }
+/*< igap = igap / 2 >*/
+ igap /= 2;
+/*< go to 40 >*/
+ goto L40;
+
+/*< else if (which .eq. 'LA') then >*/
+ } else if (s_cmp(which, "LA", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* X is sorted into increasing order of algebraic. */
+
+/*< 70 continue >*/
+L70:
+/*< if (igap .eq. 0) go to 9000 >*/
+ if (igap == 0) {
+ goto L9000;
+ }
+/*< do 90 i = igap, n-1 >*/
+ i__1 = *n - 1;
+ for (i__ = igap; i__ <= i__1; ++i__) {
+/*< j = i-igap >*/
+ j = i__ - igap;
+/*< 80 continue >*/
+L80:
+
+/*< if (j.lt.0) go to 90 >*/
+ if (j < 0) {
+ goto L90;
+ }
+
+/*< if (x(j).gt.x(j+igap)) then >*/
+ if (x[j] > x[j + igap]) {
+/*< temp = x(j) >*/
+ temp = x[j];
+/*< x(j) = x(j+igap) >*/
+ x[j] = x[j + igap];
+/*< x(j+igap) = temp >*/
+ x[j + igap] = temp;
+/*< if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1) >*/
+ if (*apply) {
+ dswap_(na, &a[j * a_dim1 + 1], &c__1, &a[(j + igap) *
+ a_dim1 + 1], &c__1);
+ }
+/*< else >*/
+ } else {
+/*< go to 90 >*/
+ goto L90;
+/*< endif >*/
+ }
+/*< j = j-igap >*/
+ j -= igap;
+/*< go to 80 >*/
+ goto L80;
+/*< 90 continue >*/
+L90:
+ ;
+ }
+/*< igap = igap / 2 >*/
+ igap /= 2;
+/*< go to 70 >*/
+ goto L70;
+
+/*< else if (which .eq. 'LM') then >*/
+ } else if (s_cmp(which, "LM", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* X is sorted into increasing order of magnitude. */
+
+/*< 100 continue >*/
+L100:
+/*< if (igap .eq. 0) go to 9000 >*/
+ if (igap == 0) {
+ goto L9000;
+ }
+/*< do 120 i = igap, n-1 >*/
+ i__1 = *n - 1;
+ for (i__ = igap; i__ <= i__1; ++i__) {
+/*< j = i-igap >*/
+ j = i__ - igap;
+/*< 110 continue >*/
+L110:
+
+/*< if (j.lt.0) go to 120 >*/
+ if (j < 0) {
+ goto L120;
+ }
+
+/*< if (abs(x(j)).gt.abs(x(j+igap))) then >*/
+ if ((d__1 = x[j], abs(d__1)) > (d__2 = x[j + igap], abs(d__2))) {
+/*< temp = x(j) >*/
+ temp = x[j];
+/*< x(j) = x(j+igap) >*/
+ x[j] = x[j + igap];
+/*< x(j+igap) = temp >*/
+ x[j + igap] = temp;
+/*< if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1) >*/
+ if (*apply) {
+ dswap_(na, &a[j * a_dim1 + 1], &c__1, &a[(j + igap) *
+ a_dim1 + 1], &c__1);
+ }
+/*< else >*/
+ } else {
+/*< go to 120 >*/
+ goto L120;
+/*< endif >*/
+ }
+/*< j = j-igap >*/
+ j -= igap;
+/*< go to 110 >*/
+ goto L110;
+/*< 120 continue >*/
+L120:
+ ;
+ }
+/*< igap = igap / 2 >*/
+ igap /= 2;
+/*< go to 100 >*/
+ goto L100;
+/*< end if >*/
+ }
+
+/*< 9000 continue >*/
+L9000:
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dsesrt | */
+/* %---------------% */
+
+/*< end >*/
+} /* dsesrt_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.f
new file mode 100644
index 0000000000000000000000000000000000000000..833fba4e6c54e7ba5dc88db0976ac91aa799bc4b
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.f
@@ -0,0 +1,217 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dsesrt
+c
+c\Description:
+c Sort the array X in the order specified by WHICH and optionally
+c apply the permutation to the columns of the matrix A.
+c
+c\Usage:
+c call dsesrt
+c ( WHICH, APPLY, N, X, NA, A, LDA)
+c
+c\Arguments
+c WHICH Character*2. (Input)
+c 'LM' -> X is sorted into increasing order of magnitude.
+c 'SM' -> X is sorted into decreasing order of magnitude.
+c 'LA' -> X is sorted into increasing order of algebraic.
+c 'SA' -> X is sorted into decreasing order of algebraic.
+c
+c APPLY Logical. (Input)
+c APPLY = .TRUE. -> apply the sorted order to A.
+c APPLY = .FALSE. -> do not apply the sorted order to A.
+c
+c N Integer. (INPUT)
+c Dimension of the array X.
+c
+c X Double precision array of length N. (INPUT/OUTPUT)
+c The array to be sorted.
+c
+c NA Integer. (INPUT)
+c Number of rows of the matrix A.
+c
+c A Double precision array of length NA by N. (INPUT/OUTPUT)
+c
+c LDA Integer. (INPUT)
+c Leading dimension of A.
+c
+c\EndDoc
+c
+c-----------------------------------------------------------------------
+c
+c\BeginLib
+c
+c\Routines
+c dswap Level 1 BLAS that swaps the contents of two vectors.
+c
+c\Authors
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\Revision history:
+c 12/15/93: Version ' 2.1'.
+c Adapted from the sort routine in LANSO and
+c the ARPACK code dsortr
+c
+c\SCCS Information: @(#)
+c FILE: sesrt.F SID: 2.3 DATE OF SID: 4/19/96 RELEASE: 2
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dsesrt (which, apply, n, x, na, a, lda)
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ character*2 which
+ logical apply
+ integer lda, n, na
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ Double precision
+ & x(0:n-1), a(lda, 0:n-1)
+c
+c %---------------%
+c | Local Scalars |
+c %---------------%
+c
+ integer i, igap, j
+ Double precision
+ & temp
+c
+c %----------------------%
+c | External Subroutines |
+c %----------------------%
+c
+ external dswap
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+ igap = n / 2
+c
+ if (which .eq. 'SA') then
+c
+c X is sorted into decreasing order of algebraic.
+c
+ 10 continue
+ if (igap .eq. 0) go to 9000
+ do 30 i = igap, n-1
+ j = i-igap
+ 20 continue
+c
+ if (j.lt.0) go to 30
+c
+ if (x(j).lt.x(j+igap)) then
+ temp = x(j)
+ x(j) = x(j+igap)
+ x(j+igap) = temp
+ if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1)
+ else
+ go to 30
+ endif
+ j = j-igap
+ go to 20
+ 30 continue
+ igap = igap / 2
+ go to 10
+c
+ else if (which .eq. 'SM') then
+c
+c X is sorted into decreasing order of magnitude.
+c
+ 40 continue
+ if (igap .eq. 0) go to 9000
+ do 60 i = igap, n-1
+ j = i-igap
+ 50 continue
+c
+ if (j.lt.0) go to 60
+c
+ if (abs(x(j)).lt.abs(x(j+igap))) then
+ temp = x(j)
+ x(j) = x(j+igap)
+ x(j+igap) = temp
+ if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1)
+ else
+ go to 60
+ endif
+ j = j-igap
+ go to 50
+ 60 continue
+ igap = igap / 2
+ go to 40
+c
+ else if (which .eq. 'LA') then
+c
+c X is sorted into increasing order of algebraic.
+c
+ 70 continue
+ if (igap .eq. 0) go to 9000
+ do 90 i = igap, n-1
+ j = i-igap
+ 80 continue
+c
+ if (j.lt.0) go to 90
+c
+ if (x(j).gt.x(j+igap)) then
+ temp = x(j)
+ x(j) = x(j+igap)
+ x(j+igap) = temp
+ if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1)
+ else
+ go to 90
+ endif
+ j = j-igap
+ go to 80
+ 90 continue
+ igap = igap / 2
+ go to 70
+c
+ else if (which .eq. 'LM') then
+c
+c X is sorted into increasing order of magnitude.
+c
+ 100 continue
+ if (igap .eq. 0) go to 9000
+ do 120 i = igap, n-1
+ j = i-igap
+ 110 continue
+c
+ if (j.lt.0) go to 120
+c
+ if (abs(x(j)).gt.abs(x(j+igap))) then
+ temp = x(j)
+ x(j) = x(j+igap)
+ x(j+igap) = temp
+ if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1)
+ else
+ go to 120
+ endif
+ j = j-igap
+ go to 110
+ 120 continue
+ igap = igap / 2
+ go to 100
+ end if
+c
+ 9000 continue
+ return
+c
+c %---------------%
+c | End of dsesrt |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.h
new file mode 100644
index 0000000000000000000000000000000000000000..ad443cb6711592b2bad76a9624949e467dfa2e46
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsesrt.h
@@ -0,0 +1,10 @@
+extern int v3p_netlib_dsesrt_(
+ char *which,
+ v3p_netlib_logical *apply,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *x,
+ v3p_netlib_integer *na,
+ v3p_netlib_doublereal *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_ftnlen which_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.P
new file mode 100644
index 0000000000000000000000000000000000000000..8de7240459d9eaac679717065f5c543486045033
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.P
@@ -0,0 +1,14 @@
+extern int dseupd_(logical *rvec, char *howmny, logical *select, doublereal *d__, doublereal *z__, integer *ldz, doublereal *sigma, char *bmat, integer *n, char *which, integer *nev, doublereal *tol, doublereal *resid, integer *ncv, doublereal *v, integer *ldv, integer *iparam, integer *ipntr, doublereal *workd, doublereal *workl, integer *lworkl, integer *info, ftnlen howmny_len, ftnlen bmat_len, ftnlen which_len);
+/* comlen debug_ 96 */
+/* comlen timing_ 124 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dnrm2_ 7 3 4 7 4 */
+/*:ref: dcopy_ 14 5 4 7 4 7 4 */
+/*:ref: dsteqr_ 14 9 13 4 7 7 7 4 7 4 124 */
+/*:ref: dsesrt_ 14 8 13 12 4 7 4 7 4 124 */
+/*:ref: dsortr_ 14 6 13 12 4 7 7 124 */
+/*:ref: dscal_ 14 4 4 7 7 4 */
+/*:ref: dgeqr2_ 14 7 4 4 7 4 7 7 4 */
+/*:ref: dorm2r_ 14 14 13 13 4 4 4 7 4 7 7 4 7 4 124 124 */
+/*:ref: dlacpy_ 14 8 13 4 4 7 4 7 4 124 */
+/*:ref: dger_ 14 9 4 4 7 7 4 7 4 7 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.c
new file mode 100644
index 0000000000000000000000000000000000000000..43d13c3ce323c8e51ed77f374b08e94a494011f5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.c
@@ -0,0 +1,1324 @@
+/* arpack/dseupd.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Common Block Declarations */
+
+/*Extern struct { */
+/* integer logfil, ndigit, mgetv0, msaupd, msaup2, msaitr, mseigt, msapps, */
+/* msgets, mseupd, mnaupd, mnaup2, mnaitr, mneigh, mnapps, mngets, */
+/* mneupd, mcaupd, mcaup2, mcaitr, mceigh, mcapps, mcgets, mceupd; */
+/*} debug_; */
+
+/*#define debug_1 debug_ */
+
+/* Table of constant values */
+
+static doublereal c_b21 = .66666666666666663;
+static integer c__1 = 1;
+static logical c_true = TRUE_;
+static doublereal c_b103 = 1.;
+
+/* \BeginDoc */
+
+/* \Name: dseupd */
+
+/* \Description: */
+
+/* This subroutine returns the converged approximations to eigenvalues */
+/* of A*z = lambda*B*z and (optionally): */
+
+/* (1) the corresponding approximate eigenvectors, */
+
+/* (2) an orthonormal (Lanczos) basis for the associated approximate */
+/* invariant subspace, */
+
+/* (3) Both. */
+
+/* There is negligible additional cost to obtain eigenvectors. An orthonormal */
+/* (Lanczos) basis is always computed. There is an additional storage cost */
+/* of n*nev if both are requested (in this case a separate array Z must be */
+/* supplied). */
+
+/* These quantities are obtained from the Lanczos factorization computed */
+/* by DSAUPD for the linear operator OP prescribed by the MODE selection */
+/* (see IPARAM(7) in DSAUPD documentation.) DSAUPD must be called before */
+/* this routine is called. These approximate eigenvalues and vectors are */
+/* commonly called Ritz values and Ritz vectors respectively. They are */
+/* referred to as such in the comments that follow. The computed orthonormal */
+/* basis for the invariant subspace corresponding to these Ritz values is */
+/* referred to as a Lanczos basis. */
+
+/* See documentation in the header of the subroutine DSAUPD for a definition */
+/* of OP as well as other terms and the relation of computed Ritz values */
+/* and vectors of OP with respect to the given problem A*z = lambda*B*z. */
+
+/* The approximate eigenvalues of the original problem are returned in */
+/* ascending algebraic order. The user may elect to call this routine */
+/* once for each desired Ritz vector and store it peripherally if desired. */
+/* There is also the option of computing a selected set of these vectors */
+/* with a single call. */
+
+/* \Usage: */
+/* call dseupd */
+/* ( RVEC, HOWMNY, SELECT, D, Z, LDZ, SIGMA, BMAT, N, WHICH, NEV, TOL, */
+/* RESID, NCV, V, LDV, IPARAM, IPNTR, WORKD, WORKL, LWORKL, INFO ) */
+
+/* RVEC LOGICAL (INPUT) */
+/* Specifies whether Ritz vectors corresponding to the Ritz value */
+/* approximations to the eigenproblem A*z = lambda*B*z are computed. */
+
+/* RVEC = .FALSE. Compute Ritz values only. */
+
+/* RVEC = .TRUE. Compute Ritz vectors. */
+
+/* HOWMNY Character*1 (INPUT) */
+/* Specifies how many Ritz vectors are wanted and the form of Z */
+/* the matrix of Ritz vectors. See remark 1 below. */
+/* = 'A': compute NEV Ritz vectors; */
+/* = 'S': compute some of the Ritz vectors, specified */
+/* by the logical array SELECT. */
+
+/* SELECT Logical array of dimension NEV. (INPUT) */
+/* If HOWMNY = 'S', SELECT specifies the Ritz vectors to be */
+/* computed. To select the Ritz vector corresponding to a */
+/* Ritz value D(j), SELECT(j) must be set to .TRUE.. */
+/* If HOWMNY = 'A' , SELECT is not referenced. */
+
+/* D Double precision array of dimension NEV. (OUTPUT) */
+/* On exit, D contains the Ritz value approximations to the */
+/* eigenvalues of A*z = lambda*B*z. The values are returned */
+/* in ascending order. If IPARAM(7) = 3,4,5 then D represents */
+/* the Ritz values of OP computed by dsaupd transformed to */
+/* those of the original eigensystem A*z = lambda*B*z. If */
+/* IPARAM(7) = 1,2 then the Ritz values of OP are the same */
+/* as the those of A*z = lambda*B*z. */
+
+/* Z Double precision N by NEV array if HOWMNY = 'A'. (OUTPUT) */
+/* On exit, Z contains the B-orthonormal Ritz vectors of the */
+/* eigensystem A*z = lambda*B*z corresponding to the Ritz */
+/* value approximations. */
+/* If RVEC = .FALSE. then Z is not referenced. */
+/* NOTE: The array Z may be set equal to first NEV columns of the */
+/* Arnoldi/Lanczos basis array V computed by DSAUPD. */
+
+/* LDZ Integer. (INPUT) */
+/* The leading dimension of the array Z. If Ritz vectors are */
+/* desired, then LDZ .ge. max( 1, N ). In any case, LDZ .ge. 1. */
+
+/* SIGMA Double precision (INPUT) */
+/* If IPARAM(7) = 3,4,5 represents the shift. Not referenced if */
+/* IPARAM(7) = 1 or 2. */
+
+
+/* **** The remaining arguments MUST be the same as for the **** */
+/* **** call to DNAUPD that was just completed. **** */
+
+/* NOTE: The remaining arguments */
+
+/* BMAT, N, WHICH, NEV, TOL, RESID, NCV, V, LDV, IPARAM, IPNTR, */
+/* WORKD, WORKL, LWORKL, INFO */
+
+/* must be passed directly to DSEUPD following the last call */
+/* to DSAUPD. These arguments MUST NOT BE MODIFIED between */
+/* the the last call to DSAUPD and the call to DSEUPD. */
+
+/* Two of these parameters (WORKL, INFO) are also output parameters: */
+
+/* WORKL Double precision work array of length LWORKL. (OUTPUT/WORKSPACE) */
+/* WORKL(1:4*ncv) contains information obtained in */
+/* dsaupd. They are not changed by dseupd. */
+/* WORKL(4*ncv+1:ncv*ncv+8*ncv) holds the */
+/* untransformed Ritz values, the computed error estimates, */
+/* and the associated eigenvector matrix of H. */
+
+/* Note: IPNTR(8:10) contains the pointer into WORKL for addresses */
+/* of the above information computed by dseupd. */
+/* ------------------------------------------------------------- */
+/* IPNTR(8): pointer to the NCV RITZ values of the original system. */
+/* IPNTR(9): pointer to the NCV corresponding error bounds. */
+/* IPNTR(10): pointer to the NCV by NCV matrix of eigenvectors */
+/* of the tridiagonal matrix T. Only referenced by */
+/* dseupd if RVEC = .TRUE. See Remarks. */
+/* ------------------------------------------------------------- */
+
+/* INFO Integer. (OUTPUT) */
+/* Error flag on output. */
+/* = 0: Normal exit. */
+/* = -1: N must be positive. */
+/* = -2: NEV must be positive. */
+/* = -3: NCV must be greater than NEV and less than or equal to N. */
+/* = -5: WHICH must be one of 'LM', 'SM', 'LA', 'SA' or 'BE'. */
+/* = -6: BMAT must be one of 'I' or 'G'. */
+/* = -7: Length of private work WORKL array is not sufficient. */
+/* = -8: Error return from trid. eigenvalue calculation; */
+/* Information error from LAPACK routine dsteqr. */
+/* = -9: Starting vector is zero. */
+/* = -10: IPARAM(7) must be 1,2,3,4,5. */
+/* = -11: IPARAM(7) = 1 and BMAT = 'G' are incompatible. */
+/* = -12: NEV and WHICH = 'BE' are incompatible. */
+/* = -14: DSAUPD did not find any eigenvalues to sufficient */
+/* accuracy. */
+/* = -15: HOWMNY must be one of 'A' or 'S' if RVEC = .true. */
+/* = -16: HOWMNY = 'S' not yet implemented */
+
+/* \BeginLib */
+
+/* \References: */
+/* 1. D.C. Sorensen, "Implicit Application of Polynomial Filters in */
+/* a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992), */
+/* pp 357-385. */
+/* 2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly */
+/* Restarted Arnoldi Iteration", Rice University Technical Report */
+/* TR95-13, Department of Computational and Applied Mathematics. */
+/* 3. B.N. Parlett, "The Symmetric Eigenvalue Problem". Prentice-Hall, */
+/* 1980. */
+/* 4. B.N. Parlett, B. Nour-Omid, "Towards a Black Box Lanczos Program", */
+/* Computer Physics Communications, 53 (1989), pp 169-179. */
+/* 5. B. Nour-Omid, B.N. Parlett, T. Ericson, P.S. Jensen, "How to */
+/* Implement the Spectral Transformation", Math. Comp., 48 (1987), */
+/* pp 663-673. */
+/* 6. R.G. Grimes, J.G. Lewis and H.D. Simon, "A Shifted Block Lanczos */
+/* Algorithm for Solving Sparse Symmetric Generalized Eigenproblems", */
+/* SIAM J. Matr. Anal. Apps., January (1993). */
+/* 7. L. Reichel, W.B. Gragg, "Algorithm 686: FORTRAN Subroutines */
+/* for Updating the QR decomposition", ACM TOMS, December 1990, */
+/* Volume 16 Number 4, pp 369-377. */
+
+/* \Remarks */
+/* 1. The converged Ritz values are always returned in increasing */
+/* (algebraic) order. */
+
+/* 2. Currently only HOWMNY = 'A' is implemented. It is included at this */
+/* stage for the user who wants to incorporate it. */
+
+/* \Routines called: */
+/* dsesrt ARPACK routine that sorts an array X, and applies the */
+/* corresponding permutation to a matrix A. */
+/* dsortr dsortr ARPACK sorting routine. */
+/* dgeqr2 LAPACK routine that computes the QR factorization of */
+/* a matrix. */
+/* dlacpy LAPACK matrix copy routine. */
+/* dlamch LAPACK routine that determines machine constants. */
+/* dorm2r LAPACK routine that applies an orthogonal matrix in */
+/* factored form. */
+/* dsteqr LAPACK routine that computes eigenvalues and eigenvectors */
+/* of a tridiagonal matrix. */
+/* dger Level 2 BLAS rank one update to a matrix. */
+/* dcopy Level 1 BLAS that copies one vector to another . */
+/* dnrm2 Level 1 BLAS that computes the norm of a vector. */
+/* dscal Level 1 BLAS that scales a vector. */
+/* dswap Level 1 BLAS that swaps the contents of two vectors. */
+/* \Authors */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Chao Yang Houston, Texas */
+/* Dept. of Computational & */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \Revision history: */
+/* 12/15/93: Version ' 2.1' */
+
+/* \SCCS Information: @(#) */
+/* FILE: seupd.F SID: 2.7 DATE OF SID: 8/27/96 RELEASE: 2 */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+/*< >*/
+/* Subroutine */ int dseupd_(logical *rvec, char *howmny, logical *select,
+ doublereal *d__, doublereal *z__, integer *ldz, doublereal *sigma,
+ char *bmat, integer *n, char *which, integer *nev, doublereal *tol,
+ doublereal *resid, integer *ncv, doublereal *v, integer *ldv, integer
+ *iparam, integer *ipntr, doublereal *workd, doublereal *workl,
+ integer *lworkl, integer *info, ftnlen howmny_len, ftnlen bmat_len,
+ ftnlen which_len)
+{
+ /* System generated locals */
+ integer v_dim1, v_offset, z_dim1, z_offset, i__1;
+ doublereal d__1, d__2, d__3;
+
+ /* Builtin functions */
+ integer s_cmp(char *, char *, ftnlen, ftnlen);
+ /* Subroutine */ int s_copy(char *, char *, ftnlen, ftnlen);
+ double pow_dd(doublereal *, doublereal *);
+
+ /* Local variables */
+ integer j, k, ih, iq, iw;
+/* doublereal kv[2]; */
+ integer ibd, ihb, ihd, ldh, ilg, ldq, ism, irz;
+ extern /* Subroutine */ int dger_(integer *, integer *, doublereal *,
+ doublereal *, integer *, doublereal *, integer *, doublereal *,
+ integer *);
+ integer mode;
+ doublereal eps23;
+ integer ierr;
+ doublereal temp;
+ integer next;
+ char type__[6];
+ integer ritz;
+ extern doublereal dnrm2_(integer *, doublereal *, integer *);
+ extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
+ integer *);
+ logical reord;
+ extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
+ doublereal *, integer *);
+ integer nconv;
+ doublereal rnorm;
+ extern /* Subroutine */ int dgeqr2_(integer *, integer *, doublereal *,
+ integer *, doublereal *, doublereal *, integer *);
+ doublereal bnorm2;
+ extern /* Subroutine */ int dorm2r_(char *, char *, integer *, integer *,
+ integer *, doublereal *, integer *, doublereal *, doublereal *,
+ integer *, doublereal *, integer *, ftnlen, ftnlen);
+ doublereal thres1, thres2;
+ extern doublereal dlamch_(char *, ftnlen);
+ integer bounds, /* msglvl, */ ktrord;
+ extern /* Subroutine */ int dlacpy_(char *, integer *, integer *,
+ doublereal *, integer *, doublereal *, integer *, ftnlen),
+ dsesrt_(char *, logical *, integer *, doublereal *, integer *,
+ doublereal *, integer *, ftnlen), dsteqr_(char *, integer *,
+ doublereal *, doublereal *, doublereal *, integer *, doublereal *,
+ integer *, ftnlen), dsortr_(char *, logical *, integer *,
+ doublereal *, doublereal *, ftnlen);
+ doublereal tempbnd;
+ integer leftptr, rghtptr;
+
+
+/* %----------------------------------------------------% */
+/* | Include files for debugging and timing information | */
+/* %----------------------------------------------------% */
+
+/*< include 'debug.h' >*/
+/*< include 'stat.h' >*/
+
+/* \SCCS Information: @(#) */
+/* FILE: debug.h SID: 2.3 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/* %---------------------------------% */
+/* | See debug.doc for documentation | */
+/* %---------------------------------% */
+/*< >*/
+/*< character bmat, howmny, which*2 >*/
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/* %--------------------------------% */
+/* | See stat.doc for documentation | */
+/* %--------------------------------% */
+
+/* \SCCS Information: @(#) */
+/* FILE: stat.h SID: 2.2 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/*< save t0, t1, t2, t3, t4, t5 >*/
+
+/*< integer nopx, nbx, nrorth, nitref, nrstrt >*/
+/*< >*/
+/*< >*/
+/*< logical rvec, select(ncv) >*/
+/*< integer info, ldz, ldv, lworkl, n, ncv, nev >*/
+/*< >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< integer iparam(7), ipntr(11) >*/
+/*< >*/
+
+/* %------------% */
+/* | Parameters | */
+/* %------------% */
+
+/*< >*/
+/*< parameter (one = 1.0D+0, zero = 0.0D+0) >*/
+
+/* %---------------% */
+/* | Local Scalars | */
+/* %---------------% */
+
+/*< character type*6 >*/
+/*< >*/
+/*< >*/
+/*< logical reord >*/
+
+/* %--------------% */
+/* | Local Arrays | */
+/* %--------------% */
+
+/*< >*/
+
+/* %----------------------% */
+/* | External Subroutines | */
+/* %----------------------% */
+
+/*< >*/
+
+/* %--------------------% */
+/* | External Functions | */
+/* %--------------------% */
+
+/*< >*/
+/*< external dnrm2, dlamch >*/
+
+/* %---------------------% */
+/* | Intrinsic Functions | */
+/* %---------------------% */
+
+/*< intrinsic min >*/
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+/* %------------------------% */
+/* | Set default parameters | */
+/* %------------------------% */
+
+/*< msglvl = mseupd >*/
+ /* Parameter adjustments */
+ --workd;
+ --resid;
+ z_dim1 = *ldz;
+ z_offset = 1 + z_dim1;
+ z__ -= z_offset;
+ --d__;
+ --select;
+ v_dim1 = *ldv;
+ v_offset = 1 + v_dim1;
+ v -= v_offset;
+ --iparam;
+ --ipntr;
+ --workl;
+
+ /* Function Body */
+/* msglvl = debug_1.mseupd; */
+/*< mode = iparam(7) >*/
+ mode = iparam[7];
+/*< nconv = iparam(5) >*/
+ nconv = iparam[5];
+/*< info = 0 >*/
+ *info = 0;
+
+/* %--------------% */
+/* | Quick return | */
+/* %--------------% */
+
+/*< if (nconv .eq. 0) go to 9000 >*/
+ if (nconv == 0) {
+ goto L9000;
+ }
+/*< ierr = 0 >*/
+ ierr = 0;
+
+/*< if (nconv .le. 0) ierr = -14 >*/
+ if (nconv <= 0) {
+ ierr = -14;
+ }
+/*< if (n .le. 0) ierr = -1 >*/
+ if (*n <= 0) {
+ ierr = -1;
+ }
+/*< if (nev .le. 0) ierr = -2 >*/
+ if (*nev <= 0) {
+ ierr = -2;
+ }
+/*< if (ncv .le. nev .or. ncv .gt. n) ierr = -3 >*/
+ if (*ncv <= *nev || *ncv > *n) {
+ ierr = -3;
+ }
+/*< >*/
+ if (s_cmp(which, "LM", (ftnlen)2, (ftnlen)2) != 0 && s_cmp(which, "SM", (
+ ftnlen)2, (ftnlen)2) != 0 && s_cmp(which, "LA", (ftnlen)2, (
+ ftnlen)2) != 0 && s_cmp(which, "SA", (ftnlen)2, (ftnlen)2) != 0 &&
+ s_cmp(which, "BE", (ftnlen)2, (ftnlen)2) != 0) {
+ ierr = -5;
+ }
+/*< if (bmat .ne. 'I' .and. bmat .ne. 'G') ierr = -6 >*/
+ if (*(unsigned char *)bmat != 'I' && *(unsigned char *)bmat != 'G') {
+ ierr = -6;
+ }
+/*< >*/
+ if (*(unsigned char *)howmny != 'A' && *(unsigned char *)howmny != 'P' &&
+ *(unsigned char *)howmny != 'S' && *rvec) {
+ ierr = -15;
+ }
+/*< if (rvec .and. howmny .eq. 'S') ierr = -16 >*/
+ if (*rvec && *(unsigned char *)howmny == 'S') {
+ ierr = -16;
+ }
+
+/*< if (rvec .and. lworkl .lt. ncv**2+8*ncv) ierr = -7 >*/
+/* Computing 2nd power */
+ i__1 = *ncv;
+ if (*rvec && *lworkl < i__1 * i__1 + (*ncv << 3)) {
+ ierr = -7;
+ }
+
+/*< if (mode .eq. 1 .or. mode .eq. 2) then >*/
+ if (mode == 1 || mode == 2) {
+/*< type = 'REGULR' >*/
+ s_copy(type__, "REGULR", (ftnlen)6, (ftnlen)6);
+/*< else if (mode .eq. 3 ) then >*/
+ } else if (mode == 3) {
+/*< type = 'SHIFTI' >*/
+ s_copy(type__, "SHIFTI", (ftnlen)6, (ftnlen)6);
+/*< else if (mode .eq. 4 ) then >*/
+ } else if (mode == 4) {
+/*< type = 'BUCKLE' >*/
+ s_copy(type__, "BUCKLE", (ftnlen)6, (ftnlen)6);
+/*< else if (mode .eq. 5 ) then >*/
+ } else if (mode == 5) {
+/*< type = 'CAYLEY' >*/
+ s_copy(type__, "CAYLEY", (ftnlen)6, (ftnlen)6);
+/*< else >*/
+ } else {
+/*< ierr = -10 >*/
+ ierr = -10;
+/*< end if >*/
+ }
+/*< if (mode .eq. 1 .and. bmat .eq. 'G') ierr = -11 >*/
+ if (mode == 1 && *(unsigned char *)bmat == 'G') {
+ ierr = -11;
+ }
+/*< if (nev .eq. 1 .and. which .eq. 'BE') ierr = -12 >*/
+ if (*nev == 1 && s_cmp(which, "BE", (ftnlen)2, (ftnlen)2) == 0) {
+ ierr = -12;
+ }
+
+/* %------------% */
+/* | Error Exit | */
+/* %------------% */
+
+/*< if (ierr .ne. 0) then >*/
+ if (ierr != 0) {
+/*< info = ierr >*/
+ *info = ierr;
+/*< go to 9000 >*/
+ goto L9000;
+/*< end if >*/
+ }
+
+/* %-------------------------------------------------------% */
+/* | Pointer into WORKL for address of H, RITZ, BOUNDS, Q | */
+/* | etc... and the remaining workspace. | */
+/* | Also update pointer to be used on output. | */
+/* | Memory is laid out as follows: | */
+/* | workl(1:2*ncv) := generated tridiagonal matrix H | */
+/* | The subdiagonal is stored in workl(2:ncv). | */
+/* | The dead spot is workl(1) but upon exiting | */
+/* | dsaupd stores the B-norm of the last residual | */
+/* | vector in workl(1). We use this !!! | */
+/* | workl(2*ncv+1:2*ncv+ncv) := ritz values | */
+/* | The wanted values are in the first NCONV spots. | */
+/* | workl(3*ncv+1:3*ncv+ncv) := computed Ritz estimates | */
+/* | The wanted values are in the first NCONV spots. | */
+/* | NOTE: workl(1:4*ncv) is set by dsaupd and is not | */
+/* | modified by dseupd. | */
+/* %-------------------------------------------------------% */
+
+/* %-------------------------------------------------------% */
+/* | The following is used and set by dseupd. | */
+/* | workl(4*ncv+1:4*ncv+ncv) := used as workspace during | */
+/* | computation of the eigenvectors of H. Stores | */
+/* | the diagonal of H. Upon EXIT contains the NCV | */
+/* | Ritz values of the original system. The first | */
+/* | NCONV spots have the wanted values. If MODE = | */
+/* | 1 or 2 then will equal workl(2*ncv+1:3*ncv). | */
+/* | workl(5*ncv+1:5*ncv+ncv) := used as workspace during | */
+/* | computation of the eigenvectors of H. Stores | */
+/* | the subdiagonal of H. Upon EXIT contains the | */
+/* | NCV corresponding Ritz estimates of the | */
+/* | original system. The first NCONV spots have the | */
+/* | wanted values. If MODE = 1,2 then will equal | */
+/* | workl(3*ncv+1:4*ncv). | */
+/* | workl(6*ncv+1:6*ncv+ncv*ncv) := orthogonal Q that is | */
+/* | the eigenvector matrix for H as returned by | */
+/* | dsteqr. Not referenced if RVEC = .False. | */
+/* | Ordering follows that of workl(4*ncv+1:5*ncv) | */
+/* | workl(6*ncv+ncv*ncv+1:6*ncv+ncv*ncv+2*ncv) := | */
+/* | Workspace. Needed by dsteqr and by dseupd. | */
+/* | GRAND total of NCV*(NCV+8) locations. | */
+/* %-------------------------------------------------------% */
+
+
+/*< ih = ipntr(5) >*/
+ ih = ipntr[5];
+/*< ritz = ipntr(6) >*/
+ ritz = ipntr[6];
+/*< bounds = ipntr(7) >*/
+ bounds = ipntr[7];
+/*< ldh = ncv >*/
+ ldh = *ncv;
+/*< ldq = ncv >*/
+ ldq = *ncv;
+/*< ihd = bounds + ldh >*/
+ ihd = bounds + ldh;
+/*< ihb = ihd + ldh >*/
+ ihb = ihd + ldh;
+/*< iq = ihb + ldh >*/
+ iq = ihb + ldh;
+/*< iw = iq + ldh*ncv >*/
+ iw = iq + ldh * *ncv;
+/*< next = iw + 2*ncv >*/
+ next = iw + (*ncv << 1);
+/*< ipntr(4) = next >*/
+ ipntr[4] = next;
+/*< ipntr(8) = ihd >*/
+ ipntr[8] = ihd;
+/*< ipntr(9) = ihb >*/
+ ipntr[9] = ihb;
+/*< ipntr(10) = iq >*/
+ ipntr[10] = iq;
+
+/* %----------------------------------------% */
+/* | irz points to the Ritz values computed | */
+/* | by _seigt before exiting _saup2. | */
+/* | ibd points to the Ritz estimates | */
+/* | computed by _seigt before exiting | */
+/* | _saup2. | */
+/* %----------------------------------------% */
+
+/*< irz = ipntr(11)+ncv >*/
+ irz = ipntr[11] + *ncv;
+/*< ibd = irz+ncv >*/
+ ibd = irz + *ncv;
+
+
+/* %---------------------------------% */
+/* | Set machine dependent constant. | */
+/* %---------------------------------% */
+
+/*< eps23 = dlamch('Epsilon-Machine') >*/
+ eps23 = dlamch_("Epsilon-Machine", (ftnlen)15);
+/*< eps23 = eps23**(2.0D+0 / 3.0D+0) >*/
+ eps23 = pow_dd(&eps23, &c_b21);
+
+/* %---------------------------------------% */
+/* | RNORM is B-norm of the RESID(1:N). | */
+/* | BNORM2 is the 2 norm of B*RESID(1:N). | */
+/* | Upon exit of dsaupd WORKD(1:N) has | */
+/* | B*RESID(1:N). | */
+/* %---------------------------------------% */
+
+/*< rnorm = workl(ih) >*/
+ rnorm = workl[ih];
+/*< if (bmat .eq. 'I') then >*/
+ if (*(unsigned char *)bmat == 'I') {
+/*< bnorm2 = rnorm >*/
+ bnorm2 = rnorm;
+/*< else if (bmat .eq. 'G') then >*/
+ } else if (*(unsigned char *)bmat == 'G') {
+/*< bnorm2 = dnrm2(n, workd, 1) >*/
+ bnorm2 = dnrm2_(n, &workd[1], &c__1);
+/*< end if >*/
+ }
+
+/*< if (rvec) then >*/
+ if (*rvec) {
+
+/* %------------------------------------------------% */
+/* | Get the converged Ritz value on the boundary. | */
+/* | This value will be used to dermine whether we | */
+/* | need to reorder the eigenvalues and | */
+/* | eigenvectors comupted by _steqr, and is | */
+/* | referred to as the "threshold" value. | */
+/* | | */
+/* | A Ritz value gamma is said to be a wanted | */
+/* | one, if | */
+/* | abs(gamma) .ge. threshold, when WHICH = 'LM'; | */
+/* | abs(gamma) .le. threshold, when WHICH = 'SM'; | */
+/* | gamma .ge. threshold, when WHICH = 'LA'; | */
+/* | gamma .le. threshold, when WHICH = 'SA'; | */
+/* | gamma .le. thres1 .or. gamma .ge. thres2 | */
+/* | when WHICH = 'BE'; | */
+/* | | */
+/* | Note: converged Ritz values and associated | */
+/* | Ritz estimates have been placed in the first | */
+/* | NCONV locations in workl(ritz) and | */
+/* | workl(bounds) respectively. They have been | */
+/* | sorted (in _saup2) according to the WHICH | */
+/* | selection criterion. (Except in the case | */
+/* | WHICH = 'BE', they are sorted in an increasing | */
+/* | order.) | */
+/* %------------------------------------------------% */
+
+/*< >*/
+ if (s_cmp(which, "LM", (ftnlen)2, (ftnlen)2) == 0 || s_cmp(which,
+ "SM", (ftnlen)2, (ftnlen)2) == 0 || s_cmp(which, "LA", (
+ ftnlen)2, (ftnlen)2) == 0 || s_cmp(which, "SA", (ftnlen)2, (
+ ftnlen)2) == 0) {
+
+/*< thres1 = workl(ritz) >*/
+ thres1 = workl[ritz];
+
+/* if (msglvl .gt. 2) then */
+/* call dvout(logfil, 1, thres1, ndigit, */
+/* & '_seupd: Threshold eigenvalue used for re-ordering') */
+/* end if */
+
+/*< else if (which .eq. 'BE') then >*/
+ } else if (s_cmp(which, "BE", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* %------------------------------------------------% */
+/* | Ritz values returned from _saup2 have been | */
+/* | sorted in increasing order. Thus two | */
+/* | "threshold" values (one for the small end, one | */
+/* | for the large end) are in the middle. | */
+/* %------------------------------------------------% */
+
+/*< ism = max(nev,nconv) / 2 >*/
+ ism = max(*nev,nconv) / 2;
+/*< ilg = ism + 1 >*/
+ ilg = ism + 1;
+/*< thres1 = workl(ism) >*/
+ thres1 = workl[ism];
+/*< thres2 = workl(ilg) >*/
+ thres2 = workl[ilg];
+
+/*< if (msglvl .gt. 2) then >*/
+/* if (msglvl > 2) { */
+/*< kv(1) = thres1 >*/
+/* kv[0] = thres1; */
+/*< kv(2) = thres2 >*/
+/* kv[1] = thres2; */
+/* call dvout(logfil, 2, kv, ndigit, */
+/* & '_seupd: Threshold eigenvalues used for re-ordering') */
+/*< end if >*/
+/* } */
+
+/*< end if >*/
+ }
+
+/* %----------------------------------------------------------% */
+/* | Check to see if all converged Ritz values appear within | */
+/* | the first NCONV diagonal elements returned from _seigt. | */
+/* | This is done in the following way: | */
+/* | | */
+/* | 1) For each Ritz value obtained from _seigt, compare it | */
+/* | with the threshold Ritz value computed above to | */
+/* | determine whether it is a wanted one. | */
+/* | | */
+/* | 2) If it is wanted, then check the corresponding Ritz | */
+/* | estimate to see if it has converged. If it has, set | */
+/* | corresponding entry in the logical array SELECT to | */
+/* | .TRUE.. | */
+/* | | */
+/* | If SELECT(j) = .TRUE. and j > NCONV, then there is a | */
+/* | converged Ritz value that does not appear at the top of | */
+/* | the diagonal matrix computed by _seigt in _saup2. | */
+/* | Reordering is needed. | */
+/* %----------------------------------------------------------% */
+
+/*< reord = .false. >*/
+ reord = FALSE_;
+/*< ktrord = 0 >*/
+ ktrord = 0;
+/*< do 10 j = 0, ncv-1 >*/
+ i__1 = *ncv - 1;
+ for (j = 0; j <= i__1; ++j) {
+/*< select(j+1) = .false. >*/
+ select[j + 1] = FALSE_;
+/*< if (which .eq. 'LM') then >*/
+ if (s_cmp(which, "LM", (ftnlen)2, (ftnlen)2) == 0) {
+/*< if (abs(workl(irz+j)) .ge. abs(thres1)) then >*/
+ if ((d__1 = workl[irz + j], abs(d__1)) >= abs(thres1)) {
+/*< tempbnd = max( eps23, abs(workl(irz+j)) ) >*/
+/* Computing MAX */
+ d__2 = eps23, d__3 = (d__1 = workl[irz + j], abs(d__1));
+ tempbnd = max(d__2,d__3);
+/*< if (workl(ibd+j) .le. tol*tempbnd) then >*/
+ if (workl[ibd + j] <= *tol * tempbnd) {
+/*< select(j+1) = .true. >*/
+ select[j + 1] = TRUE_;
+/*< end if >*/
+ }
+/*< end if >*/
+ }
+/*< else if (which .eq. 'SM') then >*/
+ } else if (s_cmp(which, "SM", (ftnlen)2, (ftnlen)2) == 0) {
+/*< if (abs(workl(irz+j)) .le. abs(thres1)) then >*/
+ if ((d__1 = workl[irz + j], abs(d__1)) <= abs(thres1)) {
+/*< tempbnd = max( eps23, abs(workl(irz+j)) ) >*/
+/* Computing MAX */
+ d__2 = eps23, d__3 = (d__1 = workl[irz + j], abs(d__1));
+ tempbnd = max(d__2,d__3);
+/*< if (workl(ibd+j) .le. tol*tempbnd) then >*/
+ if (workl[ibd + j] <= *tol * tempbnd) {
+/*< select(j+1) = .true. >*/
+ select[j + 1] = TRUE_;
+/*< end if >*/
+ }
+/*< end if >*/
+ }
+/*< else if (which .eq. 'LA') then >*/
+ } else if (s_cmp(which, "LA", (ftnlen)2, (ftnlen)2) == 0) {
+/*< if (workl(irz+j) .ge. thres1) then >*/
+ if (workl[irz + j] >= thres1) {
+/*< tempbnd = max( eps23, abs(workl(irz+j)) ) >*/
+/* Computing MAX */
+ d__2 = eps23, d__3 = (d__1 = workl[irz + j], abs(d__1));
+ tempbnd = max(d__2,d__3);
+/*< if (workl(ibd+j) .le. tol*tempbnd) then >*/
+ if (workl[ibd + j] <= *tol * tempbnd) {
+/*< select(j+1) = .true. >*/
+ select[j + 1] = TRUE_;
+/*< end if >*/
+ }
+/*< end if >*/
+ }
+/*< else if (which .eq. 'SA') then >*/
+ } else if (s_cmp(which, "SA", (ftnlen)2, (ftnlen)2) == 0) {
+/*< if (workl(irz+j) .le. thres1) then >*/
+ if (workl[irz + j] <= thres1) {
+/*< tempbnd = max( eps23, abs(workl(irz+j)) ) >*/
+/* Computing MAX */
+ d__2 = eps23, d__3 = (d__1 = workl[irz + j], abs(d__1));
+ tempbnd = max(d__2,d__3);
+/*< if (workl(ibd+j) .le. tol*tempbnd) then >*/
+ if (workl[ibd + j] <= *tol * tempbnd) {
+/*< select(j+1) = .true. >*/
+ select[j + 1] = TRUE_;
+/*< end if >*/
+ }
+/*< end if >*/
+ }
+/*< else if (which .eq. 'BE') then >*/
+ } else if (s_cmp(which, "BE", (ftnlen)2, (ftnlen)2) == 0) {
+/*< >*/
+ if (workl[irz + j] <= thres1 || workl[irz + j] >= thres2) {
+/*< tempbnd = max( eps23, abs(workl(irz+j)) ) >*/
+/* Computing MAX */
+ d__2 = eps23, d__3 = (d__1 = workl[irz + j], abs(d__1));
+ tempbnd = max(d__2,d__3);
+/*< if (workl(ibd+j) .le. tol*tempbnd) then >*/
+ if (workl[ibd + j] <= *tol * tempbnd) {
+/*< select(j+1) = .true. >*/
+ select[j + 1] = TRUE_;
+/*< end if >*/
+ }
+/*< end if >*/
+ }
+/*< end if >*/
+ }
+/*< if (j+1 .gt. nconv ) reord = select(j+1) .or. reord >*/
+ if (j + 1 > nconv) {
+ reord = select[j + 1] || reord;
+ }
+/*< if (select(j+1)) ktrord = ktrord + 1 >*/
+ if (select[j + 1]) {
+ ++ktrord;
+ }
+/*< 10 continue >*/
+/* L10: */
+ }
+/* %-------------------------------------------% */
+/* | If KTRORD .ne. NCONV, something is wrong. | */
+/* %-------------------------------------------% */
+
+/* if (msglvl .gt. 2) then */
+/* call ivout(logfil, 1, ktrord, ndigit, */
+/* & '_seupd: Number of specified eigenvalues') */
+/* call ivout(logfil, 1, nconv, ndigit, */
+/* & '_seupd: Number of "converged" eigenvalues') */
+/* end if */
+
+/* %-----------------------------------------------------------% */
+/* | Call LAPACK routine _steqr to compute the eigenvalues and | */
+/* | eigenvectors of the final symmetric tridiagonal matrix H. | */
+/* | Initialize the eigenvector matrix Q to the identity. | */
+/* %-----------------------------------------------------------% */
+
+/*< call dcopy (ncv-1, workl(ih+1), 1, workl(ihb), 1) >*/
+ i__1 = *ncv - 1;
+ dcopy_(&i__1, &workl[ih + 1], &c__1, &workl[ihb], &c__1);
+/*< call dcopy (ncv, workl(ih+ldh), 1, workl(ihd), 1) >*/
+ dcopy_(ncv, &workl[ih + ldh], &c__1, &workl[ihd], &c__1);
+
+/*< >*/
+ dsteqr_("Identity", ncv, &workl[ihd], &workl[ihb], &workl[iq], &ldq, &
+ workl[iw], &ierr, (ftnlen)8);
+
+/*< if (ierr .ne. 0) then >*/
+ if (ierr != 0) {
+/*< info = -8 >*/
+ *info = -8;
+/*< go to 9000 >*/
+ goto L9000;
+/*< end if >*/
+ }
+
+/*< if (msglvl .gt. 1) then >*/
+/* if (msglvl > 1) { */
+/*< call dcopy (ncv, workl(iq+ncv-1), ldq, workl(iw), 1) >*/
+/* dcopy_(ncv, &workl[iq + *ncv - 1], &ldq, &workl[iw], &c__1); */
+/* call dvout (logfil, ncv, workl(ihd), ndigit, */
+/* & '_seupd: NCV Ritz values of the final H matrix') */
+/* call dvout (logfil, ncv, workl(iw), ndigit, */
+/* & '_seupd: last row of the eigenvector matrix for H') */
+/*< end if >*/
+/* } */
+
+/*< if (reord) then >*/
+ if (reord) {
+
+/* %---------------------------------------------% */
+/* | Reordered the eigenvalues and eigenvectors | */
+/* | computed by _steqr so that the "converged" | */
+/* | eigenvalues appear in the first NCONV | */
+/* | positions of workl(ihd), and the associated | */
+/* | eigenvectors appear in the first NCONV | */
+/* | columns. | */
+/* %---------------------------------------------% */
+
+/*< leftptr = 1 >*/
+ leftptr = 1;
+/*< rghtptr = ncv >*/
+ rghtptr = *ncv;
+
+/*< if (ncv .eq. 1) go to 30 >*/
+ if (*ncv == 1) {
+ goto L30;
+ }
+
+/*< 20 if (select(leftptr)) then >*/
+L20:
+ if (select[leftptr]) {
+
+/* %-------------------------------------------% */
+/* | Search, from the left, for the first Ritz | */
+/* | value that has not converged. | */
+/* %-------------------------------------------% */
+
+/*< leftptr = leftptr + 1 >*/
+ ++leftptr;
+
+/*< else if ( .not. select(rghtptr)) then >*/
+ } else if (! select[rghtptr]) {
+
+/* %----------------------------------------------% */
+/* | Search, from the right, the first Ritz value | */
+/* | that has converged. | */
+/* %----------------------------------------------% */
+
+/*< rghtptr = rghtptr - 1 >*/
+ --rghtptr;
+
+/*< else >*/
+ } else {
+
+/* %----------------------------------------------% */
+/* | Swap the Ritz value on the left that has not | */
+/* | converged with the Ritz value on the right | */
+/* | that has converged. Swap the associated | */
+/* | eigenvector of the tridiagonal matrix H as | */
+/* | well. | */
+/* %----------------------------------------------% */
+
+/*< temp = workl(ihd+leftptr-1) >*/
+ temp = workl[ihd + leftptr - 1];
+/*< workl(ihd+leftptr-1) = workl(ihd+rghtptr-1) >*/
+ workl[ihd + leftptr - 1] = workl[ihd + rghtptr - 1];
+/*< workl(ihd+rghtptr-1) = temp >*/
+ workl[ihd + rghtptr - 1] = temp;
+/*< >*/
+ dcopy_(ncv, &workl[iq + *ncv * (leftptr - 1)], &c__1, &workl[
+ iw], &c__1);
+/*< >*/
+ dcopy_(ncv, &workl[iq + *ncv * (rghtptr - 1)], &c__1, &workl[
+ iq + *ncv * (leftptr - 1)], &c__1);
+/*< >*/
+ dcopy_(ncv, &workl[iw], &c__1, &workl[iq + *ncv * (rghtptr -
+ 1)], &c__1);
+/*< leftptr = leftptr + 1 >*/
+ ++leftptr;
+/*< rghtptr = rghtptr - 1 >*/
+ --rghtptr;
+
+/*< end if >*/
+ }
+
+/*< if (leftptr .lt. rghtptr) go to 20 >*/
+ if (leftptr < rghtptr) {
+ goto L20;
+ }
+
+/*< 30 end if >*/
+L30:
+ ;
+ }
+
+/* if (msglvl .gt. 2) then */
+/* call dvout (logfil, ncv, workl(ihd), ndigit, */
+/* & '_seupd: The eigenvalues of H--reordered') */
+/* end if */
+
+/* %----------------------------------------% */
+/* | Load the converged Ritz values into D. | */
+/* %----------------------------------------% */
+
+/*< call dcopy(nconv, workl(ihd), 1, d, 1) >*/
+ dcopy_(&nconv, &workl[ihd], &c__1, &d__[1], &c__1);
+
+/*< else >*/
+ } else {
+
+/* %-----------------------------------------------------% */
+/* | Ritz vectors not required. Load Ritz values into D. | */
+/* %-----------------------------------------------------% */
+
+/*< call dcopy (nconv, workl(ritz), 1, d, 1) >*/
+ dcopy_(&nconv, &workl[ritz], &c__1, &d__[1], &c__1);
+/*< call dcopy (ncv, workl(ritz), 1, workl(ihd), 1) >*/
+ dcopy_(ncv, &workl[ritz], &c__1, &workl[ihd], &c__1);
+
+/*< end if >*/
+ }
+
+/* %------------------------------------------------------------------% */
+/* | Transform the Ritz values and possibly vectors and corresponding | */
+/* | Ritz estimates of OP to those of A*x=lambda*B*x. The Ritz values | */
+/* | (and corresponding data) are returned in ascending order. | */
+/* %------------------------------------------------------------------% */
+
+/*< if (type .eq. 'REGULR') then >*/
+ if (s_cmp(type__, "REGULR", (ftnlen)6, (ftnlen)6) == 0) {
+
+/* %---------------------------------------------------------% */
+/* | Ascending sort of wanted Ritz values, vectors and error | */
+/* | bounds. Not necessary if only Ritz values are desired. | */
+/* %---------------------------------------------------------% */
+
+/*< if (rvec) then >*/
+ if (*rvec) {
+/*< call dsesrt ('LA', rvec , nconv, d, ncv, workl(iq), ldq) >*/
+ dsesrt_("LA", rvec, &nconv, &d__[1], ncv, &workl[iq], &ldq, (
+ ftnlen)2);
+/*< else >*/
+ } else {
+/*< call dcopy (ncv, workl(bounds), 1, workl(ihb), 1) >*/
+ dcopy_(ncv, &workl[bounds], &c__1, &workl[ihb], &c__1);
+/*< end if >*/
+ }
+
+/*< else >*/
+ } else {
+
+/* %-------------------------------------------------------------% */
+/* | * Make a copy of all the Ritz values. | */
+/* | * Transform the Ritz values back to the original system. | */
+/* | For TYPE = 'SHIFTI' the transformation is | */
+/* | lambda = 1/theta + sigma | */
+/* | For TYPE = 'BUCKLE' the transformation is | */
+/* | lambda = sigma * theta / ( theta - 1 ) | */
+/* | For TYPE = 'CAYLEY' the transformation is | */
+/* | lambda = sigma * (theta + 1) / (theta - 1 ) | */
+/* | where the theta are the Ritz values returned by dsaupd. | */
+/* | NOTES: | */
+/* | *The Ritz vectors are not affected by the transformation. | */
+/* | They are only reordered. | */
+/* %-------------------------------------------------------------% */
+
+/*< call dcopy (ncv, workl(ihd), 1, workl(iw), 1) >*/
+ dcopy_(ncv, &workl[ihd], &c__1, &workl[iw], &c__1);
+/*< if (type .eq. 'SHIFTI') then >*/
+ if (s_cmp(type__, "SHIFTI", (ftnlen)6, (ftnlen)6) == 0) {
+/*< do 40 k=1, ncv >*/
+ i__1 = *ncv;
+ for (k = 1; k <= i__1; ++k) {
+/*< workl(ihd+k-1) = one / workl(ihd+k-1) + sigma >*/
+ workl[ihd + k - 1] = 1. / workl[ihd + k - 1] + *sigma;
+/*< 40 continue >*/
+/* L40: */
+ }
+/*< else if (type .eq. 'BUCKLE') then >*/
+ } else if (s_cmp(type__, "BUCKLE", (ftnlen)6, (ftnlen)6) == 0) {
+/*< do 50 k=1, ncv >*/
+ i__1 = *ncv;
+ for (k = 1; k <= i__1; ++k) {
+/*< >*/
+ workl[ihd + k - 1] = *sigma * workl[ihd + k - 1] / (workl[ihd
+ + k - 1] - 1.);
+/*< 50 continue >*/
+/* L50: */
+ }
+/*< else if (type .eq. 'CAYLEY') then >*/
+ } else if (s_cmp(type__, "CAYLEY", (ftnlen)6, (ftnlen)6) == 0) {
+/*< do 60 k=1, ncv >*/
+ i__1 = *ncv;
+ for (k = 1; k <= i__1; ++k) {
+/*< >*/
+ workl[ihd + k - 1] = *sigma * (workl[ihd + k - 1] + 1.) / (
+ workl[ihd + k - 1] - 1.);
+/*< 60 continue >*/
+/* L60: */
+ }
+/*< end if >*/
+ }
+
+/* %-------------------------------------------------------------% */
+/* | * Store the wanted NCONV lambda values into D. | */
+/* | * Sort the NCONV wanted lambda in WORKL(IHD:IHD+NCONV-1) | */
+/* | into ascending order and apply sort to the NCONV theta | */
+/* | values in the transformed system. We'll need this to | */
+/* | compute Ritz estimates in the original system. | */
+/* | * Finally sort the lambda's into ascending order and apply | */
+/* | to Ritz vectors if wanted. Else just sort lambda's into | */
+/* | ascending order. | */
+/* | NOTES: | */
+/* | *workl(iw:iw+ncv-1) contain the theta ordered so that they | */
+/* | match the ordering of the lambda. We'll use them again for | */
+/* | Ritz vector purification. | */
+/* %-------------------------------------------------------------% */
+
+/*< call dcopy (nconv, workl(ihd), 1, d, 1) >*/
+ dcopy_(&nconv, &workl[ihd], &c__1, &d__[1], &c__1);
+/*< call dsortr ('LA', .true., nconv, workl(ihd), workl(iw)) >*/
+ dsortr_("LA", &c_true, &nconv, &workl[ihd], &workl[iw], (ftnlen)2);
+/*< if (rvec) then >*/
+ if (*rvec) {
+/*< call dsesrt ('LA', rvec , nconv, d, ncv, workl(iq), ldq) >*/
+ dsesrt_("LA", rvec, &nconv, &d__[1], ncv, &workl[iq], &ldq, (
+ ftnlen)2);
+/*< else >*/
+ } else {
+/*< call dcopy (ncv, workl(bounds), 1, workl(ihb), 1) >*/
+ dcopy_(ncv, &workl[bounds], &c__1, &workl[ihb], &c__1);
+/*< call dscal (ncv, bnorm2/rnorm, workl(ihb), 1) >*/
+ d__1 = bnorm2 / rnorm;
+ dscal_(ncv, &d__1, &workl[ihb], &c__1);
+/*< call dsortr ('LA', .true., nconv, d, workl(ihb)) >*/
+ dsortr_("LA", &c_true, &nconv, &d__[1], &workl[ihb], (ftnlen)2);
+/*< end if >*/
+ }
+
+/*< end if >*/
+ }
+
+/* %------------------------------------------------% */
+/* | Compute the Ritz vectors. Transform the wanted | */
+/* | eigenvectors of the symmetric tridiagonal H by | */
+/* | the Lanczos basis matrix V. | */
+/* %------------------------------------------------% */
+
+/*< if (rvec .and. howmny .eq. 'A') then >*/
+ if (*rvec && *(unsigned char *)howmny == 'A') {
+
+/* %----------------------------------------------------------% */
+/* | Compute the QR factorization of the matrix representing | */
+/* | the wanted invariant subspace located in the first NCONV | */
+/* | columns of workl(iq,ldq). | */
+/* %----------------------------------------------------------% */
+
+/*< >*/
+ dgeqr2_(ncv, &nconv, &workl[iq], &ldq, &workl[iw + *ncv], &workl[ihb],
+ &ierr);
+
+
+/* %--------------------------------------------------------% */
+/* | * Postmultiply V by Q. | */
+/* | * Copy the first NCONV columns of VQ into Z. | */
+/* | The N by NCONV matrix Z is now a matrix representation | */
+/* | of the approximate invariant subspace associated with | */
+/* | the Ritz values in workl(ihd). | */
+/* %--------------------------------------------------------% */
+
+/*< >*/
+ dorm2r_("Right", "Notranspose", n, ncv, &nconv, &workl[iq], &ldq, &
+ workl[iw + *ncv], &v[v_offset], ldv, &workd[*n + 1], &ierr, (
+ ftnlen)5, (ftnlen)11);
+/*< call dlacpy ('All', n, nconv, v, ldv, z, ldz) >*/
+ dlacpy_("All", n, &nconv, &v[v_offset], ldv, &z__[z_offset], ldz, (
+ ftnlen)3);
+
+/* %-----------------------------------------------------% */
+/* | In order to compute the Ritz estimates for the Ritz | */
+/* | values in both systems, need the last row of the | */
+/* | eigenvector matrix. Remember, it's in factored form | */
+/* %-----------------------------------------------------% */
+
+/*< do 65 j = 1, ncv-1 >*/
+ i__1 = *ncv - 1;
+ for (j = 1; j <= i__1; ++j) {
+/*< workl(ihb+j-1) = zero >*/
+ workl[ihb + j - 1] = 0.;
+/*< 65 continue >*/
+/* L65: */
+ }
+/*< workl(ihb+ncv-1) = one >*/
+ workl[ihb + *ncv - 1] = 1.;
+/*< >*/
+ dorm2r_("Left", "Transpose", ncv, &c__1, &nconv, &workl[iq], &ldq, &
+ workl[iw + *ncv], &workl[ihb], ncv, &temp, &ierr, (ftnlen)4, (
+ ftnlen)9);
+
+/*< else if (rvec .and. howmny .eq. 'S') then >*/
+ } else if (*rvec && *(unsigned char *)howmny == 'S') {
+
+/* Not yet implemented. See remark 2 above. */
+
+/*< end if >*/
+ }
+
+/*< if (type .eq. 'REGULR' .and. rvec) then >*/
+ if (s_cmp(type__, "REGULR", (ftnlen)6, (ftnlen)6) == 0 && *rvec) {
+
+/*< do 70 j=1, ncv >*/
+ i__1 = *ncv;
+ for (j = 1; j <= i__1; ++j) {
+/*< workl(ihb+j-1) = rnorm * abs( workl(ihb+j-1) ) >*/
+ workl[ihb + j - 1] = rnorm * (d__1 = workl[ihb + j - 1], abs(d__1)
+ );
+/*< 70 continue >*/
+/* L70: */
+ }
+
+/*< else if (type .ne. 'REGULR' .and. rvec) then >*/
+ } else if (s_cmp(type__, "REGULR", (ftnlen)6, (ftnlen)6) != 0 && *rvec) {
+
+/* %-------------------------------------------------% */
+/* | * Determine Ritz estimates of the theta. | */
+/* | If RVEC = .true. then compute Ritz estimates | */
+/* | of the theta. | */
+/* | If RVEC = .false. then copy Ritz estimates | */
+/* | as computed by dsaupd. | */
+/* | * Determine Ritz estimates of the lambda. | */
+/* %-------------------------------------------------% */
+
+/*< call dscal (ncv, bnorm2, workl(ihb), 1) >*/
+ dscal_(ncv, &bnorm2, &workl[ihb], &c__1);
+/*< if (type .eq. 'SHIFTI') then >*/
+ if (s_cmp(type__, "SHIFTI", (ftnlen)6, (ftnlen)6) == 0) {
+
+/*< do 80 k=1, ncv >*/
+ i__1 = *ncv;
+ for (k = 1; k <= i__1; ++k) {
+/*< workl(ihb+k-1) = abs( workl(ihb+k-1) ) / workl(iw+k-1)**2 >*/
+/* Computing 2nd power */
+ d__2 = workl[iw + k - 1];
+ workl[ihb + k - 1] = (d__1 = workl[ihb + k - 1], abs(d__1)) /
+ (d__2 * d__2);
+/*< 80 continue >*/
+/* L80: */
+ }
+
+/*< else if (type .eq. 'BUCKLE') then >*/
+ } else if (s_cmp(type__, "BUCKLE", (ftnlen)6, (ftnlen)6) == 0) {
+
+/*< do 90 k=1, ncv >*/
+ i__1 = *ncv;
+ for (k = 1; k <= i__1; ++k) {
+/*< >*/
+/* Computing 2nd power */
+ d__2 = workl[iw + k - 1] - 1.;
+ workl[ihb + k - 1] = *sigma * (d__1 = workl[ihb + k - 1], abs(
+ d__1)) / (d__2 * d__2);
+/*< 90 continue >*/
+/* L90: */
+ }
+
+/*< else if (type .eq. 'CAYLEY') then >*/
+ } else if (s_cmp(type__, "CAYLEY", (ftnlen)6, (ftnlen)6) == 0) {
+
+/*< do 100 k=1, ncv >*/
+ i__1 = *ncv;
+ for (k = 1; k <= i__1; ++k) {
+/*< >*/
+ workl[ihb + k - 1] = (d__1 = workl[ihb + k - 1] / workl[iw +
+ k - 1] * (workl[iw + k - 1] - 1.), abs(d__1));
+/*< 100 continue >*/
+/* L100: */
+ }
+
+/*< end if >*/
+ }
+
+/*< end if >*/
+ }
+
+/* if (type .ne. 'REGULR' .and. msglvl .gt. 1) then */
+/* call dvout (logfil, nconv, d, ndigit, */
+/* & '_seupd: Untransformed converged Ritz values') */
+/* call dvout (logfil, nconv, workl(ihb), ndigit, */
+/* & '_seupd: Ritz estimates of the untransformed Ritz values') */
+/* else if (msglvl .gt. 1) then */
+/* call dvout (logfil, nconv, d, ndigit, */
+/* & '_seupd: Converged Ritz values') */
+/* call dvout (logfil, nconv, workl(ihb), ndigit, */
+/* & '_seupd: Associated Ritz estimates') */
+/* end if */
+
+/* %-------------------------------------------------% */
+/* | Ritz vector purification step. Formally perform | */
+/* | one of inverse subspace iteration. Only used | */
+/* | for MODE = 3,4,5. See reference 7 | */
+/* %-------------------------------------------------% */
+
+/*< if (rvec .and. (type .eq. 'SHIFTI' .or. type .eq. 'CAYLEY')) then >*/
+ if (*rvec && (s_cmp(type__, "SHIFTI", (ftnlen)6, (ftnlen)6) == 0 || s_cmp(
+ type__, "CAYLEY", (ftnlen)6, (ftnlen)6) == 0)) {
+
+/*< do 110 k=0, nconv-1 >*/
+ i__1 = nconv - 1;
+ for (k = 0; k <= i__1; ++k) {
+/*< workl(iw+k) = workl(iq+k*ldq+ncv-1) / workl(iw+k) >*/
+ workl[iw + k] = workl[iq + k * ldq + *ncv - 1] / workl[iw + k];
+/*< 110 continue >*/
+/* L110: */
+ }
+
+/*< else if (rvec .and. type .eq. 'BUCKLE') then >*/
+ } else if (*rvec && s_cmp(type__, "BUCKLE", (ftnlen)6, (ftnlen)6) == 0) {
+
+/*< do 120 k=0, nconv-1 >*/
+ i__1 = nconv - 1;
+ for (k = 0; k <= i__1; ++k) {
+/*< workl(iw+k) = workl(iq+k*ldq+ncv-1) / (workl(iw+k)-one) >*/
+ workl[iw + k] = workl[iq + k * ldq + *ncv - 1] / (workl[iw + k] -
+ 1.);
+/*< 120 continue >*/
+/* L120: */
+ }
+
+/*< end if >*/
+ }
+
+/*< >*/
+ if (s_cmp(type__, "REGULR", (ftnlen)6, (ftnlen)6) != 0) {
+ dger_(n, &nconv, &c_b103, &resid[1], &c__1, &workl[iw], &c__1, &z__[
+ z_offset], ldz);
+ }
+
+/*< 9000 continue >*/
+L9000:
+
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dseupd | */
+/* %---------------% */
+
+/*< end >*/
+} /* dseupd_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.f
new file mode 100644
index 0000000000000000000000000000000000000000..8a92af5bdae7bec77a8ce38ca45e3ec6d9de5717
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.f
@@ -0,0 +1,900 @@
+c\BeginDoc
+c
+c\Name: dseupd
+c
+c\Description:
+c
+c This subroutine returns the converged approximations to eigenvalues
+c of A*z = lambda*B*z and (optionally):
+c
+c (1) the corresponding approximate eigenvectors,
+c
+c (2) an orthonormal (Lanczos) basis for the associated approximate
+c invariant subspace,
+c
+c (3) Both.
+c
+c There is negligible additional cost to obtain eigenvectors. An orthonormal
+c (Lanczos) basis is always computed. There is an additional storage cost
+c of n*nev if both are requested (in this case a separate array Z must be
+c supplied).
+c
+c These quantities are obtained from the Lanczos factorization computed
+c by DSAUPD for the linear operator OP prescribed by the MODE selection
+c (see IPARAM(7) in DSAUPD documentation.) DSAUPD must be called before
+c this routine is called. These approximate eigenvalues and vectors are
+c commonly called Ritz values and Ritz vectors respectively. They are
+c referred to as such in the comments that follow. The computed orthonormal
+c basis for the invariant subspace corresponding to these Ritz values is
+c referred to as a Lanczos basis.
+c
+c See documentation in the header of the subroutine DSAUPD for a definition
+c of OP as well as other terms and the relation of computed Ritz values
+c and vectors of OP with respect to the given problem A*z = lambda*B*z.
+c
+c The approximate eigenvalues of the original problem are returned in
+c ascending algebraic order. The user may elect to call this routine
+c once for each desired Ritz vector and store it peripherally if desired.
+c There is also the option of computing a selected set of these vectors
+c with a single call.
+c
+c\Usage:
+c call dseupd
+c ( RVEC, HOWMNY, SELECT, D, Z, LDZ, SIGMA, BMAT, N, WHICH, NEV, TOL,
+c RESID, NCV, V, LDV, IPARAM, IPNTR, WORKD, WORKL, LWORKL, INFO )
+c
+c RVEC LOGICAL (INPUT)
+c Specifies whether Ritz vectors corresponding to the Ritz value
+c approximations to the eigenproblem A*z = lambda*B*z are computed.
+c
+c RVEC = .FALSE. Compute Ritz values only.
+c
+c RVEC = .TRUE. Compute Ritz vectors.
+c
+c HOWMNY Character*1 (INPUT)
+c Specifies how many Ritz vectors are wanted and the form of Z
+c the matrix of Ritz vectors. See remark 1 below.
+c = 'A': compute NEV Ritz vectors;
+c = 'S': compute some of the Ritz vectors, specified
+c by the logical array SELECT.
+c
+c SELECT Logical array of dimension NEV. (INPUT)
+c If HOWMNY = 'S', SELECT specifies the Ritz vectors to be
+c computed. To select the Ritz vector corresponding to a
+c Ritz value D(j), SELECT(j) must be set to .TRUE..
+c If HOWMNY = 'A' , SELECT is not referenced.
+c
+c D Double precision array of dimension NEV. (OUTPUT)
+c On exit, D contains the Ritz value approximations to the
+c eigenvalues of A*z = lambda*B*z. The values are returned
+c in ascending order. If IPARAM(7) = 3,4,5 then D represents
+c the Ritz values of OP computed by dsaupd transformed to
+c those of the original eigensystem A*z = lambda*B*z. If
+c IPARAM(7) = 1,2 then the Ritz values of OP are the same
+c as the those of A*z = lambda*B*z.
+c
+c Z Double precision N by NEV array if HOWMNY = 'A'. (OUTPUT)
+c On exit, Z contains the B-orthonormal Ritz vectors of the
+c eigensystem A*z = lambda*B*z corresponding to the Ritz
+c value approximations.
+c If RVEC = .FALSE. then Z is not referenced.
+c NOTE: The array Z may be set equal to first NEV columns of the
+c Arnoldi/Lanczos basis array V computed by DSAUPD.
+c
+c LDZ Integer. (INPUT)
+c The leading dimension of the array Z. If Ritz vectors are
+c desired, then LDZ .ge. max( 1, N ). In any case, LDZ .ge. 1.
+c
+c SIGMA Double precision (INPUT)
+c If IPARAM(7) = 3,4,5 represents the shift. Not referenced if
+c IPARAM(7) = 1 or 2.
+c
+c
+c **** The remaining arguments MUST be the same as for the ****
+c **** call to DNAUPD that was just completed. ****
+c
+c NOTE: The remaining arguments
+c
+c BMAT, N, WHICH, NEV, TOL, RESID, NCV, V, LDV, IPARAM, IPNTR,
+c WORKD, WORKL, LWORKL, INFO
+c
+c must be passed directly to DSEUPD following the last call
+c to DSAUPD. These arguments MUST NOT BE MODIFIED between
+c the the last call to DSAUPD and the call to DSEUPD.
+c
+c Two of these parameters (WORKL, INFO) are also output parameters:
+c
+c WORKL Double precision work array of length LWORKL. (OUTPUT/WORKSPACE)
+c WORKL(1:4*ncv) contains information obtained in
+c dsaupd. They are not changed by dseupd.
+c WORKL(4*ncv+1:ncv*ncv+8*ncv) holds the
+c untransformed Ritz values, the computed error estimates,
+c and the associated eigenvector matrix of H.
+c
+c Note: IPNTR(8:10) contains the pointer into WORKL for addresses
+c of the above information computed by dseupd.
+c -------------------------------------------------------------
+c IPNTR(8): pointer to the NCV RITZ values of the original system.
+c IPNTR(9): pointer to the NCV corresponding error bounds.
+c IPNTR(10): pointer to the NCV by NCV matrix of eigenvectors
+c of the tridiagonal matrix T. Only referenced by
+c dseupd if RVEC = .TRUE. See Remarks.
+c -------------------------------------------------------------
+c
+c INFO Integer. (OUTPUT)
+c Error flag on output.
+c = 0: Normal exit.
+c = -1: N must be positive.
+c = -2: NEV must be positive.
+c = -3: NCV must be greater than NEV and less than or equal to N.
+c = -5: WHICH must be one of 'LM', 'SM', 'LA', 'SA' or 'BE'.
+c = -6: BMAT must be one of 'I' or 'G'.
+c = -7: Length of private work WORKL array is not sufficient.
+c = -8: Error return from trid. eigenvalue calculation;
+c Information error from LAPACK routine dsteqr.
+c = -9: Starting vector is zero.
+c = -10: IPARAM(7) must be 1,2,3,4,5.
+c = -11: IPARAM(7) = 1 and BMAT = 'G' are incompatible.
+c = -12: NEV and WHICH = 'BE' are incompatible.
+c = -14: DSAUPD did not find any eigenvalues to sufficient
+c accuracy.
+c = -15: HOWMNY must be one of 'A' or 'S' if RVEC = .true.
+c = -16: HOWMNY = 'S' not yet implemented
+c
+c\BeginLib
+c
+c\References:
+c 1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
+c a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
+c pp 357-385.
+c 2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly
+c Restarted Arnoldi Iteration", Rice University Technical Report
+c TR95-13, Department of Computational and Applied Mathematics.
+c 3. B.N. Parlett, "The Symmetric Eigenvalue Problem". Prentice-Hall,
+c 1980.
+c 4. B.N. Parlett, B. Nour-Omid, "Towards a Black Box Lanczos Program",
+c Computer Physics Communications, 53 (1989), pp 169-179.
+c 5. B. Nour-Omid, B.N. Parlett, T. Ericson, P.S. Jensen, "How to
+c Implement the Spectral Transformation", Math. Comp., 48 (1987),
+c pp 663-673.
+c 6. R.G. Grimes, J.G. Lewis and H.D. Simon, "A Shifted Block Lanczos
+c Algorithm for Solving Sparse Symmetric Generalized Eigenproblems",
+c SIAM J. Matr. Anal. Apps., January (1993).
+c 7. L. Reichel, W.B. Gragg, "Algorithm 686: FORTRAN Subroutines
+c for Updating the QR decomposition", ACM TOMS, December 1990,
+c Volume 16 Number 4, pp 369-377.
+c
+c\Remarks
+c 1. The converged Ritz values are always returned in increasing
+c (algebraic) order.
+c
+c 2. Currently only HOWMNY = 'A' is implemented. It is included at this
+c stage for the user who wants to incorporate it.
+c
+c\Routines called:
+c dsesrt ARPACK routine that sorts an array X, and applies the
+c corresponding permutation to a matrix A.
+c dsortr dsortr ARPACK sorting routine.
+c dgeqr2 LAPACK routine that computes the QR factorization of
+c a matrix.
+c dlacpy LAPACK matrix copy routine.
+c dlamch LAPACK routine that determines machine constants.
+c dorm2r LAPACK routine that applies an orthogonal matrix in
+c factored form.
+c dsteqr LAPACK routine that computes eigenvalues and eigenvectors
+c of a tridiagonal matrix.
+c dger Level 2 BLAS rank one update to a matrix.
+c dcopy Level 1 BLAS that copies one vector to another .
+c dnrm2 Level 1 BLAS that computes the norm of a vector.
+c dscal Level 1 BLAS that scales a vector.
+c dswap Level 1 BLAS that swaps the contents of two vectors.
+
+c\Authors
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Chao Yang Houston, Texas
+c Dept. of Computational &
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\Revision history:
+c 12/15/93: Version ' 2.1'
+c
+c\SCCS Information: @(#)
+c FILE: seupd.F SID: 2.7 DATE OF SID: 8/27/96 RELEASE: 2
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+ subroutine dseupd (rvec, howmny, select, d, z, ldz, sigma, bmat,
+ & n, which, nev, tol, resid, ncv, v, ldv, iparam,
+ & ipntr, workd, workl, lworkl, info )
+c
+c %----------------------------------------------------%
+c | Include files for debugging and timing information |
+c %----------------------------------------------------%
+c
+ include 'debug.h'
+ include 'stat.h'
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ character bmat, howmny, which*2
+ logical rvec, select(ncv)
+ integer info, ldz, ldv, lworkl, n, ncv, nev
+ Double precision
+ & sigma, tol
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ integer iparam(7), ipntr(11)
+ Double precision
+ & d(nev), resid(n), v(ldv,ncv), z(ldz, nev),
+ & workd(2*n), workl(lworkl)
+c
+c %------------%
+c | Parameters |
+c %------------%
+c
+ Double precision
+ & one, zero
+ parameter (one = 1.0D+0, zero = 0.0D+0)
+c
+c %---------------%
+c | Local Scalars |
+c %---------------%
+c
+ character type*6
+ integer bounds, ierr, ih, ihb, ihd, iq, iw, j, k,
+ & ldh, ldq, mode, msglvl, nconv, next, ritz,
+ & irz, ibd, ktrord, leftptr, rghtptr, ism, ilg
+ Double precision
+ & bnorm2, rnorm, temp, thres1, thres2, tempbnd, eps23
+ logical reord
+c
+c %--------------%
+c | Local Arrays |
+c %--------------%
+c
+ Double precision
+ & kv(2)
+c
+c %----------------------%
+c | External Subroutines |
+c %----------------------%
+c
+ external dcopy, dger, dgeqr2, dlacpy, dorm2r, dscal,
+ & dsesrt, dsteqr, dswap, dsortr
+c
+c %--------------------%
+c | External Functions |
+c %--------------------%
+c
+ Double precision
+ & dnrm2, dlamch
+ external dnrm2, dlamch
+c
+c %---------------------%
+c | Intrinsic Functions |
+c %---------------------%
+c
+ intrinsic min
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+c %------------------------%
+c | Set default parameters |
+c %------------------------%
+c
+ msglvl = mseupd
+ mode = iparam(7)
+ nconv = iparam(5)
+ info = 0
+c
+c %--------------%
+c | Quick return |
+c %--------------%
+c
+ if (nconv .eq. 0) go to 9000
+ ierr = 0
+c
+ if (nconv .le. 0) ierr = -14
+ if (n .le. 0) ierr = -1
+ if (nev .le. 0) ierr = -2
+ if (ncv .le. nev .or. ncv .gt. n) ierr = -3
+ if (which .ne. 'LM' .and.
+ & which .ne. 'SM' .and.
+ & which .ne. 'LA' .and.
+ & which .ne. 'SA' .and.
+ & which .ne. 'BE') ierr = -5
+ if (bmat .ne. 'I' .and. bmat .ne. 'G') ierr = -6
+ if ( (howmny .ne. 'A' .and.
+ & howmny .ne. 'P' .and.
+ & howmny .ne. 'S') .and. rvec )
+ & ierr = -15
+ if (rvec .and. howmny .eq. 'S') ierr = -16
+c
+ if (rvec .and. lworkl .lt. ncv**2+8*ncv) ierr = -7
+c
+ if (mode .eq. 1 .or. mode .eq. 2) then
+ type = 'REGULR'
+ else if (mode .eq. 3 ) then
+ type = 'SHIFTI'
+ else if (mode .eq. 4 ) then
+ type = 'BUCKLE'
+ else if (mode .eq. 5 ) then
+ type = 'CAYLEY'
+ else
+ ierr = -10
+ end if
+ if (mode .eq. 1 .and. bmat .eq. 'G') ierr = -11
+ if (nev .eq. 1 .and. which .eq. 'BE') ierr = -12
+c
+c %------------%
+c | Error Exit |
+c %------------%
+c
+ if (ierr .ne. 0) then
+ info = ierr
+ go to 9000
+ end if
+c
+c %-------------------------------------------------------%
+c | Pointer into WORKL for address of H, RITZ, BOUNDS, Q |
+c | etc... and the remaining workspace. |
+c | Also update pointer to be used on output. |
+c | Memory is laid out as follows: |
+c | workl(1:2*ncv) := generated tridiagonal matrix H |
+c | The subdiagonal is stored in workl(2:ncv). |
+c | The dead spot is workl(1) but upon exiting |
+c | dsaupd stores the B-norm of the last residual |
+c | vector in workl(1). We use this !!! |
+c | workl(2*ncv+1:2*ncv+ncv) := ritz values |
+c | The wanted values are in the first NCONV spots. |
+c | workl(3*ncv+1:3*ncv+ncv) := computed Ritz estimates |
+c | The wanted values are in the first NCONV spots. |
+c | NOTE: workl(1:4*ncv) is set by dsaupd and is not |
+c | modified by dseupd. |
+c %-------------------------------------------------------%
+c
+c %-------------------------------------------------------%
+c | The following is used and set by dseupd. |
+c | workl(4*ncv+1:4*ncv+ncv) := used as workspace during |
+c | computation of the eigenvectors of H. Stores |
+c | the diagonal of H. Upon EXIT contains the NCV |
+c | Ritz values of the original system. The first |
+c | NCONV spots have the wanted values. If MODE = |
+c | 1 or 2 then will equal workl(2*ncv+1:3*ncv). |
+c | workl(5*ncv+1:5*ncv+ncv) := used as workspace during |
+c | computation of the eigenvectors of H. Stores |
+c | the subdiagonal of H. Upon EXIT contains the |
+c | NCV corresponding Ritz estimates of the |
+c | original system. The first NCONV spots have the |
+c | wanted values. If MODE = 1,2 then will equal |
+c | workl(3*ncv+1:4*ncv). |
+c | workl(6*ncv+1:6*ncv+ncv*ncv) := orthogonal Q that is |
+c | the eigenvector matrix for H as returned by |
+c | dsteqr. Not referenced if RVEC = .False. |
+c | Ordering follows that of workl(4*ncv+1:5*ncv) |
+c | workl(6*ncv+ncv*ncv+1:6*ncv+ncv*ncv+2*ncv) := |
+c | Workspace. Needed by dsteqr and by dseupd. |
+c | GRAND total of NCV*(NCV+8) locations. |
+c %-------------------------------------------------------%
+c
+c
+ ih = ipntr(5)
+ ritz = ipntr(6)
+ bounds = ipntr(7)
+ ldh = ncv
+ ldq = ncv
+ ihd = bounds + ldh
+ ihb = ihd + ldh
+ iq = ihb + ldh
+ iw = iq + ldh*ncv
+ next = iw + 2*ncv
+ ipntr(4) = next
+ ipntr(8) = ihd
+ ipntr(9) = ihb
+ ipntr(10) = iq
+c
+c %----------------------------------------%
+c | irz points to the Ritz values computed |
+c | by _seigt before exiting _saup2. |
+c | ibd points to the Ritz estimates |
+c | computed by _seigt before exiting |
+c | _saup2. |
+c %----------------------------------------%
+c
+ irz = ipntr(11)+ncv
+ ibd = irz+ncv
+c
+c
+c %---------------------------------%
+c | Set machine dependent constant. |
+c %---------------------------------%
+c
+ eps23 = dlamch('Epsilon-Machine')
+ eps23 = eps23**(2.0D+0 / 3.0D+0)
+c
+c %---------------------------------------%
+c | RNORM is B-norm of the RESID(1:N). |
+c | BNORM2 is the 2 norm of B*RESID(1:N). |
+c | Upon exit of dsaupd WORKD(1:N) has |
+c | B*RESID(1:N). |
+c %---------------------------------------%
+c
+ rnorm = workl(ih)
+ if (bmat .eq. 'I') then
+ bnorm2 = rnorm
+ else if (bmat .eq. 'G') then
+ bnorm2 = dnrm2(n, workd, 1)
+ end if
+c
+ if (rvec) then
+c
+c %------------------------------------------------%
+c | Get the converged Ritz value on the boundary. |
+c | This value will be used to dermine whether we |
+c | need to reorder the eigenvalues and |
+c | eigenvectors comupted by _steqr, and is |
+c | referred to as the "threshold" value. |
+c | |
+c | A Ritz value gamma is said to be a wanted |
+c | one, if |
+c | abs(gamma) .ge. threshold, when WHICH = 'LM'; |
+c | abs(gamma) .le. threshold, when WHICH = 'SM'; |
+c | gamma .ge. threshold, when WHICH = 'LA'; |
+c | gamma .le. threshold, when WHICH = 'SA'; |
+c | gamma .le. thres1 .or. gamma .ge. thres2 |
+c | when WHICH = 'BE'; |
+c | |
+c | Note: converged Ritz values and associated |
+c | Ritz estimates have been placed in the first |
+c | NCONV locations in workl(ritz) and |
+c | workl(bounds) respectively. They have been |
+c | sorted (in _saup2) according to the WHICH |
+c | selection criterion. (Except in the case |
+c | WHICH = 'BE', they are sorted in an increasing |
+c | order.) |
+c %------------------------------------------------%
+c
+ if (which .eq. 'LM' .or. which .eq. 'SM'
+ & .or. which .eq. 'LA' .or. which .eq. 'SA' ) then
+c
+ thres1 = workl(ritz)
+c
+c if (msglvl .gt. 2) then
+c call dvout(logfil, 1, thres1, ndigit,
+c & '_seupd: Threshold eigenvalue used for re-ordering')
+c end if
+c
+ else if (which .eq. 'BE') then
+c
+c %------------------------------------------------%
+c | Ritz values returned from _saup2 have been |
+c | sorted in increasing order. Thus two |
+c | "threshold" values (one for the small end, one |
+c | for the large end) are in the middle. |
+c %------------------------------------------------%
+c
+ ism = max(nev,nconv) / 2
+ ilg = ism + 1
+ thres1 = workl(ism)
+ thres2 = workl(ilg)
+c
+ if (msglvl .gt. 2) then
+ kv(1) = thres1
+ kv(2) = thres2
+c call dvout(logfil, 2, kv, ndigit,
+c & '_seupd: Threshold eigenvalues used for re-ordering')
+ end if
+c
+ end if
+c
+c %----------------------------------------------------------%
+c | Check to see if all converged Ritz values appear within |
+c | the first NCONV diagonal elements returned from _seigt. |
+c | This is done in the following way: |
+c | |
+c | 1) For each Ritz value obtained from _seigt, compare it |
+c | with the threshold Ritz value computed above to |
+c | determine whether it is a wanted one. |
+c | |
+c | 2) If it is wanted, then check the corresponding Ritz |
+c | estimate to see if it has converged. If it has, set |
+c | corresponding entry in the logical array SELECT to |
+c | .TRUE.. |
+c | |
+c | If SELECT(j) = .TRUE. and j > NCONV, then there is a |
+c | converged Ritz value that does not appear at the top of |
+c | the diagonal matrix computed by _seigt in _saup2. |
+c | Reordering is needed. |
+c %----------------------------------------------------------%
+c
+ reord = .false.
+ ktrord = 0
+ do 10 j = 0, ncv-1
+ select(j+1) = .false.
+ if (which .eq. 'LM') then
+ if (abs(workl(irz+j)) .ge. abs(thres1)) then
+ tempbnd = max( eps23, abs(workl(irz+j)) )
+ if (workl(ibd+j) .le. tol*tempbnd) then
+ select(j+1) = .true.
+ end if
+ end if
+ else if (which .eq. 'SM') then
+ if (abs(workl(irz+j)) .le. abs(thres1)) then
+ tempbnd = max( eps23, abs(workl(irz+j)) )
+ if (workl(ibd+j) .le. tol*tempbnd) then
+ select(j+1) = .true.
+ end if
+ end if
+ else if (which .eq. 'LA') then
+ if (workl(irz+j) .ge. thres1) then
+ tempbnd = max( eps23, abs(workl(irz+j)) )
+ if (workl(ibd+j) .le. tol*tempbnd) then
+ select(j+1) = .true.
+ end if
+ end if
+ else if (which .eq. 'SA') then
+ if (workl(irz+j) .le. thres1) then
+ tempbnd = max( eps23, abs(workl(irz+j)) )
+ if (workl(ibd+j) .le. tol*tempbnd) then
+ select(j+1) = .true.
+ end if
+ end if
+ else if (which .eq. 'BE') then
+ if ( workl(irz+j) .le. thres1 .or.
+ & workl(irz+j) .ge. thres2 ) then
+ tempbnd = max( eps23, abs(workl(irz+j)) )
+ if (workl(ibd+j) .le. tol*tempbnd) then
+ select(j+1) = .true.
+ end if
+ end if
+ end if
+ if (j+1 .gt. nconv ) reord = select(j+1) .or. reord
+ if (select(j+1)) ktrord = ktrord + 1
+ 10 continue
+
+c %-------------------------------------------%
+c | If KTRORD .ne. NCONV, something is wrong. |
+c %-------------------------------------------%
+c
+c if (msglvl .gt. 2) then
+c call ivout(logfil, 1, ktrord, ndigit,
+c & '_seupd: Number of specified eigenvalues')
+c call ivout(logfil, 1, nconv, ndigit,
+c & '_seupd: Number of "converged" eigenvalues')
+c end if
+c
+c %-----------------------------------------------------------%
+c | Call LAPACK routine _steqr to compute the eigenvalues and |
+c | eigenvectors of the final symmetric tridiagonal matrix H. |
+c | Initialize the eigenvector matrix Q to the identity. |
+c %-----------------------------------------------------------%
+c
+ call dcopy (ncv-1, workl(ih+1), 1, workl(ihb), 1)
+ call dcopy (ncv, workl(ih+ldh), 1, workl(ihd), 1)
+c
+ call dsteqr ('Identity', ncv, workl(ihd), workl(ihb),
+ & workl(iq), ldq, workl(iw), ierr)
+c
+ if (ierr .ne. 0) then
+ info = -8
+ go to 9000
+ end if
+c
+ if (msglvl .gt. 1) then
+ call dcopy (ncv, workl(iq+ncv-1), ldq, workl(iw), 1)
+c call dvout (logfil, ncv, workl(ihd), ndigit,
+c & '_seupd: NCV Ritz values of the final H matrix')
+c call dvout (logfil, ncv, workl(iw), ndigit,
+c & '_seupd: last row of the eigenvector matrix for H')
+ end if
+c
+ if (reord) then
+c
+c %---------------------------------------------%
+c | Reordered the eigenvalues and eigenvectors |
+c | computed by _steqr so that the "converged" |
+c | eigenvalues appear in the first NCONV |
+c | positions of workl(ihd), and the associated |
+c | eigenvectors appear in the first NCONV |
+c | columns. |
+c %---------------------------------------------%
+c
+ leftptr = 1
+ rghtptr = ncv
+c
+ if (ncv .eq. 1) go to 30
+c
+ 20 if (select(leftptr)) then
+c
+c %-------------------------------------------%
+c | Search, from the left, for the first Ritz |
+c | value that has not converged. |
+c %-------------------------------------------%
+c
+ leftptr = leftptr + 1
+c
+ else if ( .not. select(rghtptr)) then
+c
+c %----------------------------------------------%
+c | Search, from the right, the first Ritz value |
+c | that has converged. |
+c %----------------------------------------------%
+c
+ rghtptr = rghtptr - 1
+c
+ else
+c
+c %----------------------------------------------%
+c | Swap the Ritz value on the left that has not |
+c | converged with the Ritz value on the right |
+c | that has converged. Swap the associated |
+c | eigenvector of the tridiagonal matrix H as |
+c | well. |
+c %----------------------------------------------%
+c
+ temp = workl(ihd+leftptr-1)
+ workl(ihd+leftptr-1) = workl(ihd+rghtptr-1)
+ workl(ihd+rghtptr-1) = temp
+ call dcopy(ncv, workl(iq+ncv*(leftptr-1)), 1,
+ & workl(iw), 1)
+ call dcopy(ncv, workl(iq+ncv*(rghtptr-1)), 1,
+ & workl(iq+ncv*(leftptr-1)), 1)
+ call dcopy(ncv, workl(iw), 1,
+ & workl(iq+ncv*(rghtptr-1)), 1)
+ leftptr = leftptr + 1
+ rghtptr = rghtptr - 1
+c
+ end if
+c
+ if (leftptr .lt. rghtptr) go to 20
+c
+ 30 end if
+c
+c if (msglvl .gt. 2) then
+c call dvout (logfil, ncv, workl(ihd), ndigit,
+c & '_seupd: The eigenvalues of H--reordered')
+c end if
+c
+c %----------------------------------------%
+c | Load the converged Ritz values into D. |
+c %----------------------------------------%
+c
+ call dcopy(nconv, workl(ihd), 1, d, 1)
+c
+ else
+c
+c %-----------------------------------------------------%
+c | Ritz vectors not required. Load Ritz values into D. |
+c %-----------------------------------------------------%
+c
+ call dcopy (nconv, workl(ritz), 1, d, 1)
+ call dcopy (ncv, workl(ritz), 1, workl(ihd), 1)
+c
+ end if
+c
+c %------------------------------------------------------------------%
+c | Transform the Ritz values and possibly vectors and corresponding |
+c | Ritz estimates of OP to those of A*x=lambda*B*x. The Ritz values |
+c | (and corresponding data) are returned in ascending order. |
+c %------------------------------------------------------------------%
+c
+ if (type .eq. 'REGULR') then
+c
+c %---------------------------------------------------------%
+c | Ascending sort of wanted Ritz values, vectors and error |
+c | bounds. Not necessary if only Ritz values are desired. |
+c %---------------------------------------------------------%
+c
+ if (rvec) then
+ call dsesrt ('LA', rvec , nconv, d, ncv, workl(iq), ldq)
+ else
+ call dcopy (ncv, workl(bounds), 1, workl(ihb), 1)
+ end if
+c
+ else
+c
+c %-------------------------------------------------------------%
+c | * Make a copy of all the Ritz values. |
+c | * Transform the Ritz values back to the original system. |
+c | For TYPE = 'SHIFTI' the transformation is |
+c | lambda = 1/theta + sigma |
+c | For TYPE = 'BUCKLE' the transformation is |
+c | lambda = sigma * theta / ( theta - 1 ) |
+c | For TYPE = 'CAYLEY' the transformation is |
+c | lambda = sigma * (theta + 1) / (theta - 1 ) |
+c | where the theta are the Ritz values returned by dsaupd. |
+c | NOTES: |
+c | *The Ritz vectors are not affected by the transformation. |
+c | They are only reordered. |
+c %-------------------------------------------------------------%
+c
+ call dcopy (ncv, workl(ihd), 1, workl(iw), 1)
+ if (type .eq. 'SHIFTI') then
+ do 40 k=1, ncv
+ workl(ihd+k-1) = one / workl(ihd+k-1) + sigma
+ 40 continue
+ else if (type .eq. 'BUCKLE') then
+ do 50 k=1, ncv
+ workl(ihd+k-1) = sigma * workl(ihd+k-1) /
+ & (workl(ihd+k-1) - one)
+ 50 continue
+ else if (type .eq. 'CAYLEY') then
+ do 60 k=1, ncv
+ workl(ihd+k-1) = sigma * (workl(ihd+k-1) + one) /
+ & (workl(ihd+k-1) - one)
+ 60 continue
+ end if
+c
+c %-------------------------------------------------------------%
+c | * Store the wanted NCONV lambda values into D. |
+c | * Sort the NCONV wanted lambda in WORKL(IHD:IHD+NCONV-1) |
+c | into ascending order and apply sort to the NCONV theta |
+c | values in the transformed system. We'll need this to |
+c | compute Ritz estimates in the original system. |
+c | * Finally sort the lambda's into ascending order and apply |
+c | to Ritz vectors if wanted. Else just sort lambda's into |
+c | ascending order. |
+c | NOTES: |
+c | *workl(iw:iw+ncv-1) contain the theta ordered so that they |
+c | match the ordering of the lambda. We'll use them again for |
+c | Ritz vector purification. |
+c %-------------------------------------------------------------%
+c
+ call dcopy (nconv, workl(ihd), 1, d, 1)
+ call dsortr ('LA', .true., nconv, workl(ihd), workl(iw))
+ if (rvec) then
+ call dsesrt ('LA', rvec , nconv, d, ncv, workl(iq), ldq)
+ else
+ call dcopy (ncv, workl(bounds), 1, workl(ihb), 1)
+ call dscal (ncv, bnorm2/rnorm, workl(ihb), 1)
+ call dsortr ('LA', .true., nconv, d, workl(ihb))
+ end if
+c
+ end if
+c
+c %------------------------------------------------%
+c | Compute the Ritz vectors. Transform the wanted |
+c | eigenvectors of the symmetric tridiagonal H by |
+c | the Lanczos basis matrix V. |
+c %------------------------------------------------%
+c
+ if (rvec .and. howmny .eq. 'A') then
+c
+c %----------------------------------------------------------%
+c | Compute the QR factorization of the matrix representing |
+c | the wanted invariant subspace located in the first NCONV |
+c | columns of workl(iq,ldq). |
+c %----------------------------------------------------------%
+c
+ call dgeqr2 (ncv, nconv, workl(iq), ldq, workl(iw+ncv),
+ & workl(ihb), ierr)
+c
+c
+c %--------------------------------------------------------%
+c | * Postmultiply V by Q. |
+c | * Copy the first NCONV columns of VQ into Z. |
+c | The N by NCONV matrix Z is now a matrix representation |
+c | of the approximate invariant subspace associated with |
+c | the Ritz values in workl(ihd). |
+c %--------------------------------------------------------%
+c
+ call dorm2r ('Right', 'Notranspose', n, ncv, nconv, workl(iq),
+ & ldq, workl(iw+ncv), v, ldv, workd(n+1), ierr)
+ call dlacpy ('All', n, nconv, v, ldv, z, ldz)
+c
+c %-----------------------------------------------------%
+c | In order to compute the Ritz estimates for the Ritz |
+c | values in both systems, need the last row of the |
+c | eigenvector matrix. Remember, it's in factored form |
+c %-----------------------------------------------------%
+c
+ do 65 j = 1, ncv-1
+ workl(ihb+j-1) = zero
+ 65 continue
+ workl(ihb+ncv-1) = one
+ call dorm2r ('Left', 'Transpose', ncv, 1, nconv, workl(iq),
+ & ldq, workl(iw+ncv), workl(ihb), ncv, temp, ierr)
+c
+ else if (rvec .and. howmny .eq. 'S') then
+c
+c Not yet implemented. See remark 2 above.
+c
+ end if
+c
+ if (type .eq. 'REGULR' .and. rvec) then
+c
+ do 70 j=1, ncv
+ workl(ihb+j-1) = rnorm * abs( workl(ihb+j-1) )
+ 70 continue
+c
+ else if (type .ne. 'REGULR' .and. rvec) then
+c
+c %-------------------------------------------------%
+c | * Determine Ritz estimates of the theta. |
+c | If RVEC = .true. then compute Ritz estimates |
+c | of the theta. |
+c | If RVEC = .false. then copy Ritz estimates |
+c | as computed by dsaupd. |
+c | * Determine Ritz estimates of the lambda. |
+c %-------------------------------------------------%
+c
+ call dscal (ncv, bnorm2, workl(ihb), 1)
+ if (type .eq. 'SHIFTI') then
+c
+ do 80 k=1, ncv
+ workl(ihb+k-1) = abs( workl(ihb+k-1) ) / workl(iw+k-1)**2
+ 80 continue
+c
+ else if (type .eq. 'BUCKLE') then
+c
+ do 90 k=1, ncv
+ workl(ihb+k-1) = sigma * abs( workl(ihb+k-1) ) /
+ & ( workl(iw+k-1)-one )**2
+ 90 continue
+c
+ else if (type .eq. 'CAYLEY') then
+c
+ do 100 k=1, ncv
+ workl(ihb+k-1) = abs( workl(ihb+k-1) /
+ & workl(iw+k-1)*(workl(iw+k-1)-one) )
+ 100 continue
+c
+ end if
+c
+ end if
+c
+c if (type .ne. 'REGULR' .and. msglvl .gt. 1) then
+c call dvout (logfil, nconv, d, ndigit,
+c & '_seupd: Untransformed converged Ritz values')
+c call dvout (logfil, nconv, workl(ihb), ndigit,
+c & '_seupd: Ritz estimates of the untransformed Ritz values')
+c else if (msglvl .gt. 1) then
+c call dvout (logfil, nconv, d, ndigit,
+c & '_seupd: Converged Ritz values')
+c call dvout (logfil, nconv, workl(ihb), ndigit,
+c & '_seupd: Associated Ritz estimates')
+c end if
+c
+c %-------------------------------------------------%
+c | Ritz vector purification step. Formally perform |
+c | one of inverse subspace iteration. Only used |
+c | for MODE = 3,4,5. See reference 7 |
+c %-------------------------------------------------%
+c
+ if (rvec .and. (type .eq. 'SHIFTI' .or. type .eq. 'CAYLEY')) then
+c
+ do 110 k=0, nconv-1
+ workl(iw+k) = workl(iq+k*ldq+ncv-1) / workl(iw+k)
+ 110 continue
+c
+ else if (rvec .and. type .eq. 'BUCKLE') then
+c
+ do 120 k=0, nconv-1
+ workl(iw+k) = workl(iq+k*ldq+ncv-1) / (workl(iw+k)-one)
+ 120 continue
+c
+ end if
+c
+ if (type .ne. 'REGULR')
+ & call dger (n, nconv, one, resid, 1, workl(iw), 1, z, ldz)
+c
+ 9000 continue
+c
+ return
+c
+c %---------------%
+c | End of dseupd |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.h
new file mode 100644
index 0000000000000000000000000000000000000000..260af439a6dae1972d39aabbdd6c2447bb5c1ae4
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dseupd.h
@@ -0,0 +1,27 @@
+extern int v3p_netlib_dseupd_(
+ v3p_netlib_logical *rvec,
+ char *howmny,
+ v3p_netlib_logical *select,
+ v3p_netlib_doublereal *d__,
+ v3p_netlib_doublereal *z__,
+ v3p_netlib_integer *ldz,
+ v3p_netlib_doublereal *sigma,
+ char *bmat,
+ v3p_netlib_integer *n,
+ char *which,
+ v3p_netlib_integer *nev,
+ v3p_netlib_doublereal *tol,
+ v3p_netlib_doublereal *resid,
+ v3p_netlib_integer *ncv,
+ v3p_netlib_doublereal *v,
+ v3p_netlib_integer *ldv,
+ v3p_netlib_integer *iparam,
+ v3p_netlib_integer *ipntr,
+ v3p_netlib_doublereal *workd,
+ v3p_netlib_doublereal *workl,
+ v3p_netlib_integer *lworkl,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen howmny_len,
+ v3p_netlib_ftnlen bmat_len,
+ v3p_netlib_ftnlen which_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.P
new file mode 100644
index 0000000000000000000000000000000000000000..ece1a5e98308aeb9cb6ce90202319be7a1d7c117
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.P
@@ -0,0 +1,7 @@
+extern int dsgets_(integer *ishift, char *which, integer *kev, integer *np, doublereal *ritz, doublereal *bounds, doublereal *shifts, ftnlen which_len);
+/* comlen debug_ 96 */
+/* comlen timing_ 124 */
+/*:ref: second_ 14 1 6 */
+/*:ref: dsortr_ 14 6 13 12 4 7 7 124 */
+/*:ref: dswap_ 14 5 4 7 4 7 4 */
+/*:ref: dcopy_ 14 5 4 7 4 7 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.c
new file mode 100644
index 0000000000000000000000000000000000000000..eb968df43080b981e20247b632d5609dcdf0f1fa
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.c
@@ -0,0 +1,330 @@
+/* arpack/dsgets.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Common Block Declarations */
+
+/*Extern struct { */
+/* integer logfil, ndigit, mgetv0, msaupd, msaup2, msaitr, mseigt, msapps, */
+/* msgets, mseupd, mnaupd, mnaup2, mnaitr, mneigh, mnapps, mngets, */
+/* mneupd, mcaupd, mcaup2, mcaitr, mceigh, mcapps, mcgets, mceupd; */
+/*} debug_; */
+
+/*#define debug_1 debug_ */
+
+/*Extern struct { */
+/* integer nopx, nbx, nrorth, nitref, nrstrt; */
+/* real tsaupd, tsaup2, tsaitr, tseigt, tsgets, tsapps, tsconv, tnaupd, */
+/* tnaup2, tnaitr, tneigh, tngets, tnapps, tnconv, tcaupd, tcaup2, */
+/* tcaitr, tceigh, tcgets, tcapps, tcconv, tmvopx, tmvbx, tgetv0, */
+/* titref, trvec; */
+/*} timing_; */
+
+/*#define timing_1 timing_ */
+
+/* Table of constant values */
+
+static logical c_true = TRUE_;
+static integer c__1 = 1;
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dsgets */
+
+/* \Description: */
+/* Given the eigenvalues of the symmetric tridiagonal matrix H, */
+/* computes the NP shifts AMU that are zeros of the polynomial of */
+/* degree NP which filters out components of the unwanted eigenvectors */
+/* corresponding to the AMU's based on some given criteria. */
+
+/* NOTE: This is called even in the case of user specified shifts in */
+/* order to sort the eigenvalues, and error bounds of H for later use. */
+
+/* \Usage: */
+/* call dsgets */
+/* ( ISHIFT, WHICH, KEV, NP, RITZ, BOUNDS, SHIFTS ) */
+
+/* \Arguments */
+/* ISHIFT Integer. (INPUT) */
+/* Method for selecting the implicit shifts at each iteration. */
+/* ISHIFT = 0: user specified shifts */
+/* ISHIFT = 1: exact shift with respect to the matrix H. */
+
+/* WHICH Character*2. (INPUT) */
+/* Shift selection criteria. */
+/* 'LM' -> KEV eigenvalues of largest magnitude are retained. */
+/* 'SM' -> KEV eigenvalues of smallest magnitude are retained. */
+/* 'LA' -> KEV eigenvalues of largest value are retained. */
+/* 'SA' -> KEV eigenvalues of smallest value are retained. */
+/* 'BE' -> KEV eigenvalues, half from each end of the spectrum. */
+/* If KEV is odd, compute one more from the high end. */
+
+/* KEV Integer. (INPUT) */
+/* KEV+NP is the size of the matrix H. */
+
+/* NP Integer. (INPUT) */
+/* Number of implicit shifts to be computed. */
+
+/* RITZ Double precision array of length KEV+NP. (INPUT/OUTPUT) */
+/* On INPUT, RITZ contains the eigenvalues of H. */
+/* On OUTPUT, RITZ are sorted so that the unwanted eigenvalues */
+/* are in the first NP locations and the wanted part is in */
+/* the last KEV locations. When exact shifts are selected, the */
+/* unwanted part corresponds to the shifts to be applied. */
+
+/* BOUNDS Double precision array of length KEV+NP. (INPUT/OUTPUT) */
+/* Error bounds corresponding to the ordering in RITZ. */
+
+/* SHIFTS Double precision array of length NP. (INPUT/OUTPUT) */
+/* On INPUT: contains the user specified shifts if ISHIFT = 0. */
+/* On OUTPUT: contains the shifts sorted into decreasing order */
+/* of magnitude with respect to the Ritz estimates contained in */
+/* BOUNDS. If ISHIFT = 0, SHIFTS is not modified on exit. */
+
+/* \EndDoc */
+
+/* ----------------------------------------------------------------------- */
+
+/* \BeginLib */
+
+/* \Local variables: */
+/* xxxxxx real */
+
+/* \Routines called: */
+/* dsortr ARPACK utility sorting routine. */
+/* second ARPACK utility routine for timing. */
+/* dcopy Level 1 BLAS that copies one vector to another. */
+/* dswap Level 1 BLAS that swaps the contents of two vectors. */
+
+/* \Author */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \Revision history: */
+/* xx/xx/93: Version ' 2.1' */
+
+/* \SCCS Information: @(#) */
+/* FILE: sgets.F SID: 2.4 DATE OF SID: 4/19/96 RELEASE: 2 */
+
+/* \Remarks */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< subroutine dsgets ( ishift, which, kev, np, ritz, bounds, shifts ) >*/
+/* Subroutine */ int dsgets_(integer *ishift, char *which, integer *kev,
+ integer *np, doublereal *ritz, doublereal *bounds, doublereal *shifts,
+ ftnlen which_len)
+{
+ /* System generated locals */
+ integer i__1;
+
+ /* Builtin functions */
+ integer s_cmp(char *, char *, ftnlen, ftnlen);
+
+ /* Local variables */
+/* static real t0, t1; */
+ integer kevd2;
+ extern /* Subroutine */ int dswap_(integer *, doublereal *, integer *,
+ doublereal *, integer *), dcopy_(integer *, doublereal *, integer
+ *, doublereal *, integer *), second_(real *);
+/* integer msglvl; */
+ extern /* Subroutine */ int dsortr_(char *, logical *, integer *,
+ doublereal *, doublereal *, ftnlen);
+
+
+/* %----------------------------------------------------% */
+/* | Include files for debugging and timing information | */
+/* %----------------------------------------------------% */
+
+/*< include 'debug.h' >*/
+/*< include 'stat.h' >*/
+
+/* \SCCS Information: @(#) */
+/* FILE: debug.h SID: 2.3 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/* %---------------------------------% */
+/* | See debug.doc for documentation | */
+/* %---------------------------------% */
+/*< >*/
+/*< character*2 which >*/
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/* %--------------------------------% */
+/* | See stat.doc for documentation | */
+/* %--------------------------------% */
+
+/* \SCCS Information: @(#) */
+/* FILE: stat.h SID: 2.2 DATE OF SID: 11/16/95 RELEASE: 2 */
+
+/*< save t0, t1, t2, t3, t4, t5 >*/
+
+/*< integer nopx, nbx, nrorth, nitref, nrstrt >*/
+/*< >*/
+/*< >*/
+/*< integer ishift, kev, np >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< >*/
+
+/* %------------% */
+/* | Parameters | */
+/* %------------% */
+
+/*< >*/
+/*< parameter (one = 1.0D+0, zero = 0.0D+0) >*/
+
+/* %---------------% */
+/* | Local Scalars | */
+/* %---------------% */
+
+/*< integer kevd2, msglvl >*/
+
+/* %----------------------% */
+/* | External Subroutines | */
+/* %----------------------% */
+
+/*< external dswap, dcopy, dsortr, second >*/
+
+/* %---------------------% */
+/* | Intrinsic Functions | */
+/* %---------------------% */
+
+/*< intrinsic max, min >*/
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+/* %-------------------------------% */
+/* | Initialize timing statistics | */
+/* | & message level for debugging | */
+/* %-------------------------------% */
+
+/*< call second (t0) >*/
+ /* Parameter adjustments */
+ --shifts;
+ --bounds;
+ --ritz;
+
+ /* Function Body */
+/* second_(&t0); */
+/*< msglvl = msgets >*/
+/* msglvl = debug_1.msgets; */
+
+/*< if (which .eq. 'BE') then >*/
+ if (s_cmp(which, "BE", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* %-----------------------------------------------------% */
+/* | Both ends of the spectrum are requested. | */
+/* | Sort the eigenvalues into algebraically increasing | */
+/* | order first then swap high end of the spectrum next | */
+/* | to low end in appropriate locations. | */
+/* | NOTE: when np < floor(kev/2) be careful not to swap | */
+/* | overlapping locations. | */
+/* %-----------------------------------------------------% */
+
+/*< call dsortr ('LA', .true., kev+np, ritz, bounds) >*/
+ i__1 = *kev + *np;
+ dsortr_("LA", &c_true, &i__1, &ritz[1], &bounds[1], (ftnlen)2);
+/*< kevd2 = kev / 2 >*/
+ kevd2 = *kev / 2;
+/*< if ( kev .gt. 1 ) then >*/
+ if (*kev > 1) {
+/*< >*/
+ i__1 = min(kevd2,*np);
+ dswap_(&i__1, &ritz[1], &c__1, &ritz[max(kevd2,*np) + 1], &c__1);
+/*< >*/
+ i__1 = min(kevd2,*np);
+ dswap_(&i__1, &bounds[1], &c__1, &bounds[max(kevd2,*np) + 1], &
+ c__1);
+/*< end if >*/
+ }
+
+/*< else >*/
+ } else {
+
+/* %----------------------------------------------------% */
+/* | LM, SM, LA, SA case. | */
+/* | Sort the eigenvalues of H into the desired order | */
+/* | and apply the resulting order to BOUNDS. | */
+/* | The eigenvalues are sorted so that the wanted part | */
+/* | are always in the last KEV locations. | */
+/* %----------------------------------------------------% */
+
+/*< call dsortr (which, .true., kev+np, ritz, bounds) >*/
+ i__1 = *kev + *np;
+ dsortr_(which, &c_true, &i__1, &ritz[1], &bounds[1], (ftnlen)2);
+/*< end if >*/
+ }
+
+/*< if (ishift .eq. 1 .and. np .gt. 0) then >*/
+ if (*ishift == 1 && *np > 0) {
+
+/* %-------------------------------------------------------% */
+/* | Sort the unwanted Ritz values used as shifts so that | */
+/* | the ones with largest Ritz estimates are first. | */
+/* | This will tend to minimize the effects of the | */
+/* | forward instability of the iteration when the shifts | */
+/* | are applied in subroutine dsapps. | */
+/* %-------------------------------------------------------% */
+
+/*< call dsortr ('SM', .true., np, bounds, ritz) >*/
+ dsortr_("SM", &c_true, np, &bounds[1], &ritz[1], (ftnlen)2);
+/*< call dcopy (np, ritz, 1, shifts, 1) >*/
+ dcopy_(np, &ritz[1], &c__1, &shifts[1], &c__1);
+/*< end if >*/
+ }
+
+/*< call second (t1) >*/
+/* second_(&t1); */
+/*< tsgets = tsgets + (t1 - t0) >*/
+/* timing_1.tsgets += t1 - t0; */
+
+/* if (msglvl .gt. 0) then */
+/* call ivout (logfil, 1, kev, ndigit, '_sgets: KEV is') */
+/* call ivout (logfil, 1, np, ndigit, '_sgets: NP is') */
+/* call dvout (logfil, kev+np, ritz, ndigit, */
+/* & '_sgets: Eigenvalues of current H matrix') */
+/* call dvout (logfil, kev+np, bounds, ndigit, */
+/* & '_sgets: Associated Ritz estimates') */
+/* end if */
+
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dsgets | */
+/* %---------------% */
+
+/*< end >*/
+} /* dsgets_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.f
new file mode 100644
index 0000000000000000000000000000000000000000..52de3526be1ce27c171414c671aee3170c05b547
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.f
@@ -0,0 +1,217 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dsgets
+c
+c\Description:
+c Given the eigenvalues of the symmetric tridiagonal matrix H,
+c computes the NP shifts AMU that are zeros of the polynomial of
+c degree NP which filters out components of the unwanted eigenvectors
+c corresponding to the AMU's based on some given criteria.
+c
+c NOTE: This is called even in the case of user specified shifts in
+c order to sort the eigenvalues, and error bounds of H for later use.
+c
+c\Usage:
+c call dsgets
+c ( ISHIFT, WHICH, KEV, NP, RITZ, BOUNDS, SHIFTS )
+c
+c\Arguments
+c ISHIFT Integer. (INPUT)
+c Method for selecting the implicit shifts at each iteration.
+c ISHIFT = 0: user specified shifts
+c ISHIFT = 1: exact shift with respect to the matrix H.
+c
+c WHICH Character*2. (INPUT)
+c Shift selection criteria.
+c 'LM' -> KEV eigenvalues of largest magnitude are retained.
+c 'SM' -> KEV eigenvalues of smallest magnitude are retained.
+c 'LA' -> KEV eigenvalues of largest value are retained.
+c 'SA' -> KEV eigenvalues of smallest value are retained.
+c 'BE' -> KEV eigenvalues, half from each end of the spectrum.
+c If KEV is odd, compute one more from the high end.
+c
+c KEV Integer. (INPUT)
+c KEV+NP is the size of the matrix H.
+c
+c NP Integer. (INPUT)
+c Number of implicit shifts to be computed.
+c
+c RITZ Double precision array of length KEV+NP. (INPUT/OUTPUT)
+c On INPUT, RITZ contains the eigenvalues of H.
+c On OUTPUT, RITZ are sorted so that the unwanted eigenvalues
+c are in the first NP locations and the wanted part is in
+c the last KEV locations. When exact shifts are selected, the
+c unwanted part corresponds to the shifts to be applied.
+c
+c BOUNDS Double precision array of length KEV+NP. (INPUT/OUTPUT)
+c Error bounds corresponding to the ordering in RITZ.
+c
+c SHIFTS Double precision array of length NP. (INPUT/OUTPUT)
+c On INPUT: contains the user specified shifts if ISHIFT = 0.
+c On OUTPUT: contains the shifts sorted into decreasing order
+c of magnitude with respect to the Ritz estimates contained in
+c BOUNDS. If ISHIFT = 0, SHIFTS is not modified on exit.
+c
+c\EndDoc
+c
+c-----------------------------------------------------------------------
+c
+c\BeginLib
+c
+c\Local variables:
+c xxxxxx real
+c
+c\Routines called:
+c dsortr ARPACK utility sorting routine.
+c second ARPACK utility routine for timing.
+c dcopy Level 1 BLAS that copies one vector to another.
+c dswap Level 1 BLAS that swaps the contents of two vectors.
+c
+c\Author
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\Revision history:
+c xx/xx/93: Version ' 2.1'
+c
+c\SCCS Information: @(#)
+c FILE: sgets.F SID: 2.4 DATE OF SID: 4/19/96 RELEASE: 2
+c
+c\Remarks
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dsgets ( ishift, which, kev, np, ritz, bounds, shifts )
+c
+c %----------------------------------------------------%
+c | Include files for debugging and timing information |
+c %----------------------------------------------------%
+c
+ include 'debug.h'
+ include 'stat.h'
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ character*2 which
+ integer ishift, kev, np
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ Double precision
+ & bounds(kev+np), ritz(kev+np), shifts(np)
+c
+c %------------%
+c | Parameters |
+c %------------%
+c
+ Double precision
+ & one, zero
+ parameter (one = 1.0D+0, zero = 0.0D+0)
+c
+c %---------------%
+c | Local Scalars |
+c %---------------%
+c
+ integer kevd2, msglvl
+c
+c %----------------------%
+c | External Subroutines |
+c %----------------------%
+c
+ external dswap, dcopy, dsortr, second
+c
+c %---------------------%
+c | Intrinsic Functions |
+c %---------------------%
+c
+ intrinsic max, min
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+c %-------------------------------%
+c | Initialize timing statistics |
+c | & message level for debugging |
+c %-------------------------------%
+c
+ call second (t0)
+ msglvl = msgets
+c
+ if (which .eq. 'BE') then
+c
+c %-----------------------------------------------------%
+c | Both ends of the spectrum are requested. |
+c | Sort the eigenvalues into algebraically increasing |
+c | order first then swap high end of the spectrum next |
+c | to low end in appropriate locations. |
+c | NOTE: when np < floor(kev/2) be careful not to swap |
+c | overlapping locations. |
+c %-----------------------------------------------------%
+c
+ call dsortr ('LA', .true., kev+np, ritz, bounds)
+ kevd2 = kev / 2
+ if ( kev .gt. 1 ) then
+ call dswap ( min(kevd2,np), ritz, 1,
+ & ritz( max(kevd2,np)+1 ), 1)
+ call dswap ( min(kevd2,np), bounds, 1,
+ & bounds( max(kevd2,np)+1 ), 1)
+ end if
+c
+ else
+c
+c %----------------------------------------------------%
+c | LM, SM, LA, SA case. |
+c | Sort the eigenvalues of H into the desired order |
+c | and apply the resulting order to BOUNDS. |
+c | The eigenvalues are sorted so that the wanted part |
+c | are always in the last KEV locations. |
+c %----------------------------------------------------%
+c
+ call dsortr (which, .true., kev+np, ritz, bounds)
+ end if
+c
+ if (ishift .eq. 1 .and. np .gt. 0) then
+c
+c %-------------------------------------------------------%
+c | Sort the unwanted Ritz values used as shifts so that |
+c | the ones with largest Ritz estimates are first. |
+c | This will tend to minimize the effects of the |
+c | forward instability of the iteration when the shifts |
+c | are applied in subroutine dsapps. |
+c %-------------------------------------------------------%
+c
+ call dsortr ('SM', .true., np, bounds, ritz)
+ call dcopy (np, ritz, 1, shifts, 1)
+ end if
+c
+ call second (t1)
+ tsgets = tsgets + (t1 - t0)
+c
+c if (msglvl .gt. 0) then
+c call ivout (logfil, 1, kev, ndigit, '_sgets: KEV is')
+c call ivout (logfil, 1, np, ndigit, '_sgets: NP is')
+c call dvout (logfil, kev+np, ritz, ndigit,
+c & '_sgets: Eigenvalues of current H matrix')
+c call dvout (logfil, kev+np, bounds, ndigit,
+c & '_sgets: Associated Ritz estimates')
+c end if
+c
+ return
+c
+c %---------------%
+c | End of dsgets |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.h
new file mode 100644
index 0000000000000000000000000000000000000000..89d0c2754910c16e03bd096a27ccca8c12daf23c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsgets.h
@@ -0,0 +1,10 @@
+extern int v3p_netlib_dsgets_(
+ v3p_netlib_integer *ishift,
+ char *which,
+ v3p_netlib_integer *kev,
+ v3p_netlib_integer *np,
+ v3p_netlib_doublereal *ritz,
+ v3p_netlib_doublereal *bounds,
+ v3p_netlib_doublereal *shifts,
+ v3p_netlib_ftnlen which_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.P
new file mode 100644
index 0000000000000000000000000000000000000000..6f0cf8d9482ad3bff7b99df56922255841b284a0
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.P
@@ -0,0 +1 @@
+extern int dsortr_(char *which, logical *apply, integer *n, doublereal *x1, doublereal *x2, ftnlen which_len);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.c
new file mode 100644
index 0000000000000000000000000000000000000000..204257e4cd2d844a59adcd04c3fb1649a71f9ab4
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.c
@@ -0,0 +1,382 @@
+/* arpack/dsortr.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dsortr */
+
+/* \Description: */
+/* Sort the array X1 in the order specified by WHICH and optionally */
+/* applies the permutation to the array X2. */
+
+/* \Usage: */
+/* call dsortr */
+/* ( WHICH, APPLY, N, X1, X2 ) */
+
+/* \Arguments */
+/* WHICH Character*2. (Input) */
+/* 'LM' -> X1 is sorted into increasing order of magnitude. */
+/* 'SM' -> X1 is sorted into decreasing order of magnitude. */
+/* 'LA' -> X1 is sorted into increasing order of algebraic. */
+/* 'SA' -> X1 is sorted into decreasing order of algebraic. */
+
+/* APPLY Logical. (Input) */
+/* APPLY = .TRUE. -> apply the sorted order to X2. */
+/* APPLY = .FALSE. -> do not apply the sorted order to X2. */
+
+/* N Integer. (INPUT) */
+/* Size of the arrays. */
+
+/* X1 Double precision array of length N. (INPUT/OUTPUT) */
+/* The array to be sorted. */
+
+/* X2 Double precision array of length N. (INPUT/OUTPUT) */
+/* Only referenced if APPLY = .TRUE. */
+
+/* \EndDoc */
+
+/* ----------------------------------------------------------------------- */
+
+/* \BeginLib */
+
+/* \Author */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \Revision history: */
+/* 12/16/93: Version ' 2.1'. */
+/* Adapted from the sort routine in LANSO. */
+
+/* \SCCS Information: @(#) */
+/* FILE: sortr.F SID: 2.3 DATE OF SID: 4/19/96 RELEASE: 2 */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< subroutine dsortr (which, apply, n, x1, x2) >*/
+/* Subroutine */ int dsortr_(char *which, logical *apply, integer *n,
+ doublereal *x1, doublereal *x2, ftnlen which_len)
+{
+ /* System generated locals */
+ integer i__1;
+ doublereal d__1, d__2;
+
+ /* Builtin functions */
+ integer s_cmp(char *, char *, ftnlen, ftnlen);
+
+ /* Local variables */
+ integer i__, j, igap;
+ doublereal temp;
+
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/*< character*2 which >*/
+/*< logical apply >*/
+/*< integer n >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< >*/
+
+/* %---------------% */
+/* | Local Scalars | */
+/* %---------------% */
+
+/*< integer i, igap, j >*/
+/*< >*/
+
+/* %-----------------------% */
+/* | Executable Statements | */
+/* %-----------------------% */
+
+/*< igap = n / 2 >*/
+ igap = *n / 2;
+
+/*< if (which .eq. 'SA') then >*/
+ if (s_cmp(which, "SA", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* X1 is sorted into decreasing order of algebraic. */
+
+/*< 10 continue >*/
+L10:
+/*< if (igap .eq. 0) go to 9000 >*/
+ if (igap == 0) {
+ goto L9000;
+ }
+/*< do 30 i = igap, n-1 >*/
+ i__1 = *n - 1;
+ for (i__ = igap; i__ <= i__1; ++i__) {
+/*< j = i-igap >*/
+ j = i__ - igap;
+/*< 20 continue >*/
+L20:
+
+/*< if (j.lt.0) go to 30 >*/
+ if (j < 0) {
+ goto L30;
+ }
+
+/*< if (x1(j).lt.x1(j+igap)) then >*/
+ if (x1[j] < x1[j + igap]) {
+/*< temp = x1(j) >*/
+ temp = x1[j];
+/*< x1(j) = x1(j+igap) >*/
+ x1[j] = x1[j + igap];
+/*< x1(j+igap) = temp >*/
+ x1[j + igap] = temp;
+/*< if (apply) then >*/
+ if (*apply) {
+/*< temp = x2(j) >*/
+ temp = x2[j];
+/*< x2(j) = x2(j+igap) >*/
+ x2[j] = x2[j + igap];
+/*< x2(j+igap) = temp >*/
+ x2[j + igap] = temp;
+/*< end if >*/
+ }
+/*< else >*/
+ } else {
+/*< go to 30 >*/
+ goto L30;
+/*< endif >*/
+ }
+/*< j = j-igap >*/
+ j -= igap;
+/*< go to 20 >*/
+ goto L20;
+/*< 30 continue >*/
+L30:
+ ;
+ }
+/*< igap = igap / 2 >*/
+ igap /= 2;
+/*< go to 10 >*/
+ goto L10;
+
+/*< else if (which .eq. 'SM') then >*/
+ } else if (s_cmp(which, "SM", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* X1 is sorted into decreasing order of magnitude. */
+
+/*< 40 continue >*/
+L40:
+/*< if (igap .eq. 0) go to 9000 >*/
+ if (igap == 0) {
+ goto L9000;
+ }
+/*< do 60 i = igap, n-1 >*/
+ i__1 = *n - 1;
+ for (i__ = igap; i__ <= i__1; ++i__) {
+/*< j = i-igap >*/
+ j = i__ - igap;
+/*< 50 continue >*/
+L50:
+
+/*< if (j.lt.0) go to 60 >*/
+ if (j < 0) {
+ goto L60;
+ }
+
+/*< if (abs(x1(j)).lt.abs(x1(j+igap))) then >*/
+ if ((d__1 = x1[j], abs(d__1)) < (d__2 = x1[j + igap], abs(d__2)))
+ {
+/*< temp = x1(j) >*/
+ temp = x1[j];
+/*< x1(j) = x1(j+igap) >*/
+ x1[j] = x1[j + igap];
+/*< x1(j+igap) = temp >*/
+ x1[j + igap] = temp;
+/*< if (apply) then >*/
+ if (*apply) {
+/*< temp = x2(j) >*/
+ temp = x2[j];
+/*< x2(j) = x2(j+igap) >*/
+ x2[j] = x2[j + igap];
+/*< x2(j+igap) = temp >*/
+ x2[j + igap] = temp;
+/*< end if >*/
+ }
+/*< else >*/
+ } else {
+/*< go to 60 >*/
+ goto L60;
+/*< endif >*/
+ }
+/*< j = j-igap >*/
+ j -= igap;
+/*< go to 50 >*/
+ goto L50;
+/*< 60 continue >*/
+L60:
+ ;
+ }
+/*< igap = igap / 2 >*/
+ igap /= 2;
+/*< go to 40 >*/
+ goto L40;
+
+/*< else if (which .eq. 'LA') then >*/
+ } else if (s_cmp(which, "LA", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* X1 is sorted into increasing order of algebraic. */
+
+/*< 70 continue >*/
+L70:
+/*< if (igap .eq. 0) go to 9000 >*/
+ if (igap == 0) {
+ goto L9000;
+ }
+/*< do 90 i = igap, n-1 >*/
+ i__1 = *n - 1;
+ for (i__ = igap; i__ <= i__1; ++i__) {
+/*< j = i-igap >*/
+ j = i__ - igap;
+/*< 80 continue >*/
+L80:
+
+/*< if (j.lt.0) go to 90 >*/
+ if (j < 0) {
+ goto L90;
+ }
+
+/*< if (x1(j).gt.x1(j+igap)) then >*/
+ if (x1[j] > x1[j + igap]) {
+/*< temp = x1(j) >*/
+ temp = x1[j];
+/*< x1(j) = x1(j+igap) >*/
+ x1[j] = x1[j + igap];
+/*< x1(j+igap) = temp >*/
+ x1[j + igap] = temp;
+/*< if (apply) then >*/
+ if (*apply) {
+/*< temp = x2(j) >*/
+ temp = x2[j];
+/*< x2(j) = x2(j+igap) >*/
+ x2[j] = x2[j + igap];
+/*< x2(j+igap) = temp >*/
+ x2[j + igap] = temp;
+/*< end if >*/
+ }
+/*< else >*/
+ } else {
+/*< go to 90 >*/
+ goto L90;
+/*< endif >*/
+ }
+/*< j = j-igap >*/
+ j -= igap;
+/*< go to 80 >*/
+ goto L80;
+/*< 90 continue >*/
+L90:
+ ;
+ }
+/*< igap = igap / 2 >*/
+ igap /= 2;
+/*< go to 70 >*/
+ goto L70;
+
+/*< else if (which .eq. 'LM') then >*/
+ } else if (s_cmp(which, "LM", (ftnlen)2, (ftnlen)2) == 0) {
+
+/* X1 is sorted into increasing order of magnitude. */
+
+/*< 100 continue >*/
+L100:
+/*< if (igap .eq. 0) go to 9000 >*/
+ if (igap == 0) {
+ goto L9000;
+ }
+/*< do 120 i = igap, n-1 >*/
+ i__1 = *n - 1;
+ for (i__ = igap; i__ <= i__1; ++i__) {
+/*< j = i-igap >*/
+ j = i__ - igap;
+/*< 110 continue >*/
+L110:
+
+/*< if (j.lt.0) go to 120 >*/
+ if (j < 0) {
+ goto L120;
+ }
+
+/*< if (abs(x1(j)).gt.abs(x1(j+igap))) then >*/
+ if ((d__1 = x1[j], abs(d__1)) > (d__2 = x1[j + igap], abs(d__2)))
+ {
+/*< temp = x1(j) >*/
+ temp = x1[j];
+/*< x1(j) = x1(j+igap) >*/
+ x1[j] = x1[j + igap];
+/*< x1(j+igap) = temp >*/
+ x1[j + igap] = temp;
+/*< if (apply) then >*/
+ if (*apply) {
+/*< temp = x2(j) >*/
+ temp = x2[j];
+/*< x2(j) = x2(j+igap) >*/
+ x2[j] = x2[j + igap];
+/*< x2(j+igap) = temp >*/
+ x2[j + igap] = temp;
+/*< end if >*/
+ }
+/*< else >*/
+ } else {
+/*< go to 120 >*/
+ goto L120;
+/*< endif >*/
+ }
+/*< j = j-igap >*/
+ j -= igap;
+/*< go to 110 >*/
+ goto L110;
+/*< 120 continue >*/
+L120:
+ ;
+ }
+/*< igap = igap / 2 >*/
+ igap /= 2;
+/*< go to 100 >*/
+ goto L100;
+/*< end if >*/
+ }
+
+/*< 9000 continue >*/
+L9000:
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dsortr | */
+/* %---------------% */
+
+/*< end >*/
+} /* dsortr_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.f
new file mode 100644
index 0000000000000000000000000000000000000000..b44f916cf21c1e278392c72c7f9a8c10284c864f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.f
@@ -0,0 +1,218 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dsortr
+c
+c\Description:
+c Sort the array X1 in the order specified by WHICH and optionally
+c applies the permutation to the array X2.
+c
+c\Usage:
+c call dsortr
+c ( WHICH, APPLY, N, X1, X2 )
+c
+c\Arguments
+c WHICH Character*2. (Input)
+c 'LM' -> X1 is sorted into increasing order of magnitude.
+c 'SM' -> X1 is sorted into decreasing order of magnitude.
+c 'LA' -> X1 is sorted into increasing order of algebraic.
+c 'SA' -> X1 is sorted into decreasing order of algebraic.
+c
+c APPLY Logical. (Input)
+c APPLY = .TRUE. -> apply the sorted order to X2.
+c APPLY = .FALSE. -> do not apply the sorted order to X2.
+c
+c N Integer. (INPUT)
+c Size of the arrays.
+c
+c X1 Double precision array of length N. (INPUT/OUTPUT)
+c The array to be sorted.
+c
+c X2 Double precision array of length N. (INPUT/OUTPUT)
+c Only referenced if APPLY = .TRUE.
+c
+c\EndDoc
+c
+c-----------------------------------------------------------------------
+c
+c\BeginLib
+c
+c\Author
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\Revision history:
+c 12/16/93: Version ' 2.1'.
+c Adapted from the sort routine in LANSO.
+c
+c\SCCS Information: @(#)
+c FILE: sortr.F SID: 2.3 DATE OF SID: 4/19/96 RELEASE: 2
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dsortr (which, apply, n, x1, x2)
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ character*2 which
+ logical apply
+ integer n
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ Double precision
+ & x1(0:n-1), x2(0:n-1)
+c
+c %---------------%
+c | Local Scalars |
+c %---------------%
+c
+ integer i, igap, j
+ Double precision
+ & temp
+c
+c %-----------------------%
+c | Executable Statements |
+c %-----------------------%
+c
+ igap = n / 2
+c
+ if (which .eq. 'SA') then
+c
+c X1 is sorted into decreasing order of algebraic.
+c
+ 10 continue
+ if (igap .eq. 0) go to 9000
+ do 30 i = igap, n-1
+ j = i-igap
+ 20 continue
+c
+ if (j.lt.0) go to 30
+c
+ if (x1(j).lt.x1(j+igap)) then
+ temp = x1(j)
+ x1(j) = x1(j+igap)
+ x1(j+igap) = temp
+ if (apply) then
+ temp = x2(j)
+ x2(j) = x2(j+igap)
+ x2(j+igap) = temp
+ end if
+ else
+ go to 30
+ endif
+ j = j-igap
+ go to 20
+ 30 continue
+ igap = igap / 2
+ go to 10
+c
+ else if (which .eq. 'SM') then
+c
+c X1 is sorted into decreasing order of magnitude.
+c
+ 40 continue
+ if (igap .eq. 0) go to 9000
+ do 60 i = igap, n-1
+ j = i-igap
+ 50 continue
+c
+ if (j.lt.0) go to 60
+c
+ if (abs(x1(j)).lt.abs(x1(j+igap))) then
+ temp = x1(j)
+ x1(j) = x1(j+igap)
+ x1(j+igap) = temp
+ if (apply) then
+ temp = x2(j)
+ x2(j) = x2(j+igap)
+ x2(j+igap) = temp
+ end if
+ else
+ go to 60
+ endif
+ j = j-igap
+ go to 50
+ 60 continue
+ igap = igap / 2
+ go to 40
+c
+ else if (which .eq. 'LA') then
+c
+c X1 is sorted into increasing order of algebraic.
+c
+ 70 continue
+ if (igap .eq. 0) go to 9000
+ do 90 i = igap, n-1
+ j = i-igap
+ 80 continue
+c
+ if (j.lt.0) go to 90
+c
+ if (x1(j).gt.x1(j+igap)) then
+ temp = x1(j)
+ x1(j) = x1(j+igap)
+ x1(j+igap) = temp
+ if (apply) then
+ temp = x2(j)
+ x2(j) = x2(j+igap)
+ x2(j+igap) = temp
+ end if
+ else
+ go to 90
+ endif
+ j = j-igap
+ go to 80
+ 90 continue
+ igap = igap / 2
+ go to 70
+c
+ else if (which .eq. 'LM') then
+c
+c X1 is sorted into increasing order of magnitude.
+c
+ 100 continue
+ if (igap .eq. 0) go to 9000
+ do 120 i = igap, n-1
+ j = i-igap
+ 110 continue
+c
+ if (j.lt.0) go to 120
+c
+ if (abs(x1(j)).gt.abs(x1(j+igap))) then
+ temp = x1(j)
+ x1(j) = x1(j+igap)
+ x1(j+igap) = temp
+ if (apply) then
+ temp = x2(j)
+ x2(j) = x2(j+igap)
+ x2(j+igap) = temp
+ end if
+ else
+ go to 120
+ endif
+ j = j-igap
+ go to 110
+ 120 continue
+ igap = igap / 2
+ go to 100
+ end if
+c
+ 9000 continue
+ return
+c
+c %---------------%
+c | End of dsortr |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.h
new file mode 100644
index 0000000000000000000000000000000000000000..f7916ad5df8c4e7475f20b98945a819237b76376
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dsortr.h
@@ -0,0 +1,8 @@
+extern int v3p_netlib_dsortr_(
+ char *which,
+ v3p_netlib_logical *apply,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *x1,
+ v3p_netlib_doublereal *x2,
+ v3p_netlib_ftnlen which_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.P
new file mode 100644
index 0000000000000000000000000000000000000000..467aca91715340c3809d1d00e364d611f84185c8
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.P
@@ -0,0 +1,10 @@
+extern int dstqrb_(integer *n, doublereal *d__, doublereal *e, doublereal *z__, doublereal *work, integer *info);
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dlanst_ 7 5 13 4 7 7 124 */
+/*:ref: dlascl_ 14 11 13 4 4 7 7 4 4 7 4 4 124 */
+/*:ref: dlaev2_ 14 7 7 7 7 7 7 7 7 */
+/*:ref: dlae2_ 14 5 7 7 7 7 7 */
+/*:ref: dlapy2_ 7 2 7 7 */
+/*:ref: dlartg_ 14 5 7 7 7 7 7 */
+/*:ref: dlasr_ 14 12 13 13 13 4 4 7 7 7 4 124 124 124 */
+/*:ref: dlasrt_ 14 5 13 4 7 4 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.c
new file mode 100644
index 0000000000000000000000000000000000000000..e1fd8faf6fb3b1efa7c50c50743572473a9252f4
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.c
@@ -0,0 +1,958 @@
+/* arpack/dstqrb.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__0 = 0;
+static integer c__1 = 1;
+static doublereal c_b31 = 1.;
+
+/* ----------------------------------------------------------------------- */
+/* \BeginDoc */
+
+/* \Name: dstqrb */
+
+/* \Description: */
+/* Computes all eigenvalues and the last component of the eigenvectors */
+/* of a symmetric tridiagonal matrix using the implicit QL or QR method. */
+
+/* This is mostly a modification of the LAPACK routine dsteqr. */
+/* See Remarks. */
+
+/* \Usage: */
+/* call dstqrb */
+/* ( N, D, E, Z, WORK, INFO ) */
+
+/* \Arguments */
+/* N Integer. (INPUT) */
+/* The number of rows and columns in the matrix. N >= 0. */
+
+/* D Double precision array, dimension (N). (INPUT/OUTPUT) */
+/* On entry, D contains the diagonal elements of the */
+/* tridiagonal matrix. */
+/* On exit, D contains the eigenvalues, in ascending order. */
+/* If an error exit is made, the eigenvalues are correct */
+/* for indices 1,2,...,INFO-1, but they are unordered and */
+/* may not be the smallest eigenvalues of the matrix. */
+
+/* E Double precision array, dimension (N-1). (INPUT/OUTPUT) */
+/* On entry, E contains the subdiagonal elements of the */
+/* tridiagonal matrix in positions 1 through N-1. */
+/* On exit, E has been destroyed. */
+
+/* Z Double precision array, dimension (N). (OUTPUT) */
+/* On exit, Z contains the last row of the orthonormal */
+/* eigenvector matrix of the symmetric tridiagonal matrix. */
+/* If an error exit is made, Z contains the last row of the */
+/* eigenvector matrix associated with the stored eigenvalues. */
+
+/* WORK Double precision array, dimension (max(1,2*N-2)). (WORKSPACE) */
+/* Workspace used in accumulating the transformation for */
+/* computing the last components of the eigenvectors. */
+
+/* INFO Integer. (OUTPUT) */
+/* = 0: normal return. */
+/* < 0: if INFO = -i, the i-th argument had an illegal value. */
+/* > 0: if INFO = +i, the i-th eigenvalue has not converged */
+/* after a total of 30*N iterations. */
+
+/* \Remarks */
+/* 1. None. */
+
+/* ----------------------------------------------------------------------- */
+
+/* \BeginLib */
+
+/* \Local variables: */
+/* xxxxxx real */
+
+/* \Routines called: */
+/* daxpy Level 1 BLAS that computes a vector triad. */
+/* dcopy Level 1 BLAS that copies one vector to another. */
+/* dswap Level 1 BLAS that swaps the contents of two vectors. */
+/* lsame LAPACK character comparison routine. */
+/* dlae2 LAPACK routine that computes the eigenvalues of a 2-by-2 */
+/* symmetric matrix. */
+/* dlaev2 LAPACK routine that eigendecomposition of a 2-by-2 symmetric */
+/* matrix. */
+/* dlamch LAPACK routine that determines machine constants. */
+/* dlanst LAPACK routine that computes the norm of a matrix. */
+/* dlapy2 LAPACK routine to compute sqrt(x**2+y**2) carefully. */
+/* dlartg LAPACK Givens rotation construction routine. */
+/* dlascl LAPACK routine for careful scaling of a matrix. */
+/* dlaset LAPACK matrix initialization routine. */
+/* dlasr LAPACK routine that applies an orthogonal transformation to */
+/* a matrix. */
+/* dlasrt LAPACK sorting routine. */
+/* dsteqr LAPACK routine that computes eigenvalues and eigenvectors */
+/* of a symmetric tridiagonal matrix. */
+/* xerbla LAPACK error handler routine. */
+
+/* \Authors */
+/* Danny Sorensen Phuong Vu */
+/* Richard Lehoucq CRPC / Rice University */
+/* Dept. of Computational & Houston, Texas */
+/* Applied Mathematics */
+/* Rice University */
+/* Houston, Texas */
+
+/* \SCCS Information: @(#) */
+/* FILE: stqrb.F SID: 2.5 DATE OF SID: 8/27/96 RELEASE: 2 */
+
+/* \Remarks */
+/* 1. Starting with version 2.5, this routine is a modified version */
+/* of LAPACK version 2.0 subroutine SSTEQR. No lines are deleted, */
+/* only commeted out and new lines inserted. */
+/* All lines commented out have "c$$$" at the beginning. */
+/* Note that the LAPACK version 1.0 subroutine SSTEQR contained */
+/* bugs. */
+
+/* \EndLib */
+
+/* ----------------------------------------------------------------------- */
+
+/*< subroutine dstqrb ( n, d, e, z, work, info ) >*/
+/* Subroutine */ int dstqrb_(integer *n, doublereal *d__, doublereal *e,
+ doublereal *z__, doublereal *work, integer *info)
+{
+ /* System generated locals */
+ integer i__1, i__2;
+ doublereal d__1, d__2;
+
+ /* Builtin functions */
+ double sqrt(doublereal), d_sign(doublereal *, doublereal *);
+
+ /* Local variables */
+ doublereal b, c__, f, g;
+ integer i__, j, k, l, m;
+ doublereal p, r__, s;
+ integer l1, ii, mm, lm1, mm1, nm1;
+ doublereal rt1, rt2, eps;
+ integer lsv;
+ doublereal tst, eps2;
+ integer lend, jtot;
+ extern /* Subroutine */ int dlae2_(doublereal *, doublereal *, doublereal
+ *, doublereal *, doublereal *), dlasr_(char *, char *, char *,
+ integer *, integer *, doublereal *, doublereal *, doublereal *,
+ integer *, ftnlen, ftnlen, ftnlen);
+ doublereal anorm;
+ extern /* Subroutine */ int dlaev2_(doublereal *, doublereal *,
+ doublereal *, doublereal *, doublereal *, doublereal *,
+ doublereal *);
+ integer lendm1, lendp1;
+ extern doublereal dlapy2_(doublereal *, doublereal *), dlamch_(char *,
+ ftnlen);
+ integer iscale;
+ extern /* Subroutine */ int dlascl_(char *, integer *, integer *,
+ doublereal *, doublereal *, integer *, integer *, doublereal *,
+ integer *, integer *, ftnlen);
+ doublereal safmin;
+ extern /* Subroutine */ int dlartg_(doublereal *, doublereal *,
+ doublereal *, doublereal *, doublereal *);
+ doublereal safmax;
+ extern doublereal dlanst_(char *, integer *, doublereal *, doublereal *,
+ ftnlen);
+ extern /* Subroutine */ int dlasrt_(char *, integer *, doublereal *,
+ integer *, ftnlen);
+ integer lendsv, nmaxit, icompz;
+ doublereal ssfmax, ssfmin;
+
+
+/* %------------------% */
+/* | Scalar Arguments | */
+/* %------------------% */
+
+/*< integer info, n >*/
+
+/* %-----------------% */
+/* | Array Arguments | */
+/* %-----------------% */
+
+/*< >*/
+
+/* .. parameters .. */
+/*< >*/
+/*< >*/
+/*< integer maxit >*/
+/*< parameter ( maxit = 30 ) >*/
+/* .. */
+/* .. local scalars .. */
+/*< >*/
+/*< >*/
+/* .. */
+/* .. external functions .. */
+/*< logical lsame >*/
+/*< >*/
+/*< external lsame, dlamch, dlanst, dlapy2 >*/
+/* .. */
+/* .. external subroutines .. */
+/*< >*/
+/* .. */
+/* .. intrinsic functions .. */
+/*< intrinsic abs, max, sign, sqrt >*/
+/* .. */
+/* .. executable statements .. */
+
+/* test the input parameters. */
+
+/*< info = 0 >*/
+ /* Parameter adjustments */
+ --work;
+ --z__;
+ --e;
+ --d__;
+
+ /* Function Body */
+ *info = 0;
+
+/* $$$ IF( LSAME( COMPZ, 'N' ) ) THEN */
+/* $$$ ICOMPZ = 0 */
+/* $$$ ELSE IF( LSAME( COMPZ, 'V' ) ) THEN */
+/* $$$ ICOMPZ = 1 */
+/* $$$ ELSE IF( LSAME( COMPZ, 'I' ) ) THEN */
+/* $$$ ICOMPZ = 2 */
+/* $$$ ELSE */
+/* $$$ ICOMPZ = -1 */
+/* $$$ END IF */
+/* $$$ IF( ICOMPZ.LT.0 ) THEN */
+/* $$$ INFO = -1 */
+/* $$$ ELSE IF( N.LT.0 ) THEN */
+/* $$$ INFO = -2 */
+/* $$$ ELSE IF( ( LDZ.LT.1 ) .OR. ( ICOMPZ.GT.0 .AND. LDZ.LT.MAX( 1, */
+/* $$$ $ N ) ) ) THEN */
+/* $$$ INFO = -6 */
+/* $$$ END IF */
+/* $$$ IF( INFO.NE.0 ) THEN */
+/* $$$ CALL XERBLA( 'SSTEQR', -INFO ) */
+/* $$$ RETURN */
+/* $$$ END IF */
+
+/* *** New starting with version 2.5 *** */
+
+/*< icompz = 2 >*/
+ icompz = 2;
+/* ************************************* */
+
+/* quick return if possible */
+
+/*< >*/
+ if (*n == 0) {
+ return 0;
+ }
+
+/*< if( n.eq.1 ) then >*/
+ if (*n == 1) {
+/*< if( icompz.eq.2 ) z( 1 ) = one >*/
+ if (icompz == 2) {
+ z__[1] = 1.;
+ }
+/*< return >*/
+ return 0;
+/*< end if >*/
+ }
+
+/* determine the unit roundoff and over/underflow thresholds. */
+
+/*< eps = dlamch( 'e' ) >*/
+ eps = dlamch_("e", (ftnlen)1);
+/*< eps2 = eps**2 >*/
+/* Computing 2nd power */
+ d__1 = eps;
+ eps2 = d__1 * d__1;
+/*< safmin = dlamch( 's' ) >*/
+ safmin = dlamch_("s", (ftnlen)1);
+/*< safmax = one / safmin >*/
+ safmax = 1. / safmin;
+/*< ssfmax = sqrt( safmax ) / three >*/
+ ssfmax = sqrt(safmax) / 3.;
+/*< ssfmin = sqrt( safmin ) / eps2 >*/
+ ssfmin = sqrt(safmin) / eps2;
+
+/* compute the eigenvalues and eigenvectors of the tridiagonal */
+/* matrix. */
+
+/* $$ if( icompz.eq.2 ) */
+/* $$$ $ call dlaset( 'full', n, n, zero, one, z, ldz ) */
+
+/* *** New starting with version 2.5 *** */
+
+/*< if ( icompz .eq. 2 ) then >*/
+ if (icompz == 2) {
+/*< do 5 j = 1, n-1 >*/
+ i__1 = *n - 1;
+ for (j = 1; j <= i__1; ++j) {
+/*< z(j) = zero >*/
+ z__[j] = 0.;
+/*< 5 continue >*/
+/* L5: */
+ }
+/*< z( n ) = one >*/
+ z__[*n] = 1.;
+/*< end if >*/
+ }
+/* ************************************* */
+
+/*< nmaxit = n*maxit >*/
+ nmaxit = *n * 30;
+/*< jtot = 0 >*/
+ jtot = 0;
+
+/* determine where the matrix splits and choose ql or qr iteration */
+/* for each block, according to whether top or bottom diagonal */
+/* element is smaller. */
+
+/*< l1 = 1 >*/
+ l1 = 1;
+/*< nm1 = n - 1 >*/
+ nm1 = *n - 1;
+
+/*< 10 continue >*/
+L10:
+/*< >*/
+ if (l1 > *n) {
+ goto L160;
+ }
+/*< >*/
+ if (l1 > 1) {
+ e[l1 - 1] = 0.;
+ }
+/*< if( l1.le.nm1 ) then >*/
+ if (l1 <= nm1) {
+/*< do 20 m = l1, nm1 >*/
+ i__1 = nm1;
+ for (m = l1; m <= i__1; ++m) {
+/*< tst = abs( e( m ) ) >*/
+ tst = (d__1 = e[m], abs(d__1));
+/*< >*/
+ if (tst == 0.) {
+ goto L30;
+ }
+/*< >*/
+ if (tst <= sqrt((d__1 = d__[m], abs(d__1))) * sqrt((d__2 = d__[m
+ + 1], abs(d__2))) * eps) {
+/*< e( m ) = zero >*/
+ e[m] = 0.;
+/*< go to 30 >*/
+ goto L30;
+/*< end if >*/
+ }
+/*< 20 continue >*/
+/* L20: */
+ }
+/*< end if >*/
+ }
+/*< m = n >*/
+ m = *n;
+
+/*< 30 continue >*/
+L30:
+/*< l = l1 >*/
+ l = l1;
+/*< lsv = l >*/
+ lsv = l;
+/*< lend = m >*/
+ lend = m;
+/*< lendsv = lend >*/
+ lendsv = lend;
+/*< l1 = m + 1 >*/
+ l1 = m + 1;
+/*< >*/
+ if (lend == l) {
+ goto L10;
+ }
+
+/* scale submatrix in rows and columns l to lend */
+
+/*< anorm = dlanst( 'i', lend-l+1, d( l ), e( l ) ) >*/
+ i__1 = lend - l + 1;
+ anorm = dlanst_("i", &i__1, &d__[l], &e[l], (ftnlen)1);
+/*< iscale = 0 >*/
+ iscale = 0;
+/*< >*/
+ if (anorm == 0.) {
+ goto L10;
+ }
+/*< if( anorm.gt.ssfmax ) then >*/
+ if (anorm > ssfmax) {
+/*< iscale = 1 >*/
+ iscale = 1;
+/*< >*/
+ i__1 = lend - l + 1;
+ dlascl_("g", &c__0, &c__0, &anorm, &ssfmax, &i__1, &c__1, &d__[l], n,
+ info, (ftnlen)1);
+/*< >*/
+ i__1 = lend - l;
+ dlascl_("g", &c__0, &c__0, &anorm, &ssfmax, &i__1, &c__1, &e[l], n,
+ info, (ftnlen)1);
+/*< else if( anorm.lt.ssfmin ) then >*/
+ } else if (anorm < ssfmin) {
+/*< iscale = 2 >*/
+ iscale = 2;
+/*< >*/
+ i__1 = lend - l + 1;
+ dlascl_("g", &c__0, &c__0, &anorm, &ssfmin, &i__1, &c__1, &d__[l], n,
+ info, (ftnlen)1);
+/*< >*/
+ i__1 = lend - l;
+ dlascl_("g", &c__0, &c__0, &anorm, &ssfmin, &i__1, &c__1, &e[l], n,
+ info, (ftnlen)1);
+/*< end if >*/
+ }
+
+/* choose between ql and qr iteration */
+
+/*< if( abs( d( lend ) ).lt.abs( d( l ) ) ) then >*/
+ if ((d__1 = d__[lend], abs(d__1)) < (d__2 = d__[l], abs(d__2))) {
+/*< lend = lsv >*/
+ lend = lsv;
+/*< l = lendsv >*/
+ l = lendsv;
+/*< end if >*/
+ }
+
+/*< if( lend.gt.l ) then >*/
+ if (lend > l) {
+
+/* ql iteration */
+
+/* look for small subdiagonal element. */
+
+/*< 40 continue >*/
+L40:
+/*< if( l.ne.lend ) then >*/
+ if (l != lend) {
+/*< lendm1 = lend - 1 >*/
+ lendm1 = lend - 1;
+/*< do 50 m = l, lendm1 >*/
+ i__1 = lendm1;
+ for (m = l; m <= i__1; ++m) {
+/*< tst = abs( e( m ) )**2 >*/
+/* Computing 2nd power */
+ d__2 = (d__1 = e[m], abs(d__1));
+ tst = d__2 * d__2;
+/*< >*/
+ if (tst <= eps2 * (d__1 = d__[m], abs(d__1)) * (d__2 = d__[m
+ + 1], abs(d__2)) + safmin) {
+ goto L60;
+ }
+/*< 50 continue >*/
+/* L50: */
+ }
+/*< end if >*/
+ }
+
+/*< m = lend >*/
+ m = lend;
+
+/*< 60 continue >*/
+L60:
+/*< >*/
+ if (m < lend) {
+ e[m] = 0.;
+ }
+/*< p = d( l ) >*/
+ p = d__[l];
+/*< >*/
+ if (m == l) {
+ goto L80;
+ }
+
+/* if remaining matrix is 2-by-2, use dlae2 or dlaev2 */
+/* to compute its eigensystem. */
+
+/*< if( m.eq.l+1 ) then >*/
+ if (m == l + 1) {
+/*< if( icompz.gt.0 ) then >*/
+ if (icompz > 0) {
+/*< call dlaev2( d( l ), e( l ), d( l+1 ), rt1, rt2, c, s ) >*/
+ dlaev2_(&d__[l], &e[l], &d__[l + 1], &rt1, &rt2, &c__, &s);
+/*< work( l ) = c >*/
+ work[l] = c__;
+/*< work( n-1+l ) = s >*/
+ work[*n - 1 + l] = s;
+/* $$$ call dlasr( 'r', 'v', 'b', n, 2, work( l ), */
+/* $$$ $ work( n-1+l ), z( 1, l ), ldz ) */
+
+/* *** New starting with version 2.5 *** */
+
+/*< tst = z(l+1) >*/
+ tst = z__[l + 1];
+/*< z(l+1) = c*tst - s*z(l) >*/
+ z__[l + 1] = c__ * tst - s * z__[l];
+/*< z(l) = s*tst + c*z(l) >*/
+ z__[l] = s * tst + c__ * z__[l];
+/* ************************************* */
+/*< else >*/
+ } else {
+/*< call dlae2( d( l ), e( l ), d( l+1 ), rt1, rt2 ) >*/
+ dlae2_(&d__[l], &e[l], &d__[l + 1], &rt1, &rt2);
+/*< end if >*/
+ }
+/*< d( l ) = rt1 >*/
+ d__[l] = rt1;
+/*< d( l+1 ) = rt2 >*/
+ d__[l + 1] = rt2;
+/*< e( l ) = zero >*/
+ e[l] = 0.;
+/*< l = l + 2 >*/
+ l += 2;
+/*< >*/
+ if (l <= lend) {
+ goto L40;
+ }
+/*< go to 140 >*/
+ goto L140;
+/*< end if >*/
+ }
+
+/*< >*/
+ if (jtot == nmaxit) {
+ goto L140;
+ }
+/*< jtot = jtot + 1 >*/
+ ++jtot;
+
+/* form shift. */
+
+/*< g = ( d( l+1 )-p ) / ( two*e( l ) ) >*/
+ g = (d__[l + 1] - p) / (e[l] * 2.);
+/*< r = dlapy2( g, one ) >*/
+ r__ = dlapy2_(&g, &c_b31);
+/*< g = d( m ) - p + ( e( l ) / ( g+sign( r, g ) ) ) >*/
+ g = d__[m] - p + e[l] / (g + d_sign(&r__, &g));
+
+/*< s = one >*/
+ s = 1.;
+/*< c = one >*/
+ c__ = 1.;
+/*< p = zero >*/
+ p = 0.;
+
+/* inner loop */
+
+/*< mm1 = m - 1 >*/
+ mm1 = m - 1;
+/*< do 70 i = mm1, l, -1 >*/
+ i__1 = l;
+ for (i__ = mm1; i__ >= i__1; --i__) {
+/*< f = s*e( i ) >*/
+ f = s * e[i__];
+/*< b = c*e( i ) >*/
+ b = c__ * e[i__];
+/*< call dlartg( g, f, c, s, r ) >*/
+ dlartg_(&g, &f, &c__, &s, &r__);
+/*< >*/
+ if (i__ != m - 1) {
+ e[i__ + 1] = r__;
+ }
+/*< g = d( i+1 ) - p >*/
+ g = d__[i__ + 1] - p;
+/*< r = ( d( i )-g )*s + two*c*b >*/
+ r__ = (d__[i__] - g) * s + c__ * 2. * b;
+/*< p = s*r >*/
+ p = s * r__;
+/*< d( i+1 ) = g + p >*/
+ d__[i__ + 1] = g + p;
+/*< g = c*r - b >*/
+ g = c__ * r__ - b;
+
+/* if eigenvectors are desired, then save rotations. */
+
+/*< if( icompz.gt.0 ) then >*/
+ if (icompz > 0) {
+/*< work( i ) = c >*/
+ work[i__] = c__;
+/*< work( n-1+i ) = -s >*/
+ work[*n - 1 + i__] = -s;
+/*< end if >*/
+ }
+
+/*< 70 continue >*/
+/* L70: */
+ }
+
+/* if eigenvectors are desired, then apply saved rotations. */
+
+/*< if( icompz.gt.0 ) then >*/
+ if (icompz > 0) {
+/*< mm = m - l + 1 >*/
+ mm = m - l + 1;
+/* $$$ call dlasr( 'r', 'v', 'b', n, mm, work( l ), work( n-1+l ), */
+/* $$$ $ z( 1, l ), ldz ) */
+
+/* *** New starting with version 2.5 *** */
+
+/*< >*/
+ dlasr_("r", "v", "b", &c__1, &mm, &work[l], &work[*n - 1 + l], &
+ z__[l], &c__1, (ftnlen)1, (ftnlen)1, (ftnlen)1);
+/* ************************************* */
+/*< end if >*/
+ }
+
+/*< d( l ) = d( l ) - p >*/
+ d__[l] -= p;
+/*< e( l ) = g >*/
+ e[l] = g;
+/*< go to 40 >*/
+ goto L40;
+
+/* eigenvalue found. */
+
+/*< 80 continue >*/
+L80:
+/*< d( l ) = p >*/
+ d__[l] = p;
+
+/*< l = l + 1 >*/
+ ++l;
+/*< >*/
+ if (l <= lend) {
+ goto L40;
+ }
+/*< go to 140 >*/
+ goto L140;
+
+/*< else >*/
+ } else {
+
+/* qr iteration */
+
+/* look for small superdiagonal element. */
+
+/*< 90 continue >*/
+L90:
+/*< if( l.ne.lend ) then >*/
+ if (l != lend) {
+/*< lendp1 = lend + 1 >*/
+ lendp1 = lend + 1;
+/*< do 100 m = l, lendp1, -1 >*/
+ i__1 = lendp1;
+ for (m = l; m >= i__1; --m) {
+/*< tst = abs( e( m-1 ) )**2 >*/
+/* Computing 2nd power */
+ d__2 = (d__1 = e[m - 1], abs(d__1));
+ tst = d__2 * d__2;
+/*< >*/
+ if (tst <= eps2 * (d__1 = d__[m], abs(d__1)) * (d__2 = d__[m
+ - 1], abs(d__2)) + safmin) {
+ goto L110;
+ }
+/*< 100 continue >*/
+/* L100: */
+ }
+/*< end if >*/
+ }
+
+/*< m = lend >*/
+ m = lend;
+
+/*< 110 continue >*/
+L110:
+/*< >*/
+ if (m > lend) {
+ e[m - 1] = 0.;
+ }
+/*< p = d( l ) >*/
+ p = d__[l];
+/*< >*/
+ if (m == l) {
+ goto L130;
+ }
+
+/* if remaining matrix is 2-by-2, use dlae2 or dlaev2 */
+/* to compute its eigensystem. */
+
+/*< if( m.eq.l-1 ) then >*/
+ if (m == l - 1) {
+/*< if( icompz.gt.0 ) then >*/
+ if (icompz > 0) {
+/*< call dlaev2( d( l-1 ), e( l-1 ), d( l ), rt1, rt2, c, s ) >*/
+ dlaev2_(&d__[l - 1], &e[l - 1], &d__[l], &rt1, &rt2, &c__, &s)
+ ;
+/* $$$ work( m ) = c */
+/* $$$ work( n-1+m ) = s */
+/* $$$ call dlasr( 'r', 'v', 'f', n, 2, work( m ), */
+/* $$$ $ work( n-1+m ), z( 1, l-1 ), ldz ) */
+
+/* *** New starting with version 2.5 *** */
+
+/*< tst = z(l) >*/
+ tst = z__[l];
+/*< z(l) = c*tst - s*z(l-1) >*/
+ z__[l] = c__ * tst - s * z__[l - 1];
+/*< z(l-1) = s*tst + c*z(l-1) >*/
+ z__[l - 1] = s * tst + c__ * z__[l - 1];
+/* ************************************* */
+/*< else >*/
+ } else {
+/*< call dlae2( d( l-1 ), e( l-1 ), d( l ), rt1, rt2 ) >*/
+ dlae2_(&d__[l - 1], &e[l - 1], &d__[l], &rt1, &rt2);
+/*< end if >*/
+ }
+/*< d( l-1 ) = rt1 >*/
+ d__[l - 1] = rt1;
+/*< d( l ) = rt2 >*/
+ d__[l] = rt2;
+/*< e( l-1 ) = zero >*/
+ e[l - 1] = 0.;
+/*< l = l - 2 >*/
+ l += -2;
+/*< >*/
+ if (l >= lend) {
+ goto L90;
+ }
+/*< go to 140 >*/
+ goto L140;
+/*< end if >*/
+ }
+
+/*< >*/
+ if (jtot == nmaxit) {
+ goto L140;
+ }
+/*< jtot = jtot + 1 >*/
+ ++jtot;
+
+/* form shift. */
+
+/*< g = ( d( l-1 )-p ) / ( two*e( l-1 ) ) >*/
+ g = (d__[l - 1] - p) / (e[l - 1] * 2.);
+/*< r = dlapy2( g, one ) >*/
+ r__ = dlapy2_(&g, &c_b31);
+/*< g = d( m ) - p + ( e( l-1 ) / ( g+sign( r, g ) ) ) >*/
+ g = d__[m] - p + e[l - 1] / (g + d_sign(&r__, &g));
+
+/*< s = one >*/
+ s = 1.;
+/*< c = one >*/
+ c__ = 1.;
+/*< p = zero >*/
+ p = 0.;
+
+/* inner loop */
+
+/*< lm1 = l - 1 >*/
+ lm1 = l - 1;
+/*< do 120 i = m, lm1 >*/
+ i__1 = lm1;
+ for (i__ = m; i__ <= i__1; ++i__) {
+/*< f = s*e( i ) >*/
+ f = s * e[i__];
+/*< b = c*e( i ) >*/
+ b = c__ * e[i__];
+/*< call dlartg( g, f, c, s, r ) >*/
+ dlartg_(&g, &f, &c__, &s, &r__);
+/*< >*/
+ if (i__ != m) {
+ e[i__ - 1] = r__;
+ }
+/*< g = d( i ) - p >*/
+ g = d__[i__] - p;
+/*< r = ( d( i+1 )-g )*s + two*c*b >*/
+ r__ = (d__[i__ + 1] - g) * s + c__ * 2. * b;
+/*< p = s*r >*/
+ p = s * r__;
+/*< d( i ) = g + p >*/
+ d__[i__] = g + p;
+/*< g = c*r - b >*/
+ g = c__ * r__ - b;
+
+/* if eigenvectors are desired, then save rotations. */
+
+/*< if( icompz.gt.0 ) then >*/
+ if (icompz > 0) {
+/*< work( i ) = c >*/
+ work[i__] = c__;
+/*< work( n-1+i ) = s >*/
+ work[*n - 1 + i__] = s;
+/*< end if >*/
+ }
+
+/*< 120 continue >*/
+/* L120: */
+ }
+
+/* if eigenvectors are desired, then apply saved rotations. */
+
+/*< if( icompz.gt.0 ) then >*/
+ if (icompz > 0) {
+/*< mm = l - m + 1 >*/
+ mm = l - m + 1;
+/* $$$ call dlasr( 'r', 'v', 'f', n, mm, work( m ), work( n-1+m ), */
+/* $$$ $ z( 1, m ), ldz ) */
+
+/* *** New starting with version 2.5 *** */
+
+/*< >*/
+ dlasr_("r", "v", "f", &c__1, &mm, &work[m], &work[*n - 1 + m], &
+ z__[m], &c__1, (ftnlen)1, (ftnlen)1, (ftnlen)1);
+/* ************************************* */
+/*< end if >*/
+ }
+
+/*< d( l ) = d( l ) - p >*/
+ d__[l] -= p;
+/*< e( lm1 ) = g >*/
+ e[lm1] = g;
+/*< go to 90 >*/
+ goto L90;
+
+/* eigenvalue found. */
+
+/*< 130 continue >*/
+L130:
+/*< d( l ) = p >*/
+ d__[l] = p;
+
+/*< l = l - 1 >*/
+ --l;
+/*< >*/
+ if (l >= lend) {
+ goto L90;
+ }
+/*< go to 140 >*/
+ goto L140;
+
+/*< end if >*/
+ }
+
+/* undo scaling if necessary */
+
+/*< 140 continue >*/
+L140:
+/*< if( iscale.eq.1 ) then >*/
+ if (iscale == 1) {
+/*< >*/
+ i__1 = lendsv - lsv + 1;
+ dlascl_("g", &c__0, &c__0, &ssfmax, &anorm, &i__1, &c__1, &d__[lsv],
+ n, info, (ftnlen)1);
+/*< >*/
+ i__1 = lendsv - lsv;
+ dlascl_("g", &c__0, &c__0, &ssfmax, &anorm, &i__1, &c__1, &e[lsv], n,
+ info, (ftnlen)1);
+/*< else if( iscale.eq.2 ) then >*/
+ } else if (iscale == 2) {
+/*< >*/
+ i__1 = lendsv - lsv + 1;
+ dlascl_("g", &c__0, &c__0, &ssfmin, &anorm, &i__1, &c__1, &d__[lsv],
+ n, info, (ftnlen)1);
+/*< >*/
+ i__1 = lendsv - lsv;
+ dlascl_("g", &c__0, &c__0, &ssfmin, &anorm, &i__1, &c__1, &e[lsv], n,
+ info, (ftnlen)1);
+/*< end if >*/
+ }
+
+/* check for no convergence to an eigenvalue after a total */
+/* of n*maxit iterations. */
+
+/*< >*/
+ if (jtot < nmaxit) {
+ goto L10;
+ }
+/*< do 150 i = 1, n - 1 >*/
+ i__1 = *n - 1;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< >*/
+ if (e[i__] != 0.) {
+ ++(*info);
+ }
+/*< 150 continue >*/
+/* L150: */
+ }
+/*< go to 190 >*/
+ goto L190;
+
+/* order eigenvalues and eigenvectors. */
+
+/*< 160 continue >*/
+L160:
+/*< if( icompz.eq.0 ) then >*/
+ if (icompz == 0) {
+
+/* use quick sort */
+
+/*< call dlasrt( 'i', n, d, info ) >*/
+ dlasrt_("i", n, &d__[1], info, (ftnlen)1);
+
+/*< else >*/
+ } else {
+
+/* use selection sort to minimize swaps of eigenvectors */
+
+/*< do 180 ii = 2, n >*/
+ i__1 = *n;
+ for (ii = 2; ii <= i__1; ++ii) {
+/*< i = ii - 1 >*/
+ i__ = ii - 1;
+/*< k = i >*/
+ k = i__;
+/*< p = d( i ) >*/
+ p = d__[i__];
+/*< do 170 j = ii, n >*/
+ i__2 = *n;
+ for (j = ii; j <= i__2; ++j) {
+/*< if( d( j ).lt.p ) then >*/
+ if (d__[j] < p) {
+/*< k = j >*/
+ k = j;
+/*< p = d( j ) >*/
+ p = d__[j];
+/*< end if >*/
+ }
+/*< 170 continue >*/
+/* L170: */
+ }
+/*< if( k.ne.i ) then >*/
+ if (k != i__) {
+/*< d( k ) = d( i ) >*/
+ d__[k] = d__[i__];
+/*< d( i ) = p >*/
+ d__[i__] = p;
+/* $$$ call dswap( n, z( 1, i ), 1, z( 1, k ), 1 ) */
+/* *** New starting with version 2.5 *** */
+
+/*< p = z(k) >*/
+ p = z__[k];
+/*< z(k) = z(i) >*/
+ z__[k] = z__[i__];
+/*< z(i) = p >*/
+ z__[i__] = p;
+/* ************************************* */
+/*< end if >*/
+ }
+/*< 180 continue >*/
+/* L180: */
+ }
+/*< end if >*/
+ }
+
+/*< 190 continue >*/
+L190:
+/*< return >*/
+ return 0;
+
+/* %---------------% */
+/* | End of dstqrb | */
+/* %---------------% */
+
+/*< end >*/
+} /* dstqrb_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.f
new file mode 100644
index 0000000000000000000000000000000000000000..f69067c32de9f0281dac96bfe3f2d3df1263879c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.f
@@ -0,0 +1,594 @@
+c-----------------------------------------------------------------------
+c\BeginDoc
+c
+c\Name: dstqrb
+c
+c\Description:
+c Computes all eigenvalues and the last component of the eigenvectors
+c of a symmetric tridiagonal matrix using the implicit QL or QR method.
+c
+c This is mostly a modification of the LAPACK routine dsteqr.
+c See Remarks.
+c
+c\Usage:
+c call dstqrb
+c ( N, D, E, Z, WORK, INFO )
+c
+c\Arguments
+c N Integer. (INPUT)
+c The number of rows and columns in the matrix. N >= 0.
+c
+c D Double precision array, dimension (N). (INPUT/OUTPUT)
+c On entry, D contains the diagonal elements of the
+c tridiagonal matrix.
+c On exit, D contains the eigenvalues, in ascending order.
+c If an error exit is made, the eigenvalues are correct
+c for indices 1,2,...,INFO-1, but they are unordered and
+c may not be the smallest eigenvalues of the matrix.
+c
+c E Double precision array, dimension (N-1). (INPUT/OUTPUT)
+c On entry, E contains the subdiagonal elements of the
+c tridiagonal matrix in positions 1 through N-1.
+c On exit, E has been destroyed.
+c
+c Z Double precision array, dimension (N). (OUTPUT)
+c On exit, Z contains the last row of the orthonormal
+c eigenvector matrix of the symmetric tridiagonal matrix.
+c If an error exit is made, Z contains the last row of the
+c eigenvector matrix associated with the stored eigenvalues.
+c
+c WORK Double precision array, dimension (max(1,2*N-2)). (WORKSPACE)
+c Workspace used in accumulating the transformation for
+c computing the last components of the eigenvectors.
+c
+c INFO Integer. (OUTPUT)
+c = 0: normal return.
+c < 0: if INFO = -i, the i-th argument had an illegal value.
+c > 0: if INFO = +i, the i-th eigenvalue has not converged
+c after a total of 30*N iterations.
+c
+c\Remarks
+c 1. None.
+c
+c-----------------------------------------------------------------------
+c
+c\BeginLib
+c
+c\Local variables:
+c xxxxxx real
+c
+c\Routines called:
+c daxpy Level 1 BLAS that computes a vector triad.
+c dcopy Level 1 BLAS that copies one vector to another.
+c dswap Level 1 BLAS that swaps the contents of two vectors.
+c lsame LAPACK character comparison routine.
+c dlae2 LAPACK routine that computes the eigenvalues of a 2-by-2
+c symmetric matrix.
+c dlaev2 LAPACK routine that eigendecomposition of a 2-by-2 symmetric
+c matrix.
+c dlamch LAPACK routine that determines machine constants.
+c dlanst LAPACK routine that computes the norm of a matrix.
+c dlapy2 LAPACK routine to compute sqrt(x**2+y**2) carefully.
+c dlartg LAPACK Givens rotation construction routine.
+c dlascl LAPACK routine for careful scaling of a matrix.
+c dlaset LAPACK matrix initialization routine.
+c dlasr LAPACK routine that applies an orthogonal transformation to
+c a matrix.
+c dlasrt LAPACK sorting routine.
+c dsteqr LAPACK routine that computes eigenvalues and eigenvectors
+c of a symmetric tridiagonal matrix.
+c xerbla LAPACK error handler routine.
+c
+c\Authors
+c Danny Sorensen Phuong Vu
+c Richard Lehoucq CRPC / Rice University
+c Dept. of Computational & Houston, Texas
+c Applied Mathematics
+c Rice University
+c Houston, Texas
+c
+c\SCCS Information: @(#)
+c FILE: stqrb.F SID: 2.5 DATE OF SID: 8/27/96 RELEASE: 2
+c
+c\Remarks
+c 1. Starting with version 2.5, this routine is a modified version
+c of LAPACK version 2.0 subroutine SSTEQR. No lines are deleted,
+c only commeted out and new lines inserted.
+c All lines commented out have "c$$$" at the beginning.
+c Note that the LAPACK version 1.0 subroutine SSTEQR contained
+c bugs.
+c
+c\EndLib
+c
+c-----------------------------------------------------------------------
+c
+ subroutine dstqrb ( n, d, e, z, work, info )
+c
+c %------------------%
+c | Scalar Arguments |
+c %------------------%
+c
+ integer info, n
+c
+c %-----------------%
+c | Array Arguments |
+c %-----------------%
+c
+ Double precision
+ & d( n ), e( n-1 ), z( n ), work( 2*n-2 )
+c
+c .. parameters ..
+ Double precision
+ & zero, one, two, three
+ parameter ( zero = 0.0D+0, one = 1.0D+0,
+ & two = 2.0D+0, three = 3.0D+0 )
+ integer maxit
+ parameter ( maxit = 30 )
+c ..
+c .. local scalars ..
+ integer i, icompz, ii, iscale, j, jtot, k, l, l1, lend,
+ & lendm1, lendp1, lendsv, lm1, lsv, m, mm, mm1,
+ & nm1, nmaxit
+ Double precision
+ & anorm, b, c, eps, eps2, f, g, p, r, rt1, rt2,
+ & s, safmax, safmin, ssfmax, ssfmin, tst
+c ..
+c .. external functions ..
+ logical lsame
+ Double precision
+ & dlamch, dlanst, dlapy2
+ external lsame, dlamch, dlanst, dlapy2
+c ..
+c .. external subroutines ..
+ external dlae2, dlaev2, dlartg, dlascl, dlaset, dlasr,
+ & dlasrt, dswap, xerbla
+c ..
+c .. intrinsic functions ..
+ intrinsic abs, max, sign, sqrt
+c ..
+c .. executable statements ..
+c
+c test the input parameters.
+c
+ info = 0
+c
+c$$$ IF( LSAME( COMPZ, 'N' ) ) THEN
+c$$$ ICOMPZ = 0
+c$$$ ELSE IF( LSAME( COMPZ, 'V' ) ) THEN
+c$$$ ICOMPZ = 1
+c$$$ ELSE IF( LSAME( COMPZ, 'I' ) ) THEN
+c$$$ ICOMPZ = 2
+c$$$ ELSE
+c$$$ ICOMPZ = -1
+c$$$ END IF
+c$$$ IF( ICOMPZ.LT.0 ) THEN
+c$$$ INFO = -1
+c$$$ ELSE IF( N.LT.0 ) THEN
+c$$$ INFO = -2
+c$$$ ELSE IF( ( LDZ.LT.1 ) .OR. ( ICOMPZ.GT.0 .AND. LDZ.LT.MAX( 1,
+c$$$ $ N ) ) ) THEN
+c$$$ INFO = -6
+c$$$ END IF
+c$$$ IF( INFO.NE.0 ) THEN
+c$$$ CALL XERBLA( 'SSTEQR', -INFO )
+c$$$ RETURN
+c$$$ END IF
+c
+c *** New starting with version 2.5 ***
+c
+ icompz = 2
+c *************************************
+c
+c quick return if possible
+c
+ if( n.eq.0 )
+ $ return
+c
+ if( n.eq.1 ) then
+ if( icompz.eq.2 ) z( 1 ) = one
+ return
+ end if
+c
+c determine the unit roundoff and over/underflow thresholds.
+c
+ eps = dlamch( 'e' )
+ eps2 = eps**2
+ safmin = dlamch( 's' )
+ safmax = one / safmin
+ ssfmax = sqrt( safmax ) / three
+ ssfmin = sqrt( safmin ) / eps2
+c
+c compute the eigenvalues and eigenvectors of the tridiagonal
+c matrix.
+c
+c$$ if( icompz.eq.2 )
+c$$$ $ call dlaset( 'full', n, n, zero, one, z, ldz )
+c
+c *** New starting with version 2.5 ***
+c
+ if ( icompz .eq. 2 ) then
+ do 5 j = 1, n-1
+ z(j) = zero
+ 5 continue
+ z( n ) = one
+ end if
+c *************************************
+c
+ nmaxit = n*maxit
+ jtot = 0
+c
+c determine where the matrix splits and choose ql or qr iteration
+c for each block, according to whether top or bottom diagonal
+c element is smaller.
+c
+ l1 = 1
+ nm1 = n - 1
+c
+ 10 continue
+ if( l1.gt.n )
+ $ go to 160
+ if( l1.gt.1 )
+ $ e( l1-1 ) = zero
+ if( l1.le.nm1 ) then
+ do 20 m = l1, nm1
+ tst = abs( e( m ) )
+ if( tst.eq.zero )
+ $ go to 30
+ if( tst.le.( sqrt( abs( d( m ) ) )*sqrt( abs( d( m+
+ $ 1 ) ) ) )*eps ) then
+ e( m ) = zero
+ go to 30
+ end if
+ 20 continue
+ end if
+ m = n
+c
+ 30 continue
+ l = l1
+ lsv = l
+ lend = m
+ lendsv = lend
+ l1 = m + 1
+ if( lend.eq.l )
+ $ go to 10
+c
+c scale submatrix in rows and columns l to lend
+c
+ anorm = dlanst( 'i', lend-l+1, d( l ), e( l ) )
+ iscale = 0
+ if( anorm.eq.zero )
+ $ go to 10
+ if( anorm.gt.ssfmax ) then
+ iscale = 1
+ call dlascl( 'g', 0, 0, anorm, ssfmax, lend-l+1, 1, d( l ), n,
+ $ info )
+ call dlascl( 'g', 0, 0, anorm, ssfmax, lend-l, 1, e( l ), n,
+ $ info )
+ else if( anorm.lt.ssfmin ) then
+ iscale = 2
+ call dlascl( 'g', 0, 0, anorm, ssfmin, lend-l+1, 1, d( l ), n,
+ $ info )
+ call dlascl( 'g', 0, 0, anorm, ssfmin, lend-l, 1, e( l ), n,
+ $ info )
+ end if
+c
+c choose between ql and qr iteration
+c
+ if( abs( d( lend ) ).lt.abs( d( l ) ) ) then
+ lend = lsv
+ l = lendsv
+ end if
+c
+ if( lend.gt.l ) then
+c
+c ql iteration
+c
+c look for small subdiagonal element.
+c
+ 40 continue
+ if( l.ne.lend ) then
+ lendm1 = lend - 1
+ do 50 m = l, lendm1
+ tst = abs( e( m ) )**2
+ if( tst.le.( eps2*abs( d( m ) ) )*abs( d( m+1 ) )+
+ $ safmin )go to 60
+ 50 continue
+ end if
+c
+ m = lend
+c
+ 60 continue
+ if( m.lt.lend )
+ $ e( m ) = zero
+ p = d( l )
+ if( m.eq.l )
+ $ go to 80
+c
+c if remaining matrix is 2-by-2, use dlae2 or dlaev2
+c to compute its eigensystem.
+c
+ if( m.eq.l+1 ) then
+ if( icompz.gt.0 ) then
+ call dlaev2( d( l ), e( l ), d( l+1 ), rt1, rt2, c, s )
+ work( l ) = c
+ work( n-1+l ) = s
+c$$$ call dlasr( 'r', 'v', 'b', n, 2, work( l ),
+c$$$ $ work( n-1+l ), z( 1, l ), ldz )
+c
+c *** New starting with version 2.5 ***
+c
+ tst = z(l+1)
+ z(l+1) = c*tst - s*z(l)
+ z(l) = s*tst + c*z(l)
+c *************************************
+ else
+ call dlae2( d( l ), e( l ), d( l+1 ), rt1, rt2 )
+ end if
+ d( l ) = rt1
+ d( l+1 ) = rt2
+ e( l ) = zero
+ l = l + 2
+ if( l.le.lend )
+ $ go to 40
+ go to 140
+ end if
+c
+ if( jtot.eq.nmaxit )
+ $ go to 140
+ jtot = jtot + 1
+c
+c form shift.
+c
+ g = ( d( l+1 )-p ) / ( two*e( l ) )
+ r = dlapy2( g, one )
+ g = d( m ) - p + ( e( l ) / ( g+sign( r, g ) ) )
+c
+ s = one
+ c = one
+ p = zero
+c
+c inner loop
+c
+ mm1 = m - 1
+ do 70 i = mm1, l, -1
+ f = s*e( i )
+ b = c*e( i )
+ call dlartg( g, f, c, s, r )
+ if( i.ne.m-1 )
+ $ e( i+1 ) = r
+ g = d( i+1 ) - p
+ r = ( d( i )-g )*s + two*c*b
+ p = s*r
+ d( i+1 ) = g + p
+ g = c*r - b
+c
+c if eigenvectors are desired, then save rotations.
+c
+ if( icompz.gt.0 ) then
+ work( i ) = c
+ work( n-1+i ) = -s
+ end if
+c
+ 70 continue
+c
+c if eigenvectors are desired, then apply saved rotations.
+c
+ if( icompz.gt.0 ) then
+ mm = m - l + 1
+c$$$ call dlasr( 'r', 'v', 'b', n, mm, work( l ), work( n-1+l ),
+c$$$ $ z( 1, l ), ldz )
+c
+c *** New starting with version 2.5 ***
+c
+ call dlasr( 'r', 'v', 'b', 1, mm, work( l ),
+ & work( n-1+l ), z( l ), 1 )
+c *************************************
+ end if
+c
+ d( l ) = d( l ) - p
+ e( l ) = g
+ go to 40
+c
+c eigenvalue found.
+c
+ 80 continue
+ d( l ) = p
+c
+ l = l + 1
+ if( l.le.lend )
+ $ go to 40
+ go to 140
+c
+ else
+c
+c qr iteration
+c
+c look for small superdiagonal element.
+c
+ 90 continue
+ if( l.ne.lend ) then
+ lendp1 = lend + 1
+ do 100 m = l, lendp1, -1
+ tst = abs( e( m-1 ) )**2
+ if( tst.le.( eps2*abs( d( m ) ) )*abs( d( m-1 ) )+
+ $ safmin )go to 110
+ 100 continue
+ end if
+c
+ m = lend
+c
+ 110 continue
+ if( m.gt.lend )
+ $ e( m-1 ) = zero
+ p = d( l )
+ if( m.eq.l )
+ $ go to 130
+c
+c if remaining matrix is 2-by-2, use dlae2 or dlaev2
+c to compute its eigensystem.
+c
+ if( m.eq.l-1 ) then
+ if( icompz.gt.0 ) then
+ call dlaev2( d( l-1 ), e( l-1 ), d( l ), rt1, rt2, c, s )
+c$$$ work( m ) = c
+c$$$ work( n-1+m ) = s
+c$$$ call dlasr( 'r', 'v', 'f', n, 2, work( m ),
+c$$$ $ work( n-1+m ), z( 1, l-1 ), ldz )
+c
+c *** New starting with version 2.5 ***
+c
+ tst = z(l)
+ z(l) = c*tst - s*z(l-1)
+ z(l-1) = s*tst + c*z(l-1)
+c *************************************
+ else
+ call dlae2( d( l-1 ), e( l-1 ), d( l ), rt1, rt2 )
+ end if
+ d( l-1 ) = rt1
+ d( l ) = rt2
+ e( l-1 ) = zero
+ l = l - 2
+ if( l.ge.lend )
+ $ go to 90
+ go to 140
+ end if
+c
+ if( jtot.eq.nmaxit )
+ $ go to 140
+ jtot = jtot + 1
+c
+c form shift.
+c
+ g = ( d( l-1 )-p ) / ( two*e( l-1 ) )
+ r = dlapy2( g, one )
+ g = d( m ) - p + ( e( l-1 ) / ( g+sign( r, g ) ) )
+c
+ s = one
+ c = one
+ p = zero
+c
+c inner loop
+c
+ lm1 = l - 1
+ do 120 i = m, lm1
+ f = s*e( i )
+ b = c*e( i )
+ call dlartg( g, f, c, s, r )
+ if( i.ne.m )
+ $ e( i-1 ) = r
+ g = d( i ) - p
+ r = ( d( i+1 )-g )*s + two*c*b
+ p = s*r
+ d( i ) = g + p
+ g = c*r - b
+c
+c if eigenvectors are desired, then save rotations.
+c
+ if( icompz.gt.0 ) then
+ work( i ) = c
+ work( n-1+i ) = s
+ end if
+c
+ 120 continue
+c
+c if eigenvectors are desired, then apply saved rotations.
+c
+ if( icompz.gt.0 ) then
+ mm = l - m + 1
+c$$$ call dlasr( 'r', 'v', 'f', n, mm, work( m ), work( n-1+m ),
+c$$$ $ z( 1, m ), ldz )
+c
+c *** New starting with version 2.5 ***
+c
+ call dlasr( 'r', 'v', 'f', 1, mm, work( m ), work( n-1+m ),
+ & z( m ), 1 )
+c *************************************
+ end if
+c
+ d( l ) = d( l ) - p
+ e( lm1 ) = g
+ go to 90
+c
+c eigenvalue found.
+c
+ 130 continue
+ d( l ) = p
+c
+ l = l - 1
+ if( l.ge.lend )
+ $ go to 90
+ go to 140
+c
+ end if
+c
+c undo scaling if necessary
+c
+ 140 continue
+ if( iscale.eq.1 ) then
+ call dlascl( 'g', 0, 0, ssfmax, anorm, lendsv-lsv+1, 1,
+ $ d( lsv ), n, info )
+ call dlascl( 'g', 0, 0, ssfmax, anorm, lendsv-lsv, 1, e( lsv ),
+ $ n, info )
+ else if( iscale.eq.2 ) then
+ call dlascl( 'g', 0, 0, ssfmin, anorm, lendsv-lsv+1, 1,
+ $ d( lsv ), n, info )
+ call dlascl( 'g', 0, 0, ssfmin, anorm, lendsv-lsv, 1, e( lsv ),
+ $ n, info )
+ end if
+c
+c check for no convergence to an eigenvalue after a total
+c of n*maxit iterations.
+c
+ if( jtot.lt.nmaxit )
+ $ go to 10
+ do 150 i = 1, n - 1
+ if( e( i ).ne.zero )
+ $ info = info + 1
+ 150 continue
+ go to 190
+c
+c order eigenvalues and eigenvectors.
+c
+ 160 continue
+ if( icompz.eq.0 ) then
+c
+c use quick sort
+c
+ call dlasrt( 'i', n, d, info )
+c
+ else
+c
+c use selection sort to minimize swaps of eigenvectors
+c
+ do 180 ii = 2, n
+ i = ii - 1
+ k = i
+ p = d( i )
+ do 170 j = ii, n
+ if( d( j ).lt.p ) then
+ k = j
+ p = d( j )
+ end if
+ 170 continue
+ if( k.ne.i ) then
+ d( k ) = d( i )
+ d( i ) = p
+c$$$ call dswap( n, z( 1, i ), 1, z( 1, k ), 1 )
+c *** New starting with version 2.5 ***
+c
+ p = z(k)
+ z(k) = z(i)
+ z(i) = p
+c *************************************
+ end if
+ 180 continue
+ end if
+c
+ 190 continue
+ return
+c
+c %---------------%
+c | End of dstqrb |
+c %---------------%
+c
+ end
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.h
new file mode 100644
index 0000000000000000000000000000000000000000..1407980fbaaeea10d82588e9f8576c07fdf34f61
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/arpack/dstqrb.h
@@ -0,0 +1,8 @@
+extern int v3p_netlib_dstqrb_(
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *d__,
+ v3p_netlib_doublereal *e,
+ v3p_netlib_doublereal *z__,
+ v3p_netlib_doublereal *work,
+ v3p_netlib_integer *info
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/caxpy.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/caxpy.c
index 3928b7f63cbf0f1745cb8b966d3c1e95e850dc72..ea35e760e0dd5fd562bf2292ecf2db9215b05e5c 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/caxpy.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/caxpy.c
@@ -48,9 +48,7 @@ extern "C" {
return 0;
}
/*< if (abs(real(ca)) + abs(aimag(ca)) .eq. 0.0 ) return >*/
- r__1 = ca->r;
- r__2 = (real)(r_imag(ca));
- if ( dabs(r__1) + dabs(r__2) == (real)0.) {
+ if ((r__1 = ca->r, dabs(r__1)) + (r__2 = r_imag(ca), dabs(r__2)) == 0.f) {
return 0;
}
/*< if(incx.eq.1.and.incy.eq.1)go to 20 >*/
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dgemm.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dgemm.c
index e057e4bdcbbeccd401528bd30253a73731cdd529..8049a18f1751de00a0c26b1de19b4f592e01476f 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dgemm.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dgemm.c
@@ -30,7 +30,7 @@ extern "C" {
logical nota, notb;
doublereal temp;
integer ncola;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
integer nrowa, nrowb;
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
(void)transa_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dgemv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dgemv.c
index 94088c3a0f2c3db187e0a3d753b5b6bf63414ce2..9923c5a279bbb97a12a4a19c2ada6547ac4ac894 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dgemv.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dgemv.c
@@ -27,7 +27,7 @@ extern "C" {
integer i__, j, ix, iy, jx, jy, kx, ky, info;
doublereal temp;
integer lenx, leny;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
(void)trans_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dlamch.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dlamch.c
index 86338fc33ad8da0e809ed02abfb9d5324dc815ce..023fa54afb5527e294537e653a79da0e09260c7e 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dlamch.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dlamch.c
@@ -81,7 +81,7 @@ doublereal dlamch_(char *cmach, ftnlen cmach_len)
logical lrnd;
static doublereal rmin, rmax; /* runtime-initialized constant */
doublereal rmach=0;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
doublereal small;
static doublereal sfmin; /* runtime-initialized constant */
extern /* Subroutine */ int dlamc2_(integer *, integer *, logical *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrmm.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrmm.c
index 5f8d7e7342ca0b01b555ddb00dde6af7475d27c1..66a86bce26c6320efdc337b58d14f3f322296f3f 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrmm.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrmm.c
@@ -28,7 +28,7 @@ extern "C" {
integer i__, j, k, info;
doublereal temp;
logical lside;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
integer nrowa;
logical upper;
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrmv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrmv.c
index 3d5fd3a29750a30cd24faa5f6642f9f3232b2ade..341a0d4879e882191379cd610c1f750f4f11461b 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrmv.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrmv.c
@@ -26,7 +26,7 @@ extern "C" {
/* Local variables */
integer i__, j, ix, jx, kx=0, info;
doublereal temp;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
logical nounit;
(void)uplo_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrsv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrsv.c
index 364eb5e0f1245f02aa3a36905f0bd25629c789ed..7424076d70b94e18f56088099c1c316e69cef185 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrsv.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/dtrsv.c
@@ -26,7 +26,7 @@ extern "C" {
/* Local variables */
integer i__, j, ix, jx, kx=0, info;
doublereal temp;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
logical nounit;
(void)uplo_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/sgemv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/sgemv.c
index 92676932183c56e00d8857d681696fd225132ece..12cccb923804a368260607eb861a0f932eb427a0 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/sgemv.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/sgemv.c
@@ -27,7 +27,7 @@ extern "C" {
integer i__, j, ix, iy, jx, jy, kx, ky, info;
real temp;
integer lenx, leny;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
(void)trans_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/slamch.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/slamch.c
index 2eb9a30145bb94517bba6781c24404bdcf51a11a..3773dac6c4b26fd861e3e4bc45443acc8028aefa 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/slamch.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/slamch.c
@@ -81,7 +81,7 @@ doublereal slamch_(char *cmach, ftnlen cmach_len)
logical lrnd;
static real rmin, rmax; /* runtime-initialized constant */
real rmach=0;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
real small;
static real sfmin; /* runtime-initialized constant */
extern /* Subroutine */ int slamc2_(integer *, integer *, logical *, real
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgemm.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgemm.c
index a321f095d139254690bceec7dd39b7737a8ae0eb..f90abf077a0216e549f6b318b869987bf73cad36 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgemm.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgemm.c
@@ -35,7 +35,7 @@ extern "C" {
doublecomplex temp;
logical conja, conjb;
integer ncola;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
integer nrowa, nrowb;
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
(void)transa_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgemv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgemv.c
index fdb12b67a3e12022ff3bbd1b0115fcc18a7cbc37..adb706710d971115f7b09c9e2215bf9299a03909 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgemv.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgemv.c
@@ -32,7 +32,7 @@ extern "C" {
integer i__, j, ix, iy, jx, jy, kx, ky, info;
doublecomplex temp;
integer lenx, leny;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
logical noconj;
(void)trans_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.P
new file mode 100644
index 0000000000000000000000000000000000000000..d90d37c9744365a9cc76f95b677c96e91bc3ba26
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.P
@@ -0,0 +1,2 @@
+extern int zgeru_(integer *m, integer *n, doublecomplex *alpha, doublecomplex *x, integer *incx, doublecomplex *y, integer *incy, doublecomplex *a, integer *lda);
+/*:ref: xerbla_ 14 3 13 4 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.c
new file mode 100644
index 0000000000000000000000000000000000000000..ab9c0fb8502c9a73109e28c4cc6d3eca45401de1
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.c
@@ -0,0 +1,283 @@
+/* blas/zgeru.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< SUBROUTINE ZGERU(M,N,ALPHA,X,INCX,Y,INCY,A,LDA) >*/
+/* Subroutine */ int zgeru_(integer *m, integer *n, doublecomplex *alpha,
+ doublecomplex *x, integer *incx, doublecomplex *y, integer *incy,
+ doublecomplex *a, integer *lda)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, i__1, i__2, i__3, i__4, i__5;
+ doublecomplex z__1, z__2;
+
+ /* Local variables */
+ integer i__, j, ix, jy, kx, info;
+ doublecomplex temp;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+
+/* .. Scalar Arguments .. */
+/*< DOUBLE COMPLEX ALPHA >*/
+/*< INTEGER INCX,INCY,LDA,M,N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< DOUBLE COMPLEX A(LDA,*),X(*),Y(*) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGERU performs the rank 1 operation */
+
+/* A := alpha*x*y' + A, */
+
+/* where alpha is a scalar, x is an m element vector, y is an n element */
+/* vector and A is an m by n matrix. */
+
+/* Arguments */
+/* ========== */
+
+/* M - INTEGER. */
+/* On entry, M specifies the number of rows of the matrix A. */
+/* M must be at least zero. */
+/* Unchanged on exit. */
+
+/* N - INTEGER. */
+/* On entry, N specifies the number of columns of the matrix A. */
+/* N must be at least zero. */
+/* Unchanged on exit. */
+
+/* ALPHA - COMPLEX*16 . */
+/* On entry, ALPHA specifies the scalar alpha. */
+/* Unchanged on exit. */
+
+/* X - COMPLEX*16 array of dimension at least */
+/* ( 1 + ( m - 1 )*abs( INCX ) ). */
+/* Before entry, the incremented array X must contain the m */
+/* element vector x. */
+/* Unchanged on exit. */
+
+/* INCX - INTEGER. */
+/* On entry, INCX specifies the increment for the elements of */
+/* X. INCX must not be zero. */
+/* Unchanged on exit. */
+
+/* Y - COMPLEX*16 array of dimension at least */
+/* ( 1 + ( n - 1 )*abs( INCY ) ). */
+/* Before entry, the incremented array Y must contain the n */
+/* element vector y. */
+/* Unchanged on exit. */
+
+/* INCY - INTEGER. */
+/* On entry, INCY specifies the increment for the elements of */
+/* Y. INCY must not be zero. */
+/* Unchanged on exit. */
+
+/* A - COMPLEX*16 array of DIMENSION ( LDA, n ). */
+/* Before entry, the leading m by n part of the array A must */
+/* contain the matrix of coefficients. On exit, A is */
+/* overwritten by the updated matrix. */
+
+/* LDA - INTEGER. */
+/* On entry, LDA specifies the first dimension of A as declared */
+/* in the calling (sub) program. LDA must be at least */
+/* max( 1, m ). */
+/* Unchanged on exit. */
+
+
+/* Level 2 Blas routine. */
+
+/* -- Written on 22-October-1986. */
+/* Jack Dongarra, Argonne National Lab. */
+/* Jeremy Du Croz, Nag Central Office. */
+/* Sven Hammarling, Nag Central Office. */
+/* Richard Hanson, Sandia National Labs. */
+
+
+/* .. Parameters .. */
+/*< DOUBLE COMPLEX ZERO >*/
+/*< PARAMETER (ZERO= (0.0D+0,0.0D+0)) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< DOUBLE COMPLEX TEMP >*/
+/*< INTEGER I,INFO,IX,J,JY,KX >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC MAX >*/
+/* .. */
+
+/* Test the input parameters. */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ --x;
+ --y;
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+
+ /* Function Body */
+ info = 0;
+/*< IF (M.LT.0) THEN >*/
+ if (*m < 0) {
+/*< INFO = 1 >*/
+ info = 1;
+/*< ELSE IF (N.LT.0) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = 2 >*/
+ info = 2;
+/*< ELSE IF (INCX.EQ.0) THEN >*/
+ } else if (*incx == 0) {
+/*< INFO = 5 >*/
+ info = 5;
+/*< ELSE IF (INCY.EQ.0) THEN >*/
+ } else if (*incy == 0) {
+/*< INFO = 7 >*/
+ info = 7;
+/*< ELSE IF (LDA.LT.MAX(1,M)) THEN >*/
+ } else if (*lda < max(1,*m)) {
+/*< INFO = 9 >*/
+ info = 9;
+/*< END IF >*/
+ }
+/*< IF (INFO.NE.0) THEN >*/
+ if (info != 0) {
+/*< CALL XERBLA('ZGERU ',INFO) >*/
+ xerbla_("ZGERU ", &info, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible. */
+
+/*< IF ((M.EQ.0) .OR. (N.EQ.0) .OR. (ALPHA.EQ.ZERO)) RETURN >*/
+ if (*m == 0 || *n == 0 || (alpha->r == 0. && alpha->i == 0.)) {
+ return 0;
+ }
+
+/* Start the operations. In this version the elements of A are */
+/* accessed sequentially with one pass through A. */
+
+/*< IF (INCY.GT.0) THEN >*/
+ if (*incy > 0) {
+/*< JY = 1 >*/
+ jy = 1;
+/*< ELSE >*/
+ } else {
+/*< JY = 1 - (N-1)*INCY >*/
+ jy = 1 - (*n - 1) * *incy;
+/*< END IF >*/
+ }
+/*< IF (INCX.EQ.1) THEN >*/
+ if (*incx == 1) {
+/*< DO 20 J = 1,N >*/
+ i__1 = *n;
+ for (j = 1; j <= i__1; ++j) {
+/*< IF (Y(JY).NE.ZERO) THEN >*/
+ i__2 = jy;
+ if (y[i__2].r != 0. || y[i__2].i != 0.) {
+/*< TEMP = ALPHA*Y(JY) >*/
+ i__2 = jy;
+ z__1.r = alpha->r * y[i__2].r - alpha->i * y[i__2].i, z__1.i =
+ alpha->r * y[i__2].i + alpha->i * y[i__2].r;
+ temp.r = z__1.r, temp.i = z__1.i;
+/*< DO 10 I = 1,M >*/
+ i__2 = *m;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< A(I,J) = A(I,J) + X(I)*TEMP >*/
+ i__3 = i__ + j * a_dim1;
+ i__4 = i__ + j * a_dim1;
+ i__5 = i__;
+ z__2.r = x[i__5].r * temp.r - x[i__5].i * temp.i, z__2.i =
+ x[i__5].r * temp.i + x[i__5].i * temp.r;
+ z__1.r = a[i__4].r + z__2.r, z__1.i = a[i__4].i + z__2.i;
+ a[i__3].r = z__1.r, a[i__3].i = z__1.i;
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< END IF >*/
+ }
+/*< JY = JY + INCY >*/
+ jy += *incy;
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< ELSE >*/
+ } else {
+/*< IF (INCX.GT.0) THEN >*/
+ if (*incx > 0) {
+/*< KX = 1 >*/
+ kx = 1;
+/*< ELSE >*/
+ } else {
+/*< KX = 1 - (M-1)*INCX >*/
+ kx = 1 - (*m - 1) * *incx;
+/*< END IF >*/
+ }
+/*< DO 40 J = 1,N >*/
+ i__1 = *n;
+ for (j = 1; j <= i__1; ++j) {
+/*< IF (Y(JY).NE.ZERO) THEN >*/
+ i__2 = jy;
+ if (y[i__2].r != 0. || y[i__2].i != 0.) {
+/*< TEMP = ALPHA*Y(JY) >*/
+ i__2 = jy;
+ z__1.r = alpha->r * y[i__2].r - alpha->i * y[i__2].i, z__1.i =
+ alpha->r * y[i__2].i + alpha->i * y[i__2].r;
+ temp.r = z__1.r, temp.i = z__1.i;
+/*< IX = KX >*/
+ ix = kx;
+/*< DO 30 I = 1,M >*/
+ i__2 = *m;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< A(I,J) = A(I,J) + X(IX)*TEMP >*/
+ i__3 = i__ + j * a_dim1;
+ i__4 = i__ + j * a_dim1;
+ i__5 = ix;
+ z__2.r = x[i__5].r * temp.r - x[i__5].i * temp.i, z__2.i =
+ x[i__5].r * temp.i + x[i__5].i * temp.r;
+ z__1.r = a[i__4].r + z__2.r, z__1.i = a[i__4].i + z__2.i;
+ a[i__3].r = z__1.r, a[i__3].i = z__1.i;
+/*< IX = IX + INCX >*/
+ ix += *incx;
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< END IF >*/
+ }
+/*< JY = JY + INCY >*/
+ jy += *incy;
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+/*< END IF >*/
+ }
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGERU . */
+
+/*< END >*/
+} /* zgeru_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.f
new file mode 100644
index 0000000000000000000000000000000000000000..4293a1c2a53fc57b76edddf17f1c87b858fbdbbf
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.f
@@ -0,0 +1,159 @@
+ SUBROUTINE ZGERU(M,N,ALPHA,X,INCX,Y,INCY,A,LDA)
+* .. Scalar Arguments ..
+ DOUBLE COMPLEX ALPHA
+ INTEGER INCX,INCY,LDA,M,N
+* ..
+* .. Array Arguments ..
+ DOUBLE COMPLEX A(LDA,*),X(*),Y(*)
+* ..
+*
+* Purpose
+* =======
+*
+* ZGERU performs the rank 1 operation
+*
+* A := alpha*x*y' + A,
+*
+* where alpha is a scalar, x is an m element vector, y is an n element
+* vector and A is an m by n matrix.
+*
+* Arguments
+* ==========
+*
+* M - INTEGER.
+* On entry, M specifies the number of rows of the matrix A.
+* M must be at least zero.
+* Unchanged on exit.
+*
+* N - INTEGER.
+* On entry, N specifies the number of columns of the matrix A.
+* N must be at least zero.
+* Unchanged on exit.
+*
+* ALPHA - COMPLEX*16 .
+* On entry, ALPHA specifies the scalar alpha.
+* Unchanged on exit.
+*
+* X - COMPLEX*16 array of dimension at least
+* ( 1 + ( m - 1 )*abs( INCX ) ).
+* Before entry, the incremented array X must contain the m
+* element vector x.
+* Unchanged on exit.
+*
+* INCX - INTEGER.
+* On entry, INCX specifies the increment for the elements of
+* X. INCX must not be zero.
+* Unchanged on exit.
+*
+* Y - COMPLEX*16 array of dimension at least
+* ( 1 + ( n - 1 )*abs( INCY ) ).
+* Before entry, the incremented array Y must contain the n
+* element vector y.
+* Unchanged on exit.
+*
+* INCY - INTEGER.
+* On entry, INCY specifies the increment for the elements of
+* Y. INCY must not be zero.
+* Unchanged on exit.
+*
+* A - COMPLEX*16 array of DIMENSION ( LDA, n ).
+* Before entry, the leading m by n part of the array A must
+* contain the matrix of coefficients. On exit, A is
+* overwritten by the updated matrix.
+*
+* LDA - INTEGER.
+* On entry, LDA specifies the first dimension of A as declared
+* in the calling (sub) program. LDA must be at least
+* max( 1, m ).
+* Unchanged on exit.
+*
+*
+* Level 2 Blas routine.
+*
+* -- Written on 22-October-1986.
+* Jack Dongarra, Argonne National Lab.
+* Jeremy Du Croz, Nag Central Office.
+* Sven Hammarling, Nag Central Office.
+* Richard Hanson, Sandia National Labs.
+*
+*
+* .. Parameters ..
+ DOUBLE COMPLEX ZERO
+ PARAMETER (ZERO= (0.0D+0,0.0D+0))
+* ..
+* .. Local Scalars ..
+ DOUBLE COMPLEX TEMP
+ INTEGER I,INFO,IX,J,JY,KX
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC MAX
+* ..
+*
+* Test the input parameters.
+*
+ INFO = 0
+ IF (M.LT.0) THEN
+ INFO = 1
+ ELSE IF (N.LT.0) THEN
+ INFO = 2
+ ELSE IF (INCX.EQ.0) THEN
+ INFO = 5
+ ELSE IF (INCY.EQ.0) THEN
+ INFO = 7
+ ELSE IF (LDA.LT.MAX(1,M)) THEN
+ INFO = 9
+ END IF
+ IF (INFO.NE.0) THEN
+ CALL XERBLA('ZGERU ',INFO)
+ RETURN
+ END IF
+*
+* Quick return if possible.
+*
+ IF ((M.EQ.0) .OR. (N.EQ.0) .OR. (ALPHA.EQ.ZERO)) RETURN
+*
+* Start the operations. In this version the elements of A are
+* accessed sequentially with one pass through A.
+*
+ IF (INCY.GT.0) THEN
+ JY = 1
+ ELSE
+ JY = 1 - (N-1)*INCY
+ END IF
+ IF (INCX.EQ.1) THEN
+ DO 20 J = 1,N
+ IF (Y(JY).NE.ZERO) THEN
+ TEMP = ALPHA*Y(JY)
+ DO 10 I = 1,M
+ A(I,J) = A(I,J) + X(I)*TEMP
+ 10 CONTINUE
+ END IF
+ JY = JY + INCY
+ 20 CONTINUE
+ ELSE
+ IF (INCX.GT.0) THEN
+ KX = 1
+ ELSE
+ KX = 1 - (M-1)*INCX
+ END IF
+ DO 40 J = 1,N
+ IF (Y(JY).NE.ZERO) THEN
+ TEMP = ALPHA*Y(JY)
+ IX = KX
+ DO 30 I = 1,M
+ A(I,J) = A(I,J) + X(IX)*TEMP
+ IX = IX + INCX
+ 30 CONTINUE
+ END IF
+ JY = JY + INCY
+ 40 CONTINUE
+ END IF
+*
+ RETURN
+*
+* End of ZGERU .
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.h
new file mode 100644
index 0000000000000000000000000000000000000000..6a1afec51846c7a88eb7b393624c8a418e7362c6
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/zgeru.h
@@ -0,0 +1,11 @@
+extern int v3p_netlib_zgeru_(
+ v3p_netlib_integer *m,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *alpha,
+ v3p_netlib_doublecomplex *x,
+ v3p_netlib_integer *incx,
+ v3p_netlib_doublecomplex *y,
+ v3p_netlib_integer *incy,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrmm.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrmm.c
index cde1d5e7a9126a035dc6832cb90fdcc4fa8b1319..9037eb7bee186f717339d7a2fa1c212237127c13 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrmm.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrmm.c
@@ -33,7 +33,7 @@ extern "C" {
integer i__, j, k, info;
doublecomplex temp;
logical lside;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
integer nrowa;
logical upper;
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrmv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrmv.c
index 83c989238c6ef08d116cd2c7e0511498884cc9b1..fe2b2a8225b66ab5deb254a4fd3f6f60bae0e1f0 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrmv.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrmv.c
@@ -30,7 +30,7 @@ extern "C" {
/* Local variables */
integer i__, j, ix, jx, kx=0, info;
doublecomplex temp;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
logical noconj, nounit;
(void)uplo_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrsv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrsv.c
index 2d7b6d40c81d2f1358522df137d487f186409d44..af672230d871d4a1514fcbe0b15b8c2a69161dc3 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrsv.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/blas/ztrsv.c
@@ -31,7 +31,7 @@ extern "C" {
/* Local variables */
integer i__, j, ix, jx, kx=0, info;
doublecomplex temp;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
logical noconj, nounit;
(void)uplo_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.P
new file mode 100644
index 0000000000000000000000000000000000000000..93a8f07c8ac9fd1c1abbd80ab94944547c78133c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.P
@@ -0,0 +1,4 @@
+extern int zdrscl_(integer *n, doublereal *sa, doublecomplex *sx, integer *incx);
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dlabad_ 14 2 7 7 */
+/*:ref: zdscal_ 14 4 4 7 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.c
new file mode 100644
index 0000000000000000000000000000000000000000..aa2065060df7896475497716810769139396039b
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.c
@@ -0,0 +1,179 @@
+/* lapack/complex16/zdrscl.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< SUBROUTINE ZDRSCL( N, SA, SX, INCX ) >*/
+/* Subroutine */ int zdrscl_(integer *n, doublereal *sa, doublecomplex *sx,
+ integer *incx)
+{
+ doublereal mul, cden;
+ logical done;
+ doublereal cnum, cden1, cnum1;
+ extern /* Subroutine */ int dlabad_(doublereal *, doublereal *);
+ extern doublereal dlamch_(char *, ftnlen);
+ extern /* Subroutine */ int zdscal_(integer *, doublereal *,
+ doublecomplex *, integer *);
+ doublereal bignum, smlnum;
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER INCX, N >*/
+/*< DOUBLE PRECISION SA >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< COMPLEX*16 SX( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZDRSCL multiplies an n-element complex vector x by the real scalar */
+/* 1/a. This is done without overflow or underflow as long as */
+/* the final result x/a does not overflow or underflow. */
+
+/* Arguments */
+/* ========= */
+
+/* N (input) INTEGER */
+/* The number of components of the vector x. */
+
+/* SA (input) DOUBLE PRECISION */
+/* The scalar a which is used to divide each component of x. */
+/* SA must be >= 0, or the subroutine will divide by zero. */
+
+/* SX (input/output) COMPLEX*16 array, dimension */
+/* (1+(N-1)*abs(INCX)) */
+/* The n-element vector x. */
+
+/* INCX (input) INTEGER */
+/* The increment between successive values of the vector SX. */
+/* > 0: SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i), 1< i<= n */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ZERO, ONE >*/
+/*< PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL DONE >*/
+/*< DOUBLE PRECISION BIGNUM, CDEN, CDEN1, CNUM, CNUM1, MUL, SMLNUM >*/
+/* .. */
+/* .. External Functions .. */
+/*< DOUBLE PRECISION DLAMCH >*/
+/*< EXTERNAL DLAMCH >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL DLABAD, ZDSCAL >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Quick return if possible */
+
+/*< >*/
+ /* Parameter adjustments */
+ --sx;
+
+ /* Function Body */
+ if (*n <= 0) {
+ return 0;
+ }
+
+/* Get machine parameters */
+
+/*< SMLNUM = DLAMCH( 'S' ) >*/
+ smlnum = dlamch_("S", (ftnlen)1);
+/*< BIGNUM = ONE / SMLNUM >*/
+ bignum = 1. / smlnum;
+/*< CALL DLABAD( SMLNUM, BIGNUM ) >*/
+ dlabad_(&smlnum, &bignum);
+
+/* Initialize the denominator to SA and the numerator to 1. */
+
+/*< CDEN = SA >*/
+ cden = *sa;
+/*< CNUM = ONE >*/
+ cnum = 1.;
+
+/*< 10 CONTINUE >*/
+L10:
+/*< CDEN1 = CDEN*SMLNUM >*/
+ cden1 = cden * smlnum;
+/*< CNUM1 = CNUM / BIGNUM >*/
+ cnum1 = cnum / bignum;
+/*< IF( ABS( CDEN1 ).GT.ABS( CNUM ) .AND. CNUM.NE.ZERO ) THEN >*/
+ if (abs(cden1) > abs(cnum) && cnum != 0.) {
+
+/* Pre-multiply X by SMLNUM if CDEN is large compared to CNUM. */
+
+/*< MUL = SMLNUM >*/
+ mul = smlnum;
+/*< DONE = .FALSE. >*/
+ done = FALSE_;
+/*< CDEN = CDEN1 >*/
+ cden = cden1;
+/*< ELSE IF( ABS( CNUM1 ).GT.ABS( CDEN ) ) THEN >*/
+ } else if (abs(cnum1) > abs(cden)) {
+
+/* Pre-multiply X by BIGNUM if CDEN is small compared to CNUM. */
+
+/*< MUL = BIGNUM >*/
+ mul = bignum;
+/*< DONE = .FALSE. >*/
+ done = FALSE_;
+/*< CNUM = CNUM1 >*/
+ cnum = cnum1;
+/*< ELSE >*/
+ } else {
+
+/* Multiply X by CNUM / CDEN and return. */
+
+/*< MUL = CNUM / CDEN >*/
+ mul = cnum / cden;
+/*< DONE = .TRUE. >*/
+ done = TRUE_;
+/*< END IF >*/
+ }
+
+/* Scale the vector X by MUL */
+
+/*< CALL ZDSCAL( N, MUL, SX, INCX ) >*/
+ zdscal_(n, &mul, &sx[1], incx);
+
+/*< >*/
+ if (! done) {
+ goto L10;
+ }
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZDRSCL */
+
+/*< END >*/
+} /* zdrscl_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.f
new file mode 100644
index 0000000000000000000000000000000000000000..5e241643a38418a12fec16bdc040c4cd72c6a757
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.f
@@ -0,0 +1,115 @@
+ SUBROUTINE ZDRSCL( N, SA, SX, INCX )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER INCX, N
+ DOUBLE PRECISION SA
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 SX( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZDRSCL multiplies an n-element complex vector x by the real scalar
+* 1/a. This is done without overflow or underflow as long as
+* the final result x/a does not overflow or underflow.
+*
+* Arguments
+* =========
+*
+* N (input) INTEGER
+* The number of components of the vector x.
+*
+* SA (input) DOUBLE PRECISION
+* The scalar a which is used to divide each component of x.
+* SA must be >= 0, or the subroutine will divide by zero.
+*
+* SX (input/output) COMPLEX*16 array, dimension
+* (1+(N-1)*abs(INCX))
+* The n-element vector x.
+*
+* INCX (input) INTEGER
+* The increment between successive values of the vector SX.
+* > 0: SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i), 1< i<= n
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ZERO, ONE
+ PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 )
+* ..
+* .. Local Scalars ..
+ LOGICAL DONE
+ DOUBLE PRECISION BIGNUM, CDEN, CDEN1, CNUM, CNUM1, MUL, SMLNUM
+* ..
+* .. External Functions ..
+ DOUBLE PRECISION DLAMCH
+ EXTERNAL DLAMCH
+* ..
+* .. External Subroutines ..
+ EXTERNAL DLABAD, ZDSCAL
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS
+* ..
+* .. Executable Statements ..
+*
+* Quick return if possible
+*
+ IF( N.LE.0 )
+ $ RETURN
+*
+* Get machine parameters
+*
+ SMLNUM = DLAMCH( 'S' )
+ BIGNUM = ONE / SMLNUM
+ CALL DLABAD( SMLNUM, BIGNUM )
+*
+* Initialize the denominator to SA and the numerator to 1.
+*
+ CDEN = SA
+ CNUM = ONE
+*
+ 10 CONTINUE
+ CDEN1 = CDEN*SMLNUM
+ CNUM1 = CNUM / BIGNUM
+ IF( ABS( CDEN1 ).GT.ABS( CNUM ) .AND. CNUM.NE.ZERO ) THEN
+*
+* Pre-multiply X by SMLNUM if CDEN is large compared to CNUM.
+*
+ MUL = SMLNUM
+ DONE = .FALSE.
+ CDEN = CDEN1
+ ELSE IF( ABS( CNUM1 ).GT.ABS( CDEN ) ) THEN
+*
+* Pre-multiply X by BIGNUM if CDEN is small compared to CNUM.
+*
+ MUL = BIGNUM
+ DONE = .FALSE.
+ CNUM = CNUM1
+ ELSE
+*
+* Multiply X by CNUM / CDEN and return.
+*
+ MUL = CNUM / CDEN
+ DONE = .TRUE.
+ END IF
+*
+* Scale the vector X by MUL
+*
+ CALL ZDSCAL( N, MUL, SX, INCX )
+*
+ IF( .NOT.DONE )
+ $ GO TO 10
+*
+ RETURN
+*
+* End of ZDRSCL
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.h
new file mode 100644
index 0000000000000000000000000000000000000000..84d9e699bd375ec45b5098356b1b50ee433a1ea5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zdrscl.h
@@ -0,0 +1,6 @@
+extern int v3p_netlib_zdrscl_(
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *sa,
+ v3p_netlib_doublecomplex *sx,
+ v3p_netlib_integer *incx
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgebak.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgebak.c
index 5747cb34811641eb6920774209874582ca1305d9..abe168a1e34874fc5e8619ea1eedbf91f0579a57 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgebak.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgebak.c
@@ -27,7 +27,7 @@ extern "C" {
integer i__, k;
doublereal s;
integer ii;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
logical leftv;
extern /* Subroutine */ int zswap_(integer *, doublecomplex *, integer *,
doublecomplex *, integer *), xerbla_(char *, integer *, ftnlen),
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgebal.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgebal.c
index efa4f7753b7400f2eb11a42c9ad826b7b5198327..645a63e664f297cc3e2fb8391e49217178d5938c 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgebal.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgebal.c
@@ -36,7 +36,7 @@ static integer c__1 = 1;
integer i__, j, k, l, m;
doublereal r__, s, ca, ra;
integer ica, ira, iexc;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int zswap_(integer *, doublecomplex *, integer *,
doublecomplex *, integer *);
doublereal sfmin1, sfmin2, sfmax1, sfmax2;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.P
new file mode 100644
index 0000000000000000000000000000000000000000..1c0480aeed129c7831cd48c17ed5a0bd1cfd774c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.P
@@ -0,0 +1,8 @@
+extern int zgecon_(char *norm, integer *n, doublecomplex *a, integer *lda, doublereal *anorm, doublereal *rcond, doublecomplex *work, doublereal *rwork, integer *info, ftnlen norm_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: zlacn2_ 14 6 4 9 9 7 4 4 */
+/*:ref: zlatrs_ 14 15 13 13 13 13 4 9 4 9 7 7 4 124 124 124 124 */
+/*:ref: izamax_ 4 3 4 9 4 */
+/*:ref: zdrscl_ 14 4 4 7 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.c
new file mode 100644
index 0000000000000000000000000000000000000000..340f841e916675c7f0c531c2b241c14dc3a97191
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.c
@@ -0,0 +1,324 @@
+/* lapack/complex16/zgecon.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+
+/*< >*/
+/* Subroutine */ int zgecon_(char *norm, integer *n, doublecomplex *a,
+ integer *lda, doublereal *anorm, doublereal *rcond, doublecomplex *
+ work, doublereal *rwork, integer *info, ftnlen norm_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, i__1;
+ doublereal d__1, d__2;
+
+ /* Builtin functions */
+ double d_imag(doublecomplex *);
+
+ /* Local variables */
+ doublereal sl;
+ integer ix;
+ doublereal su;
+ integer kase, kase1;
+ doublereal scale;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ integer isave[3];
+ extern /* Subroutine */ int zlacn2_(integer *, doublecomplex *,
+ doublecomplex *, doublereal *, integer *, integer *);
+ extern doublereal dlamch_(char *, ftnlen);
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+ doublereal ainvnm;
+ extern integer izamax_(integer *, doublecomplex *, integer *);
+ logical onenrm;
+ extern /* Subroutine */ int zdrscl_(integer *, doublereal *,
+ doublecomplex *, integer *);
+ char normin[1];
+ doublereal smlnum;
+ extern /* Subroutine */ int zlatrs_(char *, char *, char *, char *,
+ integer *, doublecomplex *, integer *, doublecomplex *,
+ doublereal *, doublereal *, integer *, ftnlen, ftnlen, ftnlen,
+ ftnlen);
+ (void)norm_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* Modified to call ZLACN2 in place of ZLACON, 10 Feb 03, SJH. */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER NORM >*/
+/*< INTEGER INFO, LDA, N >*/
+/*< DOUBLE PRECISION ANORM, RCOND >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< DOUBLE PRECISION RWORK( * ) >*/
+/*< COMPLEX*16 A( LDA, * ), WORK( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGECON estimates the reciprocal of the condition number of a general */
+/* complex matrix A, in either the 1-norm or the infinity-norm, using */
+/* the LU factorization computed by ZGETRF. */
+
+/* An estimate is obtained for norm(inv(A)), and the reciprocal of the */
+/* condition number is computed as */
+/* RCOND = 1 / ( norm(A) * norm(inv(A)) ). */
+
+/* Arguments */
+/* ========= */
+
+/* NORM (input) CHARACTER*1 */
+/* Specifies whether the 1-norm condition number or the */
+/* infinity-norm condition number is required: */
+/* = '1' or 'O': 1-norm; */
+/* = 'I': Infinity-norm. */
+
+/* N (input) INTEGER */
+/* The order of the matrix A. N >= 0. */
+
+/* A (input) COMPLEX*16 array, dimension (LDA,N) */
+/* The factors L and U from the factorization A = P*L*U */
+/* as computed by ZGETRF. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,N). */
+
+/* ANORM (input) DOUBLE PRECISION */
+/* If NORM = '1' or 'O', the 1-norm of the original matrix A. */
+/* If NORM = 'I', the infinity-norm of the original matrix A. */
+
+/* RCOND (output) DOUBLE PRECISION */
+/* The reciprocal of the condition number of the matrix A, */
+/* computed as RCOND = 1/(norm(A) * norm(inv(A))). */
+
+/* WORK (workspace) COMPLEX*16 array, dimension (2*N) */
+
+/* RWORK (workspace) DOUBLE PRECISION array, dimension (2*N) */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ONE, ZERO >*/
+/*< PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL ONENRM >*/
+/*< CHARACTER NORMIN >*/
+/*< INTEGER IX, KASE, KASE1 >*/
+/*< DOUBLE PRECISION AINVNM, SCALE, SL, SMLNUM, SU >*/
+/*< COMPLEX*16 ZDUM >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< INTEGER ISAVE( 3 ) >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< INTEGER IZAMAX >*/
+/*< DOUBLE PRECISION DLAMCH >*/
+/*< EXTERNAL LSAME, IZAMAX, DLAMCH >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZDRSCL, ZLACN2, ZLATRS >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, DBLE, DIMAG, MAX >*/
+/* .. */
+/* .. Statement Functions .. */
+/*< DOUBLE PRECISION CABS1 >*/
+/* .. */
+/* .. Statement Function definitions .. */
+/*< CABS1( ZDUM ) = ABS( DBLE( ZDUM ) ) + ABS( DIMAG( ZDUM ) ) >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input parameters. */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ --work;
+ --rwork;
+
+ /* Function Body */
+ *info = 0;
+/*< ONENRM = NORM.EQ.'1' .OR. LSAME( NORM, 'O' ) >*/
+ onenrm = *(unsigned char *)norm == '1' || lsame_(norm, "O", (ftnlen)1, (
+ ftnlen)1);
+/*< IF( .NOT.ONENRM .AND. .NOT.LSAME( NORM, 'I' ) ) THEN >*/
+ if (! onenrm && ! lsame_(norm, "I", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( LDA.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*lda < max(1,*n)) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( ANORM.LT.ZERO ) THEN >*/
+ } else if (*anorm < 0.) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZGECON', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZGECON", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< RCOND = ZERO >*/
+ *rcond = 0.;
+/*< IF( N.EQ.0 ) THEN >*/
+ if (*n == 0) {
+/*< RCOND = ONE >*/
+ *rcond = 1.;
+/*< RETURN >*/
+ return 0;
+/*< ELSE IF( ANORM.EQ.ZERO ) THEN >*/
+ } else if (*anorm == 0.) {
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< SMLNUM = DLAMCH( 'Safe minimum' ) >*/
+ smlnum = dlamch_("Safe minimum", (ftnlen)12);
+
+/* Estimate the norm of inv(A). */
+
+/*< AINVNM = ZERO >*/
+ ainvnm = 0.;
+/*< NORMIN = 'N' >*/
+ *(unsigned char *)normin = 'N';
+/*< IF( ONENRM ) THEN >*/
+ if (onenrm) {
+/*< KASE1 = 1 >*/
+ kase1 = 1;
+/*< ELSE >*/
+ } else {
+/*< KASE1 = 2 >*/
+ kase1 = 2;
+/*< END IF >*/
+ }
+/*< KASE = 0 >*/
+ kase = 0;
+/*< 10 CONTINUE >*/
+L10:
+/*< CALL ZLACN2( N, WORK( N+1 ), WORK, AINVNM, KASE, ISAVE ) >*/
+ zlacn2_(n, &work[*n + 1], &work[1], &ainvnm, &kase, isave);
+/*< IF( KASE.NE.0 ) THEN >*/
+ if (kase != 0) {
+/*< IF( KASE.EQ.KASE1 ) THEN >*/
+ if (kase == kase1) {
+
+/* Multiply by inv(L). */
+
+/*< >*/
+ zlatrs_("Lower", "No transpose", "Unit", normin, n, &a[a_offset],
+ lda, &work[1], &sl, &rwork[1], info, (ftnlen)5, (ftnlen)
+ 12, (ftnlen)4, (ftnlen)1);
+
+/* Multiply by inv(U). */
+
+/*< >*/
+ zlatrs_("Upper", "No transpose", "Non-unit", normin, n, &a[
+ a_offset], lda, &work[1], &su, &rwork[*n + 1], info, (
+ ftnlen)5, (ftnlen)12, (ftnlen)8, (ftnlen)1);
+/*< ELSE >*/
+ } else {
+
+/* Multiply by inv(U'). */
+
+/*< >*/
+ zlatrs_("Upper", "Conjugate transpose", "Non-unit", normin, n, &a[
+ a_offset], lda, &work[1], &su, &rwork[*n + 1], info, (
+ ftnlen)5, (ftnlen)19, (ftnlen)8, (ftnlen)1);
+
+/* Multiply by inv(L'). */
+
+/*< >*/
+ zlatrs_("Lower", "Conjugate transpose", "Unit", normin, n, &a[
+ a_offset], lda, &work[1], &sl, &rwork[1], info, (ftnlen)5,
+ (ftnlen)19, (ftnlen)4, (ftnlen)1);
+/*< END IF >*/
+ }
+
+/* Divide X by 1/(SL*SU) if doing so will not cause overflow. */
+
+/*< SCALE = SL*SU >*/
+ scale = sl * su;
+/*< NORMIN = 'Y' >*/
+ *(unsigned char *)normin = 'Y';
+/*< IF( SCALE.NE.ONE ) THEN >*/
+ if (scale != 1.) {
+/*< IX = IZAMAX( N, WORK, 1 ) >*/
+ ix = izamax_(n, &work[1], &c__1);
+/*< >*/
+ i__1 = ix;
+ if (scale < ((d__1 = work[i__1].r, abs(d__1)) + (d__2 = d_imag(&
+ work[ix]), abs(d__2))) * smlnum || scale == 0.) {
+ goto L20;
+ }
+/*< CALL ZDRSCL( N, SCALE, WORK, 1 ) >*/
+ zdrscl_(n, &scale, &work[1], &c__1);
+/*< END IF >*/
+ }
+/*< GO TO 10 >*/
+ goto L10;
+/*< END IF >*/
+ }
+
+/* Compute the estimate of the reciprocal condition number. */
+
+/*< >*/
+ if (ainvnm != 0.) {
+ *rcond = 1. / ainvnm / *anorm;
+ }
+
+/*< 20 CONTINUE >*/
+L20:
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGECON */
+
+/*< END >*/
+} /* zgecon_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.f
new file mode 100644
index 0000000000000000000000000000000000000000..b969b58b1daa33b66340214c0a8d0bf49811a325
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.f
@@ -0,0 +1,194 @@
+ SUBROUTINE ZGECON( NORM, N, A, LDA, ANORM, RCOND, WORK, RWORK,
+ $ INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* Modified to call ZLACN2 in place of ZLACON, 10 Feb 03, SJH.
+*
+* .. Scalar Arguments ..
+ CHARACTER NORM
+ INTEGER INFO, LDA, N
+ DOUBLE PRECISION ANORM, RCOND
+* ..
+* .. Array Arguments ..
+ DOUBLE PRECISION RWORK( * )
+ COMPLEX*16 A( LDA, * ), WORK( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZGECON estimates the reciprocal of the condition number of a general
+* complex matrix A, in either the 1-norm or the infinity-norm, using
+* the LU factorization computed by ZGETRF.
+*
+* An estimate is obtained for norm(inv(A)), and the reciprocal of the
+* condition number is computed as
+* RCOND = 1 / ( norm(A) * norm(inv(A)) ).
+*
+* Arguments
+* =========
+*
+* NORM (input) CHARACTER*1
+* Specifies whether the 1-norm condition number or the
+* infinity-norm condition number is required:
+* = '1' or 'O': 1-norm;
+* = 'I': Infinity-norm.
+*
+* N (input) INTEGER
+* The order of the matrix A. N >= 0.
+*
+* A (input) COMPLEX*16 array, dimension (LDA,N)
+* The factors L and U from the factorization A = P*L*U
+* as computed by ZGETRF.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,N).
+*
+* ANORM (input) DOUBLE PRECISION
+* If NORM = '1' or 'O', the 1-norm of the original matrix A.
+* If NORM = 'I', the infinity-norm of the original matrix A.
+*
+* RCOND (output) DOUBLE PRECISION
+* The reciprocal of the condition number of the matrix A,
+* computed as RCOND = 1/(norm(A) * norm(inv(A))).
+*
+* WORK (workspace) COMPLEX*16 array, dimension (2*N)
+*
+* RWORK (workspace) DOUBLE PRECISION array, dimension (2*N)
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ONE, ZERO
+ PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 )
+* ..
+* .. Local Scalars ..
+ LOGICAL ONENRM
+ CHARACTER NORMIN
+ INTEGER IX, KASE, KASE1
+ DOUBLE PRECISION AINVNM, SCALE, SL, SMLNUM, SU
+ COMPLEX*16 ZDUM
+* ..
+* .. Local Arrays ..
+ INTEGER ISAVE( 3 )
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ INTEGER IZAMAX
+ DOUBLE PRECISION DLAMCH
+ EXTERNAL LSAME, IZAMAX, DLAMCH
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZDRSCL, ZLACN2, ZLATRS
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DBLE, DIMAG, MAX
+* ..
+* .. Statement Functions ..
+ DOUBLE PRECISION CABS1
+* ..
+* .. Statement Function definitions ..
+ CABS1( ZDUM ) = ABS( DBLE( ZDUM ) ) + ABS( DIMAG( ZDUM ) )
+* ..
+* .. Executable Statements ..
+*
+* Test the input parameters.
+*
+ INFO = 0
+ ONENRM = NORM.EQ.'1' .OR. LSAME( NORM, 'O' )
+ IF( .NOT.ONENRM .AND. .NOT.LSAME( NORM, 'I' ) ) THEN
+ INFO = -1
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -2
+ ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
+ INFO = -4
+ ELSE IF( ANORM.LT.ZERO ) THEN
+ INFO = -5
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZGECON', -INFO )
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ RCOND = ZERO
+ IF( N.EQ.0 ) THEN
+ RCOND = ONE
+ RETURN
+ ELSE IF( ANORM.EQ.ZERO ) THEN
+ RETURN
+ END IF
+*
+ SMLNUM = DLAMCH( 'Safe minimum' )
+*
+* Estimate the norm of inv(A).
+*
+ AINVNM = ZERO
+ NORMIN = 'N'
+ IF( ONENRM ) THEN
+ KASE1 = 1
+ ELSE
+ KASE1 = 2
+ END IF
+ KASE = 0
+ 10 CONTINUE
+ CALL ZLACN2( N, WORK( N+1 ), WORK, AINVNM, KASE, ISAVE )
+ IF( KASE.NE.0 ) THEN
+ IF( KASE.EQ.KASE1 ) THEN
+*
+* Multiply by inv(L).
+*
+ CALL ZLATRS( 'Lower', 'No transpose', 'Unit', NORMIN, N, A,
+ $ LDA, WORK, SL, RWORK, INFO )
+*
+* Multiply by inv(U).
+*
+ CALL ZLATRS( 'Upper', 'No transpose', 'Non-unit', NORMIN, N,
+ $ A, LDA, WORK, SU, RWORK( N+1 ), INFO )
+ ELSE
+*
+* Multiply by inv(U').
+*
+ CALL ZLATRS( 'Upper', 'Conjugate transpose', 'Non-unit',
+ $ NORMIN, N, A, LDA, WORK, SU, RWORK( N+1 ),
+ $ INFO )
+*
+* Multiply by inv(L').
+*
+ CALL ZLATRS( 'Lower', 'Conjugate transpose', 'Unit', NORMIN,
+ $ N, A, LDA, WORK, SL, RWORK, INFO )
+ END IF
+*
+* Divide X by 1/(SL*SU) if doing so will not cause overflow.
+*
+ SCALE = SL*SU
+ NORMIN = 'Y'
+ IF( SCALE.NE.ONE ) THEN
+ IX = IZAMAX( N, WORK, 1 )
+ IF( SCALE.LT.CABS1( WORK( IX ) )*SMLNUM .OR. SCALE.EQ.ZERO )
+ $ GO TO 20
+ CALL ZDRSCL( N, SCALE, WORK, 1 )
+ END IF
+ GO TO 10
+ END IF
+*
+* Compute the estimate of the reciprocal condition number.
+*
+ IF( AINVNM.NE.ZERO )
+ $ RCOND = ( ONE / AINVNM ) / ANORM
+*
+ 20 CONTINUE
+ RETURN
+*
+* End of ZGECON
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.h
new file mode 100644
index 0000000000000000000000000000000000000000..619c90fe435d5072e68993d7ba0fa513a14ebcc1
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgecon.h
@@ -0,0 +1,12 @@
+extern int v3p_netlib_zgecon_(
+ char *norm,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublereal *anorm,
+ v3p_netlib_doublereal *rcond,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_doublereal *rwork,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen norm_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.P
new file mode 100644
index 0000000000000000000000000000000000000000..b6f8ac651f7b85473f449980581a9a603766915f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.P
@@ -0,0 +1,16 @@
+extern int zgees_(char *jobvs, char *sort, L_fp select, integer *n, doublecomplex *a, integer *lda, integer *sdim, doublecomplex *w, doublecomplex *vs, integer *ldvs, doublecomplex *work, integer *lwork, doublereal *rwork, logical *bwork, integer *info, ftnlen jobvs_len, ftnlen sort_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: ilaenv_ 4 9 4 13 13 4 4 4 4 124 124 */
+/*:ref: zhseqr_ 14 15 13 13 4 4 4 9 4 9 9 4 9 4 4 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dlabad_ 14 2 7 7 */
+/*:ref: zlange_ 7 7 13 4 4 9 4 7 124 */
+/*:ref: zlascl_ 14 11 13 4 4 7 7 4 4 9 4 4 124 */
+/*:ref: zgebal_ 14 9 13 4 9 4 4 4 7 4 124 */
+/*:ref: zgehrd_ 14 9 4 4 4 9 4 9 9 4 4 */
+/*:ref: zlacpy_ 14 8 13 4 4 9 4 9 4 124 */
+/*:ref: zunghr_ 14 9 4 4 4 9 4 9 9 4 4 */
+/*:ref: ztrsen_ 14 17 13 13 12 4 9 4 9 4 9 4 7 7 9 4 4 124 124 */
+/*:ref: zgebak_ 14 12 13 13 4 4 4 7 4 9 4 4 124 124 */
+/*:ref: zcopy_ 14 5 4 9 4 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.c
new file mode 100644
index 0000000000000000000000000000000000000000..c0ea011a8f90d6a54ae7555b88a76af894c96734
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.c
@@ -0,0 +1,537 @@
+/* lapack/complex16/zgees.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+static integer c__0 = 0;
+static integer c_n1 = -1;
+
+/*< >*/
+/* Subroutine */ int zgees_(char *jobvs, char *sort,
+ logical (*select)(doublecomplex*), integer *n,
+ doublecomplex *a, integer *lda, integer *sdim, doublecomplex *w,
+ doublecomplex *vs, integer *ldvs, doublecomplex *work, integer *lwork,
+ doublereal *rwork, logical *bwork, integer *info, ftnlen jobvs_len,
+ ftnlen sort_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, vs_dim1, vs_offset, i__1, i__2;
+
+ /* Builtin functions */
+ double sqrt(doublereal);
+
+ /* Local variables */
+ integer i__;
+ doublereal s;
+ integer ihi, ilo;
+ doublereal dum[1], eps, sep;
+ integer ibal;
+ doublereal anrm;
+ integer ierr, itau, iwrk, icond, ieval;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ extern /* Subroutine */ int zcopy_(integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *), dlabad_(doublereal *, doublereal *);
+ logical scalea;
+ extern doublereal dlamch_(char *, ftnlen);
+ doublereal cscale;
+ extern /* Subroutine */ int zgebak_(char *, char *, integer *, integer *,
+ integer *, doublereal *, integer *, doublecomplex *, integer *,
+ integer *, ftnlen, ftnlen), zgebal_(char *, integer *,
+ doublecomplex *, integer *, integer *, integer *, doublereal *,
+ integer *, ftnlen), xerbla_(char *, integer *, ftnlen);
+ extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
+ integer *, integer *, ftnlen, ftnlen);
+ extern doublereal zlange_(char *, integer *, integer *, doublecomplex *,
+ integer *, doublereal *, ftnlen);
+ doublereal bignum;
+ extern /* Subroutine */ int zgehrd_(integer *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, doublecomplex *,
+ integer *, integer *), zlascl_(char *, integer *, integer *,
+ doublereal *, doublereal *, integer *, integer *, doublecomplex *,
+ integer *, integer *, ftnlen), zlacpy_(char *, integer *,
+ integer *, doublecomplex *, integer *, doublecomplex *, integer *,
+ ftnlen);
+ integer minwrk, maxwrk;
+ doublereal smlnum;
+ extern /* Subroutine */ int zhseqr_(char *, char *, integer *, integer *,
+ integer *, doublecomplex *, integer *, doublecomplex *,
+ doublecomplex *, integer *, doublecomplex *, integer *, integer *,
+ ftnlen, ftnlen);
+ integer hswork;
+ extern /* Subroutine */ int zunghr_(integer *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, doublecomplex *,
+ integer *, integer *);
+ logical wantst, lquery, wantvs;
+ extern /* Subroutine */ int ztrsen_(char *, char *, logical *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublereal *, doublereal *,
+ doublecomplex *, integer *, integer *, ftnlen, ftnlen);
+ (void)jobvs_len;
+ (void)sort_len;
+
+/* -- LAPACK driver routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER JOBVS, SORT >*/
+/*< INTEGER INFO, LDA, LDVS, LWORK, N, SDIM >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< LOGICAL BWORK( * ) >*/
+/*< DOUBLE PRECISION RWORK( * ) >*/
+/*< COMPLEX*16 A( LDA, * ), VS( LDVS, * ), W( * ), WORK( * ) >*/
+/* .. */
+/* .. Function Arguments .. */
+/*< LOGICAL SELECT >*/
+/*< EXTERNAL SELECT >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGEES computes for an N-by-N complex nonsymmetric matrix A, the */
+/* eigenvalues, the Schur form T, and, optionally, the matrix of Schur */
+/* vectors Z. This gives the Schur factorization A = Z*T*(Z**H). */
+
+/* Optionally, it also orders the eigenvalues on the diagonal of the */
+/* Schur form so that selected eigenvalues are at the top left. */
+/* The leading columns of Z then form an orthonormal basis for the */
+/* invariant subspace corresponding to the selected eigenvalues. */
+
+/* A complex matrix is in Schur form if it is upper triangular. */
+
+/* Arguments */
+/* ========= */
+
+/* JOBVS (input) CHARACTER*1 */
+/* = 'N': Schur vectors are not computed; */
+/* = 'V': Schur vectors are computed. */
+
+/* SORT (input) CHARACTER*1 */
+/* Specifies whether or not to order the eigenvalues on the */
+/* diagonal of the Schur form. */
+/* = 'N': Eigenvalues are not ordered: */
+/* = 'S': Eigenvalues are ordered (see SELECT). */
+
+/* SELECT (external procedure) LOGICAL FUNCTION of one COMPLEX*16 argument */
+/* SELECT must be declared EXTERNAL in the calling subroutine. */
+/* If SORT = 'S', SELECT is used to select eigenvalues to order */
+/* to the top left of the Schur form. */
+/* IF SORT = 'N', SELECT is not referenced. */
+/* The eigenvalue W(j) is selected if SELECT(W(j)) is true. */
+
+/* N (input) INTEGER */
+/* The order of the matrix A. N >= 0. */
+
+/* A (input/output) COMPLEX*16 array, dimension (LDA,N) */
+/* On entry, the N-by-N matrix A. */
+/* On exit, A has been overwritten by its Schur form T. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,N). */
+
+/* SDIM (output) INTEGER */
+/* If SORT = 'N', SDIM = 0. */
+/* If SORT = 'S', SDIM = number of eigenvalues for which */
+/* SELECT is true. */
+
+/* W (output) COMPLEX*16 array, dimension (N) */
+/* W contains the computed eigenvalues, in the same order that */
+/* they appear on the diagonal of the output Schur form T. */
+
+/* VS (output) COMPLEX*16 array, dimension (LDVS,N) */
+/* If JOBVS = 'V', VS contains the unitary matrix Z of Schur */
+/* vectors. */
+/* If JOBVS = 'N', VS is not referenced. */
+
+/* LDVS (input) INTEGER */
+/* The leading dimension of the array VS. LDVS >= 1; if */
+/* JOBVS = 'V', LDVS >= N. */
+
+/* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK)) */
+/* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
+
+/* LWORK (input) INTEGER */
+/* The dimension of the array WORK. LWORK >= max(1,2*N). */
+/* For good performance, LWORK must generally be larger. */
+
+/* If LWORK = -1, then a workspace query is assumed; the routine */
+/* only calculates the optimal size of the WORK array, returns */
+/* this value as the first entry of the WORK array, and no error */
+/* message related to LWORK is issued by XERBLA. */
+
+/* RWORK (workspace) DOUBLE PRECISION array, dimension (N) */
+
+/* BWORK (workspace) LOGICAL array, dimension (N) */
+/* Not referenced if SORT = 'N'. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value. */
+/* > 0: if INFO = i, and i is */
+/* <= N: the QR algorithm failed to compute all the */
+/* eigenvalues; elements 1:ILO-1 and i+1:N of W */
+/* contain those eigenvalues which have converged; */
+/* if JOBVS = 'V', VS contains the matrix which */
+/* reduces A to its partially converged Schur form. */
+/* = N+1: the eigenvalues could not be reordered because */
+/* some eigenvalues were too close to separate (the */
+/* problem is very ill-conditioned); */
+/* = N+2: after reordering, roundoff changed values of */
+/* some complex eigenvalues so that leading */
+/* eigenvalues in the Schur form no longer satisfy */
+/* SELECT = .TRUE.. This could also be caused by */
+/* underflow due to scaling. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ZERO, ONE >*/
+/*< PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL LQUERY, SCALEA, WANTST, WANTVS >*/
+/*< >*/
+/*< DOUBLE PRECISION ANRM, BIGNUM, CSCALE, EPS, S, SEP, SMLNUM >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< DOUBLE PRECISION DUM( 1 ) >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< INTEGER ILAENV >*/
+/*< DOUBLE PRECISION DLAMCH, ZLANGE >*/
+/*< EXTERNAL LSAME, ILAENV, DLAMCH, ZLANGE >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC MAX, SQRT >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input arguments */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ --w;
+ vs_dim1 = *ldvs;
+ vs_offset = 1 + vs_dim1;
+ vs -= vs_offset;
+ --work;
+ --rwork;
+ --bwork;
+
+ /* Function Body */
+ *info = 0;
+/*< LQUERY = ( LWORK.EQ.-1 ) >*/
+ lquery = *lwork == -1;
+/*< WANTVS = LSAME( JOBVS, 'V' ) >*/
+ wantvs = lsame_(jobvs, "V", (ftnlen)1, (ftnlen)1);
+/*< WANTST = LSAME( SORT, 'S' ) >*/
+ wantst = lsame_(sort, "S", (ftnlen)1, (ftnlen)1);
+/*< IF( ( .NOT.WANTVS ) .AND. ( .NOT.LSAME( JOBVS, 'N' ) ) ) THEN >*/
+ if (! wantvs && ! lsame_(jobvs, "N", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( ( .NOT.WANTST ) .AND. ( .NOT.LSAME( SORT, 'N' ) ) ) THEN >*/
+ } else if (! wantst && ! lsame_(sort, "N", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( LDA.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*lda < max(1,*n)) {
+/*< INFO = -6 >*/
+ *info = -6;
+/*< ELSE IF( LDVS.LT.1 .OR. ( WANTVS .AND. LDVS.LT.N ) ) THEN >*/
+ } else if (*ldvs < 1 || (wantvs && *ldvs < *n)) {
+/*< INFO = -10 >*/
+ *info = -10;
+/*< END IF >*/
+ }
+
+/* Compute workspace */
+/* (Note: Comments in the code beginning "Workspace:" describe the */
+/* minimal amount of workspace needed at that point in the code, */
+/* as well as the preferred amount for good performance. */
+/* CWorkspace refers to complex workspace, and RWorkspace to real */
+/* workspace. NB refers to the optimal block size for the */
+/* immediately following subroutine, as returned by ILAENV. */
+/* HSWORK refers to the workspace preferred by ZHSEQR, as */
+/* calculated below. HSWORK is computed assuming ILO=1 and IHI=N, */
+/* the worst case.) */
+
+/*< IF( INFO.EQ.0 ) THEN >*/
+ if (*info == 0) {
+/*< IF( N.EQ.0 ) THEN >*/
+ if (*n == 0) {
+/*< MINWRK = 1 >*/
+ minwrk = 1;
+/*< MAXWRK = 1 >*/
+ maxwrk = 1;
+/*< ELSE >*/
+ } else {
+/*< MAXWRK = N + N*ILAENV( 1, 'ZGEHRD', ' ', N, 1, N, 0 ) >*/
+ maxwrk = *n + *n * ilaenv_(&c__1, "ZGEHRD", " ", n, &c__1, n, &
+ c__0, (ftnlen)6, (ftnlen)1);
+/*< MINWRK = 2*N >*/
+ minwrk = *n << 1;
+
+/*< >*/
+ zhseqr_("S", jobvs, n, &c__1, n, &a[a_offset], lda, &w[1], &vs[
+ vs_offset], ldvs, &work[1], &c_n1, &ieval, (ftnlen)1, (
+ ftnlen)1);
+/*< HSWORK = WORK( 1 ) >*/
+ hswork = (integer) work[1].r;
+
+/*< IF( .NOT.WANTVS ) THEN >*/
+ if (! wantvs) {
+/*< MAXWRK = MAX( MAXWRK, HSWORK ) >*/
+ maxwrk = max(maxwrk,hswork);
+/*< ELSE >*/
+ } else {
+/*< >*/
+/* Computing MAX */
+ i__1 = maxwrk, i__2 = *n + (*n - 1) * ilaenv_(&c__1, "ZUNGHR",
+ " ", n, &c__1, n, &c_n1, (ftnlen)6, (ftnlen)1);
+ maxwrk = max(i__1,i__2);
+/*< MAXWRK = MAX( MAXWRK, HSWORK ) >*/
+ maxwrk = max(maxwrk,hswork);
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< WORK( 1 ) = MAXWRK >*/
+ work[1].r = (doublereal) maxwrk, work[1].i = 0.;
+
+/*< IF( LWORK.LT.MINWRK .AND. .NOT.LQUERY ) THEN >*/
+ if (*lwork < minwrk && ! lquery) {
+/*< INFO = -12 >*/
+ *info = -12;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZGEES ', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZGEES ", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< ELSE IF( LQUERY ) THEN >*/
+ } else if (lquery) {
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< IF( N.EQ.0 ) THEN >*/
+ if (*n == 0) {
+/*< SDIM = 0 >*/
+ *sdim = 0;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Get machine constants */
+
+/*< EPS = DLAMCH( 'P' ) >*/
+ eps = dlamch_("P", (ftnlen)1);
+/*< SMLNUM = DLAMCH( 'S' ) >*/
+ smlnum = dlamch_("S", (ftnlen)1);
+/*< BIGNUM = ONE / SMLNUM >*/
+ bignum = 1. / smlnum;
+/*< CALL DLABAD( SMLNUM, BIGNUM ) >*/
+ dlabad_(&smlnum, &bignum);
+/*< SMLNUM = SQRT( SMLNUM ) / EPS >*/
+ smlnum = sqrt(smlnum) / eps;
+/*< BIGNUM = ONE / SMLNUM >*/
+ bignum = 1. / smlnum;
+
+/* Scale A if max element outside range [SMLNUM,BIGNUM] */
+
+/*< ANRM = ZLANGE( 'M', N, N, A, LDA, DUM ) >*/
+ anrm = zlange_("M", n, n, &a[a_offset], lda, dum, (ftnlen)1);
+/*< SCALEA = .FALSE. >*/
+ scalea = FALSE_;
+/*< IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN >*/
+ if (anrm > 0. && anrm < smlnum) {
+/*< SCALEA = .TRUE. >*/
+ scalea = TRUE_;
+/*< CSCALE = SMLNUM >*/
+ cscale = smlnum;
+/*< ELSE IF( ANRM.GT.BIGNUM ) THEN >*/
+ } else if (anrm > bignum) {
+/*< SCALEA = .TRUE. >*/
+ scalea = TRUE_;
+/*< CSCALE = BIGNUM >*/
+ cscale = bignum;
+/*< END IF >*/
+ }
+/*< >*/
+ if (scalea) {
+ zlascl_("G", &c__0, &c__0, &anrm, &cscale, n, n, &a[a_offset], lda, &
+ ierr, (ftnlen)1);
+ }
+
+/* Permute the matrix to make it more nearly triangular */
+/* (CWorkspace: none) */
+/* (RWorkspace: need N) */
+
+/*< IBAL = 1 >*/
+ ibal = 1;
+/*< CALL ZGEBAL( 'P', N, A, LDA, ILO, IHI, RWORK( IBAL ), IERR ) >*/
+ zgebal_("P", n, &a[a_offset], lda, &ilo, &ihi, &rwork[ibal], &ierr, (
+ ftnlen)1);
+
+/* Reduce to upper Hessenberg form */
+/* (CWorkspace: need 2*N, prefer N+N*NB) */
+/* (RWorkspace: none) */
+
+/*< ITAU = 1 >*/
+ itau = 1;
+/*< IWRK = N + ITAU >*/
+ iwrk = *n + itau;
+/*< >*/
+ i__1 = *lwork - iwrk + 1;
+ zgehrd_(n, &ilo, &ihi, &a[a_offset], lda, &work[itau], &work[iwrk], &i__1,
+ &ierr);
+
+/*< IF( WANTVS ) THEN >*/
+ if (wantvs) {
+
+/* Copy Householder vectors to VS */
+
+/*< CALL ZLACPY( 'L', N, N, A, LDA, VS, LDVS ) >*/
+ zlacpy_("L", n, n, &a[a_offset], lda, &vs[vs_offset], ldvs, (ftnlen)1)
+ ;
+
+/* Generate unitary matrix in VS */
+/* (CWorkspace: need 2*N-1, prefer N+(N-1)*NB) */
+/* (RWorkspace: none) */
+
+/*< >*/
+ i__1 = *lwork - iwrk + 1;
+ zunghr_(n, &ilo, &ihi, &vs[vs_offset], ldvs, &work[itau], &work[iwrk],
+ &i__1, &ierr);
+/*< END IF >*/
+ }
+
+/*< SDIM = 0 >*/
+ *sdim = 0;
+
+/* Perform QR iteration, accumulating Schur vectors in VS if desired */
+/* (CWorkspace: need 1, prefer HSWORK (see comments) ) */
+/* (RWorkspace: none) */
+
+/*< IWRK = ITAU >*/
+ iwrk = itau;
+/*< >*/
+ i__1 = *lwork - iwrk + 1;
+ zhseqr_("S", jobvs, n, &ilo, &ihi, &a[a_offset], lda, &w[1], &vs[
+ vs_offset], ldvs, &work[iwrk], &i__1, &ieval, (ftnlen)1, (ftnlen)
+ 1);
+/*< >*/
+ if (ieval > 0) {
+ *info = ieval;
+ }
+
+/* Sort eigenvalues if desired */
+
+/*< IF( WANTST .AND. INFO.EQ.0 ) THEN >*/
+ if (wantst && *info == 0) {
+/*< >*/
+ if (scalea) {
+ zlascl_("G", &c__0, &c__0, &cscale, &anrm, n, &c__1, &w[1], n, &
+ ierr, (ftnlen)1);
+ }
+/*< DO 10 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< BWORK( I ) = SELECT( W( I ) ) >*/
+ bwork[i__] = (*select)(&w[i__]);
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+
+/* Reorder eigenvalues and transform Schur vectors */
+/* (CWorkspace: none) */
+/* (RWorkspace: none) */
+
+/*< >*/
+ i__1 = *lwork - iwrk + 1;
+ ztrsen_("N", jobvs, &bwork[1], n, &a[a_offset], lda, &vs[vs_offset],
+ ldvs, &w[1], sdim, &s, &sep, &work[iwrk], &i__1, &icond, (
+ ftnlen)1, (ftnlen)1);
+/*< END IF >*/
+ }
+
+/*< IF( WANTVS ) THEN >*/
+ if (wantvs) {
+
+/* Undo balancing */
+/* (CWorkspace: none) */
+/* (RWorkspace: need N) */
+
+/*< >*/
+ zgebak_("P", "R", n, &ilo, &ihi, &rwork[ibal], n, &vs[vs_offset],
+ ldvs, &ierr, (ftnlen)1, (ftnlen)1);
+/*< END IF >*/
+ }
+
+/*< IF( SCALEA ) THEN >*/
+ if (scalea) {
+
+/* Undo scaling for the Schur form of A */
+
+/*< CALL ZLASCL( 'U', 0, 0, CSCALE, ANRM, N, N, A, LDA, IERR ) >*/
+ zlascl_("U", &c__0, &c__0, &cscale, &anrm, n, n, &a[a_offset], lda, &
+ ierr, (ftnlen)1);
+/*< CALL ZCOPY( N, A, LDA+1, W, 1 ) >*/
+ i__1 = *lda + 1;
+ zcopy_(n, &a[a_offset], &i__1, &w[1], &c__1);
+/*< END IF >*/
+ }
+
+/*< WORK( 1 ) = MAXWRK >*/
+ work[1].r = (doublereal) maxwrk, work[1].i = 0.;
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGEES */
+
+/*< END >*/
+} /* zgees_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.f
new file mode 100644
index 0000000000000000000000000000000000000000..d9712c7d3af7f34e507779cf1ac3356e4bce8577
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.f
@@ -0,0 +1,325 @@
+ SUBROUTINE ZGEES( JOBVS, SORT, SELECT, N, A, LDA, SDIM, W, VS,
+ $ LDVS, WORK, LWORK, RWORK, BWORK, INFO )
+*
+* -- LAPACK driver routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER JOBVS, SORT
+ INTEGER INFO, LDA, LDVS, LWORK, N, SDIM
+* ..
+* .. Array Arguments ..
+ LOGICAL BWORK( * )
+ DOUBLE PRECISION RWORK( * )
+ COMPLEX*16 A( LDA, * ), VS( LDVS, * ), W( * ), WORK( * )
+* ..
+* .. Function Arguments ..
+ LOGICAL SELECT
+ EXTERNAL SELECT
+* ..
+*
+* Purpose
+* =======
+*
+* ZGEES computes for an N-by-N complex nonsymmetric matrix A, the
+* eigenvalues, the Schur form T, and, optionally, the matrix of Schur
+* vectors Z. This gives the Schur factorization A = Z*T*(Z**H).
+*
+* Optionally, it also orders the eigenvalues on the diagonal of the
+* Schur form so that selected eigenvalues are at the top left.
+* The leading columns of Z then form an orthonormal basis for the
+* invariant subspace corresponding to the selected eigenvalues.
+*
+* A complex matrix is in Schur form if it is upper triangular.
+*
+* Arguments
+* =========
+*
+* JOBVS (input) CHARACTER*1
+* = 'N': Schur vectors are not computed;
+* = 'V': Schur vectors are computed.
+*
+* SORT (input) CHARACTER*1
+* Specifies whether or not to order the eigenvalues on the
+* diagonal of the Schur form.
+* = 'N': Eigenvalues are not ordered:
+* = 'S': Eigenvalues are ordered (see SELECT).
+*
+* SELECT (external procedure) LOGICAL FUNCTION of one COMPLEX*16 argument
+* SELECT must be declared EXTERNAL in the calling subroutine.
+* If SORT = 'S', SELECT is used to select eigenvalues to order
+* to the top left of the Schur form.
+* IF SORT = 'N', SELECT is not referenced.
+* The eigenvalue W(j) is selected if SELECT(W(j)) is true.
+*
+* N (input) INTEGER
+* The order of the matrix A. N >= 0.
+*
+* A (input/output) COMPLEX*16 array, dimension (LDA,N)
+* On entry, the N-by-N matrix A.
+* On exit, A has been overwritten by its Schur form T.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,N).
+*
+* SDIM (output) INTEGER
+* If SORT = 'N', SDIM = 0.
+* If SORT = 'S', SDIM = number of eigenvalues for which
+* SELECT is true.
+*
+* W (output) COMPLEX*16 array, dimension (N)
+* W contains the computed eigenvalues, in the same order that
+* they appear on the diagonal of the output Schur form T.
+*
+* VS (output) COMPLEX*16 array, dimension (LDVS,N)
+* If JOBVS = 'V', VS contains the unitary matrix Z of Schur
+* vectors.
+* If JOBVS = 'N', VS is not referenced.
+*
+* LDVS (input) INTEGER
+* The leading dimension of the array VS. LDVS >= 1; if
+* JOBVS = 'V', LDVS >= N.
+*
+* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))
+* On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
+*
+* LWORK (input) INTEGER
+* The dimension of the array WORK. LWORK >= max(1,2*N).
+* For good performance, LWORK must generally be larger.
+*
+* If LWORK = -1, then a workspace query is assumed; the routine
+* only calculates the optimal size of the WORK array, returns
+* this value as the first entry of the WORK array, and no error
+* message related to LWORK is issued by XERBLA.
+*
+* RWORK (workspace) DOUBLE PRECISION array, dimension (N)
+*
+* BWORK (workspace) LOGICAL array, dimension (N)
+* Not referenced if SORT = 'N'.
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value.
+* > 0: if INFO = i, and i is
+* <= N: the QR algorithm failed to compute all the
+* eigenvalues; elements 1:ILO-1 and i+1:N of W
+* contain those eigenvalues which have converged;
+* if JOBVS = 'V', VS contains the matrix which
+* reduces A to its partially converged Schur form.
+* = N+1: the eigenvalues could not be reordered because
+* some eigenvalues were too close to separate (the
+* problem is very ill-conditioned);
+* = N+2: after reordering, roundoff changed values of
+* some complex eigenvalues so that leading
+* eigenvalues in the Schur form no longer satisfy
+* SELECT = .TRUE.. This could also be caused by
+* underflow due to scaling.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ZERO, ONE
+ PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 )
+* ..
+* .. Local Scalars ..
+ LOGICAL LQUERY, SCALEA, WANTST, WANTVS
+ INTEGER HSWORK, I, IBAL, ICOND, IERR, IEVAL, IHI, ILO,
+ $ ITAU, IWRK, MAXWRK, MINWRK
+ DOUBLE PRECISION ANRM, BIGNUM, CSCALE, EPS, S, SEP, SMLNUM
+* ..
+* .. Local Arrays ..
+ DOUBLE PRECISION DUM( 1 )
+* ..
+* .. External Subroutines ..
+ EXTERNAL DLABAD, XERBLA, ZCOPY, ZGEBAK, ZGEBAL, ZGEHRD,
+ $ ZHSEQR, ZLACPY, ZLASCL, ZTRSEN, ZUNGHR
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ INTEGER ILAENV
+ DOUBLE PRECISION DLAMCH, ZLANGE
+ EXTERNAL LSAME, ILAENV, DLAMCH, ZLANGE
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC MAX, SQRT
+* ..
+* .. Executable Statements ..
+*
+* Test the input arguments
+*
+ INFO = 0
+ LQUERY = ( LWORK.EQ.-1 )
+ WANTVS = LSAME( JOBVS, 'V' )
+ WANTST = LSAME( SORT, 'S' )
+ IF( ( .NOT.WANTVS ) .AND. ( .NOT.LSAME( JOBVS, 'N' ) ) ) THEN
+ INFO = -1
+ ELSE IF( ( .NOT.WANTST ) .AND. ( .NOT.LSAME( SORT, 'N' ) ) ) THEN
+ INFO = -2
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -4
+ ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
+ INFO = -6
+ ELSE IF( LDVS.LT.1 .OR. ( WANTVS .AND. LDVS.LT.N ) ) THEN
+ INFO = -10
+ END IF
+*
+* Compute workspace
+* (Note: Comments in the code beginning "Workspace:" describe the
+* minimal amount of workspace needed at that point in the code,
+* as well as the preferred amount for good performance.
+* CWorkspace refers to complex workspace, and RWorkspace to real
+* workspace. NB refers to the optimal block size for the
+* immediately following subroutine, as returned by ILAENV.
+* HSWORK refers to the workspace preferred by ZHSEQR, as
+* calculated below. HSWORK is computed assuming ILO=1 and IHI=N,
+* the worst case.)
+*
+ IF( INFO.EQ.0 ) THEN
+ IF( N.EQ.0 ) THEN
+ MINWRK = 1
+ MAXWRK = 1
+ ELSE
+ MAXWRK = N + N*ILAENV( 1, 'ZGEHRD', ' ', N, 1, N, 0 )
+ MINWRK = 2*N
+*
+ CALL ZHSEQR( 'S', JOBVS, N, 1, N, A, LDA, W, VS, LDVS,
+ $ WORK, -1, IEVAL )
+ HSWORK = WORK( 1 )
+*
+ IF( .NOT.WANTVS ) THEN
+ MAXWRK = MAX( MAXWRK, HSWORK )
+ ELSE
+ MAXWRK = MAX( MAXWRK, N + ( N - 1 )*ILAENV( 1, 'ZUNGHR',
+ $ ' ', N, 1, N, -1 ) )
+ MAXWRK = MAX( MAXWRK, HSWORK )
+ END IF
+ END IF
+ WORK( 1 ) = MAXWRK
+*
+ IF( LWORK.LT.MINWRK .AND. .NOT.LQUERY ) THEN
+ INFO = -12
+ END IF
+ END IF
+*
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZGEES ', -INFO )
+ RETURN
+ ELSE IF( LQUERY ) THEN
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( N.EQ.0 ) THEN
+ SDIM = 0
+ RETURN
+ END IF
+*
+* Get machine constants
+*
+ EPS = DLAMCH( 'P' )
+ SMLNUM = DLAMCH( 'S' )
+ BIGNUM = ONE / SMLNUM
+ CALL DLABAD( SMLNUM, BIGNUM )
+ SMLNUM = SQRT( SMLNUM ) / EPS
+ BIGNUM = ONE / SMLNUM
+*
+* Scale A if max element outside range [SMLNUM,BIGNUM]
+*
+ ANRM = ZLANGE( 'M', N, N, A, LDA, DUM )
+ SCALEA = .FALSE.
+ IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN
+ SCALEA = .TRUE.
+ CSCALE = SMLNUM
+ ELSE IF( ANRM.GT.BIGNUM ) THEN
+ SCALEA = .TRUE.
+ CSCALE = BIGNUM
+ END IF
+ IF( SCALEA )
+ $ CALL ZLASCL( 'G', 0, 0, ANRM, CSCALE, N, N, A, LDA, IERR )
+*
+* Permute the matrix to make it more nearly triangular
+* (CWorkspace: none)
+* (RWorkspace: need N)
+*
+ IBAL = 1
+ CALL ZGEBAL( 'P', N, A, LDA, ILO, IHI, RWORK( IBAL ), IERR )
+*
+* Reduce to upper Hessenberg form
+* (CWorkspace: need 2*N, prefer N+N*NB)
+* (RWorkspace: none)
+*
+ ITAU = 1
+ IWRK = N + ITAU
+ CALL ZGEHRD( N, ILO, IHI, A, LDA, WORK( ITAU ), WORK( IWRK ),
+ $ LWORK-IWRK+1, IERR )
+*
+ IF( WANTVS ) THEN
+*
+* Copy Householder vectors to VS
+*
+ CALL ZLACPY( 'L', N, N, A, LDA, VS, LDVS )
+*
+* Generate unitary matrix in VS
+* (CWorkspace: need 2*N-1, prefer N+(N-1)*NB)
+* (RWorkspace: none)
+*
+ CALL ZUNGHR( N, ILO, IHI, VS, LDVS, WORK( ITAU ), WORK( IWRK ),
+ $ LWORK-IWRK+1, IERR )
+ END IF
+*
+ SDIM = 0
+*
+* Perform QR iteration, accumulating Schur vectors in VS if desired
+* (CWorkspace: need 1, prefer HSWORK (see comments) )
+* (RWorkspace: none)
+*
+ IWRK = ITAU
+ CALL ZHSEQR( 'S', JOBVS, N, ILO, IHI, A, LDA, W, VS, LDVS,
+ $ WORK( IWRK ), LWORK-IWRK+1, IEVAL )
+ IF( IEVAL.GT.0 )
+ $ INFO = IEVAL
+*
+* Sort eigenvalues if desired
+*
+ IF( WANTST .AND. INFO.EQ.0 ) THEN
+ IF( SCALEA )
+ $ CALL ZLASCL( 'G', 0, 0, CSCALE, ANRM, N, 1, W, N, IERR )
+ DO 10 I = 1, N
+ BWORK( I ) = SELECT( W( I ) )
+ 10 CONTINUE
+*
+* Reorder eigenvalues and transform Schur vectors
+* (CWorkspace: none)
+* (RWorkspace: none)
+*
+ CALL ZTRSEN( 'N', JOBVS, BWORK, N, A, LDA, VS, LDVS, W, SDIM,
+ $ S, SEP, WORK( IWRK ), LWORK-IWRK+1, ICOND )
+ END IF
+*
+ IF( WANTVS ) THEN
+*
+* Undo balancing
+* (CWorkspace: none)
+* (RWorkspace: need N)
+*
+ CALL ZGEBAK( 'P', 'R', N, ILO, IHI, RWORK( IBAL ), N, VS, LDVS,
+ $ IERR )
+ END IF
+*
+ IF( SCALEA ) THEN
+*
+* Undo scaling for the Schur form of A
+*
+ CALL ZLASCL( 'U', 0, 0, CSCALE, ANRM, N, N, A, LDA, IERR )
+ CALL ZCOPY( N, A, LDA+1, W, 1 )
+ END IF
+*
+ WORK( 1 ) = MAXWRK
+ RETURN
+*
+* End of ZGEES
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.h
new file mode 100644
index 0000000000000000000000000000000000000000..a9975af2a80076371c353cd03fb3dd2adfe69125
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgees.h
@@ -0,0 +1,19 @@
+extern int v3p_netlib_zgees_(
+ char *jobvs,
+ char *sort,
+ v3p_netlib_logical (*select)(v3p_netlib_doublecomplex*),
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_integer *sdim,
+ v3p_netlib_doublecomplex *w,
+ v3p_netlib_doublecomplex *vs,
+ v3p_netlib_integer *ldvs,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_integer *lwork,
+ v3p_netlib_doublereal *rwork,
+ v3p_netlib_logical *bwork,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen jobvs_len,
+ v3p_netlib_ftnlen sort_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeev.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeev.c
index 05e9b562ab03e6f3ab58fb44f62438b293cca279..7ef142881ed9b89fc4108174259441c84f2f9018 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeev.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeev.c
@@ -51,7 +51,7 @@ static integer c__4 = 4;
integer maxb;
doublereal anrm;
integer ierr, itau, iwrk, nout;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int zscal_(integer *, doublecomplex *,
doublecomplex *, integer *), dlabad_(doublereal *, doublereal *);
extern doublereal dznrm2_(integer *, doublecomplex *, integer *);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.P
new file mode 100644
index 0000000000000000000000000000000000000000..b84b164d5189c47b2f76750cdbc833edfe88efbc
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.P
@@ -0,0 +1,4 @@
+extern int zgeqr2_(integer *m, integer *n, doublecomplex *a, integer *lda, doublecomplex *tau, doublecomplex *work, integer *info);
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zlarfg_ 14 5 4 9 9 4 9 */
+/*:ref: zlarf_ 14 10 13 4 4 9 4 9 9 4 9 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.c
new file mode 100644
index 0000000000000000000000000000000000000000..f8f27fe2c32c708430e07f42f1086b7908bb22a3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.c
@@ -0,0 +1,210 @@
+/* lapack/complex16/zgeqr2.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+
+/*< SUBROUTINE ZGEQR2( M, N, A, LDA, TAU, WORK, INFO ) >*/
+/* Subroutine */ int zgeqr2_(integer *m, integer *n, doublecomplex *a,
+ integer *lda, doublecomplex *tau, doublecomplex *work, integer *info)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, i__1, i__2, i__3;
+ doublecomplex z__1;
+
+ /* Builtin functions */
+ void d_cnjg(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ integer i__, k;
+ doublecomplex alpha;
+ extern /* Subroutine */ int zlarf_(char *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, doublecomplex *,
+ integer *, doublecomplex *, ftnlen), xerbla_(char *, integer *,
+ ftnlen), zlarfg_(integer *, doublecomplex *, doublecomplex *,
+ integer *, doublecomplex *);
+
+
+/* -- LAPACK routine (version 3.2.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* June 2010 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER INFO, LDA, M, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGEQR2 computes a QR factorization of a complex m by n matrix A: */
+/* A = Q * R. */
+
+/* Arguments */
+/* ========= */
+
+/* M (input) INTEGER */
+/* The number of rows of the matrix A. M >= 0. */
+
+/* N (input) INTEGER */
+/* The number of columns of the matrix A. N >= 0. */
+
+/* A (input/output) COMPLEX*16 array, dimension (LDA,N) */
+/* On entry, the m by n matrix A. */
+/* On exit, the elements on and above the diagonal of the array */
+/* contain the min(m,n) by n upper trapezoidal matrix R (R is */
+/* upper triangular if m >= n); the elements below the diagonal, */
+/* with the array TAU, represent the unitary matrix Q as a */
+/* product of elementary reflectors (see Further Details). */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,M). */
+
+/* TAU (output) COMPLEX*16 array, dimension (min(M,N)) */
+/* The scalar factors of the elementary reflectors (see Further */
+/* Details). */
+
+/* WORK (workspace) COMPLEX*16 array, dimension (N) */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+
+/* Further Details */
+/* =============== */
+
+/* The matrix Q is represented as a product of elementary reflectors */
+
+/* Q = H(1) H(2) . . . H(k), where k = min(m,n). */
+
+/* Each H(i) has the form */
+
+/* H(i) = I - tau * v * v' */
+
+/* where tau is a complex scalar, and v is a complex vector with */
+/* v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), */
+/* and tau in TAU(i). */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< COMPLEX*16 ONE >*/
+/*< PARAMETER ( ONE = ( 1.0D+0, 0.0D+0 ) ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< INTEGER I, K >*/
+/*< COMPLEX*16 ALPHA >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZLARF, ZLARFG >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC DCONJG, MAX, MIN >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input arguments */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ --tau;
+ --work;
+
+ /* Function Body */
+ *info = 0;
+/*< IF( M.LT.0 ) THEN >*/
+ if (*m < 0) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( LDA.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*lda < max(1,*m)) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZGEQR2', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZGEQR2", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< K = MIN( M, N ) >*/
+ k = min(*m,*n);
+
+/*< DO 10 I = 1, K >*/
+ i__1 = k;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+
+/* Generate elementary reflector H(i) to annihilate A(i+1:m,i) */
+
+/*< >*/
+ i__2 = *m - i__ + 1;
+/* Computing MIN */
+ i__3 = i__ + 1;
+ zlarfg_(&i__2, &a[i__ + i__ * a_dim1], &a[min(i__3,*m) + i__ * a_dim1]
+ , &c__1, &tau[i__]);
+/*< IF( I.LT.N ) THEN >*/
+ if (i__ < *n) {
+
+/* Apply H(i)' to A(i:m,i+1:n) from the left */
+
+/*< ALPHA = A( I, I ) >*/
+ i__2 = i__ + i__ * a_dim1;
+ alpha.r = a[i__2].r, alpha.i = a[i__2].i;
+/*< A( I, I ) = ONE >*/
+ i__2 = i__ + i__ * a_dim1;
+ a[i__2].r = 1., a[i__2].i = 0.;
+/*< >*/
+ i__2 = *m - i__ + 1;
+ i__3 = *n - i__;
+ d_cnjg(&z__1, &tau[i__]);
+ zlarf_("Left", &i__2, &i__3, &a[i__ + i__ * a_dim1], &c__1, &z__1,
+ &a[i__ + (i__ + 1) * a_dim1], lda, &work[1], (ftnlen)4);
+/*< A( I, I ) = ALPHA >*/
+ i__2 = i__ + i__ * a_dim1;
+ a[i__2].r = alpha.r, a[i__2].i = alpha.i;
+/*< END IF >*/
+ }
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGEQR2 */
+
+/*< END >*/
+} /* zgeqr2_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.f
new file mode 100644
index 0000000000000000000000000000000000000000..fb397f1f8bb42bb7245648278313dcbcb3321dcb
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.f
@@ -0,0 +1,122 @@
+ SUBROUTINE ZGEQR2( M, N, A, LDA, TAU, WORK, INFO )
+*
+* -- LAPACK routine (version 3.2.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* June 2010
+*
+* .. Scalar Arguments ..
+ INTEGER INFO, LDA, M, N
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZGEQR2 computes a QR factorization of a complex m by n matrix A:
+* A = Q * R.
+*
+* Arguments
+* =========
+*
+* M (input) INTEGER
+* The number of rows of the matrix A. M >= 0.
+*
+* N (input) INTEGER
+* The number of columns of the matrix A. N >= 0.
+*
+* A (input/output) COMPLEX*16 array, dimension (LDA,N)
+* On entry, the m by n matrix A.
+* On exit, the elements on and above the diagonal of the array
+* contain the min(m,n) by n upper trapezoidal matrix R (R is
+* upper triangular if m >= n); the elements below the diagonal,
+* with the array TAU, represent the unitary matrix Q as a
+* product of elementary reflectors (see Further Details).
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,M).
+*
+* TAU (output) COMPLEX*16 array, dimension (min(M,N))
+* The scalar factors of the elementary reflectors (see Further
+* Details).
+*
+* WORK (workspace) COMPLEX*16 array, dimension (N)
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+*
+* Further Details
+* ===============
+*
+* The matrix Q is represented as a product of elementary reflectors
+*
+* Q = H(1) H(2) . . . H(k), where k = min(m,n).
+*
+* Each H(i) has the form
+*
+* H(i) = I - tau * v * v'
+*
+* where tau is a complex scalar, and v is a complex vector with
+* v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
+* and tau in TAU(i).
+*
+* =====================================================================
+*
+* .. Parameters ..
+ COMPLEX*16 ONE
+ PARAMETER ( ONE = ( 1.0D+0, 0.0D+0 ) )
+* ..
+* .. Local Scalars ..
+ INTEGER I, K
+ COMPLEX*16 ALPHA
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZLARF, ZLARFG
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC DCONJG, MAX, MIN
+* ..
+* .. Executable Statements ..
+*
+* Test the input arguments
+*
+ INFO = 0
+ IF( M.LT.0 ) THEN
+ INFO = -1
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -2
+ ELSE IF( LDA.LT.MAX( 1, M ) ) THEN
+ INFO = -4
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZGEQR2', -INFO )
+ RETURN
+ END IF
+*
+ K = MIN( M, N )
+*
+ DO 10 I = 1, K
+*
+* Generate elementary reflector H(i) to annihilate A(i+1:m,i)
+*
+ CALL ZLARFG( M-I+1, A( I, I ), A( MIN( I+1, M ), I ), 1,
+ $ TAU( I ) )
+ IF( I.LT.N ) THEN
+*
+* Apply H(i)' to A(i:m,i+1:n) from the left
+*
+ ALPHA = A( I, I )
+ A( I, I ) = ONE
+ CALL ZLARF( 'Left', M-I+1, N-I, A( I, I ), 1,
+ $ DCONJG( TAU( I ) ), A( I, I+1 ), LDA, WORK )
+ A( I, I ) = ALPHA
+ END IF
+ 10 CONTINUE
+ RETURN
+*
+* End of ZGEQR2
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.h
new file mode 100644
index 0000000000000000000000000000000000000000..63102fbf164d54ff1a98a09a321be8f1bde9951f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqr2.h
@@ -0,0 +1,9 @@
+extern int v3p_netlib_zgeqr2_(
+ v3p_netlib_integer *m,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *tau,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_integer *info
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.P
new file mode 100644
index 0000000000000000000000000000000000000000..cd4ec0a67a1247e768fedd9206e456eb65b815dc
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.P
@@ -0,0 +1,6 @@
+extern int zgeqrf_(integer *m, integer *n, doublecomplex *a, integer *lda, doublecomplex *tau, doublecomplex *work, integer *lwork, integer *info);
+/*:ref: ilaenv_ 4 9 4 13 13 4 4 4 4 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zgeqr2_ 14 7 4 4 9 4 9 9 4 */
+/*:ref: zlarft_ 14 11 13 13 4 4 9 4 9 9 4 124 124 */
+/*:ref: zlarfb_ 14 19 13 13 13 13 4 4 4 9 4 9 4 9 4 9 4 124 124 124 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.c
new file mode 100644
index 0000000000000000000000000000000000000000..9ef8aa997e56ca4c3757d1adcddc0a10223297b7
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.c
@@ -0,0 +1,333 @@
+/* lapack/complex16/zgeqrf.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+static integer c_n1 = -1;
+static integer c__3 = 3;
+static integer c__2 = 2;
+
+/*< SUBROUTINE ZGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) >*/
+/* Subroutine */ int zgeqrf_(integer *m, integer *n, doublecomplex *a,
+ integer *lda, doublecomplex *tau, doublecomplex *work, integer *lwork,
+ integer *info)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, i__1, i__2, i__3, i__4;
+
+ /* Local variables */
+ integer i__, k, ib, nb, nx, iws, nbmin, iinfo;
+ extern /* Subroutine */ int zgeqr2_(integer *, integer *, doublecomplex *,
+ integer *, doublecomplex *, doublecomplex *, integer *), xerbla_(
+ char *, integer *, ftnlen);
+ extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
+ integer *, integer *, ftnlen, ftnlen);
+ extern /* Subroutine */ int zlarfb_(char *, char *, char *, char *,
+ integer *, integer *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, ftnlen, ftnlen, ftnlen, ftnlen);
+ integer ldwork;
+ extern /* Subroutine */ int zlarft_(char *, char *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, doublecomplex *,
+ integer *, ftnlen, ftnlen);
+ integer lwkopt;
+ logical lquery;
+
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER INFO, LDA, LWORK, M, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGEQRF computes a QR factorization of a complex M-by-N matrix A: */
+/* A = Q * R. */
+
+/* Arguments */
+/* ========= */
+
+/* M (input) INTEGER */
+/* The number of rows of the matrix A. M >= 0. */
+
+/* N (input) INTEGER */
+/* The number of columns of the matrix A. N >= 0. */
+
+/* A (input/output) COMPLEX*16 array, dimension (LDA,N) */
+/* On entry, the M-by-N matrix A. */
+/* On exit, the elements on and above the diagonal of the array */
+/* contain the min(M,N)-by-N upper trapezoidal matrix R (R is */
+/* upper triangular if m >= n); the elements below the diagonal, */
+/* with the array TAU, represent the unitary matrix Q as a */
+/* product of min(m,n) elementary reflectors (see Further */
+/* Details). */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,M). */
+
+/* TAU (output) COMPLEX*16 array, dimension (min(M,N)) */
+/* The scalar factors of the elementary reflectors (see Further */
+/* Details). */
+
+/* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK)) */
+/* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
+
+/* LWORK (input) INTEGER */
+/* The dimension of the array WORK. LWORK >= max(1,N). */
+/* For optimum performance LWORK >= N*NB, where NB is */
+/* the optimal blocksize. */
+
+/* If LWORK = -1, then a workspace query is assumed; the routine */
+/* only calculates the optimal size of the WORK array, returns */
+/* this value as the first entry of the WORK array, and no error */
+/* message related to LWORK is issued by XERBLA. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+
+/* Further Details */
+/* =============== */
+
+/* The matrix Q is represented as a product of elementary reflectors */
+
+/* Q = H(1) H(2) . . . H(k), where k = min(m,n). */
+
+/* Each H(i) has the form */
+
+/* H(i) = I - tau * v * v' */
+
+/* where tau is a complex scalar, and v is a complex vector with */
+/* v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), */
+/* and tau in TAU(i). */
+
+/* ===================================================================== */
+
+/* .. Local Scalars .. */
+/*< LOGICAL LQUERY >*/
+/*< >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZGEQR2, ZLARFB, ZLARFT >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC MAX, MIN >*/
+/* .. */
+/* .. External Functions .. */
+/*< INTEGER ILAENV >*/
+/*< EXTERNAL ILAENV >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input arguments */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ --tau;
+ --work;
+
+ /* Function Body */
+ *info = 0;
+/*< NB = ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) >*/
+ nb = ilaenv_(&c__1, "ZGEQRF", " ", m, n, &c_n1, &c_n1, (ftnlen)6, (ftnlen)
+ 1);
+/*< LWKOPT = N*NB >*/
+ lwkopt = *n * nb;
+/*< WORK( 1 ) = LWKOPT >*/
+ work[1].r = (doublereal) lwkopt, work[1].i = 0.;
+/*< LQUERY = ( LWORK.EQ.-1 ) >*/
+ lquery = *lwork == -1;
+/*< IF( M.LT.0 ) THEN >*/
+ if (*m < 0) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( LDA.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*lda < max(1,*m)) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( LWORK.LT.MAX( 1, N ) .AND. .NOT.LQUERY ) THEN >*/
+ } else if (*lwork < max(1,*n) && ! lquery) {
+/*< INFO = -7 >*/
+ *info = -7;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZGEQRF', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZGEQRF", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< ELSE IF( LQUERY ) THEN >*/
+ } else if (lquery) {
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< K = MIN( M, N ) >*/
+ k = min(*m,*n);
+/*< IF( K.EQ.0 ) THEN >*/
+ if (k == 0) {
+/*< WORK( 1 ) = 1 >*/
+ work[1].r = 1., work[1].i = 0.;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< NBMIN = 2 >*/
+ nbmin = 2;
+/*< NX = 0 >*/
+ nx = 0;
+/*< IWS = N >*/
+ iws = *n;
+/*< IF( NB.GT.1 .AND. NB.LT.K ) THEN >*/
+ if (nb > 1 && nb < k) {
+
+/* Determine when to cross over from blocked to unblocked code. */
+
+/*< NX = MAX( 0, ILAENV( 3, 'ZGEQRF', ' ', M, N, -1, -1 ) ) >*/
+/* Computing MAX */
+ i__1 = 0, i__2 = ilaenv_(&c__3, "ZGEQRF", " ", m, n, &c_n1, &c_n1, (
+ ftnlen)6, (ftnlen)1);
+ nx = max(i__1,i__2);
+/*< IF( NX.LT.K ) THEN >*/
+ if (nx < k) {
+
+/* Determine if workspace is large enough for blocked code. */
+
+/*< LDWORK = N >*/
+ ldwork = *n;
+/*< IWS = LDWORK*NB >*/
+ iws = ldwork * nb;
+/*< IF( LWORK.LT.IWS ) THEN >*/
+ if (*lwork < iws) {
+
+/* Not enough workspace to use optimal NB: reduce NB and */
+/* determine the minimum value of NB. */
+
+/*< NB = LWORK / LDWORK >*/
+ nb = *lwork / ldwork;
+/*< >*/
+/* Computing MAX */
+ i__1 = 2, i__2 = ilaenv_(&c__2, "ZGEQRF", " ", m, n, &c_n1, &
+ c_n1, (ftnlen)6, (ftnlen)1);
+ nbmin = max(i__1,i__2);
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/*< IF( NB.GE.NBMIN .AND. NB.LT.K .AND. NX.LT.K ) THEN >*/
+ if (nb >= nbmin && nb < k && nx < k) {
+
+/* Use blocked code initially */
+
+/*< DO 10 I = 1, K - NX, NB >*/
+ i__1 = k - nx;
+ i__2 = nb;
+ for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
+/*< IB = MIN( K-I+1, NB ) >*/
+/* Computing MIN */
+ i__3 = k - i__ + 1;
+ ib = min(i__3,nb);
+
+/* Compute the QR factorization of the current block */
+/* A(i:m,i:i+ib-1) */
+
+/*< >*/
+ i__3 = *m - i__ + 1;
+ zgeqr2_(&i__3, &ib, &a[i__ + i__ * a_dim1], lda, &tau[i__], &work[
+ 1], &iinfo);
+/*< IF( I+IB.LE.N ) THEN >*/
+ if (i__ + ib <= *n) {
+
+/* Form the triangular factor of the block reflector */
+/* H = H(i) H(i+1) . . . H(i+ib-1) */
+
+/*< >*/
+ i__3 = *m - i__ + 1;
+ zlarft_("Forward", "Columnwise", &i__3, &ib, &a[i__ + i__ *
+ a_dim1], lda, &tau[i__], &work[1], &ldwork, (ftnlen)7,
+ (ftnlen)10);
+
+/* Apply H' to A(i:m,i+ib:n) from the left */
+
+/*< >*/
+ i__3 = *m - i__ + 1;
+ i__4 = *n - i__ - ib + 1;
+ zlarfb_("Left", "Conjugate transpose", "Forward", "Columnwise"
+ , &i__3, &i__4, &ib, &a[i__ + i__ * a_dim1], lda, &
+ work[1], &ldwork, &a[i__ + (i__ + ib) * a_dim1], lda,
+ &work[ib + 1], &ldwork, (ftnlen)4, (ftnlen)19, (
+ ftnlen)7, (ftnlen)10);
+/*< END IF >*/
+ }
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< ELSE >*/
+ } else {
+/*< I = 1 >*/
+ i__ = 1;
+/*< END IF >*/
+ }
+
+/* Use unblocked code to factor the last or only block. */
+
+/*< >*/
+ if (i__ <= k) {
+ i__2 = *m - i__ + 1;
+ i__1 = *n - i__ + 1;
+ zgeqr2_(&i__2, &i__1, &a[i__ + i__ * a_dim1], lda, &tau[i__], &work[1]
+ , &iinfo);
+ }
+
+/*< WORK( 1 ) = IWS >*/
+ work[1].r = (doublereal) iws, work[1].i = 0.;
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGEQRF */
+
+/*< END >*/
+} /* zgeqrf_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.f
new file mode 100644
index 0000000000000000000000000000000000000000..e0a2eeb48f1c678b286e2b40f7fd10584048fc69
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.f
@@ -0,0 +1,197 @@
+ SUBROUTINE ZGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER INFO, LDA, LWORK, M, N
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZGEQRF computes a QR factorization of a complex M-by-N matrix A:
+* A = Q * R.
+*
+* Arguments
+* =========
+*
+* M (input) INTEGER
+* The number of rows of the matrix A. M >= 0.
+*
+* N (input) INTEGER
+* The number of columns of the matrix A. N >= 0.
+*
+* A (input/output) COMPLEX*16 array, dimension (LDA,N)
+* On entry, the M-by-N matrix A.
+* On exit, the elements on and above the diagonal of the array
+* contain the min(M,N)-by-N upper trapezoidal matrix R (R is
+* upper triangular if m >= n); the elements below the diagonal,
+* with the array TAU, represent the unitary matrix Q as a
+* product of min(m,n) elementary reflectors (see Further
+* Details).
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,M).
+*
+* TAU (output) COMPLEX*16 array, dimension (min(M,N))
+* The scalar factors of the elementary reflectors (see Further
+* Details).
+*
+* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))
+* On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
+*
+* LWORK (input) INTEGER
+* The dimension of the array WORK. LWORK >= max(1,N).
+* For optimum performance LWORK >= N*NB, where NB is
+* the optimal blocksize.
+*
+* If LWORK = -1, then a workspace query is assumed; the routine
+* only calculates the optimal size of the WORK array, returns
+* this value as the first entry of the WORK array, and no error
+* message related to LWORK is issued by XERBLA.
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+*
+* Further Details
+* ===============
+*
+* The matrix Q is represented as a product of elementary reflectors
+*
+* Q = H(1) H(2) . . . H(k), where k = min(m,n).
+*
+* Each H(i) has the form
+*
+* H(i) = I - tau * v * v'
+*
+* where tau is a complex scalar, and v is a complex vector with
+* v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i),
+* and tau in TAU(i).
+*
+* =====================================================================
+*
+* .. Local Scalars ..
+ LOGICAL LQUERY
+ INTEGER I, IB, IINFO, IWS, K, LDWORK, LWKOPT, NB,
+ $ NBMIN, NX
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZGEQR2, ZLARFB, ZLARFT
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC MAX, MIN
+* ..
+* .. External Functions ..
+ INTEGER ILAENV
+ EXTERNAL ILAENV
+* ..
+* .. Executable Statements ..
+*
+* Test the input arguments
+*
+ INFO = 0
+ NB = ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 )
+ LWKOPT = N*NB
+ WORK( 1 ) = LWKOPT
+ LQUERY = ( LWORK.EQ.-1 )
+ IF( M.LT.0 ) THEN
+ INFO = -1
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -2
+ ELSE IF( LDA.LT.MAX( 1, M ) ) THEN
+ INFO = -4
+ ELSE IF( LWORK.LT.MAX( 1, N ) .AND. .NOT.LQUERY ) THEN
+ INFO = -7
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZGEQRF', -INFO )
+ RETURN
+ ELSE IF( LQUERY ) THEN
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ K = MIN( M, N )
+ IF( K.EQ.0 ) THEN
+ WORK( 1 ) = 1
+ RETURN
+ END IF
+*
+ NBMIN = 2
+ NX = 0
+ IWS = N
+ IF( NB.GT.1 .AND. NB.LT.K ) THEN
+*
+* Determine when to cross over from blocked to unblocked code.
+*
+ NX = MAX( 0, ILAENV( 3, 'ZGEQRF', ' ', M, N, -1, -1 ) )
+ IF( NX.LT.K ) THEN
+*
+* Determine if workspace is large enough for blocked code.
+*
+ LDWORK = N
+ IWS = LDWORK*NB
+ IF( LWORK.LT.IWS ) THEN
+*
+* Not enough workspace to use optimal NB: reduce NB and
+* determine the minimum value of NB.
+*
+ NB = LWORK / LDWORK
+ NBMIN = MAX( 2, ILAENV( 2, 'ZGEQRF', ' ', M, N, -1,
+ $ -1 ) )
+ END IF
+ END IF
+ END IF
+*
+ IF( NB.GE.NBMIN .AND. NB.LT.K .AND. NX.LT.K ) THEN
+*
+* Use blocked code initially
+*
+ DO 10 I = 1, K - NX, NB
+ IB = MIN( K-I+1, NB )
+*
+* Compute the QR factorization of the current block
+* A(i:m,i:i+ib-1)
+*
+ CALL ZGEQR2( M-I+1, IB, A( I, I ), LDA, TAU( I ), WORK,
+ $ IINFO )
+ IF( I+IB.LE.N ) THEN
+*
+* Form the triangular factor of the block reflector
+* H = H(i) H(i+1) . . . H(i+ib-1)
+*
+ CALL ZLARFT( 'Forward', 'Columnwise', M-I+1, IB,
+ $ A( I, I ), LDA, TAU( I ), WORK, LDWORK )
+*
+* Apply H' to A(i:m,i+ib:n) from the left
+*
+ CALL ZLARFB( 'Left', 'Conjugate transpose', 'Forward',
+ $ 'Columnwise', M-I+1, N-I-IB+1, IB,
+ $ A( I, I ), LDA, WORK, LDWORK, A( I, I+IB ),
+ $ LDA, WORK( IB+1 ), LDWORK )
+ END IF
+ 10 CONTINUE
+ ELSE
+ I = 1
+ END IF
+*
+* Use unblocked code to factor the last or only block.
+*
+ IF( I.LE.K )
+ $ CALL ZGEQR2( M-I+1, N-I+1, A( I, I ), LDA, TAU( I ), WORK,
+ $ IINFO )
+*
+ WORK( 1 ) = IWS
+ RETURN
+*
+* End of ZGEQRF
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.h
new file mode 100644
index 0000000000000000000000000000000000000000..e041f90ce21faeff13b55200cc2797191fad8c37
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgeqrf.h
@@ -0,0 +1,10 @@
+extern int v3p_netlib_zgeqrf_(
+ v3p_netlib_integer *m,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *tau,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_integer *lwork,
+ v3p_netlib_integer *info
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.P
new file mode 100644
index 0000000000000000000000000000000000000000..92e372a95ae39ced9c05aa6f0c50705e09528715
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.P
@@ -0,0 +1,6 @@
+extern int zgesc2_(integer *n, doublecomplex *a, integer *lda, doublecomplex *rhs, integer *ipiv, integer *jpiv, doublereal *scale);
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dlabad_ 14 2 7 7 */
+/*:ref: zlaswp_ 14 7 4 9 4 4 4 4 4 */
+/*:ref: izamax_ 4 3 4 9 4 */
+/*:ref: zscal_ 14 4 4 9 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.c
new file mode 100644
index 0000000000000000000000000000000000000000..68ba946c30c316ebf45046ccf892c1206a8ea2f1
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.c
@@ -0,0 +1,255 @@
+/* lapack/complex16/zgesc2.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+static doublecomplex c_b13 = {1.,0.};
+static integer c_n1 = -1;
+
+/*< SUBROUTINE ZGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE ) >*/
+/* Subroutine */ int zgesc2_(integer *n, doublecomplex *a, integer *lda,
+ doublecomplex *rhs, integer *ipiv, integer *jpiv, doublereal *scale)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, i__1, i__2, i__3, i__4, i__5, i__6;
+ doublereal d__1;
+ doublecomplex z__1, z__2, z__3;
+
+ /* Builtin functions */
+ double z_abs(doublecomplex *);
+ void z_div(doublecomplex *, doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ integer i__, j;
+ doublereal eps;
+ doublecomplex temp;
+ extern /* Subroutine */ int zscal_(integer *, doublecomplex *,
+ doublecomplex *, integer *), dlabad_(doublereal *, doublereal *);
+ extern doublereal dlamch_(char *, ftnlen);
+ doublereal bignum;
+ extern integer izamax_(integer *, doublecomplex *, integer *);
+ doublereal smlnum;
+ extern /* Subroutine */ int zlaswp_(integer *, doublecomplex *, integer *,
+ integer *, integer *, integer *, integer *);
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER LDA, N >*/
+/*< DOUBLE PRECISION SCALE >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< INTEGER IPIV( * ), JPIV( * ) >*/
+/*< COMPLEX*16 A( LDA, * ), RHS( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGESC2 solves a system of linear equations */
+
+/* A * X = scale* RHS */
+
+/* with a general N-by-N matrix A using the LU factorization with */
+/* complete pivoting computed by ZGETC2. */
+
+
+/* Arguments */
+/* ========= */
+
+/* N (input) INTEGER */
+/* The number of columns of the matrix A. */
+
+/* A (input) COMPLEX*16 array, dimension (LDA, N) */
+/* On entry, the LU part of the factorization of the n-by-n */
+/* matrix A computed by ZGETC2: A = P * L * U * Q */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1, N). */
+
+/* RHS (input/output) COMPLEX*16 array, dimension N. */
+/* On entry, the right hand side vector b. */
+/* On exit, the solution vector X. */
+
+/* IPIV (input) INTEGER array, dimension (N). */
+/* The pivot indices; for 1 <= i <= N, row i of the */
+/* matrix has been interchanged with row IPIV(i). */
+
+/* JPIV (input) INTEGER array, dimension (N). */
+/* The pivot indices; for 1 <= j <= N, column j of the */
+/* matrix has been interchanged with column JPIV(j). */
+
+/* SCALE (output) DOUBLE PRECISION */
+/* On exit, SCALE contains the scale factor. SCALE is chosen */
+/* 0 <= SCALE <= 1 to prevent owerflow in the solution. */
+
+/* Further Details */
+/* =============== */
+
+/* Based on contributions by */
+/* Bo Kagstrom and Peter Poromaa, Department of Computing Science, */
+/* Umea University, S-901 87 Umea, Sweden. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ZERO, ONE, TWO >*/
+/*< PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0, TWO = 2.0D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< INTEGER I, J >*/
+/*< DOUBLE PRECISION BIGNUM, EPS, SMLNUM >*/
+/*< COMPLEX*16 TEMP >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL ZLASWP, ZSCAL >*/
+/* .. */
+/* .. External Functions .. */
+/*< INTEGER IZAMAX >*/
+/*< DOUBLE PRECISION DLAMCH >*/
+/*< EXTERNAL IZAMAX, DLAMCH >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, DBLE, DCMPLX >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Set constant to control overflow */
+
+/*< EPS = DLAMCH( 'P' ) >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ --rhs;
+ --ipiv;
+ --jpiv;
+
+ /* Function Body */
+ eps = dlamch_("P", (ftnlen)1);
+/*< SMLNUM = DLAMCH( 'S' ) / EPS >*/
+ smlnum = dlamch_("S", (ftnlen)1) / eps;
+/*< BIGNUM = ONE / SMLNUM >*/
+ bignum = 1. / smlnum;
+/*< CALL DLABAD( SMLNUM, BIGNUM ) >*/
+ dlabad_(&smlnum, &bignum);
+
+/* Apply permutations IPIV to RHS */
+
+/*< CALL ZLASWP( 1, RHS, LDA, 1, N-1, IPIV, 1 ) >*/
+ i__1 = *n - 1;
+ zlaswp_(&c__1, &rhs[1], lda, &c__1, &i__1, &ipiv[1], &c__1);
+
+/* Solve for L part */
+
+/*< DO 20 I = 1, N - 1 >*/
+ i__1 = *n - 1;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< DO 10 J = I + 1, N >*/
+ i__2 = *n;
+ for (j = i__ + 1; j <= i__2; ++j) {
+/*< RHS( J ) = RHS( J ) - A( J, I )*RHS( I ) >*/
+ i__3 = j;
+ i__4 = j;
+ i__5 = j + i__ * a_dim1;
+ i__6 = i__;
+ z__2.r = a[i__5].r * rhs[i__6].r - a[i__5].i * rhs[i__6].i,
+ z__2.i = a[i__5].r * rhs[i__6].i + a[i__5].i * rhs[i__6]
+ .r;
+ z__1.r = rhs[i__4].r - z__2.r, z__1.i = rhs[i__4].i - z__2.i;
+ rhs[i__3].r = z__1.r, rhs[i__3].i = z__1.i;
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+
+/* Solve for U part */
+
+/*< SCALE = ONE >*/
+ *scale = 1.;
+
+/* Check for scaling */
+
+/*< I = IZAMAX( N, RHS, 1 ) >*/
+ i__ = izamax_(n, &rhs[1], &c__1);
+/*< IF( TWO*SMLNUM*ABS( RHS( I ) ).GT.ABS( A( N, N ) ) ) THEN >*/
+ if (smlnum * 2. * z_abs(&rhs[i__]) > z_abs(&a[*n + *n * a_dim1])) {
+/*< TEMP = DCMPLX( ONE / TWO, ZERO ) / ABS( RHS( I ) ) >*/
+ d__1 = z_abs(&rhs[i__]);
+ z__1.r = .5 / d__1, z__1.i = 0. / d__1;
+ temp.r = z__1.r, temp.i = z__1.i;
+/*< CALL ZSCAL( N, TEMP, RHS( 1 ), 1 ) >*/
+ zscal_(n, &temp, &rhs[1], &c__1);
+/*< SCALE = SCALE*DBLE( TEMP ) >*/
+ *scale *= temp.r;
+/*< END IF >*/
+ }
+/*< DO 40 I = N, 1, -1 >*/
+ for (i__ = *n; i__ >= 1; --i__) {
+/*< TEMP = DCMPLX( ONE, ZERO ) / A( I, I ) >*/
+ z_div(&z__1, &c_b13, &a[i__ + i__ * a_dim1]);
+ temp.r = z__1.r, temp.i = z__1.i;
+/*< RHS( I ) = RHS( I )*TEMP >*/
+ i__1 = i__;
+ i__2 = i__;
+ z__1.r = rhs[i__2].r * temp.r - rhs[i__2].i * temp.i, z__1.i = rhs[
+ i__2].r * temp.i + rhs[i__2].i * temp.r;
+ rhs[i__1].r = z__1.r, rhs[i__1].i = z__1.i;
+/*< DO 30 J = I + 1, N >*/
+ i__1 = *n;
+ for (j = i__ + 1; j <= i__1; ++j) {
+/*< RHS( I ) = RHS( I ) - RHS( J )*( A( I, J )*TEMP ) >*/
+ i__2 = i__;
+ i__3 = i__;
+ i__4 = j;
+ i__5 = i__ + j * a_dim1;
+ z__3.r = a[i__5].r * temp.r - a[i__5].i * temp.i, z__3.i = a[i__5]
+ .r * temp.i + a[i__5].i * temp.r;
+ z__2.r = rhs[i__4].r * z__3.r - rhs[i__4].i * z__3.i, z__2.i =
+ rhs[i__4].r * z__3.i + rhs[i__4].i * z__3.r;
+ z__1.r = rhs[i__3].r - z__2.r, z__1.i = rhs[i__3].i - z__2.i;
+ rhs[i__2].r = z__1.r, rhs[i__2].i = z__1.i;
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+
+/* Apply permutations JPIV to the solution (RHS) */
+
+/*< CALL ZLASWP( 1, RHS, LDA, 1, N-1, JPIV, -1 ) >*/
+ i__1 = *n - 1;
+ zlaswp_(&c__1, &rhs[1], lda, &c__1, &i__1, &jpiv[1], &c_n1);
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGESC2 */
+
+/*< END >*/
+} /* zgesc2_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.f
new file mode 100644
index 0000000000000000000000000000000000000000..3ceddfd2f3591bfc576aa3434f1943122ebb4333
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.f
@@ -0,0 +1,134 @@
+ SUBROUTINE ZGESC2( N, A, LDA, RHS, IPIV, JPIV, SCALE )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER LDA, N
+ DOUBLE PRECISION SCALE
+* ..
+* .. Array Arguments ..
+ INTEGER IPIV( * ), JPIV( * )
+ COMPLEX*16 A( LDA, * ), RHS( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZGESC2 solves a system of linear equations
+*
+* A * X = scale* RHS
+*
+* with a general N-by-N matrix A using the LU factorization with
+* complete pivoting computed by ZGETC2.
+*
+*
+* Arguments
+* =========
+*
+* N (input) INTEGER
+* The number of columns of the matrix A.
+*
+* A (input) COMPLEX*16 array, dimension (LDA, N)
+* On entry, the LU part of the factorization of the n-by-n
+* matrix A computed by ZGETC2: A = P * L * U * Q
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1, N).
+*
+* RHS (input/output) COMPLEX*16 array, dimension N.
+* On entry, the right hand side vector b.
+* On exit, the solution vector X.
+*
+* IPIV (input) INTEGER array, dimension (N).
+* The pivot indices; for 1 <= i <= N, row i of the
+* matrix has been interchanged with row IPIV(i).
+*
+* JPIV (input) INTEGER array, dimension (N).
+* The pivot indices; for 1 <= j <= N, column j of the
+* matrix has been interchanged with column JPIV(j).
+*
+* SCALE (output) DOUBLE PRECISION
+* On exit, SCALE contains the scale factor. SCALE is chosen
+* 0 <= SCALE <= 1 to prevent owerflow in the solution.
+*
+* Further Details
+* ===============
+*
+* Based on contributions by
+* Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+* Umea University, S-901 87 Umea, Sweden.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ZERO, ONE, TWO
+ PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0, TWO = 2.0D+0 )
+* ..
+* .. Local Scalars ..
+ INTEGER I, J
+ DOUBLE PRECISION BIGNUM, EPS, SMLNUM
+ COMPLEX*16 TEMP
+* ..
+* .. External Subroutines ..
+ EXTERNAL ZLASWP, ZSCAL
+* ..
+* .. External Functions ..
+ INTEGER IZAMAX
+ DOUBLE PRECISION DLAMCH
+ EXTERNAL IZAMAX, DLAMCH
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DBLE, DCMPLX
+* ..
+* .. Executable Statements ..
+*
+* Set constant to control overflow
+*
+ EPS = DLAMCH( 'P' )
+ SMLNUM = DLAMCH( 'S' ) / EPS
+ BIGNUM = ONE / SMLNUM
+ CALL DLABAD( SMLNUM, BIGNUM )
+*
+* Apply permutations IPIV to RHS
+*
+ CALL ZLASWP( 1, RHS, LDA, 1, N-1, IPIV, 1 )
+*
+* Solve for L part
+*
+ DO 20 I = 1, N - 1
+ DO 10 J = I + 1, N
+ RHS( J ) = RHS( J ) - A( J, I )*RHS( I )
+ 10 CONTINUE
+ 20 CONTINUE
+*
+* Solve for U part
+*
+ SCALE = ONE
+*
+* Check for scaling
+*
+ I = IZAMAX( N, RHS, 1 )
+ IF( TWO*SMLNUM*ABS( RHS( I ) ).GT.ABS( A( N, N ) ) ) THEN
+ TEMP = DCMPLX( ONE / TWO, ZERO ) / ABS( RHS( I ) )
+ CALL ZSCAL( N, TEMP, RHS( 1 ), 1 )
+ SCALE = SCALE*DBLE( TEMP )
+ END IF
+ DO 40 I = N, 1, -1
+ TEMP = DCMPLX( ONE, ZERO ) / A( I, I )
+ RHS( I ) = RHS( I )*TEMP
+ DO 30 J = I + 1, N
+ RHS( I ) = RHS( I ) - RHS( J )*( A( I, J )*TEMP )
+ 30 CONTINUE
+ 40 CONTINUE
+*
+* Apply permutations JPIV to the solution (RHS)
+*
+ CALL ZLASWP( 1, RHS, LDA, 1, N-1, JPIV, -1 )
+ RETURN
+*
+* End of ZGESC2
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.h
new file mode 100644
index 0000000000000000000000000000000000000000..dc06a96215825fcad29e31ceb7b4271573057b02
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgesc2.h
@@ -0,0 +1,9 @@
+extern int v3p_netlib_zgesc2_(
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *rhs,
+ v3p_netlib_integer *ipiv,
+ v3p_netlib_integer *jpiv,
+ v3p_netlib_doublereal *scale
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.P
new file mode 100644
index 0000000000000000000000000000000000000000..5dd7359d629c2b7abef01cd914b947c2e7904d6f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.P
@@ -0,0 +1,5 @@
+extern int zgetc2_(integer *n, doublecomplex *a, integer *lda, integer *ipiv, integer *jpiv, integer *info);
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dlabad_ 14 2 7 7 */
+/*:ref: zswap_ 14 5 4 9 4 9 4 */
+/*:ref: zgeru_ 14 9 4 4 9 9 4 9 4 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.c
new file mode 100644
index 0000000000000000000000000000000000000000..fe668295852a0acf930b10bc13cab4f6cf34b4da
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.c
@@ -0,0 +1,264 @@
+/* lapack/complex16/zgetc2.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+static doublecomplex c_b10 = {-1.,-0.};
+
+/*< SUBROUTINE ZGETC2( N, A, LDA, IPIV, JPIV, INFO ) >*/
+/* Subroutine */ int zgetc2_(integer *n, doublecomplex *a, integer *lda,
+ integer *ipiv, integer *jpiv, integer *info)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, i__1, i__2, i__3;
+ doublereal d__1;
+ doublecomplex z__1;
+
+ /* Builtin functions */
+ double z_abs(doublecomplex *);
+ void z_div(doublecomplex *, doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ integer i__, j, ip, jp;
+ doublereal eps;
+ integer ipv, jpv;
+ doublereal smin, xmax;
+ extern /* Subroutine */ int zgeru_(integer *, integer *, doublecomplex *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *), zswap_(integer *, doublecomplex *,
+ integer *, doublecomplex *, integer *), dlabad_(doublereal *,
+ doublereal *);
+ extern doublereal dlamch_(char *, ftnlen);
+ doublereal bignum, smlnum;
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER INFO, LDA, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< INTEGER IPIV( * ), JPIV( * ) >*/
+/*< COMPLEX*16 A( LDA, * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGETC2 computes an LU factorization, using complete pivoting, of the */
+/* n-by-n matrix A. The factorization has the form A = P * L * U * Q, */
+/* where P and Q are permutation matrices, L is lower triangular with */
+/* unit diagonal elements and U is upper triangular. */
+
+/* This is a level 1 BLAS version of the algorithm. */
+
+/* Arguments */
+/* ========= */
+
+/* N (input) INTEGER */
+/* The order of the matrix A. N >= 0. */
+
+/* A (input/output) COMPLEX*16 array, dimension (LDA, N) */
+/* On entry, the n-by-n matrix to be factored. */
+/* On exit, the factors L and U from the factorization */
+/* A = P*L*U*Q; the unit diagonal elements of L are not stored. */
+/* If U(k, k) appears to be less than SMIN, U(k, k) is given the */
+/* value of SMIN, giving a nonsingular perturbed system. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1, N). */
+
+/* IPIV (output) INTEGER array, dimension (N). */
+/* The pivot indices; for 1 <= i <= N, row i of the */
+/* matrix has been interchanged with row IPIV(i). */
+
+/* JPIV (output) INTEGER array, dimension (N). */
+/* The pivot indices; for 1 <= j <= N, column j of the */
+/* matrix has been interchanged with column JPIV(j). */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* > 0: if INFO = k, U(k, k) is likely to produce overflow if */
+/* one tries to solve for x in Ax = b. So U is perturbed */
+/* to avoid the overflow. */
+
+/* Further Details */
+/* =============== */
+
+/* Based on contributions by */
+/* Bo Kagstrom and Peter Poromaa, Department of Computing Science, */
+/* Umea University, S-901 87 Umea, Sweden. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ZERO, ONE >*/
+/*< PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< INTEGER I, IP, IPV, J, JP, JPV >*/
+/*< DOUBLE PRECISION BIGNUM, EPS, SMIN, SMLNUM, XMAX >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL ZGERU, ZSWAP >*/
+/* .. */
+/* .. External Functions .. */
+/*< DOUBLE PRECISION DLAMCH >*/
+/*< EXTERNAL DLAMCH >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, DCMPLX, MAX >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Set constants to control overflow */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ --ipiv;
+ --jpiv;
+
+ /* Function Body */
+ *info = 0;
+/*< EPS = DLAMCH( 'P' ) >*/
+ eps = dlamch_("P", (ftnlen)1);
+/*< SMLNUM = DLAMCH( 'S' ) / EPS >*/
+ smlnum = dlamch_("S", (ftnlen)1) / eps;
+/*< BIGNUM = ONE / SMLNUM >*/
+ bignum = 1. / smlnum;
+/*< CALL DLABAD( SMLNUM, BIGNUM ) >*/
+ dlabad_(&smlnum, &bignum);
+
+/* Factorize A using complete pivoting. */
+/* Set pivots less than SMIN to SMIN */
+
+/*< DO 40 I = 1, N - 1 >*/
+ i__1 = *n - 1;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+
+/* Find max element in matrix A */
+
+/*< XMAX = ZERO >*/
+ xmax = 0.;
+/*< DO 20 IP = I, N >*/
+ i__2 = *n;
+ for (ip = i__; ip <= i__2; ++ip) {
+/*< DO 10 JP = I, N >*/
+ i__3 = *n;
+ for (jp = i__; jp <= i__3; ++jp) {
+/*< IF( ABS( A( IP, JP ) ).GE.XMAX ) THEN >*/
+ if (z_abs(&a[ip + jp * a_dim1]) >= xmax) {
+/*< XMAX = ABS( A( IP, JP ) ) >*/
+ xmax = z_abs(&a[ip + jp * a_dim1]);
+/*< IPV = IP >*/
+ ipv = ip;
+/*< JPV = JP >*/
+ jpv = jp;
+/*< END IF >*/
+ }
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< >*/
+ if (i__ == 1) {
+/* Computing MAX */
+ d__1 = eps * xmax;
+ smin = max(d__1,smlnum);
+ }
+
+/* Swap rows */
+
+/*< >*/
+ if (ipv != i__) {
+ zswap_(n, &a[ipv + a_dim1], lda, &a[i__ + a_dim1], lda);
+ }
+/*< IPIV( I ) = IPV >*/
+ ipiv[i__] = ipv;
+
+/* Swap columns */
+
+/*< >*/
+ if (jpv != i__) {
+ zswap_(n, &a[jpv * a_dim1 + 1], &c__1, &a[i__ * a_dim1 + 1], &
+ c__1);
+ }
+/*< JPIV( I ) = JPV >*/
+ jpiv[i__] = jpv;
+
+/* Check for singularity */
+
+/*< IF( ABS( A( I, I ) ).LT.SMIN ) THEN >*/
+ if (z_abs(&a[i__ + i__ * a_dim1]) < smin) {
+/*< INFO = I >*/
+ *info = i__;
+/*< A( I, I ) = DCMPLX( SMIN, ZERO ) >*/
+ i__2 = i__ + i__ * a_dim1;
+ z__1.r = smin, z__1.i = 0.;
+ a[i__2].r = z__1.r, a[i__2].i = z__1.i;
+/*< END IF >*/
+ }
+/*< DO 30 J = I + 1, N >*/
+ i__2 = *n;
+ for (j = i__ + 1; j <= i__2; ++j) {
+/*< A( J, I ) = A( J, I ) / A( I, I ) >*/
+ i__3 = j + i__ * a_dim1;
+ z_div(&z__1, &a[j + i__ * a_dim1], &a[i__ + i__ * a_dim1]);
+ a[i__3].r = z__1.r, a[i__3].i = z__1.i;
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< >*/
+ i__2 = *n - i__;
+ i__3 = *n - i__;
+ zgeru_(&i__2, &i__3, &c_b10, &a[i__ + 1 + i__ * a_dim1], &c__1, &a[
+ i__ + (i__ + 1) * a_dim1], lda, &a[i__ + 1 + (i__ + 1) *
+ a_dim1], lda);
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+
+/*< IF( ABS( A( N, N ) ).LT.SMIN ) THEN >*/
+ if (z_abs(&a[*n + *n * a_dim1]) < smin) {
+/*< INFO = N >*/
+ *info = *n;
+/*< A( N, N ) = DCMPLX( SMIN, ZERO ) >*/
+ i__1 = *n + *n * a_dim1;
+ z__1.r = smin, z__1.i = 0.;
+ a[i__1].r = z__1.r, a[i__1].i = z__1.i;
+/*< END IF >*/
+ }
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGETC2 */
+
+/*< END >*/
+} /* zgetc2_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.f
new file mode 100644
index 0000000000000000000000000000000000000000..b44ed2007e3872d8c4578b0753cbc2ba603172b8
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.f
@@ -0,0 +1,146 @@
+ SUBROUTINE ZGETC2( N, A, LDA, IPIV, JPIV, INFO )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER INFO, LDA, N
+* ..
+* .. Array Arguments ..
+ INTEGER IPIV( * ), JPIV( * )
+ COMPLEX*16 A( LDA, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZGETC2 computes an LU factorization, using complete pivoting, of the
+* n-by-n matrix A. The factorization has the form A = P * L * U * Q,
+* where P and Q are permutation matrices, L is lower triangular with
+* unit diagonal elements and U is upper triangular.
+*
+* This is a level 1 BLAS version of the algorithm.
+*
+* Arguments
+* =========
+*
+* N (input) INTEGER
+* The order of the matrix A. N >= 0.
+*
+* A (input/output) COMPLEX*16 array, dimension (LDA, N)
+* On entry, the n-by-n matrix to be factored.
+* On exit, the factors L and U from the factorization
+* A = P*L*U*Q; the unit diagonal elements of L are not stored.
+* If U(k, k) appears to be less than SMIN, U(k, k) is given the
+* value of SMIN, giving a nonsingular perturbed system.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1, N).
+*
+* IPIV (output) INTEGER array, dimension (N).
+* The pivot indices; for 1 <= i <= N, row i of the
+* matrix has been interchanged with row IPIV(i).
+*
+* JPIV (output) INTEGER array, dimension (N).
+* The pivot indices; for 1 <= j <= N, column j of the
+* matrix has been interchanged with column JPIV(j).
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* > 0: if INFO = k, U(k, k) is likely to produce overflow if
+* one tries to solve for x in Ax = b. So U is perturbed
+* to avoid the overflow.
+*
+* Further Details
+* ===============
+*
+* Based on contributions by
+* Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+* Umea University, S-901 87 Umea, Sweden.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ZERO, ONE
+ PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 )
+* ..
+* .. Local Scalars ..
+ INTEGER I, IP, IPV, J, JP, JPV
+ DOUBLE PRECISION BIGNUM, EPS, SMIN, SMLNUM, XMAX
+* ..
+* .. External Subroutines ..
+ EXTERNAL ZGERU, ZSWAP
+* ..
+* .. External Functions ..
+ DOUBLE PRECISION DLAMCH
+ EXTERNAL DLAMCH
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DCMPLX, MAX
+* ..
+* .. Executable Statements ..
+*
+* Set constants to control overflow
+*
+ INFO = 0
+ EPS = DLAMCH( 'P' )
+ SMLNUM = DLAMCH( 'S' ) / EPS
+ BIGNUM = ONE / SMLNUM
+ CALL DLABAD( SMLNUM, BIGNUM )
+*
+* Factorize A using complete pivoting.
+* Set pivots less than SMIN to SMIN
+*
+ DO 40 I = 1, N - 1
+*
+* Find max element in matrix A
+*
+ XMAX = ZERO
+ DO 20 IP = I, N
+ DO 10 JP = I, N
+ IF( ABS( A( IP, JP ) ).GE.XMAX ) THEN
+ XMAX = ABS( A( IP, JP ) )
+ IPV = IP
+ JPV = JP
+ END IF
+ 10 CONTINUE
+ 20 CONTINUE
+ IF( I.EQ.1 )
+ $ SMIN = MAX( EPS*XMAX, SMLNUM )
+*
+* Swap rows
+*
+ IF( IPV.NE.I )
+ $ CALL ZSWAP( N, A( IPV, 1 ), LDA, A( I, 1 ), LDA )
+ IPIV( I ) = IPV
+*
+* Swap columns
+*
+ IF( JPV.NE.I )
+ $ CALL ZSWAP( N, A( 1, JPV ), 1, A( 1, I ), 1 )
+ JPIV( I ) = JPV
+*
+* Check for singularity
+*
+ IF( ABS( A( I, I ) ).LT.SMIN ) THEN
+ INFO = I
+ A( I, I ) = DCMPLX( SMIN, ZERO )
+ END IF
+ DO 30 J = I + 1, N
+ A( J, I ) = A( J, I ) / A( I, I )
+ 30 CONTINUE
+ CALL ZGERU( N-I, N-I, -DCMPLX( ONE ), A( I+1, I ), 1,
+ $ A( I, I+1 ), LDA, A( I+1, I+1 ), LDA )
+ 40 CONTINUE
+*
+ IF( ABS( A( N, N ) ).LT.SMIN ) THEN
+ INFO = N
+ A( N, N ) = DCMPLX( SMIN, ZERO )
+ END IF
+ RETURN
+*
+* End of ZGETC2
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.h
new file mode 100644
index 0000000000000000000000000000000000000000..adef911931adeb5397ab1626ad0fcda15128f546
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgetc2.h
@@ -0,0 +1,8 @@
+extern int v3p_netlib_zgetc2_(
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_integer *ipiv,
+ v3p_netlib_integer *jpiv,
+ v3p_netlib_integer *info
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.P
new file mode 100644
index 0000000000000000000000000000000000000000..08229e5d052d207dfb651539360fdc2ea3d5dde4
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.P
@@ -0,0 +1,5 @@
+extern int zggbak_(char *job, char *side, integer *n, integer *ilo, integer *ihi, doublereal *lscale, doublereal *rscale, integer *m, doublecomplex *v, integer *ldv, integer *info, ftnlen job_len, ftnlen side_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zdscal_ 14 4 4 7 9 4 */
+/*:ref: zswap_ 14 5 4 9 4 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.c
new file mode 100644
index 0000000000000000000000000000000000000000..d179f5082e67e3f43e891a9cf5706135cf25c671
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.c
@@ -0,0 +1,375 @@
+/* lapack/complex16/zggbak.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< >*/
+/* Subroutine */ int zggbak_(char *job, char *side, integer *n, integer *ilo,
+ integer *ihi, doublereal *lscale, doublereal *rscale, integer *m,
+ doublecomplex *v, integer *ldv, integer *info, ftnlen job_len, ftnlen
+ side_len)
+{
+ /* System generated locals */
+ integer v_dim1, v_offset, i__1;
+
+ /* Local variables */
+ integer i__, k;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ logical leftv;
+ extern /* Subroutine */ int zswap_(integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *), xerbla_(char *, integer *, ftnlen),
+ zdscal_(integer *, doublereal *, doublecomplex *, integer *);
+ logical rightv;
+ (void)job_len;
+ (void)side_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER JOB, SIDE >*/
+/*< INTEGER IHI, ILO, INFO, LDV, M, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< DOUBLE PRECISION LSCALE( * ), RSCALE( * ) >*/
+/*< COMPLEX*16 V( LDV, * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGGBAK forms the right or left eigenvectors of a complex generalized */
+/* eigenvalue problem A*x = lambda*B*x, by backward transformation on */
+/* the computed eigenvectors of the balanced pair of matrices output by */
+/* ZGGBAL. */
+
+/* Arguments */
+/* ========= */
+
+/* JOB (input) CHARACTER*1 */
+/* Specifies the type of backward transformation required: */
+/* = 'N': do nothing, return immediately; */
+/* = 'P': do backward transformation for permutation only; */
+/* = 'S': do backward transformation for scaling only; */
+/* = 'B': do backward transformations for both permutation and */
+/* scaling. */
+/* JOB must be the same as the argument JOB supplied to ZGGBAL. */
+
+/* SIDE (input) CHARACTER*1 */
+/* = 'R': V contains right eigenvectors; */
+/* = 'L': V contains left eigenvectors. */
+
+/* N (input) INTEGER */
+/* The number of rows of the matrix V. N >= 0. */
+
+/* ILO (input) INTEGER */
+/* IHI (input) INTEGER */
+/* The integers ILO and IHI determined by ZGGBAL. */
+/* 1 <= ILO <= IHI <= N, if N > 0; ILO=1 and IHI=0, if N=0. */
+
+/* LSCALE (input) DOUBLE PRECISION array, dimension (N) */
+/* Details of the permutations and/or scaling factors applied */
+/* to the left side of A and B, as returned by ZGGBAL. */
+
+/* RSCALE (input) DOUBLE PRECISION array, dimension (N) */
+/* Details of the permutations and/or scaling factors applied */
+/* to the right side of A and B, as returned by ZGGBAL. */
+
+/* M (input) INTEGER */
+/* The number of columns of the matrix V. M >= 0. */
+
+/* V (input/output) COMPLEX*16 array, dimension (LDV,M) */
+/* On entry, the matrix of right or left eigenvectors to be */
+/* transformed, as returned by ZTGEVC. */
+/* On exit, V is overwritten by the transformed eigenvectors. */
+
+/* LDV (input) INTEGER */
+/* The leading dimension of the matrix V. LDV >= max(1,N). */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit. */
+/* < 0: if INFO = -i, the i-th argument had an illegal value. */
+
+/* Further Details */
+/* =============== */
+
+/* See R.C. Ward, Balancing the generalized eigenvalue problem, */
+/* SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. */
+
+/* ===================================================================== */
+
+/* .. Local Scalars .. */
+/*< LOGICAL LEFTV, RIGHTV >*/
+/*< INTEGER I, K >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< EXTERNAL LSAME >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZDSCAL, ZSWAP >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC MAX >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input parameters */
+
+/*< RIGHTV = LSAME( SIDE, 'R' ) >*/
+ /* Parameter adjustments */
+ --lscale;
+ --rscale;
+ v_dim1 = *ldv;
+ v_offset = 1 + v_dim1;
+ v -= v_offset;
+
+ /* Function Body */
+ rightv = lsame_(side, "R", (ftnlen)1, (ftnlen)1);
+/*< LEFTV = LSAME( SIDE, 'L' ) >*/
+ leftv = lsame_(side, "L", (ftnlen)1, (ftnlen)1);
+
+/*< INFO = 0 >*/
+ *info = 0;
+/*< >*/
+ if (! lsame_(job, "N", (ftnlen)1, (ftnlen)1) && ! lsame_(job, "P", (
+ ftnlen)1, (ftnlen)1) && ! lsame_(job, "S", (ftnlen)1, (ftnlen)1)
+ && ! lsame_(job, "B", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( .NOT.RIGHTV .AND. .NOT.LEFTV ) THEN >*/
+ } else if (! rightv && ! leftv) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -3 >*/
+ *info = -3;
+/*< ELSE IF( ILO.LT.1 ) THEN >*/
+ } else if (*ilo < 1) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( N.EQ.0 .AND. IHI.EQ.0 .AND. ILO.NE.1 ) THEN >*/
+ } else if (*n == 0 && *ihi == 0 && *ilo != 1) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< >*/
+ } else if (*n > 0 && (*ihi < *ilo || *ihi > max(1,*n))) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( N.EQ.0 .AND. ILO.EQ.1 .AND. IHI.NE.0 ) THEN >*/
+ } else if (*n == 0 && *ilo == 1 && *ihi != 0) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( M.LT.0 ) THEN >*/
+ } else if (*m < 0) {
+/*< INFO = -8 >*/
+ *info = -8;
+/*< ELSE IF( LDV.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldv < max(1,*n)) {
+/*< INFO = -10 >*/
+ *info = -10;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZGGBAK', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZGGBAK", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< >*/
+ if (*n == 0) {
+ return 0;
+ }
+/*< >*/
+ if (*m == 0) {
+ return 0;
+ }
+/*< >*/
+ if (lsame_(job, "N", (ftnlen)1, (ftnlen)1)) {
+ return 0;
+ }
+
+/*< >*/
+ if (*ilo == *ihi) {
+ goto L30;
+ }
+
+/* Backward balance */
+
+/*< IF( LSAME( JOB, 'S' ) .OR. LSAME( JOB, 'B' ) ) THEN >*/
+ if (lsame_(job, "S", (ftnlen)1, (ftnlen)1) || lsame_(job, "B", (ftnlen)1,
+ (ftnlen)1)) {
+
+/* Backward transformation on right eigenvectors */
+
+/*< IF( RIGHTV ) THEN >*/
+ if (rightv) {
+/*< DO 10 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< CALL ZDSCAL( M, RSCALE( I ), V( I, 1 ), LDV ) >*/
+ zdscal_(m, &rscale[i__], &v[i__ + v_dim1], ldv);
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< END IF >*/
+ }
+
+/* Backward transformation on left eigenvectors */
+
+/*< IF( LEFTV ) THEN >*/
+ if (leftv) {
+/*< DO 20 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< CALL ZDSCAL( M, LSCALE( I ), V( I, 1 ), LDV ) >*/
+ zdscal_(m, &lscale[i__], &v[i__ + v_dim1], ldv);
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/* Backward permutation */
+
+/*< 30 CONTINUE >*/
+L30:
+/*< IF( LSAME( JOB, 'P' ) .OR. LSAME( JOB, 'B' ) ) THEN >*/
+ if (lsame_(job, "P", (ftnlen)1, (ftnlen)1) || lsame_(job, "B", (ftnlen)1,
+ (ftnlen)1)) {
+
+/* Backward permutation on right eigenvectors */
+
+/*< IF( RIGHTV ) THEN >*/
+ if (rightv) {
+/*< >*/
+ if (*ilo == 1) {
+ goto L50;
+ }
+/*< DO 40 I = ILO - 1, 1, -1 >*/
+ for (i__ = *ilo - 1; i__ >= 1; --i__) {
+/*< K = RSCALE( I ) >*/
+ k = (integer) rscale[i__];
+/*< >*/
+ if (k == i__) {
+ goto L40;
+ }
+/*< CALL ZSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV ) >*/
+ zswap_(m, &v[i__ + v_dim1], ldv, &v[k + v_dim1], ldv);
+/*< 40 CONTINUE >*/
+L40:
+ ;
+ }
+
+/*< 50 CONTINUE >*/
+L50:
+/*< >*/
+ if (*ihi == *n) {
+ goto L70;
+ }
+/*< DO 60 I = IHI + 1, N >*/
+ i__1 = *n;
+ for (i__ = *ihi + 1; i__ <= i__1; ++i__) {
+/*< K = RSCALE( I ) >*/
+ k = (integer) rscale[i__];
+/*< >*/
+ if (k == i__) {
+ goto L60;
+ }
+/*< CALL ZSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV ) >*/
+ zswap_(m, &v[i__ + v_dim1], ldv, &v[k + v_dim1], ldv);
+/*< 60 CONTINUE >*/
+L60:
+ ;
+ }
+/*< END IF >*/
+ }
+
+/* Backward permutation on left eigenvectors */
+
+/*< 70 CONTINUE >*/
+L70:
+/*< IF( LEFTV ) THEN >*/
+ if (leftv) {
+/*< >*/
+ if (*ilo == 1) {
+ goto L90;
+ }
+/*< DO 80 I = ILO - 1, 1, -1 >*/
+ for (i__ = *ilo - 1; i__ >= 1; --i__) {
+/*< K = LSCALE( I ) >*/
+ k = (integer) lscale[i__];
+/*< >*/
+ if (k == i__) {
+ goto L80;
+ }
+/*< CALL ZSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV ) >*/
+ zswap_(m, &v[i__ + v_dim1], ldv, &v[k + v_dim1], ldv);
+/*< 80 CONTINUE >*/
+L80:
+ ;
+ }
+
+/*< 90 CONTINUE >*/
+L90:
+/*< >*/
+ if (*ihi == *n) {
+ goto L110;
+ }
+/*< DO 100 I = IHI + 1, N >*/
+ i__1 = *n;
+ for (i__ = *ihi + 1; i__ <= i__1; ++i__) {
+/*< K = LSCALE( I ) >*/
+ k = (integer) lscale[i__];
+/*< >*/
+ if (k == i__) {
+ goto L100;
+ }
+/*< CALL ZSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV ) >*/
+ zswap_(m, &v[i__ + v_dim1], ldv, &v[k + v_dim1], ldv);
+/*< 100 CONTINUE >*/
+L100:
+ ;
+ }
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/*< 110 CONTINUE >*/
+L110:
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGGBAK */
+
+/*< END >*/
+} /* zggbak_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.f
new file mode 100644
index 0000000000000000000000000000000000000000..d5cb78cc2890c1febfa2567154b0454b8f128bf7
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.f
@@ -0,0 +1,221 @@
+ SUBROUTINE ZGGBAK( JOB, SIDE, N, ILO, IHI, LSCALE, RSCALE, M, V,
+ $ LDV, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER JOB, SIDE
+ INTEGER IHI, ILO, INFO, LDV, M, N
+* ..
+* .. Array Arguments ..
+ DOUBLE PRECISION LSCALE( * ), RSCALE( * )
+ COMPLEX*16 V( LDV, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZGGBAK forms the right or left eigenvectors of a complex generalized
+* eigenvalue problem A*x = lambda*B*x, by backward transformation on
+* the computed eigenvectors of the balanced pair of matrices output by
+* ZGGBAL.
+*
+* Arguments
+* =========
+*
+* JOB (input) CHARACTER*1
+* Specifies the type of backward transformation required:
+* = 'N': do nothing, return immediately;
+* = 'P': do backward transformation for permutation only;
+* = 'S': do backward transformation for scaling only;
+* = 'B': do backward transformations for both permutation and
+* scaling.
+* JOB must be the same as the argument JOB supplied to ZGGBAL.
+*
+* SIDE (input) CHARACTER*1
+* = 'R': V contains right eigenvectors;
+* = 'L': V contains left eigenvectors.
+*
+* N (input) INTEGER
+* The number of rows of the matrix V. N >= 0.
+*
+* ILO (input) INTEGER
+* IHI (input) INTEGER
+* The integers ILO and IHI determined by ZGGBAL.
+* 1 <= ILO <= IHI <= N, if N > 0; ILO=1 and IHI=0, if N=0.
+*
+* LSCALE (input) DOUBLE PRECISION array, dimension (N)
+* Details of the permutations and/or scaling factors applied
+* to the left side of A and B, as returned by ZGGBAL.
+*
+* RSCALE (input) DOUBLE PRECISION array, dimension (N)
+* Details of the permutations and/or scaling factors applied
+* to the right side of A and B, as returned by ZGGBAL.
+*
+* M (input) INTEGER
+* The number of columns of the matrix V. M >= 0.
+*
+* V (input/output) COMPLEX*16 array, dimension (LDV,M)
+* On entry, the matrix of right or left eigenvectors to be
+* transformed, as returned by ZTGEVC.
+* On exit, V is overwritten by the transformed eigenvectors.
+*
+* LDV (input) INTEGER
+* The leading dimension of the matrix V. LDV >= max(1,N).
+*
+* INFO (output) INTEGER
+* = 0: successful exit.
+* < 0: if INFO = -i, the i-th argument had an illegal value.
+*
+* Further Details
+* ===============
+*
+* See R.C. Ward, Balancing the generalized eigenvalue problem,
+* SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.
+*
+* =====================================================================
+*
+* .. Local Scalars ..
+ LOGICAL LEFTV, RIGHTV
+ INTEGER I, K
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ EXTERNAL LSAME
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZDSCAL, ZSWAP
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC MAX
+* ..
+* .. Executable Statements ..
+*
+* Test the input parameters
+*
+ RIGHTV = LSAME( SIDE, 'R' )
+ LEFTV = LSAME( SIDE, 'L' )
+*
+ INFO = 0
+ IF( .NOT.LSAME( JOB, 'N' ) .AND. .NOT.LSAME( JOB, 'P' ) .AND.
+ $ .NOT.LSAME( JOB, 'S' ) .AND. .NOT.LSAME( JOB, 'B' ) ) THEN
+ INFO = -1
+ ELSE IF( .NOT.RIGHTV .AND. .NOT.LEFTV ) THEN
+ INFO = -2
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -3
+ ELSE IF( ILO.LT.1 ) THEN
+ INFO = -4
+ ELSE IF( N.EQ.0 .AND. IHI.EQ.0 .AND. ILO.NE.1 ) THEN
+ INFO = -4
+ ELSE IF( N.GT.0 .AND. ( IHI.LT.ILO .OR. IHI.GT.MAX( 1, N ) ) )
+ $ THEN
+ INFO = -5
+ ELSE IF( N.EQ.0 .AND. ILO.EQ.1 .AND. IHI.NE.0 ) THEN
+ INFO = -5
+ ELSE IF( M.LT.0 ) THEN
+ INFO = -8
+ ELSE IF( LDV.LT.MAX( 1, N ) ) THEN
+ INFO = -10
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZGGBAK', -INFO )
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( N.EQ.0 )
+ $ RETURN
+ IF( M.EQ.0 )
+ $ RETURN
+ IF( LSAME( JOB, 'N' ) )
+ $ RETURN
+*
+ IF( ILO.EQ.IHI )
+ $ GO TO 30
+*
+* Backward balance
+*
+ IF( LSAME( JOB, 'S' ) .OR. LSAME( JOB, 'B' ) ) THEN
+*
+* Backward transformation on right eigenvectors
+*
+ IF( RIGHTV ) THEN
+ DO 10 I = ILO, IHI
+ CALL ZDSCAL( M, RSCALE( I ), V( I, 1 ), LDV )
+ 10 CONTINUE
+ END IF
+*
+* Backward transformation on left eigenvectors
+*
+ IF( LEFTV ) THEN
+ DO 20 I = ILO, IHI
+ CALL ZDSCAL( M, LSCALE( I ), V( I, 1 ), LDV )
+ 20 CONTINUE
+ END IF
+ END IF
+*
+* Backward permutation
+*
+ 30 CONTINUE
+ IF( LSAME( JOB, 'P' ) .OR. LSAME( JOB, 'B' ) ) THEN
+*
+* Backward permutation on right eigenvectors
+*
+ IF( RIGHTV ) THEN
+ IF( ILO.EQ.1 )
+ $ GO TO 50
+ DO 40 I = ILO - 1, 1, -1
+ K = RSCALE( I )
+ IF( K.EQ.I )
+ $ GO TO 40
+ CALL ZSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV )
+ 40 CONTINUE
+*
+ 50 CONTINUE
+ IF( IHI.EQ.N )
+ $ GO TO 70
+ DO 60 I = IHI + 1, N
+ K = RSCALE( I )
+ IF( K.EQ.I )
+ $ GO TO 60
+ CALL ZSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV )
+ 60 CONTINUE
+ END IF
+*
+* Backward permutation on left eigenvectors
+*
+ 70 CONTINUE
+ IF( LEFTV ) THEN
+ IF( ILO.EQ.1 )
+ $ GO TO 90
+ DO 80 I = ILO - 1, 1, -1
+ K = LSCALE( I )
+ IF( K.EQ.I )
+ $ GO TO 80
+ CALL ZSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV )
+ 80 CONTINUE
+*
+ 90 CONTINUE
+ IF( IHI.EQ.N )
+ $ GO TO 110
+ DO 100 I = IHI + 1, N
+ K = LSCALE( I )
+ IF( K.EQ.I )
+ $ GO TO 100
+ CALL ZSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV )
+ 100 CONTINUE
+ END IF
+ END IF
+*
+ 110 CONTINUE
+*
+ RETURN
+*
+* End of ZGGBAK
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.h
new file mode 100644
index 0000000000000000000000000000000000000000..06d38f45f82ea5902a23f63e78dcddb60fb8abf4
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbak.h
@@ -0,0 +1,15 @@
+extern int v3p_netlib_zggbak_(
+ char *job,
+ char *side,
+ v3p_netlib_integer *n,
+ v3p_netlib_integer *ilo,
+ v3p_netlib_integer *ihi,
+ v3p_netlib_doublereal *lscale,
+ v3p_netlib_doublereal *rscale,
+ v3p_netlib_integer *m,
+ v3p_netlib_doublecomplex *v,
+ v3p_netlib_integer *ldv,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen job_len,
+ v3p_netlib_ftnlen side_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.P
new file mode 100644
index 0000000000000000000000000000000000000000..bfa14e298765f6fcefb08f43f0e171e5e71791bd
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.P
@@ -0,0 +1,10 @@
+extern int zggbal_(char *job, integer *n, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb, integer *ilo, integer *ihi, doublereal *lscale, doublereal *rscale, doublereal *work, integer *info, ftnlen job_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zswap_ 14 5 4 9 4 9 4 */
+/*:ref: ddot_ 7 5 4 7 4 7 4 */
+/*:ref: dscal_ 14 4 4 7 7 4 */
+/*:ref: daxpy_ 14 6 4 7 7 4 7 4 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: izamax_ 4 3 4 9 4 */
+/*:ref: zdscal_ 14 4 4 7 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.c
new file mode 100644
index 0000000000000000000000000000000000000000..80a001199b90172f77949c217f365fd9ad9e31f0
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.c
@@ -0,0 +1,931 @@
+/* lapack/complex16/zggbal.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+static doublereal c_b36 = 10.;
+static doublereal c_b72 = .5;
+
+/*< >*/
+/* Subroutine */ int zggbal_(char *job, integer *n, doublecomplex *a, integer
+ *lda, doublecomplex *b, integer *ldb, integer *ilo, integer *ihi,
+ doublereal *lscale, doublereal *rscale, doublereal *work, integer *
+ info, ftnlen job_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, b_dim1, b_offset, i__1, i__2, i__3, i__4;
+ doublereal d__1, d__2, d__3;
+
+ /* Builtin functions */
+ double d_lg10(doublereal *), d_imag(doublecomplex *), z_abs(doublecomplex
+ *), d_sign(doublereal *, doublereal *), pow_di(doublereal *,
+ integer *);
+
+ /* Local variables */
+ integer i__, j, k, l, m;
+ doublereal t;
+ integer jc;
+ doublereal ta, tb, tc;
+ integer ir;
+ doublereal ew;
+ integer it, nr, ip1, jp1, lm1;
+ doublereal cab, rab, ewc, cor, sum;
+ integer nrp2, icab, lcab;
+ doublereal beta, coef;
+ integer irab, lrab;
+ doublereal basl, cmax;
+ extern doublereal ddot_(integer *, doublereal *, integer *, doublereal *,
+ integer *);
+ doublereal coef2, coef5, gamma, alpha;
+ extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
+ integer *);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ doublereal sfmin, sfmax;
+ integer iflow;
+ extern /* Subroutine */ int daxpy_(integer *, doublereal *, doublereal *,
+ integer *, doublereal *, integer *);
+ integer kount;
+ extern /* Subroutine */ int zswap_(integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *);
+ extern doublereal dlamch_(char *, ftnlen);
+ doublereal pgamma;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen), zdscal_(
+ integer *, doublereal *, doublecomplex *, integer *);
+ integer lsfmin;
+ extern integer izamax_(integer *, doublecomplex *, integer *);
+ integer lsfmax;
+ (void)job_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER JOB >*/
+/*< INTEGER IHI, ILO, INFO, LDA, LDB, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< DOUBLE PRECISION LSCALE( * ), RSCALE( * ), WORK( * ) >*/
+/*< COMPLEX*16 A( LDA, * ), B( LDB, * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGGBAL balances a pair of general complex matrices (A,B). This */
+/* involves, first, permuting A and B by similarity transformations to */
+/* isolate eigenvalues in the first 1 to ILO$-$1 and last IHI+1 to N */
+/* elements on the diagonal; and second, applying a diagonal similarity */
+/* transformation to rows and columns ILO to IHI to make the rows */
+/* and columns as close in norm as possible. Both steps are optional. */
+
+/* Balancing may reduce the 1-norm of the matrices, and improve the */
+/* accuracy of the computed eigenvalues and/or eigenvectors in the */
+/* generalized eigenvalue problem A*x = lambda*B*x. */
+
+/* Arguments */
+/* ========= */
+
+/* JOB (input) CHARACTER*1 */
+/* Specifies the operations to be performed on A and B: */
+/* = 'N': none: simply set ILO = 1, IHI = N, LSCALE(I) = 1.0 */
+/* and RSCALE(I) = 1.0 for i=1,...,N; */
+/* = 'P': permute only; */
+/* = 'S': scale only; */
+/* = 'B': both permute and scale. */
+
+/* N (input) INTEGER */
+/* The order of the matrices A and B. N >= 0. */
+
+/* A (input/output) COMPLEX*16 array, dimension (LDA,N) */
+/* On entry, the input matrix A. */
+/* On exit, A is overwritten by the balanced matrix. */
+/* If JOB = 'N', A is not referenced. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,N). */
+
+/* B (input/output) COMPLEX*16 array, dimension (LDB,N) */
+/* On entry, the input matrix B. */
+/* On exit, B is overwritten by the balanced matrix. */
+/* If JOB = 'N', B is not referenced. */
+
+/* LDB (input) INTEGER */
+/* The leading dimension of the array B. LDB >= max(1,N). */
+
+/* ILO (output) INTEGER */
+/* IHI (output) INTEGER */
+/* ILO and IHI are set to integers such that on exit */
+/* A(i,j) = 0 and B(i,j) = 0 if i > j and */
+/* j = 1,...,ILO-1 or i = IHI+1,...,N. */
+/* If JOB = 'N' or 'S', ILO = 1 and IHI = N. */
+
+/* LSCALE (output) DOUBLE PRECISION array, dimension (N) */
+/* Details of the permutations and scaling factors applied */
+/* to the left side of A and B. If P(j) is the index of the */
+/* row interchanged with row j, and D(j) is the scaling factor */
+/* applied to row j, then */
+/* LSCALE(j) = P(j) for J = 1,...,ILO-1 */
+/* = D(j) for J = ILO,...,IHI */
+/* = P(j) for J = IHI+1,...,N. */
+/* The order in which the interchanges are made is N to IHI+1, */
+/* then 1 to ILO-1. */
+
+/* RSCALE (output) DOUBLE PRECISION array, dimension (N) */
+/* Details of the permutations and scaling factors applied */
+/* to the right side of A and B. If P(j) is the index of the */
+/* column interchanged with column j, and D(j) is the scaling */
+/* factor applied to column j, then */
+/* RSCALE(j) = P(j) for J = 1,...,ILO-1 */
+/* = D(j) for J = ILO,...,IHI */
+/* = P(j) for J = IHI+1,...,N. */
+/* The order in which the interchanges are made is N to IHI+1, */
+/* then 1 to ILO-1. */
+
+/* WORK (workspace) REAL array, dimension (lwork) */
+/* lwork must be at least max(1,6*N) when JOB = 'S' or 'B', and */
+/* at least 1 when JOB = 'N' or 'P'. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value. */
+
+/* Further Details */
+/* =============== */
+
+/* See R.C. WARD, Balancing the generalized eigenvalue problem, */
+/* SIAM J. Sci. Stat. Comp. 2 (1981), 141-152. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ZERO, HALF, ONE >*/
+/*< PARAMETER ( ZERO = 0.0D+0, HALF = 0.5D+0, ONE = 1.0D+0 ) >*/
+/*< DOUBLE PRECISION THREE, SCLFAC >*/
+/*< PARAMETER ( THREE = 3.0D+0, SCLFAC = 1.0D+1 ) >*/
+/*< COMPLEX*16 CZERO >*/
+/*< PARAMETER ( CZERO = ( 0.0D+0, 0.0D+0 ) ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< >*/
+/*< >*/
+/*< COMPLEX*16 CDUM >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< INTEGER IZAMAX >*/
+/*< DOUBLE PRECISION DDOT, DLAMCH >*/
+/*< EXTERNAL LSAME, IZAMAX, DDOT, DLAMCH >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL DAXPY, DSCAL, XERBLA, ZDSCAL, ZSWAP >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, DBLE, DIMAG, INT, LOG10, MAX, MIN, SIGN >*/
+/* .. */
+/* .. Statement Functions .. */
+/*< DOUBLE PRECISION CABS1 >*/
+/* .. */
+/* .. Statement Function definitions .. */
+/*< CABS1( CDUM ) = ABS( DBLE( CDUM ) ) + ABS( DIMAG( CDUM ) ) >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input parameters */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ b_dim1 = *ldb;
+ b_offset = 1 + b_dim1;
+ b -= b_offset;
+ --lscale;
+ --rscale;
+ --work;
+
+ /* Function Body */
+ *info = 0;
+/*< >*/
+ if (! lsame_(job, "N", (ftnlen)1, (ftnlen)1) && ! lsame_(job, "P", (
+ ftnlen)1, (ftnlen)1) && ! lsame_(job, "S", (ftnlen)1, (ftnlen)1)
+ && ! lsame_(job, "B", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( LDA.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*lda < max(1,*n)) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( LDB.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldb < max(1,*n)) {
+/*< INFO = -6 >*/
+ *info = -6;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZGGBAL', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZGGBAL", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< IF( N.EQ.0 ) THEN >*/
+ if (*n == 0) {
+/*< ILO = 1 >*/
+ *ilo = 1;
+/*< IHI = N >*/
+ *ihi = *n;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< IF( N.EQ.1 ) THEN >*/
+ if (*n == 1) {
+/*< ILO = 1 >*/
+ *ilo = 1;
+/*< IHI = N >*/
+ *ihi = *n;
+/*< LSCALE( 1 ) = ONE >*/
+ lscale[1] = 1.;
+/*< RSCALE( 1 ) = ONE >*/
+ rscale[1] = 1.;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< IF( LSAME( JOB, 'N' ) ) THEN >*/
+ if (lsame_(job, "N", (ftnlen)1, (ftnlen)1)) {
+/*< ILO = 1 >*/
+ *ilo = 1;
+/*< IHI = N >*/
+ *ihi = *n;
+/*< DO 10 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< LSCALE( I ) = ONE >*/
+ lscale[i__] = 1.;
+/*< RSCALE( I ) = ONE >*/
+ rscale[i__] = 1.;
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< K = 1 >*/
+ k = 1;
+/*< L = N >*/
+ l = *n;
+/*< >*/
+ if (lsame_(job, "S", (ftnlen)1, (ftnlen)1)) {
+ goto L190;
+ }
+
+/*< GO TO 30 >*/
+ goto L30;
+
+/* Permute the matrices A and B to isolate the eigenvalues. */
+
+/* Find row with one nonzero in columns 1 through L */
+
+/*< 20 CONTINUE >*/
+L20:
+/*< L = LM1 >*/
+ l = lm1;
+/*< >*/
+ if (l != 1) {
+ goto L30;
+ }
+
+/*< RSCALE( 1 ) = 1 >*/
+ rscale[1] = 1.;
+/*< LSCALE( 1 ) = 1 >*/
+ lscale[1] = 1.;
+/*< GO TO 190 >*/
+ goto L190;
+
+/*< 30 CONTINUE >*/
+L30:
+/*< LM1 = L - 1 >*/
+ lm1 = l - 1;
+/*< DO 80 I = L, 1, -1 >*/
+ for (i__ = l; i__ >= 1; --i__) {
+/*< DO 40 J = 1, LM1 >*/
+ i__1 = lm1;
+ for (j = 1; j <= i__1; ++j) {
+/*< JP1 = J + 1 >*/
+ jp1 = j + 1;
+/*< >*/
+ i__2 = i__ + j * a_dim1;
+ i__3 = i__ + j * b_dim1;
+ if (a[i__2].r != 0. || a[i__2].i != 0. || (b[i__3].r != 0. || b[
+ i__3].i != 0.)) {
+ goto L50;
+ }
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+/*< J = L >*/
+ j = l;
+/*< GO TO 70 >*/
+ goto L70;
+
+/*< 50 CONTINUE >*/
+L50:
+/*< DO 60 J = JP1, L >*/
+ i__1 = l;
+ for (j = jp1; j <= i__1; ++j) {
+/*< >*/
+ i__2 = i__ + j * a_dim1;
+ i__3 = i__ + j * b_dim1;
+ if (a[i__2].r != 0. || a[i__2].i != 0. || (b[i__3].r != 0. || b[
+ i__3].i != 0.)) {
+ goto L80;
+ }
+/*< 60 CONTINUE >*/
+/* L60: */
+ }
+/*< J = JP1 - 1 >*/
+ j = jp1 - 1;
+
+/*< 70 CONTINUE >*/
+L70:
+/*< M = L >*/
+ m = l;
+/*< IFLOW = 1 >*/
+ iflow = 1;
+/*< GO TO 160 >*/
+ goto L160;
+/*< 80 CONTINUE >*/
+L80:
+ ;
+ }
+/*< GO TO 100 >*/
+ goto L100;
+
+/* Find column with one nonzero in rows K through N */
+
+/*< 90 CONTINUE >*/
+L90:
+/*< K = K + 1 >*/
+ ++k;
+
+/*< 100 CONTINUE >*/
+L100:
+/*< DO 150 J = K, L >*/
+ i__1 = l;
+ for (j = k; j <= i__1; ++j) {
+/*< DO 110 I = K, LM1 >*/
+ i__2 = lm1;
+ for (i__ = k; i__ <= i__2; ++i__) {
+/*< IP1 = I + 1 >*/
+ ip1 = i__ + 1;
+/*< >*/
+ i__3 = i__ + j * a_dim1;
+ i__4 = i__ + j * b_dim1;
+ if (a[i__3].r != 0. || a[i__3].i != 0. || (b[i__4].r != 0. || b[
+ i__4].i != 0.)) {
+ goto L120;
+ }
+/*< 110 CONTINUE >*/
+/* L110: */
+ }
+/*< I = L >*/
+ i__ = l;
+/*< GO TO 140 >*/
+ goto L140;
+/*< 120 CONTINUE >*/
+L120:
+/*< DO 130 I = IP1, L >*/
+ i__2 = l;
+ for (i__ = ip1; i__ <= i__2; ++i__) {
+/*< >*/
+ i__3 = i__ + j * a_dim1;
+ i__4 = i__ + j * b_dim1;
+ if (a[i__3].r != 0. || a[i__3].i != 0. || (b[i__4].r != 0. || b[
+ i__4].i != 0.)) {
+ goto L150;
+ }
+/*< 130 CONTINUE >*/
+/* L130: */
+ }
+/*< I = IP1 - 1 >*/
+ i__ = ip1 - 1;
+/*< 140 CONTINUE >*/
+L140:
+/*< M = K >*/
+ m = k;
+/*< IFLOW = 2 >*/
+ iflow = 2;
+/*< GO TO 160 >*/
+ goto L160;
+/*< 150 CONTINUE >*/
+L150:
+ ;
+ }
+/*< GO TO 190 >*/
+ goto L190;
+
+/* Permute rows M and I */
+
+/*< 160 CONTINUE >*/
+L160:
+/*< LSCALE( M ) = I >*/
+ lscale[m] = (doublereal) i__;
+/*< >*/
+ if (i__ == m) {
+ goto L170;
+ }
+/*< CALL ZSWAP( N-K+1, A( I, K ), LDA, A( M, K ), LDA ) >*/
+ i__1 = *n - k + 1;
+ zswap_(&i__1, &a[i__ + k * a_dim1], lda, &a[m + k * a_dim1], lda);
+/*< CALL ZSWAP( N-K+1, B( I, K ), LDB, B( M, K ), LDB ) >*/
+ i__1 = *n - k + 1;
+ zswap_(&i__1, &b[i__ + k * b_dim1], ldb, &b[m + k * b_dim1], ldb);
+
+/* Permute columns M and J */
+
+/*< 170 CONTINUE >*/
+L170:
+/*< RSCALE( M ) = J >*/
+ rscale[m] = (doublereal) j;
+/*< >*/
+ if (j == m) {
+ goto L180;
+ }
+/*< CALL ZSWAP( L, A( 1, J ), 1, A( 1, M ), 1 ) >*/
+ zswap_(&l, &a[j * a_dim1 + 1], &c__1, &a[m * a_dim1 + 1], &c__1);
+/*< CALL ZSWAP( L, B( 1, J ), 1, B( 1, M ), 1 ) >*/
+ zswap_(&l, &b[j * b_dim1 + 1], &c__1, &b[m * b_dim1 + 1], &c__1);
+
+/*< 180 CONTINUE >*/
+L180:
+/*< GO TO ( 20, 90 )IFLOW >*/
+ switch (iflow) {
+ case 1: goto L20;
+ case 2: goto L90;
+ }
+
+/*< 190 CONTINUE >*/
+L190:
+/*< ILO = K >*/
+ *ilo = k;
+/*< IHI = L >*/
+ *ihi = l;
+
+/*< IF( LSAME( JOB, 'P' ) ) THEN >*/
+ if (lsame_(job, "P", (ftnlen)1, (ftnlen)1)) {
+/*< DO 195 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< LSCALE( I ) = ONE >*/
+ lscale[i__] = 1.;
+/*< RSCALE( I ) = ONE >*/
+ rscale[i__] = 1.;
+/*< 195 CONTINUE >*/
+/* L195: */
+ }
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< >*/
+ if (*ilo == *ihi) {
+ return 0;
+ }
+
+/* Balance the submatrix in rows ILO to IHI. */
+
+/*< NR = IHI - ILO + 1 >*/
+ nr = *ihi - *ilo + 1;
+/*< DO 200 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< RSCALE( I ) = ZERO >*/
+ rscale[i__] = 0.;
+/*< LSCALE( I ) = ZERO >*/
+ lscale[i__] = 0.;
+
+/*< WORK( I ) = ZERO >*/
+ work[i__] = 0.;
+/*< WORK( I+N ) = ZERO >*/
+ work[i__ + *n] = 0.;
+/*< WORK( I+2*N ) = ZERO >*/
+ work[i__ + (*n << 1)] = 0.;
+/*< WORK( I+3*N ) = ZERO >*/
+ work[i__ + *n * 3] = 0.;
+/*< WORK( I+4*N ) = ZERO >*/
+ work[i__ + (*n << 2)] = 0.;
+/*< WORK( I+5*N ) = ZERO >*/
+ work[i__ + *n * 5] = 0.;
+/*< 200 CONTINUE >*/
+/* L200: */
+ }
+
+/* Compute right side vector in resulting linear equations */
+
+/*< BASL = LOG10( SCLFAC ) >*/
+ basl = d_lg10(&c_b36);
+/*< DO 240 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< DO 230 J = ILO, IHI >*/
+ i__2 = *ihi;
+ for (j = *ilo; j <= i__2; ++j) {
+/*< IF( A( I, J ).EQ.CZERO ) THEN >*/
+ i__3 = i__ + j * a_dim1;
+ if (a[i__3].r == 0. && a[i__3].i == 0.) {
+/*< TA = ZERO >*/
+ ta = 0.;
+/*< GO TO 210 >*/
+ goto L210;
+/*< END IF >*/
+ }
+/*< TA = LOG10( CABS1( A( I, J ) ) ) / BASL >*/
+ i__3 = i__ + j * a_dim1;
+ d__3 = (d__1 = a[i__3].r, abs(d__1)) + (d__2 = d_imag(&a[i__ + j *
+ a_dim1]), abs(d__2));
+ ta = d_lg10(&d__3) / basl;
+
+/*< 210 CONTINUE >*/
+L210:
+/*< IF( B( I, J ).EQ.CZERO ) THEN >*/
+ i__3 = i__ + j * b_dim1;
+ if (b[i__3].r == 0. && b[i__3].i == 0.) {
+/*< TB = ZERO >*/
+ tb = 0.;
+/*< GO TO 220 >*/
+ goto L220;
+/*< END IF >*/
+ }
+/*< TB = LOG10( CABS1( B( I, J ) ) ) / BASL >*/
+ i__3 = i__ + j * b_dim1;
+ d__3 = (d__1 = b[i__3].r, abs(d__1)) + (d__2 = d_imag(&b[i__ + j *
+ b_dim1]), abs(d__2));
+ tb = d_lg10(&d__3) / basl;
+
+/*< 220 CONTINUE >*/
+L220:
+/*< WORK( I+4*N ) = WORK( I+4*N ) - TA - TB >*/
+ work[i__ + (*n << 2)] = work[i__ + (*n << 2)] - ta - tb;
+/*< WORK( J+5*N ) = WORK( J+5*N ) - TA - TB >*/
+ work[j + *n * 5] = work[j + *n * 5] - ta - tb;
+/*< 230 CONTINUE >*/
+/* L230: */
+ }
+/*< 240 CONTINUE >*/
+/* L240: */
+ }
+
+/*< COEF = ONE / DBLE( 2*NR ) >*/
+ coef = 1. / (doublereal) (nr << 1);
+/*< COEF2 = COEF*COEF >*/
+ coef2 = coef * coef;
+/*< COEF5 = HALF*COEF2 >*/
+ coef5 = coef2 * .5;
+/*< NRP2 = NR + 2 >*/
+ nrp2 = nr + 2;
+/*< BETA = ZERO >*/
+ beta = 0.;
+/*< IT = 1 >*/
+ it = 1;
+
+/* Start generalized conjugate gradient iteration */
+
+/*< 250 CONTINUE >*/
+L250:
+
+/*< >*/
+ gamma = ddot_(&nr, &work[*ilo + (*n << 2)], &c__1, &work[*ilo + (*n << 2)]
+ , &c__1) + ddot_(&nr, &work[*ilo + *n * 5], &c__1, &work[*ilo + *
+ n * 5], &c__1);
+
+/*< EW = ZERO >*/
+ ew = 0.;
+/*< EWC = ZERO >*/
+ ewc = 0.;
+/*< DO 260 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< EW = EW + WORK( I+4*N ) >*/
+ ew += work[i__ + (*n << 2)];
+/*< EWC = EWC + WORK( I+5*N ) >*/
+ ewc += work[i__ + *n * 5];
+/*< 260 CONTINUE >*/
+/* L260: */
+ }
+
+/*< GAMMA = COEF*GAMMA - COEF2*( EW**2+EWC**2 ) - COEF5*( EW-EWC )**2 >*/
+/* Computing 2nd power */
+ d__1 = ew;
+/* Computing 2nd power */
+ d__2 = ewc;
+/* Computing 2nd power */
+ d__3 = ew - ewc;
+ gamma = coef * gamma - coef2 * (d__1 * d__1 + d__2 * d__2) - coef5 * (
+ d__3 * d__3);
+/*< >*/
+ if (gamma == 0.) {
+ goto L350;
+ }
+/*< >*/
+ if (it != 1) {
+ beta = gamma / pgamma;
+ }
+/*< T = COEF5*( EWC-THREE*EW ) >*/
+ t = coef5 * (ewc - ew * 3.);
+/*< TC = COEF5*( EW-THREE*EWC ) >*/
+ tc = coef5 * (ew - ewc * 3.);
+
+/*< CALL DSCAL( NR, BETA, WORK( ILO ), 1 ) >*/
+ dscal_(&nr, &beta, &work[*ilo], &c__1);
+/*< CALL DSCAL( NR, BETA, WORK( ILO+N ), 1 ) >*/
+ dscal_(&nr, &beta, &work[*ilo + *n], &c__1);
+
+/*< CALL DAXPY( NR, COEF, WORK( ILO+4*N ), 1, WORK( ILO+N ), 1 ) >*/
+ daxpy_(&nr, &coef, &work[*ilo + (*n << 2)], &c__1, &work[*ilo + *n], &
+ c__1);
+/*< CALL DAXPY( NR, COEF, WORK( ILO+5*N ), 1, WORK( ILO ), 1 ) >*/
+ daxpy_(&nr, &coef, &work[*ilo + *n * 5], &c__1, &work[*ilo], &c__1);
+
+/*< DO 270 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< WORK( I ) = WORK( I ) + TC >*/
+ work[i__] += tc;
+/*< WORK( I+N ) = WORK( I+N ) + T >*/
+ work[i__ + *n] += t;
+/*< 270 CONTINUE >*/
+/* L270: */
+ }
+
+/* Apply matrix to vector */
+
+/*< DO 300 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< KOUNT = 0 >*/
+ kount = 0;
+/*< SUM = ZERO >*/
+ sum = 0.;
+/*< DO 290 J = ILO, IHI >*/
+ i__2 = *ihi;
+ for (j = *ilo; j <= i__2; ++j) {
+/*< >*/
+ i__3 = i__ + j * a_dim1;
+ if (a[i__3].r == 0. && a[i__3].i == 0.) {
+ goto L280;
+ }
+/*< KOUNT = KOUNT + 1 >*/
+ ++kount;
+/*< SUM = SUM + WORK( J ) >*/
+ sum += work[j];
+/*< 280 CONTINUE >*/
+L280:
+/*< >*/
+ i__3 = i__ + j * b_dim1;
+ if (b[i__3].r == 0. && b[i__3].i == 0.) {
+ goto L290;
+ }
+/*< KOUNT = KOUNT + 1 >*/
+ ++kount;
+/*< SUM = SUM + WORK( J ) >*/
+ sum += work[j];
+/*< 290 CONTINUE >*/
+L290:
+ ;
+ }
+/*< WORK( I+2*N ) = DBLE( KOUNT )*WORK( I+N ) + SUM >*/
+ work[i__ + (*n << 1)] = (doublereal) kount * work[i__ + *n] + sum;
+/*< 300 CONTINUE >*/
+/* L300: */
+ }
+
+/*< DO 330 J = ILO, IHI >*/
+ i__1 = *ihi;
+ for (j = *ilo; j <= i__1; ++j) {
+/*< KOUNT = 0 >*/
+ kount = 0;
+/*< SUM = ZERO >*/
+ sum = 0.;
+/*< DO 320 I = ILO, IHI >*/
+ i__2 = *ihi;
+ for (i__ = *ilo; i__ <= i__2; ++i__) {
+/*< >*/
+ i__3 = i__ + j * a_dim1;
+ if (a[i__3].r == 0. && a[i__3].i == 0.) {
+ goto L310;
+ }
+/*< KOUNT = KOUNT + 1 >*/
+ ++kount;
+/*< SUM = SUM + WORK( I+N ) >*/
+ sum += work[i__ + *n];
+/*< 310 CONTINUE >*/
+L310:
+/*< >*/
+ i__3 = i__ + j * b_dim1;
+ if (b[i__3].r == 0. && b[i__3].i == 0.) {
+ goto L320;
+ }
+/*< KOUNT = KOUNT + 1 >*/
+ ++kount;
+/*< SUM = SUM + WORK( I+N ) >*/
+ sum += work[i__ + *n];
+/*< 320 CONTINUE >*/
+L320:
+ ;
+ }
+/*< WORK( J+3*N ) = DBLE( KOUNT )*WORK( J ) + SUM >*/
+ work[j + *n * 3] = (doublereal) kount * work[j] + sum;
+/*< 330 CONTINUE >*/
+/* L330: */
+ }
+
+/*< >*/
+ sum = ddot_(&nr, &work[*ilo + *n], &c__1, &work[*ilo + (*n << 1)], &c__1)
+ + ddot_(&nr, &work[*ilo], &c__1, &work[*ilo + *n * 3], &c__1);
+/*< ALPHA = GAMMA / SUM >*/
+ alpha = gamma / sum;
+
+/* Determine correction to current iteration */
+
+/*< CMAX = ZERO >*/
+ cmax = 0.;
+/*< DO 340 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< COR = ALPHA*WORK( I+N ) >*/
+ cor = alpha * work[i__ + *n];
+/*< >*/
+ if (abs(cor) > cmax) {
+ cmax = abs(cor);
+ }
+/*< LSCALE( I ) = LSCALE( I ) + COR >*/
+ lscale[i__] += cor;
+/*< COR = ALPHA*WORK( I ) >*/
+ cor = alpha * work[i__];
+/*< >*/
+ if (abs(cor) > cmax) {
+ cmax = abs(cor);
+ }
+/*< RSCALE( I ) = RSCALE( I ) + COR >*/
+ rscale[i__] += cor;
+/*< 340 CONTINUE >*/
+/* L340: */
+ }
+/*< >*/
+ if (cmax < .5) {
+ goto L350;
+ }
+
+/*< CALL DAXPY( NR, -ALPHA, WORK( ILO+2*N ), 1, WORK( ILO+4*N ), 1 ) >*/
+ d__1 = -alpha;
+ daxpy_(&nr, &d__1, &work[*ilo + (*n << 1)], &c__1, &work[*ilo + (*n << 2)]
+ , &c__1);
+/*< CALL DAXPY( NR, -ALPHA, WORK( ILO+3*N ), 1, WORK( ILO+5*N ), 1 ) >*/
+ d__1 = -alpha;
+ daxpy_(&nr, &d__1, &work[*ilo + *n * 3], &c__1, &work[*ilo + *n * 5], &
+ c__1);
+
+/*< PGAMMA = GAMMA >*/
+ pgamma = gamma;
+/*< IT = IT + 1 >*/
+ ++it;
+/*< >*/
+ if (it <= nrp2) {
+ goto L250;
+ }
+
+/* End generalized conjugate gradient iteration */
+
+/*< 350 CONTINUE >*/
+L350:
+/*< SFMIN = DLAMCH( 'S' ) >*/
+ sfmin = dlamch_("S", (ftnlen)1);
+/*< SFMAX = ONE / SFMIN >*/
+ sfmax = 1. / sfmin;
+/*< LSFMIN = INT( LOG10( SFMIN ) / BASL+ONE ) >*/
+ lsfmin = (integer) (d_lg10(&sfmin) / basl + 1.);
+/*< LSFMAX = INT( LOG10( SFMAX ) / BASL ) >*/
+ lsfmax = (integer) (d_lg10(&sfmax) / basl);
+/*< DO 360 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< IRAB = IZAMAX( N-ILO+1, A( I, ILO ), LDA ) >*/
+ i__2 = *n - *ilo + 1;
+ irab = izamax_(&i__2, &a[i__ + *ilo * a_dim1], lda);
+/*< RAB = ABS( A( I, IRAB+ILO-1 ) ) >*/
+ rab = z_abs(&a[i__ + (irab + *ilo - 1) * a_dim1]);
+/*< IRAB = IZAMAX( N-ILO+1, B( I, ILO ), LDB ) >*/
+ i__2 = *n - *ilo + 1;
+ irab = izamax_(&i__2, &b[i__ + *ilo * b_dim1], ldb);
+/*< RAB = MAX( RAB, ABS( B( I, IRAB+ILO-1 ) ) ) >*/
+/* Computing MAX */
+ d__1 = rab, d__2 = z_abs(&b[i__ + (irab + *ilo - 1) * b_dim1]);
+ rab = max(d__1,d__2);
+/*< LRAB = INT( LOG10( RAB+SFMIN ) / BASL+ONE ) >*/
+ d__1 = rab + sfmin;
+ lrab = (integer) (d_lg10(&d__1) / basl + 1.);
+/*< IR = LSCALE( I ) + SIGN( HALF, LSCALE( I ) ) >*/
+ ir = (integer) (lscale[i__] + d_sign(&c_b72, &lscale[i__]));
+/*< IR = MIN( MAX( IR, LSFMIN ), LSFMAX, LSFMAX-LRAB ) >*/
+/* Computing MIN */
+ i__2 = max(ir,lsfmin), i__2 = min(i__2,lsfmax), i__3 = lsfmax - lrab;
+ ir = min(i__2,i__3);
+/*< LSCALE( I ) = SCLFAC**IR >*/
+ lscale[i__] = pow_di(&c_b36, &ir);
+/*< ICAB = IZAMAX( IHI, A( 1, I ), 1 ) >*/
+ icab = izamax_(ihi, &a[i__ * a_dim1 + 1], &c__1);
+/*< CAB = ABS( A( ICAB, I ) ) >*/
+ cab = z_abs(&a[icab + i__ * a_dim1]);
+/*< ICAB = IZAMAX( IHI, B( 1, I ), 1 ) >*/
+ icab = izamax_(ihi, &b[i__ * b_dim1 + 1], &c__1);
+/*< CAB = MAX( CAB, ABS( B( ICAB, I ) ) ) >*/
+/* Computing MAX */
+ d__1 = cab, d__2 = z_abs(&b[icab + i__ * b_dim1]);
+ cab = max(d__1,d__2);
+/*< LCAB = INT( LOG10( CAB+SFMIN ) / BASL+ONE ) >*/
+ d__1 = cab + sfmin;
+ lcab = (integer) (d_lg10(&d__1) / basl + 1.);
+/*< JC = RSCALE( I ) + SIGN( HALF, RSCALE( I ) ) >*/
+ jc = (integer) (rscale[i__] + d_sign(&c_b72, &rscale[i__]));
+/*< JC = MIN( MAX( JC, LSFMIN ), LSFMAX, LSFMAX-LCAB ) >*/
+/* Computing MIN */
+ i__2 = max(jc,lsfmin), i__2 = min(i__2,lsfmax), i__3 = lsfmax - lcab;
+ jc = min(i__2,i__3);
+/*< RSCALE( I ) = SCLFAC**JC >*/
+ rscale[i__] = pow_di(&c_b36, &jc);
+/*< 360 CONTINUE >*/
+/* L360: */
+ }
+
+/* Row scaling of matrices A and B */
+
+/*< DO 370 I = ILO, IHI >*/
+ i__1 = *ihi;
+ for (i__ = *ilo; i__ <= i__1; ++i__) {
+/*< CALL ZDSCAL( N-ILO+1, LSCALE( I ), A( I, ILO ), LDA ) >*/
+ i__2 = *n - *ilo + 1;
+ zdscal_(&i__2, &lscale[i__], &a[i__ + *ilo * a_dim1], lda);
+/*< CALL ZDSCAL( N-ILO+1, LSCALE( I ), B( I, ILO ), LDB ) >*/
+ i__2 = *n - *ilo + 1;
+ zdscal_(&i__2, &lscale[i__], &b[i__ + *ilo * b_dim1], ldb);
+/*< 370 CONTINUE >*/
+/* L370: */
+ }
+
+/* Column scaling of matrices A and B */
+
+/*< DO 380 J = ILO, IHI >*/
+ i__1 = *ihi;
+ for (j = *ilo; j <= i__1; ++j) {
+/*< CALL ZDSCAL( IHI, RSCALE( J ), A( 1, J ), 1 ) >*/
+ zdscal_(ihi, &rscale[j], &a[j * a_dim1 + 1], &c__1);
+/*< CALL ZDSCAL( IHI, RSCALE( J ), B( 1, J ), 1 ) >*/
+ zdscal_(ihi, &rscale[j], &b[j * b_dim1 + 1], &c__1);
+/*< 380 CONTINUE >*/
+/* L380: */
+ }
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGGBAL */
+
+/*< END >*/
+} /* zggbal_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.f
new file mode 100644
index 0000000000000000000000000000000000000000..0ac779780666ed4c0ac2eb6d601b77bfdf475dd3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.f
@@ -0,0 +1,483 @@
+ SUBROUTINE ZGGBAL( JOB, N, A, LDA, B, LDB, ILO, IHI, LSCALE,
+ $ RSCALE, WORK, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER JOB
+ INTEGER IHI, ILO, INFO, LDA, LDB, N
+* ..
+* .. Array Arguments ..
+ DOUBLE PRECISION LSCALE( * ), RSCALE( * ), WORK( * )
+ COMPLEX*16 A( LDA, * ), B( LDB, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZGGBAL balances a pair of general complex matrices (A,B). This
+* involves, first, permuting A and B by similarity transformations to
+* isolate eigenvalues in the first 1 to ILO$-$1 and last IHI+1 to N
+* elements on the diagonal; and second, applying a diagonal similarity
+* transformation to rows and columns ILO to IHI to make the rows
+* and columns as close in norm as possible. Both steps are optional.
+*
+* Balancing may reduce the 1-norm of the matrices, and improve the
+* accuracy of the computed eigenvalues and/or eigenvectors in the
+* generalized eigenvalue problem A*x = lambda*B*x.
+*
+* Arguments
+* =========
+*
+* JOB (input) CHARACTER*1
+* Specifies the operations to be performed on A and B:
+* = 'N': none: simply set ILO = 1, IHI = N, LSCALE(I) = 1.0
+* and RSCALE(I) = 1.0 for i=1,...,N;
+* = 'P': permute only;
+* = 'S': scale only;
+* = 'B': both permute and scale.
+*
+* N (input) INTEGER
+* The order of the matrices A and B. N >= 0.
+*
+* A (input/output) COMPLEX*16 array, dimension (LDA,N)
+* On entry, the input matrix A.
+* On exit, A is overwritten by the balanced matrix.
+* If JOB = 'N', A is not referenced.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,N).
+*
+* B (input/output) COMPLEX*16 array, dimension (LDB,N)
+* On entry, the input matrix B.
+* On exit, B is overwritten by the balanced matrix.
+* If JOB = 'N', B is not referenced.
+*
+* LDB (input) INTEGER
+* The leading dimension of the array B. LDB >= max(1,N).
+*
+* ILO (output) INTEGER
+* IHI (output) INTEGER
+* ILO and IHI are set to integers such that on exit
+* A(i,j) = 0 and B(i,j) = 0 if i > j and
+* j = 1,...,ILO-1 or i = IHI+1,...,N.
+* If JOB = 'N' or 'S', ILO = 1 and IHI = N.
+*
+* LSCALE (output) DOUBLE PRECISION array, dimension (N)
+* Details of the permutations and scaling factors applied
+* to the left side of A and B. If P(j) is the index of the
+* row interchanged with row j, and D(j) is the scaling factor
+* applied to row j, then
+* LSCALE(j) = P(j) for J = 1,...,ILO-1
+* = D(j) for J = ILO,...,IHI
+* = P(j) for J = IHI+1,...,N.
+* The order in which the interchanges are made is N to IHI+1,
+* then 1 to ILO-1.
+*
+* RSCALE (output) DOUBLE PRECISION array, dimension (N)
+* Details of the permutations and scaling factors applied
+* to the right side of A and B. If P(j) is the index of the
+* column interchanged with column j, and D(j) is the scaling
+* factor applied to column j, then
+* RSCALE(j) = P(j) for J = 1,...,ILO-1
+* = D(j) for J = ILO,...,IHI
+* = P(j) for J = IHI+1,...,N.
+* The order in which the interchanges are made is N to IHI+1,
+* then 1 to ILO-1.
+*
+* WORK (workspace) REAL array, dimension (lwork)
+* lwork must be at least max(1,6*N) when JOB = 'S' or 'B', and
+* at least 1 when JOB = 'N' or 'P'.
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value.
+*
+* Further Details
+* ===============
+*
+* See R.C. WARD, Balancing the generalized eigenvalue problem,
+* SIAM J. Sci. Stat. Comp. 2 (1981), 141-152.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ZERO, HALF, ONE
+ PARAMETER ( ZERO = 0.0D+0, HALF = 0.5D+0, ONE = 1.0D+0 )
+ DOUBLE PRECISION THREE, SCLFAC
+ PARAMETER ( THREE = 3.0D+0, SCLFAC = 1.0D+1 )
+ COMPLEX*16 CZERO
+ PARAMETER ( CZERO = ( 0.0D+0, 0.0D+0 ) )
+* ..
+* .. Local Scalars ..
+ INTEGER I, ICAB, IFLOW, IP1, IR, IRAB, IT, J, JC, JP1,
+ $ K, KOUNT, L, LCAB, LM1, LRAB, LSFMAX, LSFMIN,
+ $ M, NR, NRP2
+ DOUBLE PRECISION ALPHA, BASL, BETA, CAB, CMAX, COEF, COEF2,
+ $ COEF5, COR, EW, EWC, GAMMA, PGAMMA, RAB, SFMAX,
+ $ SFMIN, SUM, T, TA, TB, TC
+ COMPLEX*16 CDUM
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ INTEGER IZAMAX
+ DOUBLE PRECISION DDOT, DLAMCH
+ EXTERNAL LSAME, IZAMAX, DDOT, DLAMCH
+* ..
+* .. External Subroutines ..
+ EXTERNAL DAXPY, DSCAL, XERBLA, ZDSCAL, ZSWAP
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DBLE, DIMAG, INT, LOG10, MAX, MIN, SIGN
+* ..
+* .. Statement Functions ..
+ DOUBLE PRECISION CABS1
+* ..
+* .. Statement Function definitions ..
+ CABS1( CDUM ) = ABS( DBLE( CDUM ) ) + ABS( DIMAG( CDUM ) )
+* ..
+* .. Executable Statements ..
+*
+* Test the input parameters
+*
+ INFO = 0
+ IF( .NOT.LSAME( JOB, 'N' ) .AND. .NOT.LSAME( JOB, 'P' ) .AND.
+ $ .NOT.LSAME( JOB, 'S' ) .AND. .NOT.LSAME( JOB, 'B' ) ) THEN
+ INFO = -1
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -2
+ ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
+ INFO = -4
+ ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
+ INFO = -6
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZGGBAL', -INFO )
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( N.EQ.0 ) THEN
+ ILO = 1
+ IHI = N
+ RETURN
+ END IF
+*
+ IF( N.EQ.1 ) THEN
+ ILO = 1
+ IHI = N
+ LSCALE( 1 ) = ONE
+ RSCALE( 1 ) = ONE
+ RETURN
+ END IF
+*
+ IF( LSAME( JOB, 'N' ) ) THEN
+ ILO = 1
+ IHI = N
+ DO 10 I = 1, N
+ LSCALE( I ) = ONE
+ RSCALE( I ) = ONE
+ 10 CONTINUE
+ RETURN
+ END IF
+*
+ K = 1
+ L = N
+ IF( LSAME( JOB, 'S' ) )
+ $ GO TO 190
+*
+ GO TO 30
+*
+* Permute the matrices A and B to isolate the eigenvalues.
+*
+* Find row with one nonzero in columns 1 through L
+*
+ 20 CONTINUE
+ L = LM1
+ IF( L.NE.1 )
+ $ GO TO 30
+*
+ RSCALE( 1 ) = 1
+ LSCALE( 1 ) = 1
+ GO TO 190
+*
+ 30 CONTINUE
+ LM1 = L - 1
+ DO 80 I = L, 1, -1
+ DO 40 J = 1, LM1
+ JP1 = J + 1
+ IF( A( I, J ).NE.CZERO .OR. B( I, J ).NE.CZERO )
+ $ GO TO 50
+ 40 CONTINUE
+ J = L
+ GO TO 70
+*
+ 50 CONTINUE
+ DO 60 J = JP1, L
+ IF( A( I, J ).NE.CZERO .OR. B( I, J ).NE.CZERO )
+ $ GO TO 80
+ 60 CONTINUE
+ J = JP1 - 1
+*
+ 70 CONTINUE
+ M = L
+ IFLOW = 1
+ GO TO 160
+ 80 CONTINUE
+ GO TO 100
+*
+* Find column with one nonzero in rows K through N
+*
+ 90 CONTINUE
+ K = K + 1
+*
+ 100 CONTINUE
+ DO 150 J = K, L
+ DO 110 I = K, LM1
+ IP1 = I + 1
+ IF( A( I, J ).NE.CZERO .OR. B( I, J ).NE.CZERO )
+ $ GO TO 120
+ 110 CONTINUE
+ I = L
+ GO TO 140
+ 120 CONTINUE
+ DO 130 I = IP1, L
+ IF( A( I, J ).NE.CZERO .OR. B( I, J ).NE.CZERO )
+ $ GO TO 150
+ 130 CONTINUE
+ I = IP1 - 1
+ 140 CONTINUE
+ M = K
+ IFLOW = 2
+ GO TO 160
+ 150 CONTINUE
+ GO TO 190
+*
+* Permute rows M and I
+*
+ 160 CONTINUE
+ LSCALE( M ) = I
+ IF( I.EQ.M )
+ $ GO TO 170
+ CALL ZSWAP( N-K+1, A( I, K ), LDA, A( M, K ), LDA )
+ CALL ZSWAP( N-K+1, B( I, K ), LDB, B( M, K ), LDB )
+*
+* Permute columns M and J
+*
+ 170 CONTINUE
+ RSCALE( M ) = J
+ IF( J.EQ.M )
+ $ GO TO 180
+ CALL ZSWAP( L, A( 1, J ), 1, A( 1, M ), 1 )
+ CALL ZSWAP( L, B( 1, J ), 1, B( 1, M ), 1 )
+*
+ 180 CONTINUE
+ GO TO ( 20, 90 )IFLOW
+*
+ 190 CONTINUE
+ ILO = K
+ IHI = L
+*
+ IF( LSAME( JOB, 'P' ) ) THEN
+ DO 195 I = ILO, IHI
+ LSCALE( I ) = ONE
+ RSCALE( I ) = ONE
+ 195 CONTINUE
+ RETURN
+ END IF
+*
+ IF( ILO.EQ.IHI )
+ $ RETURN
+*
+* Balance the submatrix in rows ILO to IHI.
+*
+ NR = IHI - ILO + 1
+ DO 200 I = ILO, IHI
+ RSCALE( I ) = ZERO
+ LSCALE( I ) = ZERO
+*
+ WORK( I ) = ZERO
+ WORK( I+N ) = ZERO
+ WORK( I+2*N ) = ZERO
+ WORK( I+3*N ) = ZERO
+ WORK( I+4*N ) = ZERO
+ WORK( I+5*N ) = ZERO
+ 200 CONTINUE
+*
+* Compute right side vector in resulting linear equations
+*
+ BASL = LOG10( SCLFAC )
+ DO 240 I = ILO, IHI
+ DO 230 J = ILO, IHI
+ IF( A( I, J ).EQ.CZERO ) THEN
+ TA = ZERO
+ GO TO 210
+ END IF
+ TA = LOG10( CABS1( A( I, J ) ) ) / BASL
+*
+ 210 CONTINUE
+ IF( B( I, J ).EQ.CZERO ) THEN
+ TB = ZERO
+ GO TO 220
+ END IF
+ TB = LOG10( CABS1( B( I, J ) ) ) / BASL
+*
+ 220 CONTINUE
+ WORK( I+4*N ) = WORK( I+4*N ) - TA - TB
+ WORK( J+5*N ) = WORK( J+5*N ) - TA - TB
+ 230 CONTINUE
+ 240 CONTINUE
+*
+ COEF = ONE / DBLE( 2*NR )
+ COEF2 = COEF*COEF
+ COEF5 = HALF*COEF2
+ NRP2 = NR + 2
+ BETA = ZERO
+ IT = 1
+*
+* Start generalized conjugate gradient iteration
+*
+ 250 CONTINUE
+*
+ GAMMA = DDOT( NR, WORK( ILO+4*N ), 1, WORK( ILO+4*N ), 1 ) +
+ $ DDOT( NR, WORK( ILO+5*N ), 1, WORK( ILO+5*N ), 1 )
+*
+ EW = ZERO
+ EWC = ZERO
+ DO 260 I = ILO, IHI
+ EW = EW + WORK( I+4*N )
+ EWC = EWC + WORK( I+5*N )
+ 260 CONTINUE
+*
+ GAMMA = COEF*GAMMA - COEF2*( EW**2+EWC**2 ) - COEF5*( EW-EWC )**2
+ IF( GAMMA.EQ.ZERO )
+ $ GO TO 350
+ IF( IT.NE.1 )
+ $ BETA = GAMMA / PGAMMA
+ T = COEF5*( EWC-THREE*EW )
+ TC = COEF5*( EW-THREE*EWC )
+*
+ CALL DSCAL( NR, BETA, WORK( ILO ), 1 )
+ CALL DSCAL( NR, BETA, WORK( ILO+N ), 1 )
+*
+ CALL DAXPY( NR, COEF, WORK( ILO+4*N ), 1, WORK( ILO+N ), 1 )
+ CALL DAXPY( NR, COEF, WORK( ILO+5*N ), 1, WORK( ILO ), 1 )
+*
+ DO 270 I = ILO, IHI
+ WORK( I ) = WORK( I ) + TC
+ WORK( I+N ) = WORK( I+N ) + T
+ 270 CONTINUE
+*
+* Apply matrix to vector
+*
+ DO 300 I = ILO, IHI
+ KOUNT = 0
+ SUM = ZERO
+ DO 290 J = ILO, IHI
+ IF( A( I, J ).EQ.CZERO )
+ $ GO TO 280
+ KOUNT = KOUNT + 1
+ SUM = SUM + WORK( J )
+ 280 CONTINUE
+ IF( B( I, J ).EQ.CZERO )
+ $ GO TO 290
+ KOUNT = KOUNT + 1
+ SUM = SUM + WORK( J )
+ 290 CONTINUE
+ WORK( I+2*N ) = DBLE( KOUNT )*WORK( I+N ) + SUM
+ 300 CONTINUE
+*
+ DO 330 J = ILO, IHI
+ KOUNT = 0
+ SUM = ZERO
+ DO 320 I = ILO, IHI
+ IF( A( I, J ).EQ.CZERO )
+ $ GO TO 310
+ KOUNT = KOUNT + 1
+ SUM = SUM + WORK( I+N )
+ 310 CONTINUE
+ IF( B( I, J ).EQ.CZERO )
+ $ GO TO 320
+ KOUNT = KOUNT + 1
+ SUM = SUM + WORK( I+N )
+ 320 CONTINUE
+ WORK( J+3*N ) = DBLE( KOUNT )*WORK( J ) + SUM
+ 330 CONTINUE
+*
+ SUM = DDOT( NR, WORK( ILO+N ), 1, WORK( ILO+2*N ), 1 ) +
+ $ DDOT( NR, WORK( ILO ), 1, WORK( ILO+3*N ), 1 )
+ ALPHA = GAMMA / SUM
+*
+* Determine correction to current iteration
+*
+ CMAX = ZERO
+ DO 340 I = ILO, IHI
+ COR = ALPHA*WORK( I+N )
+ IF( ABS( COR ).GT.CMAX )
+ $ CMAX = ABS( COR )
+ LSCALE( I ) = LSCALE( I ) + COR
+ COR = ALPHA*WORK( I )
+ IF( ABS( COR ).GT.CMAX )
+ $ CMAX = ABS( COR )
+ RSCALE( I ) = RSCALE( I ) + COR
+ 340 CONTINUE
+ IF( CMAX.LT.HALF )
+ $ GO TO 350
+*
+ CALL DAXPY( NR, -ALPHA, WORK( ILO+2*N ), 1, WORK( ILO+4*N ), 1 )
+ CALL DAXPY( NR, -ALPHA, WORK( ILO+3*N ), 1, WORK( ILO+5*N ), 1 )
+*
+ PGAMMA = GAMMA
+ IT = IT + 1
+ IF( IT.LE.NRP2 )
+ $ GO TO 250
+*
+* End generalized conjugate gradient iteration
+*
+ 350 CONTINUE
+ SFMIN = DLAMCH( 'S' )
+ SFMAX = ONE / SFMIN
+ LSFMIN = INT( LOG10( SFMIN ) / BASL+ONE )
+ LSFMAX = INT( LOG10( SFMAX ) / BASL )
+ DO 360 I = ILO, IHI
+ IRAB = IZAMAX( N-ILO+1, A( I, ILO ), LDA )
+ RAB = ABS( A( I, IRAB+ILO-1 ) )
+ IRAB = IZAMAX( N-ILO+1, B( I, ILO ), LDB )
+ RAB = MAX( RAB, ABS( B( I, IRAB+ILO-1 ) ) )
+ LRAB = INT( LOG10( RAB+SFMIN ) / BASL+ONE )
+ IR = LSCALE( I ) + SIGN( HALF, LSCALE( I ) )
+ IR = MIN( MAX( IR, LSFMIN ), LSFMAX, LSFMAX-LRAB )
+ LSCALE( I ) = SCLFAC**IR
+ ICAB = IZAMAX( IHI, A( 1, I ), 1 )
+ CAB = ABS( A( ICAB, I ) )
+ ICAB = IZAMAX( IHI, B( 1, I ), 1 )
+ CAB = MAX( CAB, ABS( B( ICAB, I ) ) )
+ LCAB = INT( LOG10( CAB+SFMIN ) / BASL+ONE )
+ JC = RSCALE( I ) + SIGN( HALF, RSCALE( I ) )
+ JC = MIN( MAX( JC, LSFMIN ), LSFMAX, LSFMAX-LCAB )
+ RSCALE( I ) = SCLFAC**JC
+ 360 CONTINUE
+*
+* Row scaling of matrices A and B
+*
+ DO 370 I = ILO, IHI
+ CALL ZDSCAL( N-ILO+1, LSCALE( I ), A( I, ILO ), LDA )
+ CALL ZDSCAL( N-ILO+1, LSCALE( I ), B( I, ILO ), LDB )
+ 370 CONTINUE
+*
+* Column scaling of matrices A and B
+*
+ DO 380 J = ILO, IHI
+ CALL ZDSCAL( IHI, RSCALE( J ), A( 1, J ), 1 )
+ CALL ZDSCAL( IHI, RSCALE( J ), B( 1, J ), 1 )
+ 380 CONTINUE
+*
+ RETURN
+*
+* End of ZGGBAL
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.h
new file mode 100644
index 0000000000000000000000000000000000000000..8d07b9952b252809c45cb0d284af7f55600ce039
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zggbal.h
@@ -0,0 +1,15 @@
+extern int v3p_netlib_zggbal_(
+ char *job,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *b,
+ v3p_netlib_integer *ldb,
+ v3p_netlib_integer *ilo,
+ v3p_netlib_integer *ihi,
+ v3p_netlib_doublereal *lscale,
+ v3p_netlib_doublereal *rscale,
+ v3p_netlib_doublereal *work,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen job_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.P
new file mode 100644
index 0000000000000000000000000000000000000000..aaa48df186f8969bfd5ace0547ea66eda77de00a
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.P
@@ -0,0 +1,18 @@
+extern int zgges_(char *jobvsl, char *jobvsr, char *sort, L_fp selctg, integer *n, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb, integer *sdim, doublecomplex *alpha, doublecomplex *beta, doublecomplex *vsl, integer *ldvsl, doublecomplex *vsr, integer *ldvsr, doublecomplex *work, integer *lwork, doublereal *rwork, logical *bwork, integer *info, ftnlen jobvsl_len, ftnlen jobvsr_len, ftnlen sort_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: ilaenv_ 4 9 4 13 13 4 4 4 4 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dlabad_ 14 2 7 7 */
+/*:ref: zlange_ 7 7 13 4 4 9 4 7 124 */
+/*:ref: zlascl_ 14 11 13 4 4 7 7 4 4 9 4 4 124 */
+/*:ref: zggbal_ 14 13 13 4 9 4 9 4 4 4 7 7 7 4 124 */
+/*:ref: zgeqrf_ 14 8 4 4 9 4 9 9 4 4 */
+/*:ref: zunmqr_ 14 15 13 13 4 4 4 9 4 9 9 4 9 4 4 124 124 */
+/*:ref: zlaset_ 14 8 13 4 4 9 9 9 4 124 */
+/*:ref: zlacpy_ 14 8 13 4 4 9 4 9 4 124 */
+/*:ref: zungqr_ 14 9 4 4 4 9 4 9 9 4 4 */
+/*:ref: zgghrd_ 14 16 13 13 4 4 4 9 4 9 4 9 4 9 4 4 124 124 */
+/*:ref: zhgeqz_ 14 23 13 13 13 4 4 4 9 4 9 4 9 9 9 4 9 4 9 4 7 4 124 124 124 */
+/*:ref: ztgsen_ 14 24 4 12 12 12 4 9 4 9 4 9 9 9 4 9 4 4 7 7 7 9 4 4 4 4 */
+/*:ref: zggbak_ 14 13 13 13 4 4 4 7 7 4 9 4 4 124 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.c
new file mode 100644
index 0000000000000000000000000000000000000000..e9da865adafce0a444471cffd5457b25d3475291
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.c
@@ -0,0 +1,795 @@
+/* lapack/complex16/zgges.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static doublecomplex c_b1 = {0.,0.};
+static doublecomplex c_b2 = {1.,0.};
+static integer c__1 = 1;
+static integer c__0 = 0;
+static integer c_n1 = -1;
+
+/*< >*/
+/* Subroutine */ int zgges_(char *jobvsl, char *jobvsr, char *sort,
+ logical (*selctg)(doublecomplex*,doublecomplex*),
+ integer *n, doublecomplex *a, integer *lda, doublecomplex *b,
+ integer *ldb, integer *sdim, doublecomplex *alpha, doublecomplex *
+ beta, doublecomplex *vsl, integer *ldvsl, doublecomplex *vsr, integer
+ *ldvsr, doublecomplex *work, integer *lwork, doublereal *rwork,
+ logical *bwork, integer *info, ftnlen jobvsl_len, ftnlen jobvsr_len,
+ ftnlen sort_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, b_dim1, b_offset, vsl_dim1, vsl_offset,
+ vsr_dim1, vsr_offset, i__1, i__2;
+
+ /* Builtin functions */
+ double sqrt(doublereal);
+
+ /* Local variables */
+ integer i__;
+ doublereal dif[2];
+ integer ihi, ilo;
+ doublereal eps, anrm, bnrm;
+ integer idum[1], ierr, itau, iwrk;
+ doublereal pvsl, pvsr;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ integer ileft, icols;
+ logical cursl, ilvsl, ilvsr;
+ integer irwrk, irows;
+ extern /* Subroutine */ int dlabad_(doublereal *, doublereal *);
+ extern doublereal dlamch_(char *, ftnlen);
+ extern /* Subroutine */ int zggbak_(char *, char *, integer *, integer *,
+ integer *, doublereal *, doublereal *, integer *, doublecomplex *,
+ integer *, integer *, ftnlen, ftnlen), zggbal_(char *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *, integer *
+ , integer *, doublereal *, doublereal *, doublereal *, integer *,
+ ftnlen);
+ logical ilascl, ilbscl;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+ extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
+ integer *, integer *, ftnlen, ftnlen);
+ extern doublereal zlange_(char *, integer *, integer *, doublecomplex *,
+ integer *, doublereal *, ftnlen);
+ doublereal bignum;
+ integer ijobvl, iright;
+ extern /* Subroutine */ int zgghrd_(char *, char *, integer *, integer *,
+ integer *, doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *, integer *
+ , ftnlen, ftnlen), zlascl_(char *, integer *, integer *,
+ doublereal *, doublereal *, integer *, integer *, doublecomplex *,
+ integer *, integer *, ftnlen);
+ integer ijobvr;
+ extern /* Subroutine */ int zgeqrf_(integer *, integer *, doublecomplex *,
+ integer *, doublecomplex *, doublecomplex *, integer *, integer *
+ );
+ doublereal anrmto;
+ integer lwkmin;
+ logical lastsl;
+ doublereal bnrmto;
+ extern /* Subroutine */ int zlacpy_(char *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *, ftnlen),
+ zlaset_(char *, integer *, integer *, doublecomplex *,
+ doublecomplex *, doublecomplex *, integer *, ftnlen), zhgeqz_(
+ char *, char *, char *, integer *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, doublecomplex *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublereal *, integer *, ftnlen, ftnlen, ftnlen), ztgsen_(integer
+ *, logical *, logical *, logical *, integer *, doublecomplex *,
+ integer *, doublecomplex *, integer *, doublecomplex *,
+ doublecomplex *, doublecomplex *, integer *, doublecomplex *,
+ integer *, integer *, doublereal *, doublereal *, doublereal *,
+ doublecomplex *, integer *, integer *, integer *, integer *);
+ doublereal smlnum;
+ logical wantst, lquery;
+ integer lwkopt;
+ extern /* Subroutine */ int zungqr_(integer *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, doublecomplex *,
+ integer *, integer *), zunmqr_(char *, char *, integer *, integer
+ *, integer *, doublecomplex *, integer *, doublecomplex *,
+ doublecomplex *, integer *, doublecomplex *, integer *, integer *,
+ ftnlen, ftnlen);
+ (void)jobvsl_len;
+ (void)jobvsr_len;
+ (void)sort_len;
+
+/* -- LAPACK driver routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER JOBVSL, JOBVSR, SORT >*/
+/*< INTEGER INFO, LDA, LDB, LDVSL, LDVSR, LWORK, N, SDIM >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< LOGICAL BWORK( * ) >*/
+/*< DOUBLE PRECISION RWORK( * ) >*/
+/*< >*/
+/* .. */
+/* .. Function Arguments .. */
+/*< LOGICAL SELCTG >*/
+/*< EXTERNAL SELCTG >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGGES computes for a pair of N-by-N complex nonsymmetric matrices */
+/* (A,B), the generalized eigenvalues, the generalized complex Schur */
+/* form (S, T), and optionally left and/or right Schur vectors (VSL */
+/* and VSR). This gives the generalized Schur factorization */
+
+/* (A,B) = ( (VSL)*S*(VSR)**H, (VSL)*T*(VSR)**H ) */
+
+/* where (VSR)**H is the conjugate-transpose of VSR. */
+
+/* Optionally, it also orders the eigenvalues so that a selected cluster */
+/* of eigenvalues appears in the leading diagonal blocks of the upper */
+/* triangular matrix S and the upper triangular matrix T. The leading */
+/* columns of VSL and VSR then form an unitary basis for the */
+/* corresponding left and right eigenspaces (deflating subspaces). */
+
+/* (If only the generalized eigenvalues are needed, use the driver */
+/* ZGGEV instead, which is faster.) */
+
+/* A generalized eigenvalue for a pair of matrices (A,B) is a scalar w */
+/* or a ratio alpha/beta = w, such that A - w*B is singular. It is */
+/* usually represented as the pair (alpha,beta), as there is a */
+/* reasonable interpretation for beta=0, and even for both being zero. */
+
+/* A pair of matrices (S,T) is in generalized complex Schur form if S */
+/* and T are upper triangular and, in addition, the diagonal elements */
+/* of T are non-negative real numbers. */
+
+/* Arguments */
+/* ========= */
+
+/* JOBVSL (input) CHARACTER*1 */
+/* = 'N': do not compute the left Schur vectors; */
+/* = 'V': compute the left Schur vectors. */
+
+/* JOBVSR (input) CHARACTER*1 */
+/* = 'N': do not compute the right Schur vectors; */
+/* = 'V': compute the right Schur vectors. */
+
+/* SORT (input) CHARACTER*1 */
+/* Specifies whether or not to order the eigenvalues on the */
+/* diagonal of the generalized Schur form. */
+/* = 'N': Eigenvalues are not ordered; */
+/* = 'S': Eigenvalues are ordered (see SELCTG). */
+
+/* SELCTG (external procedure) LOGICAL FUNCTION of two COMPLEX*16 arguments */
+/* SELCTG must be declared EXTERNAL in the calling subroutine. */
+/* If SORT = 'N', SELCTG is not referenced. */
+/* If SORT = 'S', SELCTG is used to select eigenvalues to sort */
+/* to the top left of the Schur form. */
+/* An eigenvalue ALPHA(j)/BETA(j) is selected if */
+/* SELCTG(ALPHA(j),BETA(j)) is true. */
+
+/* Note that a selected complex eigenvalue may no longer satisfy */
+/* SELCTG(ALPHA(j),BETA(j)) = .TRUE. after ordering, since */
+/* ordering may change the value of complex eigenvalues */
+/* (especially if the eigenvalue is ill-conditioned), in this */
+/* case INFO is set to N+2 (See INFO below). */
+
+/* N (input) INTEGER */
+/* The order of the matrices A, B, VSL, and VSR. N >= 0. */
+
+/* A (input/output) COMPLEX*16 array, dimension (LDA, N) */
+/* On entry, the first of the pair of matrices. */
+/* On exit, A has been overwritten by its generalized Schur */
+/* form S. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of A. LDA >= max(1,N). */
+
+/* B (input/output) COMPLEX*16 array, dimension (LDB, N) */
+/* On entry, the second of the pair of matrices. */
+/* On exit, B has been overwritten by its generalized Schur */
+/* form T. */
+
+/* LDB (input) INTEGER */
+/* The leading dimension of B. LDB >= max(1,N). */
+
+/* SDIM (output) INTEGER */
+/* If SORT = 'N', SDIM = 0. */
+/* If SORT = 'S', SDIM = number of eigenvalues (after sorting) */
+/* for which SELCTG is true. */
+
+/* ALPHA (output) COMPLEX*16 array, dimension (N) */
+/* BETA (output) COMPLEX*16 array, dimension (N) */
+/* On exit, ALPHA(j)/BETA(j), j=1,...,N, will be the */
+/* generalized eigenvalues. ALPHA(j), j=1,...,N and BETA(j), */
+/* j=1,...,N are the diagonals of the complex Schur form (A,B) */
+/* output by ZGGES. The BETA(j) will be non-negative real. */
+
+/* Note: the quotients ALPHA(j)/BETA(j) may easily over- or */
+/* underflow, and BETA(j) may even be zero. Thus, the user */
+/* should avoid naively computing the ratio alpha/beta. */
+/* However, ALPHA will be always less than and usually */
+/* comparable with norm(A) in magnitude, and BETA always less */
+/* than and usually comparable with norm(B). */
+
+/* VSL (output) COMPLEX*16 array, dimension (LDVSL,N) */
+/* If JOBVSL = 'V', VSL will contain the left Schur vectors. */
+/* Not referenced if JOBVSL = 'N'. */
+
+/* LDVSL (input) INTEGER */
+/* The leading dimension of the matrix VSL. LDVSL >= 1, and */
+/* if JOBVSL = 'V', LDVSL >= N. */
+
+/* VSR (output) COMPLEX*16 array, dimension (LDVSR,N) */
+/* If JOBVSR = 'V', VSR will contain the right Schur vectors. */
+/* Not referenced if JOBVSR = 'N'. */
+
+/* LDVSR (input) INTEGER */
+/* The leading dimension of the matrix VSR. LDVSR >= 1, and */
+/* if JOBVSR = 'V', LDVSR >= N. */
+
+/* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK)) */
+/* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
+
+/* LWORK (input) INTEGER */
+/* The dimension of the array WORK. LWORK >= max(1,2*N). */
+/* For good performance, LWORK must generally be larger. */
+
+/* If LWORK = -1, then a workspace query is assumed; the routine */
+/* only calculates the optimal size of the WORK array, returns */
+/* this value as the first entry of the WORK array, and no error */
+/* message related to LWORK is issued by XERBLA. */
+
+/* RWORK (workspace) DOUBLE PRECISION array, dimension (8*N) */
+
+/* BWORK (workspace) LOGICAL array, dimension (N) */
+/* Not referenced if SORT = 'N'. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value. */
+/* =1,...,N: */
+/* The QZ iteration failed. (A,B) are not in Schur */
+/* form, but ALPHA(j) and BETA(j) should be correct for */
+/* j=INFO+1,...,N. */
+/* > N: =N+1: other than QZ iteration failed in ZHGEQZ */
+/* =N+2: after reordering, roundoff changed values of */
+/* some complex eigenvalues so that leading */
+/* eigenvalues in the Generalized Schur form no */
+/* longer satisfy SELCTG=.TRUE. This could also */
+/* be caused due to scaling. */
+/* =N+3: reordering falied in ZTGSEN. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ZERO, ONE >*/
+/*< PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) >*/
+/*< COMPLEX*16 CZERO, CONE >*/
+/*< >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< >*/
+/*< >*/
+/*< >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< INTEGER IDUM( 1 ) >*/
+/*< DOUBLE PRECISION DIF( 2 ) >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< INTEGER ILAENV >*/
+/*< DOUBLE PRECISION DLAMCH, ZLANGE >*/
+/*< EXTERNAL LSAME, ILAENV, DLAMCH, ZLANGE >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC MAX, SQRT >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Decode the input arguments */
+
+/*< IF( LSAME( JOBVSL, 'N' ) ) THEN >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ b_dim1 = *ldb;
+ b_offset = 1 + b_dim1;
+ b -= b_offset;
+ --alpha;
+ --beta;
+ vsl_dim1 = *ldvsl;
+ vsl_offset = 1 + vsl_dim1;
+ vsl -= vsl_offset;
+ vsr_dim1 = *ldvsr;
+ vsr_offset = 1 + vsr_dim1;
+ vsr -= vsr_offset;
+ --work;
+ --rwork;
+ --bwork;
+
+ /* Function Body */
+ if (lsame_(jobvsl, "N", (ftnlen)1, (ftnlen)1)) {
+/*< IJOBVL = 1 >*/
+ ijobvl = 1;
+/*< ILVSL = .FALSE. >*/
+ ilvsl = FALSE_;
+/*< ELSE IF( LSAME( JOBVSL, 'V' ) ) THEN >*/
+ } else if (lsame_(jobvsl, "V", (ftnlen)1, (ftnlen)1)) {
+/*< IJOBVL = 2 >*/
+ ijobvl = 2;
+/*< ILVSL = .TRUE. >*/
+ ilvsl = TRUE_;
+/*< ELSE >*/
+ } else {
+/*< IJOBVL = -1 >*/
+ ijobvl = -1;
+/*< ILVSL = .FALSE. >*/
+ ilvsl = FALSE_;
+/*< END IF >*/
+ }
+
+/*< IF( LSAME( JOBVSR, 'N' ) ) THEN >*/
+ if (lsame_(jobvsr, "N", (ftnlen)1, (ftnlen)1)) {
+/*< IJOBVR = 1 >*/
+ ijobvr = 1;
+/*< ILVSR = .FALSE. >*/
+ ilvsr = FALSE_;
+/*< ELSE IF( LSAME( JOBVSR, 'V' ) ) THEN >*/
+ } else if (lsame_(jobvsr, "V", (ftnlen)1, (ftnlen)1)) {
+/*< IJOBVR = 2 >*/
+ ijobvr = 2;
+/*< ILVSR = .TRUE. >*/
+ ilvsr = TRUE_;
+/*< ELSE >*/
+ } else {
+/*< IJOBVR = -1 >*/
+ ijobvr = -1;
+/*< ILVSR = .FALSE. >*/
+ ilvsr = FALSE_;
+/*< END IF >*/
+ }
+
+/*< WANTST = LSAME( SORT, 'S' ) >*/
+ wantst = lsame_(sort, "S", (ftnlen)1, (ftnlen)1);
+
+/* Test the input arguments */
+
+/*< INFO = 0 >*/
+ *info = 0;
+/*< LQUERY = ( LWORK.EQ.-1 ) >*/
+ lquery = *lwork == -1;
+/*< IF( IJOBVL.LE.0 ) THEN >*/
+ if (ijobvl <= 0) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( IJOBVR.LE.0 ) THEN >*/
+ } else if (ijobvr <= 0) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( ( .NOT.WANTST ) .AND. ( .NOT.LSAME( SORT, 'N' ) ) ) THEN >*/
+ } else if (! wantst && ! lsame_(sort, "N", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -3 >*/
+ *info = -3;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( LDA.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*lda < max(1,*n)) {
+/*< INFO = -7 >*/
+ *info = -7;
+/*< ELSE IF( LDB.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldb < max(1,*n)) {
+/*< INFO = -9 >*/
+ *info = -9;
+/*< ELSE IF( LDVSL.LT.1 .OR. ( ILVSL .AND. LDVSL.LT.N ) ) THEN >*/
+ } else if (*ldvsl < 1 || (ilvsl && *ldvsl < *n)) {
+/*< INFO = -14 >*/
+ *info = -14;
+/*< ELSE IF( LDVSR.LT.1 .OR. ( ILVSR .AND. LDVSR.LT.N ) ) THEN >*/
+ } else if (*ldvsr < 1 || (ilvsr && *ldvsr < *n)) {
+/*< INFO = -16 >*/
+ *info = -16;
+/*< END IF >*/
+ }
+
+/* Compute workspace */
+/* (Note: Comments in the code beginning "Workspace:" describe the */
+/* minimal amount of workspace needed at that point in the code, */
+/* as well as the preferred amount for good performance. */
+/* NB refers to the optimal block size for the immediately */
+/* following subroutine, as returned by ILAENV.) */
+
+/*< IF( INFO.EQ.0 ) THEN >*/
+ if (*info == 0) {
+/*< LWKMIN = MAX( 1, 2*N ) >*/
+/* Computing MAX */
+ i__1 = 1, i__2 = *n << 1;
+ lwkmin = max(i__1,i__2);
+/*< LWKOPT = MAX( 1, N + N*ILAENV( 1, 'ZGEQRF', ' ', N, 1, N, 0 ) ) >*/
+/* Computing MAX */
+ i__1 = 1, i__2 = *n + *n * ilaenv_(&c__1, "ZGEQRF", " ", n, &c__1, n,
+ &c__0, (ftnlen)6, (ftnlen)1);
+ lwkopt = max(i__1,i__2);
+/*< >*/
+/* Computing MAX */
+ i__1 = lwkopt, i__2 = *n + *n * ilaenv_(&c__1, "ZUNMQR", " ", n, &
+ c__1, n, &c_n1, (ftnlen)6, (ftnlen)1);
+ lwkopt = max(i__1,i__2);
+/*< IF( ILVSL ) THEN >*/
+ if (ilvsl) {
+/*< >*/
+/* Computing MAX */
+ i__1 = lwkopt, i__2 = *n + *n * ilaenv_(&c__1, "ZUNGQR", " ", n, &
+ c__1, n, &c_n1, (ftnlen)6, (ftnlen)1);
+ lwkopt = max(i__1,i__2);
+/*< END IF >*/
+ }
+/*< WORK( 1 ) = LWKOPT >*/
+ work[1].r = (doublereal) lwkopt, work[1].i = 0.;
+
+/*< >*/
+ if (*lwork < lwkmin && ! lquery) {
+ *info = -18;
+ }
+/*< END IF >*/
+ }
+
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZGGES ', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZGGES ", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< ELSE IF( LQUERY ) THEN >*/
+ } else if (lquery) {
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< IF( N.EQ.0 ) THEN >*/
+ if (*n == 0) {
+/*< SDIM = 0 >*/
+ *sdim = 0;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Get machine constants */
+
+/*< EPS = DLAMCH( 'P' ) >*/
+ eps = dlamch_("P", (ftnlen)1);
+/*< SMLNUM = DLAMCH( 'S' ) >*/
+ smlnum = dlamch_("S", (ftnlen)1);
+/*< BIGNUM = ONE / SMLNUM >*/
+ bignum = 1. / smlnum;
+/*< CALL DLABAD( SMLNUM, BIGNUM ) >*/
+ dlabad_(&smlnum, &bignum);
+/*< SMLNUM = SQRT( SMLNUM ) / EPS >*/
+ smlnum = sqrt(smlnum) / eps;
+/*< BIGNUM = ONE / SMLNUM >*/
+ bignum = 1. / smlnum;
+
+/* Scale A if max element outside range [SMLNUM,BIGNUM] */
+
+/*< ANRM = ZLANGE( 'M', N, N, A, LDA, RWORK ) >*/
+ anrm = zlange_("M", n, n, &a[a_offset], lda, &rwork[1], (ftnlen)1);
+/*< ILASCL = .FALSE. >*/
+ ilascl = FALSE_;
+/*< IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN >*/
+ if (anrm > 0. && anrm < smlnum) {
+/*< ANRMTO = SMLNUM >*/
+ anrmto = smlnum;
+/*< ILASCL = .TRUE. >*/
+ ilascl = TRUE_;
+/*< ELSE IF( ANRM.GT.BIGNUM ) THEN >*/
+ } else if (anrm > bignum) {
+/*< ANRMTO = BIGNUM >*/
+ anrmto = bignum;
+/*< ILASCL = .TRUE. >*/
+ ilascl = TRUE_;
+/*< END IF >*/
+ }
+
+/*< >*/
+ if (ilascl) {
+ zlascl_("G", &c__0, &c__0, &anrm, &anrmto, n, n, &a[a_offset], lda, &
+ ierr, (ftnlen)1);
+ }
+
+/* Scale B if max element outside range [SMLNUM,BIGNUM] */
+
+/*< BNRM = ZLANGE( 'M', N, N, B, LDB, RWORK ) >*/
+ bnrm = zlange_("M", n, n, &b[b_offset], ldb, &rwork[1], (ftnlen)1);
+/*< ILBSCL = .FALSE. >*/
+ ilbscl = FALSE_;
+/*< IF( BNRM.GT.ZERO .AND. BNRM.LT.SMLNUM ) THEN >*/
+ if (bnrm > 0. && bnrm < smlnum) {
+/*< BNRMTO = SMLNUM >*/
+ bnrmto = smlnum;
+/*< ILBSCL = .TRUE. >*/
+ ilbscl = TRUE_;
+/*< ELSE IF( BNRM.GT.BIGNUM ) THEN >*/
+ } else if (bnrm > bignum) {
+/*< BNRMTO = BIGNUM >*/
+ bnrmto = bignum;
+/*< ILBSCL = .TRUE. >*/
+ ilbscl = TRUE_;
+/*< END IF >*/
+ }
+
+/*< >*/
+ if (ilbscl) {
+ zlascl_("G", &c__0, &c__0, &bnrm, &bnrmto, n, n, &b[b_offset], ldb, &
+ ierr, (ftnlen)1);
+ }
+
+/* Permute the matrix to make it more nearly triangular */
+/* (Real Workspace: need 6*N) */
+
+/*< ILEFT = 1 >*/
+ ileft = 1;
+/*< IRIGHT = N + 1 >*/
+ iright = *n + 1;
+/*< IRWRK = IRIGHT + N >*/
+ irwrk = iright + *n;
+/*< >*/
+ zggbal_("P", n, &a[a_offset], lda, &b[b_offset], ldb, &ilo, &ihi, &rwork[
+ ileft], &rwork[iright], &rwork[irwrk], &ierr, (ftnlen)1);
+
+/* Reduce B to triangular form (QR decomposition of B) */
+/* (Complex Workspace: need N, prefer N*NB) */
+
+/*< IROWS = IHI + 1 - ILO >*/
+ irows = ihi + 1 - ilo;
+/*< ICOLS = N + 1 - ILO >*/
+ icols = *n + 1 - ilo;
+/*< ITAU = 1 >*/
+ itau = 1;
+/*< IWRK = ITAU + IROWS >*/
+ iwrk = itau + irows;
+/*< >*/
+ i__1 = *lwork + 1 - iwrk;
+ zgeqrf_(&irows, &icols, &b[ilo + ilo * b_dim1], ldb, &work[itau], &work[
+ iwrk], &i__1, &ierr);
+
+/* Apply the orthogonal transformation to matrix A */
+/* (Complex Workspace: need N, prefer N*NB) */
+
+/*< >*/
+ i__1 = *lwork + 1 - iwrk;
+ zunmqr_("L", "C", &irows, &icols, &irows, &b[ilo + ilo * b_dim1], ldb, &
+ work[itau], &a[ilo + ilo * a_dim1], lda, &work[iwrk], &i__1, &
+ ierr, (ftnlen)1, (ftnlen)1);
+
+/* Initialize VSL */
+/* (Complex Workspace: need N, prefer N*NB) */
+
+/*< IF( ILVSL ) THEN >*/
+ if (ilvsl) {
+/*< CALL ZLASET( 'Full', N, N, CZERO, CONE, VSL, LDVSL ) >*/
+ zlaset_("Full", n, n, &c_b1, &c_b2, &vsl[vsl_offset], ldvsl, (ftnlen)
+ 4);
+/*< IF( IROWS.GT.1 ) THEN >*/
+ if (irows > 1) {
+/*< >*/
+ i__1 = irows - 1;
+ i__2 = irows - 1;
+ zlacpy_("L", &i__1, &i__2, &b[ilo + 1 + ilo * b_dim1], ldb, &vsl[
+ ilo + 1 + ilo * vsl_dim1], ldvsl, (ftnlen)1);
+/*< END IF >*/
+ }
+/*< >*/
+ i__1 = *lwork + 1 - iwrk;
+ zungqr_(&irows, &irows, &irows, &vsl[ilo + ilo * vsl_dim1], ldvsl, &
+ work[itau], &work[iwrk], &i__1, &ierr);
+/*< END IF >*/
+ }
+
+/* Initialize VSR */
+
+/*< >*/
+ if (ilvsr) {
+ zlaset_("Full", n, n, &c_b1, &c_b2, &vsr[vsr_offset], ldvsr, (ftnlen)
+ 4);
+ }
+
+/* Reduce to generalized Hessenberg form */
+/* (Workspace: none needed) */
+
+/*< >*/
+ zgghrd_(jobvsl, jobvsr, n, &ilo, &ihi, &a[a_offset], lda, &b[b_offset],
+ ldb, &vsl[vsl_offset], ldvsl, &vsr[vsr_offset], ldvsr, &ierr, (
+ ftnlen)1, (ftnlen)1);
+
+/*< SDIM = 0 >*/
+ *sdim = 0;
+
+/* Perform QZ algorithm, computing Schur vectors if desired */
+/* (Complex Workspace: need N) */
+/* (Real Workspace: need N) */
+
+/*< IWRK = ITAU >*/
+ iwrk = itau;
+/*< >*/
+ i__1 = *lwork + 1 - iwrk;
+ zhgeqz_("S", jobvsl, jobvsr, n, &ilo, &ihi, &a[a_offset], lda, &b[
+ b_offset], ldb, &alpha[1], &beta[1], &vsl[vsl_offset], ldvsl, &
+ vsr[vsr_offset], ldvsr, &work[iwrk], &i__1, &rwork[irwrk], &ierr,
+ (ftnlen)1, (ftnlen)1, (ftnlen)1);
+/*< IF( IERR.NE.0 ) THEN >*/
+ if (ierr != 0) {
+/*< IF( IERR.GT.0 .AND. IERR.LE.N ) THEN >*/
+ if (ierr > 0 && ierr <= *n) {
+/*< INFO = IERR >*/
+ *info = ierr;
+/*< ELSE IF( IERR.GT.N .AND. IERR.LE.2*N ) THEN >*/
+ } else if (ierr > *n && ierr <= *n << 1) {
+/*< INFO = IERR - N >*/
+ *info = ierr - *n;
+/*< ELSE >*/
+ } else {
+/*< INFO = N + 1 >*/
+ *info = *n + 1;
+/*< END IF >*/
+ }
+/*< GO TO 30 >*/
+ goto L30;
+/*< END IF >*/
+ }
+
+/* Sort eigenvalues ALPHA/BETA if desired */
+/* (Workspace: none needed) */
+
+/*< IF( WANTST ) THEN >*/
+ if (wantst) {
+
+/* Undo scaling on eigenvalues before selecting */
+
+/*< >*/
+ if (ilascl) {
+ zlascl_("G", &c__0, &c__0, &anrm, &anrmto, n, &c__1, &alpha[1], n,
+ &ierr, (ftnlen)1);
+ }
+/*< >*/
+ if (ilbscl) {
+ zlascl_("G", &c__0, &c__0, &bnrm, &bnrmto, n, &c__1, &beta[1], n,
+ &ierr, (ftnlen)1);
+ }
+
+/* Select eigenvalues */
+
+/*< DO 10 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< BWORK( I ) = SELCTG( ALPHA( I ), BETA( I ) ) >*/
+ bwork[i__] = (*selctg)(&alpha[i__], &beta[i__]);
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+
+/*< >*/
+ i__1 = *lwork - iwrk + 1;
+ ztgsen_(&c__0, &ilvsl, &ilvsr, &bwork[1], n, &a[a_offset], lda, &b[
+ b_offset], ldb, &alpha[1], &beta[1], &vsl[vsl_offset], ldvsl,
+ &vsr[vsr_offset], ldvsr, sdim, &pvsl, &pvsr, dif, &work[iwrk],
+ &i__1, idum, &c__1, &ierr);
+/*< >*/
+ if (ierr == 1) {
+ *info = *n + 3;
+ }
+
+/*< END IF >*/
+ }
+
+/* Apply back-permutation to VSL and VSR */
+/* (Workspace: none needed) */
+
+/*< >*/
+ if (ilvsl) {
+ zggbak_("P", "L", n, &ilo, &ihi, &rwork[ileft], &rwork[iright], n, &
+ vsl[vsl_offset], ldvsl, &ierr, (ftnlen)1, (ftnlen)1);
+ }
+/*< >*/
+ if (ilvsr) {
+ zggbak_("P", "R", n, &ilo, &ihi, &rwork[ileft], &rwork[iright], n, &
+ vsr[vsr_offset], ldvsr, &ierr, (ftnlen)1, (ftnlen)1);
+ }
+
+/* Undo scaling */
+
+/*< IF( ILASCL ) THEN >*/
+ if (ilascl) {
+/*< CALL ZLASCL( 'U', 0, 0, ANRMTO, ANRM, N, N, A, LDA, IERR ) >*/
+ zlascl_("U", &c__0, &c__0, &anrmto, &anrm, n, n, &a[a_offset], lda, &
+ ierr, (ftnlen)1);
+/*< CALL ZLASCL( 'G', 0, 0, ANRMTO, ANRM, N, 1, ALPHA, N, IERR ) >*/
+ zlascl_("G", &c__0, &c__0, &anrmto, &anrm, n, &c__1, &alpha[1], n, &
+ ierr, (ftnlen)1);
+/*< END IF >*/
+ }
+
+/*< IF( ILBSCL ) THEN >*/
+ if (ilbscl) {
+/*< CALL ZLASCL( 'U', 0, 0, BNRMTO, BNRM, N, N, B, LDB, IERR ) >*/
+ zlascl_("U", &c__0, &c__0, &bnrmto, &bnrm, n, n, &b[b_offset], ldb, &
+ ierr, (ftnlen)1);
+/*< CALL ZLASCL( 'G', 0, 0, BNRMTO, BNRM, N, 1, BETA, N, IERR ) >*/
+ zlascl_("G", &c__0, &c__0, &bnrmto, &bnrm, n, &c__1, &beta[1], n, &
+ ierr, (ftnlen)1);
+/*< END IF >*/
+ }
+
+/*< IF( WANTST ) THEN >*/
+ if (wantst) {
+
+/* Check if reordering is correct */
+
+/*< LASTSL = .TRUE. >*/
+ lastsl = TRUE_;
+/*< SDIM = 0 >*/
+ *sdim = 0;
+/*< DO 20 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< CURSL = SELCTG( ALPHA( I ), BETA( I ) ) >*/
+ cursl = (*selctg)(&alpha[i__], &beta[i__]);
+/*< >*/
+ if (cursl) {
+ ++(*sdim);
+ }
+/*< >*/
+ if (cursl && ! lastsl) {
+ *info = *n + 2;
+ }
+/*< LASTSL = CURSL >*/
+ lastsl = cursl;
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+
+/*< END IF >*/
+ }
+
+/*< 30 CONTINUE >*/
+L30:
+
+/*< WORK( 1 ) = LWKOPT >*/
+ work[1].r = (doublereal) lwkopt, work[1].i = 0.;
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGGES */
+
+/*< END >*/
+} /* zgges_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.f
new file mode 100644
index 0000000000000000000000000000000000000000..5f41fb61021c70fbe8984cc262767820c1d780a8
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.f
@@ -0,0 +1,478 @@
+ SUBROUTINE ZGGES( JOBVSL, JOBVSR, SORT, SELCTG, N, A, LDA, B, LDB,
+ $ SDIM, ALPHA, BETA, VSL, LDVSL, VSR, LDVSR, WORK,
+ $ LWORK, RWORK, BWORK, INFO )
+*
+* -- LAPACK driver routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER JOBVSL, JOBVSR, SORT
+ INTEGER INFO, LDA, LDB, LDVSL, LDVSR, LWORK, N, SDIM
+* ..
+* .. Array Arguments ..
+ LOGICAL BWORK( * )
+ DOUBLE PRECISION RWORK( * )
+ COMPLEX*16 A( LDA, * ), ALPHA( * ), B( LDB, * ),
+ $ BETA( * ), VSL( LDVSL, * ), VSR( LDVSR, * ),
+ $ WORK( * )
+* ..
+* .. Function Arguments ..
+ LOGICAL SELCTG
+ EXTERNAL SELCTG
+* ..
+*
+* Purpose
+* =======
+*
+* ZGGES computes for a pair of N-by-N complex nonsymmetric matrices
+* (A,B), the generalized eigenvalues, the generalized complex Schur
+* form (S, T), and optionally left and/or right Schur vectors (VSL
+* and VSR). This gives the generalized Schur factorization
+*
+* (A,B) = ( (VSL)*S*(VSR)**H, (VSL)*T*(VSR)**H )
+*
+* where (VSR)**H is the conjugate-transpose of VSR.
+*
+* Optionally, it also orders the eigenvalues so that a selected cluster
+* of eigenvalues appears in the leading diagonal blocks of the upper
+* triangular matrix S and the upper triangular matrix T. The leading
+* columns of VSL and VSR then form an unitary basis for the
+* corresponding left and right eigenspaces (deflating subspaces).
+*
+* (If only the generalized eigenvalues are needed, use the driver
+* ZGGEV instead, which is faster.)
+*
+* A generalized eigenvalue for a pair of matrices (A,B) is a scalar w
+* or a ratio alpha/beta = w, such that A - w*B is singular. It is
+* usually represented as the pair (alpha,beta), as there is a
+* reasonable interpretation for beta=0, and even for both being zero.
+*
+* A pair of matrices (S,T) is in generalized complex Schur form if S
+* and T are upper triangular and, in addition, the diagonal elements
+* of T are non-negative real numbers.
+*
+* Arguments
+* =========
+*
+* JOBVSL (input) CHARACTER*1
+* = 'N': do not compute the left Schur vectors;
+* = 'V': compute the left Schur vectors.
+*
+* JOBVSR (input) CHARACTER*1
+* = 'N': do not compute the right Schur vectors;
+* = 'V': compute the right Schur vectors.
+*
+* SORT (input) CHARACTER*1
+* Specifies whether or not to order the eigenvalues on the
+* diagonal of the generalized Schur form.
+* = 'N': Eigenvalues are not ordered;
+* = 'S': Eigenvalues are ordered (see SELCTG).
+*
+* SELCTG (external procedure) LOGICAL FUNCTION of two COMPLEX*16 arguments
+* SELCTG must be declared EXTERNAL in the calling subroutine.
+* If SORT = 'N', SELCTG is not referenced.
+* If SORT = 'S', SELCTG is used to select eigenvalues to sort
+* to the top left of the Schur form.
+* An eigenvalue ALPHA(j)/BETA(j) is selected if
+* SELCTG(ALPHA(j),BETA(j)) is true.
+*
+* Note that a selected complex eigenvalue may no longer satisfy
+* SELCTG(ALPHA(j),BETA(j)) = .TRUE. after ordering, since
+* ordering may change the value of complex eigenvalues
+* (especially if the eigenvalue is ill-conditioned), in this
+* case INFO is set to N+2 (See INFO below).
+*
+* N (input) INTEGER
+* The order of the matrices A, B, VSL, and VSR. N >= 0.
+*
+* A (input/output) COMPLEX*16 array, dimension (LDA, N)
+* On entry, the first of the pair of matrices.
+* On exit, A has been overwritten by its generalized Schur
+* form S.
+*
+* LDA (input) INTEGER
+* The leading dimension of A. LDA >= max(1,N).
+*
+* B (input/output) COMPLEX*16 array, dimension (LDB, N)
+* On entry, the second of the pair of matrices.
+* On exit, B has been overwritten by its generalized Schur
+* form T.
+*
+* LDB (input) INTEGER
+* The leading dimension of B. LDB >= max(1,N).
+*
+* SDIM (output) INTEGER
+* If SORT = 'N', SDIM = 0.
+* If SORT = 'S', SDIM = number of eigenvalues (after sorting)
+* for which SELCTG is true.
+*
+* ALPHA (output) COMPLEX*16 array, dimension (N)
+* BETA (output) COMPLEX*16 array, dimension (N)
+* On exit, ALPHA(j)/BETA(j), j=1,...,N, will be the
+* generalized eigenvalues. ALPHA(j), j=1,...,N and BETA(j),
+* j=1,...,N are the diagonals of the complex Schur form (A,B)
+* output by ZGGES. The BETA(j) will be non-negative real.
+*
+* Note: the quotients ALPHA(j)/BETA(j) may easily over- or
+* underflow, and BETA(j) may even be zero. Thus, the user
+* should avoid naively computing the ratio alpha/beta.
+* However, ALPHA will be always less than and usually
+* comparable with norm(A) in magnitude, and BETA always less
+* than and usually comparable with norm(B).
+*
+* VSL (output) COMPLEX*16 array, dimension (LDVSL,N)
+* If JOBVSL = 'V', VSL will contain the left Schur vectors.
+* Not referenced if JOBVSL = 'N'.
+*
+* LDVSL (input) INTEGER
+* The leading dimension of the matrix VSL. LDVSL >= 1, and
+* if JOBVSL = 'V', LDVSL >= N.
+*
+* VSR (output) COMPLEX*16 array, dimension (LDVSR,N)
+* If JOBVSR = 'V', VSR will contain the right Schur vectors.
+* Not referenced if JOBVSR = 'N'.
+*
+* LDVSR (input) INTEGER
+* The leading dimension of the matrix VSR. LDVSR >= 1, and
+* if JOBVSR = 'V', LDVSR >= N.
+*
+* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))
+* On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
+*
+* LWORK (input) INTEGER
+* The dimension of the array WORK. LWORK >= max(1,2*N).
+* For good performance, LWORK must generally be larger.
+*
+* If LWORK = -1, then a workspace query is assumed; the routine
+* only calculates the optimal size of the WORK array, returns
+* this value as the first entry of the WORK array, and no error
+* message related to LWORK is issued by XERBLA.
+*
+* RWORK (workspace) DOUBLE PRECISION array, dimension (8*N)
+*
+* BWORK (workspace) LOGICAL array, dimension (N)
+* Not referenced if SORT = 'N'.
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value.
+* =1,...,N:
+* The QZ iteration failed. (A,B) are not in Schur
+* form, but ALPHA(j) and BETA(j) should be correct for
+* j=INFO+1,...,N.
+* > N: =N+1: other than QZ iteration failed in ZHGEQZ
+* =N+2: after reordering, roundoff changed values of
+* some complex eigenvalues so that leading
+* eigenvalues in the Generalized Schur form no
+* longer satisfy SELCTG=.TRUE. This could also
+* be caused due to scaling.
+* =N+3: reordering falied in ZTGSEN.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ZERO, ONE
+ PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 )
+ COMPLEX*16 CZERO, CONE
+ PARAMETER ( CZERO = ( 0.0D0, 0.0D0 ),
+ $ CONE = ( 1.0D0, 0.0D0 ) )
+* ..
+* .. Local Scalars ..
+ LOGICAL CURSL, ILASCL, ILBSCL, ILVSL, ILVSR, LASTSL,
+ $ LQUERY, WANTST
+ INTEGER I, ICOLS, IERR, IHI, IJOBVL, IJOBVR, ILEFT,
+ $ ILO, IRIGHT, IROWS, IRWRK, ITAU, IWRK, LWKMIN,
+ $ LWKOPT
+ DOUBLE PRECISION ANRM, ANRMTO, BIGNUM, BNRM, BNRMTO, EPS, PVSL,
+ $ PVSR, SMLNUM
+* ..
+* .. Local Arrays ..
+ INTEGER IDUM( 1 )
+ DOUBLE PRECISION DIF( 2 )
+* ..
+* .. External Subroutines ..
+ EXTERNAL DLABAD, XERBLA, ZGEQRF, ZGGBAK, ZGGBAL, ZGGHRD,
+ $ ZHGEQZ, ZLACPY, ZLASCL, ZLASET, ZTGSEN, ZUNGQR,
+ $ ZUNMQR
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ INTEGER ILAENV
+ DOUBLE PRECISION DLAMCH, ZLANGE
+ EXTERNAL LSAME, ILAENV, DLAMCH, ZLANGE
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC MAX, SQRT
+* ..
+* .. Executable Statements ..
+*
+* Decode the input arguments
+*
+ IF( LSAME( JOBVSL, 'N' ) ) THEN
+ IJOBVL = 1
+ ILVSL = .FALSE.
+ ELSE IF( LSAME( JOBVSL, 'V' ) ) THEN
+ IJOBVL = 2
+ ILVSL = .TRUE.
+ ELSE
+ IJOBVL = -1
+ ILVSL = .FALSE.
+ END IF
+*
+ IF( LSAME( JOBVSR, 'N' ) ) THEN
+ IJOBVR = 1
+ ILVSR = .FALSE.
+ ELSE IF( LSAME( JOBVSR, 'V' ) ) THEN
+ IJOBVR = 2
+ ILVSR = .TRUE.
+ ELSE
+ IJOBVR = -1
+ ILVSR = .FALSE.
+ END IF
+*
+ WANTST = LSAME( SORT, 'S' )
+*
+* Test the input arguments
+*
+ INFO = 0
+ LQUERY = ( LWORK.EQ.-1 )
+ IF( IJOBVL.LE.0 ) THEN
+ INFO = -1
+ ELSE IF( IJOBVR.LE.0 ) THEN
+ INFO = -2
+ ELSE IF( ( .NOT.WANTST ) .AND. ( .NOT.LSAME( SORT, 'N' ) ) ) THEN
+ INFO = -3
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -5
+ ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
+ INFO = -7
+ ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
+ INFO = -9
+ ELSE IF( LDVSL.LT.1 .OR. ( ILVSL .AND. LDVSL.LT.N ) ) THEN
+ INFO = -14
+ ELSE IF( LDVSR.LT.1 .OR. ( ILVSR .AND. LDVSR.LT.N ) ) THEN
+ INFO = -16
+ END IF
+*
+* Compute workspace
+* (Note: Comments in the code beginning "Workspace:" describe the
+* minimal amount of workspace needed at that point in the code,
+* as well as the preferred amount for good performance.
+* NB refers to the optimal block size for the immediately
+* following subroutine, as returned by ILAENV.)
+*
+ IF( INFO.EQ.0 ) THEN
+ LWKMIN = MAX( 1, 2*N )
+ LWKOPT = MAX( 1, N + N*ILAENV( 1, 'ZGEQRF', ' ', N, 1, N, 0 ) )
+ LWKOPT = MAX( LWKOPT, N +
+ $ N*ILAENV( 1, 'ZUNMQR', ' ', N, 1, N, -1 ) )
+ IF( ILVSL ) THEN
+ LWKOPT = MAX( LWKOPT, N +
+ $ N*ILAENV( 1, 'ZUNGQR', ' ', N, 1, N, -1 ) )
+ END IF
+ WORK( 1 ) = LWKOPT
+*
+ IF( LWORK.LT.LWKMIN .AND. .NOT.LQUERY )
+ $ INFO = -18
+ END IF
+*
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZGGES ', -INFO )
+ RETURN
+ ELSE IF( LQUERY ) THEN
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( N.EQ.0 ) THEN
+ SDIM = 0
+ RETURN
+ END IF
+*
+* Get machine constants
+*
+ EPS = DLAMCH( 'P' )
+ SMLNUM = DLAMCH( 'S' )
+ BIGNUM = ONE / SMLNUM
+ CALL DLABAD( SMLNUM, BIGNUM )
+ SMLNUM = SQRT( SMLNUM ) / EPS
+ BIGNUM = ONE / SMLNUM
+*
+* Scale A if max element outside range [SMLNUM,BIGNUM]
+*
+ ANRM = ZLANGE( 'M', N, N, A, LDA, RWORK )
+ ILASCL = .FALSE.
+ IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN
+ ANRMTO = SMLNUM
+ ILASCL = .TRUE.
+ ELSE IF( ANRM.GT.BIGNUM ) THEN
+ ANRMTO = BIGNUM
+ ILASCL = .TRUE.
+ END IF
+*
+ IF( ILASCL )
+ $ CALL ZLASCL( 'G', 0, 0, ANRM, ANRMTO, N, N, A, LDA, IERR )
+*
+* Scale B if max element outside range [SMLNUM,BIGNUM]
+*
+ BNRM = ZLANGE( 'M', N, N, B, LDB, RWORK )
+ ILBSCL = .FALSE.
+ IF( BNRM.GT.ZERO .AND. BNRM.LT.SMLNUM ) THEN
+ BNRMTO = SMLNUM
+ ILBSCL = .TRUE.
+ ELSE IF( BNRM.GT.BIGNUM ) THEN
+ BNRMTO = BIGNUM
+ ILBSCL = .TRUE.
+ END IF
+*
+ IF( ILBSCL )
+ $ CALL ZLASCL( 'G', 0, 0, BNRM, BNRMTO, N, N, B, LDB, IERR )
+*
+* Permute the matrix to make it more nearly triangular
+* (Real Workspace: need 6*N)
+*
+ ILEFT = 1
+ IRIGHT = N + 1
+ IRWRK = IRIGHT + N
+ CALL ZGGBAL( 'P', N, A, LDA, B, LDB, ILO, IHI, RWORK( ILEFT ),
+ $ RWORK( IRIGHT ), RWORK( IRWRK ), IERR )
+*
+* Reduce B to triangular form (QR decomposition of B)
+* (Complex Workspace: need N, prefer N*NB)
+*
+ IROWS = IHI + 1 - ILO
+ ICOLS = N + 1 - ILO
+ ITAU = 1
+ IWRK = ITAU + IROWS
+ CALL ZGEQRF( IROWS, ICOLS, B( ILO, ILO ), LDB, WORK( ITAU ),
+ $ WORK( IWRK ), LWORK+1-IWRK, IERR )
+*
+* Apply the orthogonal transformation to matrix A
+* (Complex Workspace: need N, prefer N*NB)
+*
+ CALL ZUNMQR( 'L', 'C', IROWS, ICOLS, IROWS, B( ILO, ILO ), LDB,
+ $ WORK( ITAU ), A( ILO, ILO ), LDA, WORK( IWRK ),
+ $ LWORK+1-IWRK, IERR )
+*
+* Initialize VSL
+* (Complex Workspace: need N, prefer N*NB)
+*
+ IF( ILVSL ) THEN
+ CALL ZLASET( 'Full', N, N, CZERO, CONE, VSL, LDVSL )
+ IF( IROWS.GT.1 ) THEN
+ CALL ZLACPY( 'L', IROWS-1, IROWS-1, B( ILO+1, ILO ), LDB,
+ $ VSL( ILO+1, ILO ), LDVSL )
+ END IF
+ CALL ZUNGQR( IROWS, IROWS, IROWS, VSL( ILO, ILO ), LDVSL,
+ $ WORK( ITAU ), WORK( IWRK ), LWORK+1-IWRK, IERR )
+ END IF
+*
+* Initialize VSR
+*
+ IF( ILVSR )
+ $ CALL ZLASET( 'Full', N, N, CZERO, CONE, VSR, LDVSR )
+*
+* Reduce to generalized Hessenberg form
+* (Workspace: none needed)
+*
+ CALL ZGGHRD( JOBVSL, JOBVSR, N, ILO, IHI, A, LDA, B, LDB, VSL,
+ $ LDVSL, VSR, LDVSR, IERR )
+*
+ SDIM = 0
+*
+* Perform QZ algorithm, computing Schur vectors if desired
+* (Complex Workspace: need N)
+* (Real Workspace: need N)
+*
+ IWRK = ITAU
+ CALL ZHGEQZ( 'S', JOBVSL, JOBVSR, N, ILO, IHI, A, LDA, B, LDB,
+ $ ALPHA, BETA, VSL, LDVSL, VSR, LDVSR, WORK( IWRK ),
+ $ LWORK+1-IWRK, RWORK( IRWRK ), IERR )
+ IF( IERR.NE.0 ) THEN
+ IF( IERR.GT.0 .AND. IERR.LE.N ) THEN
+ INFO = IERR
+ ELSE IF( IERR.GT.N .AND. IERR.LE.2*N ) THEN
+ INFO = IERR - N
+ ELSE
+ INFO = N + 1
+ END IF
+ GO TO 30
+ END IF
+*
+* Sort eigenvalues ALPHA/BETA if desired
+* (Workspace: none needed)
+*
+ IF( WANTST ) THEN
+*
+* Undo scaling on eigenvalues before selecting
+*
+ IF( ILASCL )
+ $ CALL ZLASCL( 'G', 0, 0, ANRM, ANRMTO, N, 1, ALPHA, N, IERR )
+ IF( ILBSCL )
+ $ CALL ZLASCL( 'G', 0, 0, BNRM, BNRMTO, N, 1, BETA, N, IERR )
+*
+* Select eigenvalues
+*
+ DO 10 I = 1, N
+ BWORK( I ) = SELCTG( ALPHA( I ), BETA( I ) )
+ 10 CONTINUE
+*
+ CALL ZTGSEN( 0, ILVSL, ILVSR, BWORK, N, A, LDA, B, LDB, ALPHA,
+ $ BETA, VSL, LDVSL, VSR, LDVSR, SDIM, PVSL, PVSR,
+ $ DIF, WORK( IWRK ), LWORK-IWRK+1, IDUM, 1, IERR )
+ IF( IERR.EQ.1 )
+ $ INFO = N + 3
+*
+ END IF
+*
+* Apply back-permutation to VSL and VSR
+* (Workspace: none needed)
+*
+ IF( ILVSL )
+ $ CALL ZGGBAK( 'P', 'L', N, ILO, IHI, RWORK( ILEFT ),
+ $ RWORK( IRIGHT ), N, VSL, LDVSL, IERR )
+ IF( ILVSR )
+ $ CALL ZGGBAK( 'P', 'R', N, ILO, IHI, RWORK( ILEFT ),
+ $ RWORK( IRIGHT ), N, VSR, LDVSR, IERR )
+*
+* Undo scaling
+*
+ IF( ILASCL ) THEN
+ CALL ZLASCL( 'U', 0, 0, ANRMTO, ANRM, N, N, A, LDA, IERR )
+ CALL ZLASCL( 'G', 0, 0, ANRMTO, ANRM, N, 1, ALPHA, N, IERR )
+ END IF
+*
+ IF( ILBSCL ) THEN
+ CALL ZLASCL( 'U', 0, 0, BNRMTO, BNRM, N, N, B, LDB, IERR )
+ CALL ZLASCL( 'G', 0, 0, BNRMTO, BNRM, N, 1, BETA, N, IERR )
+ END IF
+*
+ IF( WANTST ) THEN
+*
+* Check if reordering is correct
+*
+ LASTSL = .TRUE.
+ SDIM = 0
+ DO 20 I = 1, N
+ CURSL = SELCTG( ALPHA( I ), BETA( I ) )
+ IF( CURSL )
+ $ SDIM = SDIM + 1
+ IF( CURSL .AND. .NOT.LASTSL )
+ $ INFO = N + 2
+ LASTSL = CURSL
+ 20 CONTINUE
+*
+ END IF
+*
+ 30 CONTINUE
+*
+ WORK( 1 ) = LWKOPT
+*
+ RETURN
+*
+* End of ZGGES
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.h
new file mode 100644
index 0000000000000000000000000000000000000000..43cfa6e6ca5aaff9b0f22ee746700710f85ed0fc
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgges.h
@@ -0,0 +1,27 @@
+extern int v3p_netlib_zgges_(
+ char v3p_netlib_const *jobvsl,
+ char v3p_netlib_const *jobvsr,
+ char v3p_netlib_const *sort,
+ v3p_netlib_logical (*selctg)(v3p_netlib_doublecomplex*,
+ v3p_netlib_doublecomplex*),
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *b,
+ v3p_netlib_integer *ldb,
+ v3p_netlib_integer *sdim,
+ v3p_netlib_doublecomplex *alpha,
+ v3p_netlib_doublecomplex *beta,
+ v3p_netlib_doublecomplex *vsl,
+ v3p_netlib_integer *ldvsl,
+ v3p_netlib_doublecomplex *vsr,
+ v3p_netlib_integer *ldvsr,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_integer *lwork,
+ v3p_netlib_doublereal *rwork,
+ v3p_netlib_logical *bwork,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen jobvsl_len,
+ v3p_netlib_ftnlen jobvsr_len,
+ v3p_netlib_ftnlen sort_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.P
new file mode 100644
index 0000000000000000000000000000000000000000..ee255a370c4bb02f6768d58f5bae2f2bee44fe6f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.P
@@ -0,0 +1,6 @@
+extern int zgghrd_(char *compq, char *compz, integer *n, integer *ilo, integer *ihi, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb, doublecomplex *q, integer *ldq, doublecomplex *z__, integer *ldz, integer *info, ftnlen compq_len, ftnlen compz_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zlaset_ 14 8 13 4 4 9 9 9 4 124 */
+/*:ref: zlartg_ 14 5 9 9 7 9 9 */
+/*:ref: zrot_ 14 7 4 9 4 9 4 7 9 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.c
new file mode 100644
index 0000000000000000000000000000000000000000..a6d487488382e25b776dd8a840f0d5b5eef6108c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.c
@@ -0,0 +1,433 @@
+/* lapack/complex16/zgghrd.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static doublecomplex c_b1 = {1.,0.};
+static doublecomplex c_b2 = {0.,0.};
+static integer c__1 = 1;
+
+/*< >*/
+/* Subroutine */ int zgghrd_(char *compq, char *compz, integer *n, integer *
+ ilo, integer *ihi, doublecomplex *a, integer *lda, doublecomplex *b,
+ integer *ldb, doublecomplex *q, integer *ldq, doublecomplex *z__,
+ integer *ldz, integer *info, ftnlen compq_len, ftnlen compz_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, b_dim1, b_offset, q_dim1, q_offset, z_dim1,
+ z_offset, i__1, i__2, i__3;
+ doublecomplex z__1;
+
+ /* Builtin functions */
+ void d_cnjg(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ doublereal c__;
+ doublecomplex s;
+ logical ilq, ilz;
+ integer jcol, jrow;
+ extern /* Subroutine */ int zrot_(integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublereal *, doublecomplex *);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ doublecomplex ctemp;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+ integer icompq, icompz;
+ extern /* Subroutine */ int zlaset_(char *, integer *, integer *,
+ doublecomplex *, doublecomplex *, doublecomplex *, integer *,
+ ftnlen), zlartg_(doublecomplex *, doublecomplex *, doublereal *,
+ doublecomplex *, doublecomplex *);
+ (void)compq_len;
+ (void)compz_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER COMPQ, COMPZ >*/
+/*< INTEGER IHI, ILO, INFO, LDA, LDB, LDQ, LDZ, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZGGHRD reduces a pair of complex matrices (A,B) to generalized upper */
+/* Hessenberg form using unitary transformations, where A is a */
+/* general matrix and B is upper triangular. The form of the */
+/* generalized eigenvalue problem is */
+/* A*x = lambda*B*x, */
+/* and B is typically made upper triangular by computing its QR */
+/* factorization and moving the unitary matrix Q to the left side */
+/* of the equation. */
+
+/* This subroutine simultaneously reduces A to a Hessenberg matrix H: */
+/* Q**H*A*Z = H */
+/* and transforms B to another upper triangular matrix T: */
+/* Q**H*B*Z = T */
+/* in order to reduce the problem to its standard form */
+/* H*y = lambda*T*y */
+/* where y = Z**H*x. */
+
+/* The unitary matrices Q and Z are determined as products of Givens */
+/* rotations. They may either be formed explicitly, or they may be */
+/* postmultiplied into input matrices Q1 and Z1, so that */
+/* Q1 * A * Z1**H = (Q1*Q) * H * (Z1*Z)**H */
+/* Q1 * B * Z1**H = (Q1*Q) * T * (Z1*Z)**H */
+/* If Q1 is the unitary matrix from the QR factorization of B in the */
+/* original equation A*x = lambda*B*x, then ZGGHRD reduces the original */
+/* problem to generalized Hessenberg form. */
+
+/* Arguments */
+/* ========= */
+
+/* COMPQ (input) CHARACTER*1 */
+/* = 'N': do not compute Q; */
+/* = 'I': Q is initialized to the unit matrix, and the */
+/* unitary matrix Q is returned; */
+/* = 'V': Q must contain a unitary matrix Q1 on entry, */
+/* and the product Q1*Q is returned. */
+
+/* COMPZ (input) CHARACTER*1 */
+/* = 'N': do not compute Q; */
+/* = 'I': Q is initialized to the unit matrix, and the */
+/* unitary matrix Q is returned; */
+/* = 'V': Q must contain a unitary matrix Q1 on entry, */
+/* and the product Q1*Q is returned. */
+
+/* N (input) INTEGER */
+/* The order of the matrices A and B. N >= 0. */
+
+/* ILO (input) INTEGER */
+/* IHI (input) INTEGER */
+/* ILO and IHI mark the rows and columns of A which are to be */
+/* reduced. It is assumed that A is already upper triangular */
+/* in rows and columns 1:ILO-1 and IHI+1:N. ILO and IHI are */
+/* normally set by a previous call to ZGGBAL; otherwise they */
+/* should be set to 1 and N respectively. */
+/* 1 <= ILO <= IHI <= N, if N > 0; ILO=1 and IHI=0, if N=0. */
+
+/* A (input/output) COMPLEX*16 array, dimension (LDA, N) */
+/* On entry, the N-by-N general matrix to be reduced. */
+/* On exit, the upper triangle and the first subdiagonal of A */
+/* are overwritten with the upper Hessenberg matrix H, and the */
+/* rest is set to zero. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,N). */
+
+/* B (input/output) COMPLEX*16 array, dimension (LDB, N) */
+/* On entry, the N-by-N upper triangular matrix B. */
+/* On exit, the upper triangular matrix T = Q**H B Z. The */
+/* elements below the diagonal are set to zero. */
+
+/* LDB (input) INTEGER */
+/* The leading dimension of the array B. LDB >= max(1,N). */
+
+/* Q (input/output) COMPLEX*16 array, dimension (LDQ, N) */
+/* On entry, if COMPQ = 'V', the unitary matrix Q1, typically */
+/* from the QR factorization of B. */
+/* On exit, if COMPQ='I', the unitary matrix Q, and if */
+/* COMPQ = 'V', the product Q1*Q. */
+/* Not referenced if COMPQ='N'. */
+
+/* LDQ (input) INTEGER */
+/* The leading dimension of the array Q. */
+/* LDQ >= N if COMPQ='V' or 'I'; LDQ >= 1 otherwise. */
+
+/* Z (input/output) COMPLEX*16 array, dimension (LDZ, N) */
+/* On entry, if COMPZ = 'V', the unitary matrix Z1. */
+/* On exit, if COMPZ='I', the unitary matrix Z, and if */
+/* COMPZ = 'V', the product Z1*Z. */
+/* Not referenced if COMPZ='N'. */
+
+/* LDZ (input) INTEGER */
+/* The leading dimension of the array Z. */
+/* LDZ >= N if COMPZ='V' or 'I'; LDZ >= 1 otherwise. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit. */
+/* < 0: if INFO = -i, the i-th argument had an illegal value. */
+
+/* Further Details */
+/* =============== */
+
+/* This routine reduces A to Hessenberg and B to triangular form by */
+/* an unblocked reduction, as described in _Matrix_Computations_, */
+/* by Golub and van Loan (Johns Hopkins Press). */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< COMPLEX*16 CONE, CZERO >*/
+/*< >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL ILQ, ILZ >*/
+/*< INTEGER ICOMPQ, ICOMPZ, JCOL, JROW >*/
+/*< DOUBLE PRECISION C >*/
+/*< COMPLEX*16 CTEMP, S >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< EXTERNAL LSAME >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZLARTG, ZLASET, ZROT >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC DCONJG, MAX >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Decode COMPQ */
+
+/*< IF( LSAME( COMPQ, 'N' ) ) THEN >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ b_dim1 = *ldb;
+ b_offset = 1 + b_dim1;
+ b -= b_offset;
+ q_dim1 = *ldq;
+ q_offset = 1 + q_dim1;
+ q -= q_offset;
+ z_dim1 = *ldz;
+ z_offset = 1 + z_dim1;
+ z__ -= z_offset;
+
+ /* Function Body */
+ if (lsame_(compq, "N", (ftnlen)1, (ftnlen)1)) {
+/*< ILQ = .FALSE. >*/
+ ilq = FALSE_;
+/*< ICOMPQ = 1 >*/
+ icompq = 1;
+/*< ELSE IF( LSAME( COMPQ, 'V' ) ) THEN >*/
+ } else if (lsame_(compq, "V", (ftnlen)1, (ftnlen)1)) {
+/*< ILQ = .TRUE. >*/
+ ilq = TRUE_;
+/*< ICOMPQ = 2 >*/
+ icompq = 2;
+/*< ELSE IF( LSAME( COMPQ, 'I' ) ) THEN >*/
+ } else if (lsame_(compq, "I", (ftnlen)1, (ftnlen)1)) {
+/*< ILQ = .TRUE. >*/
+ ilq = TRUE_;
+/*< ICOMPQ = 3 >*/
+ icompq = 3;
+/*< ELSE >*/
+ } else {
+/*< ICOMPQ = 0 >*/
+ icompq = 0;
+/*< END IF >*/
+ }
+
+/* Decode COMPZ */
+
+/*< IF( LSAME( COMPZ, 'N' ) ) THEN >*/
+ if (lsame_(compz, "N", (ftnlen)1, (ftnlen)1)) {
+/*< ILZ = .FALSE. >*/
+ ilz = FALSE_;
+/*< ICOMPZ = 1 >*/
+ icompz = 1;
+/*< ELSE IF( LSAME( COMPZ, 'V' ) ) THEN >*/
+ } else if (lsame_(compz, "V", (ftnlen)1, (ftnlen)1)) {
+/*< ILZ = .TRUE. >*/
+ ilz = TRUE_;
+/*< ICOMPZ = 2 >*/
+ icompz = 2;
+/*< ELSE IF( LSAME( COMPZ, 'I' ) ) THEN >*/
+ } else if (lsame_(compz, "I", (ftnlen)1, (ftnlen)1)) {
+/*< ILZ = .TRUE. >*/
+ ilz = TRUE_;
+/*< ICOMPZ = 3 >*/
+ icompz = 3;
+/*< ELSE >*/
+ } else {
+/*< ICOMPZ = 0 >*/
+ icompz = 0;
+/*< END IF >*/
+ }
+
+/* Test the input parameters. */
+
+/*< INFO = 0 >*/
+ *info = 0;
+/*< IF( ICOMPQ.LE.0 ) THEN >*/
+ if (icompq <= 0) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( ICOMPZ.LE.0 ) THEN >*/
+ } else if (icompz <= 0) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -3 >*/
+ *info = -3;
+/*< ELSE IF( ILO.LT.1 ) THEN >*/
+ } else if (*ilo < 1) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( IHI.GT.N .OR. IHI.LT.ILO-1 ) THEN >*/
+ } else if (*ihi > *n || *ihi < *ilo - 1) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( LDA.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*lda < max(1,*n)) {
+/*< INFO = -7 >*/
+ *info = -7;
+/*< ELSE IF( LDB.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldb < max(1,*n)) {
+/*< INFO = -9 >*/
+ *info = -9;
+/*< ELSE IF( ( ILQ .AND. LDQ.LT.N ) .OR. LDQ.LT.1 ) THEN >*/
+ } else if ((ilq && *ldq < *n) || *ldq < 1) {
+/*< INFO = -11 >*/
+ *info = -11;
+/*< ELSE IF( ( ILZ .AND. LDZ.LT.N ) .OR. LDZ.LT.1 ) THEN >*/
+ } else if ((ilz && *ldz < *n) || *ldz < 1) {
+/*< INFO = -13 >*/
+ *info = -13;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZGGHRD', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZGGHRD", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Initialize Q and Z if desired. */
+
+/*< >*/
+ if (icompq == 3) {
+ zlaset_("Full", n, n, &c_b2, &c_b1, &q[q_offset], ldq, (ftnlen)4);
+ }
+/*< >*/
+ if (icompz == 3) {
+ zlaset_("Full", n, n, &c_b2, &c_b1, &z__[z_offset], ldz, (ftnlen)4);
+ }
+
+/* Quick return if possible */
+
+/*< >*/
+ if (*n <= 1) {
+ return 0;
+ }
+
+/* Zero out lower triangle of B */
+
+/*< DO 20 JCOL = 1, N - 1 >*/
+ i__1 = *n - 1;
+ for (jcol = 1; jcol <= i__1; ++jcol) {
+/*< DO 10 JROW = JCOL + 1, N >*/
+ i__2 = *n;
+ for (jrow = jcol + 1; jrow <= i__2; ++jrow) {
+/*< B( JROW, JCOL ) = CZERO >*/
+ i__3 = jrow + jcol * b_dim1;
+ b[i__3].r = 0., b[i__3].i = 0.;
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+
+/* Reduce A and B */
+
+/*< DO 40 JCOL = ILO, IHI - 2 >*/
+ i__1 = *ihi - 2;
+ for (jcol = *ilo; jcol <= i__1; ++jcol) {
+
+/*< DO 30 JROW = IHI, JCOL + 2, -1 >*/
+ i__2 = jcol + 2;
+ for (jrow = *ihi; jrow >= i__2; --jrow) {
+
+/* Step 1: rotate rows JROW-1, JROW to kill A(JROW,JCOL) */
+
+/*< CTEMP = A( JROW-1, JCOL ) >*/
+ i__3 = jrow - 1 + jcol * a_dim1;
+ ctemp.r = a[i__3].r, ctemp.i = a[i__3].i;
+/*< >*/
+ zlartg_(&ctemp, &a[jrow + jcol * a_dim1], &c__, &s, &a[jrow - 1 +
+ jcol * a_dim1]);
+/*< A( JROW, JCOL ) = CZERO >*/
+ i__3 = jrow + jcol * a_dim1;
+ a[i__3].r = 0., a[i__3].i = 0.;
+/*< >*/
+ i__3 = *n - jcol;
+ zrot_(&i__3, &a[jrow - 1 + (jcol + 1) * a_dim1], lda, &a[jrow + (
+ jcol + 1) * a_dim1], lda, &c__, &s);
+/*< >*/
+ i__3 = *n + 2 - jrow;
+ zrot_(&i__3, &b[jrow - 1 + (jrow - 1) * b_dim1], ldb, &b[jrow + (
+ jrow - 1) * b_dim1], ldb, &c__, &s);
+/*< >*/
+ if (ilq) {
+ d_cnjg(&z__1, &s);
+ zrot_(n, &q[(jrow - 1) * q_dim1 + 1], &c__1, &q[jrow * q_dim1
+ + 1], &c__1, &c__, &z__1);
+ }
+
+/* Step 2: rotate columns JROW, JROW-1 to kill B(JROW,JROW-1) */
+
+/*< CTEMP = B( JROW, JROW ) >*/
+ i__3 = jrow + jrow * b_dim1;
+ ctemp.r = b[i__3].r, ctemp.i = b[i__3].i;
+/*< >*/
+ zlartg_(&ctemp, &b[jrow + (jrow - 1) * b_dim1], &c__, &s, &b[jrow
+ + jrow * b_dim1]);
+/*< B( JROW, JROW-1 ) = CZERO >*/
+ i__3 = jrow + (jrow - 1) * b_dim1;
+ b[i__3].r = 0., b[i__3].i = 0.;
+/*< CALL ZROT( IHI, A( 1, JROW ), 1, A( 1, JROW-1 ), 1, C, S ) >*/
+ zrot_(ihi, &a[jrow * a_dim1 + 1], &c__1, &a[(jrow - 1) * a_dim1 +
+ 1], &c__1, &c__, &s);
+/*< >*/
+ i__3 = jrow - 1;
+ zrot_(&i__3, &b[jrow * b_dim1 + 1], &c__1, &b[(jrow - 1) * b_dim1
+ + 1], &c__1, &c__, &s);
+/*< >*/
+ if (ilz) {
+ zrot_(n, &z__[jrow * z_dim1 + 1], &c__1, &z__[(jrow - 1) *
+ z_dim1 + 1], &c__1, &c__, &s);
+ }
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZGGHRD */
+
+/*< END >*/
+} /* zgghrd_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.f
new file mode 100644
index 0000000000000000000000000000000000000000..a628bc74b7faa4aef636e168552e5714269c80d8
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.f
@@ -0,0 +1,265 @@
+ SUBROUTINE ZGGHRD( COMPQ, COMPZ, N, ILO, IHI, A, LDA, B, LDB, Q,
+ $ LDQ, Z, LDZ, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER COMPQ, COMPZ
+ INTEGER IHI, ILO, INFO, LDA, LDB, LDQ, LDZ, N
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 A( LDA, * ), B( LDB, * ), Q( LDQ, * ),
+ $ Z( LDZ, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZGGHRD reduces a pair of complex matrices (A,B) to generalized upper
+* Hessenberg form using unitary transformations, where A is a
+* general matrix and B is upper triangular. The form of the
+* generalized eigenvalue problem is
+* A*x = lambda*B*x,
+* and B is typically made upper triangular by computing its QR
+* factorization and moving the unitary matrix Q to the left side
+* of the equation.
+*
+* This subroutine simultaneously reduces A to a Hessenberg matrix H:
+* Q**H*A*Z = H
+* and transforms B to another upper triangular matrix T:
+* Q**H*B*Z = T
+* in order to reduce the problem to its standard form
+* H*y = lambda*T*y
+* where y = Z**H*x.
+*
+* The unitary matrices Q and Z are determined as products of Givens
+* rotations. They may either be formed explicitly, or they may be
+* postmultiplied into input matrices Q1 and Z1, so that
+* Q1 * A * Z1**H = (Q1*Q) * H * (Z1*Z)**H
+* Q1 * B * Z1**H = (Q1*Q) * T * (Z1*Z)**H
+* If Q1 is the unitary matrix from the QR factorization of B in the
+* original equation A*x = lambda*B*x, then ZGGHRD reduces the original
+* problem to generalized Hessenberg form.
+*
+* Arguments
+* =========
+*
+* COMPQ (input) CHARACTER*1
+* = 'N': do not compute Q;
+* = 'I': Q is initialized to the unit matrix, and the
+* unitary matrix Q is returned;
+* = 'V': Q must contain a unitary matrix Q1 on entry,
+* and the product Q1*Q is returned.
+*
+* COMPZ (input) CHARACTER*1
+* = 'N': do not compute Q;
+* = 'I': Q is initialized to the unit matrix, and the
+* unitary matrix Q is returned;
+* = 'V': Q must contain a unitary matrix Q1 on entry,
+* and the product Q1*Q is returned.
+*
+* N (input) INTEGER
+* The order of the matrices A and B. N >= 0.
+*
+* ILO (input) INTEGER
+* IHI (input) INTEGER
+* ILO and IHI mark the rows and columns of A which are to be
+* reduced. It is assumed that A is already upper triangular
+* in rows and columns 1:ILO-1 and IHI+1:N. ILO and IHI are
+* normally set by a previous call to ZGGBAL; otherwise they
+* should be set to 1 and N respectively.
+* 1 <= ILO <= IHI <= N, if N > 0; ILO=1 and IHI=0, if N=0.
+*
+* A (input/output) COMPLEX*16 array, dimension (LDA, N)
+* On entry, the N-by-N general matrix to be reduced.
+* On exit, the upper triangle and the first subdiagonal of A
+* are overwritten with the upper Hessenberg matrix H, and the
+* rest is set to zero.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,N).
+*
+* B (input/output) COMPLEX*16 array, dimension (LDB, N)
+* On entry, the N-by-N upper triangular matrix B.
+* On exit, the upper triangular matrix T = Q**H B Z. The
+* elements below the diagonal are set to zero.
+*
+* LDB (input) INTEGER
+* The leading dimension of the array B. LDB >= max(1,N).
+*
+* Q (input/output) COMPLEX*16 array, dimension (LDQ, N)
+* On entry, if COMPQ = 'V', the unitary matrix Q1, typically
+* from the QR factorization of B.
+* On exit, if COMPQ='I', the unitary matrix Q, and if
+* COMPQ = 'V', the product Q1*Q.
+* Not referenced if COMPQ='N'.
+*
+* LDQ (input) INTEGER
+* The leading dimension of the array Q.
+* LDQ >= N if COMPQ='V' or 'I'; LDQ >= 1 otherwise.
+*
+* Z (input/output) COMPLEX*16 array, dimension (LDZ, N)
+* On entry, if COMPZ = 'V', the unitary matrix Z1.
+* On exit, if COMPZ='I', the unitary matrix Z, and if
+* COMPZ = 'V', the product Z1*Z.
+* Not referenced if COMPZ='N'.
+*
+* LDZ (input) INTEGER
+* The leading dimension of the array Z.
+* LDZ >= N if COMPZ='V' or 'I'; LDZ >= 1 otherwise.
+*
+* INFO (output) INTEGER
+* = 0: successful exit.
+* < 0: if INFO = -i, the i-th argument had an illegal value.
+*
+* Further Details
+* ===============
+*
+* This routine reduces A to Hessenberg and B to triangular form by
+* an unblocked reduction, as described in _Matrix_Computations_,
+* by Golub and van Loan (Johns Hopkins Press).
+*
+* =====================================================================
+*
+* .. Parameters ..
+ COMPLEX*16 CONE, CZERO
+ PARAMETER ( CONE = ( 1.0D+0, 0.0D+0 ),
+ $ CZERO = ( 0.0D+0, 0.0D+0 ) )
+* ..
+* .. Local Scalars ..
+ LOGICAL ILQ, ILZ
+ INTEGER ICOMPQ, ICOMPZ, JCOL, JROW
+ DOUBLE PRECISION C
+ COMPLEX*16 CTEMP, S
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ EXTERNAL LSAME
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZLARTG, ZLASET, ZROT
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC DCONJG, MAX
+* ..
+* .. Executable Statements ..
+*
+* Decode COMPQ
+*
+ IF( LSAME( COMPQ, 'N' ) ) THEN
+ ILQ = .FALSE.
+ ICOMPQ = 1
+ ELSE IF( LSAME( COMPQ, 'V' ) ) THEN
+ ILQ = .TRUE.
+ ICOMPQ = 2
+ ELSE IF( LSAME( COMPQ, 'I' ) ) THEN
+ ILQ = .TRUE.
+ ICOMPQ = 3
+ ELSE
+ ICOMPQ = 0
+ END IF
+*
+* Decode COMPZ
+*
+ IF( LSAME( COMPZ, 'N' ) ) THEN
+ ILZ = .FALSE.
+ ICOMPZ = 1
+ ELSE IF( LSAME( COMPZ, 'V' ) ) THEN
+ ILZ = .TRUE.
+ ICOMPZ = 2
+ ELSE IF( LSAME( COMPZ, 'I' ) ) THEN
+ ILZ = .TRUE.
+ ICOMPZ = 3
+ ELSE
+ ICOMPZ = 0
+ END IF
+*
+* Test the input parameters.
+*
+ INFO = 0
+ IF( ICOMPQ.LE.0 ) THEN
+ INFO = -1
+ ELSE IF( ICOMPZ.LE.0 ) THEN
+ INFO = -2
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -3
+ ELSE IF( ILO.LT.1 ) THEN
+ INFO = -4
+ ELSE IF( IHI.GT.N .OR. IHI.LT.ILO-1 ) THEN
+ INFO = -5
+ ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
+ INFO = -7
+ ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
+ INFO = -9
+ ELSE IF( ( ILQ .AND. LDQ.LT.N ) .OR. LDQ.LT.1 ) THEN
+ INFO = -11
+ ELSE IF( ( ILZ .AND. LDZ.LT.N ) .OR. LDZ.LT.1 ) THEN
+ INFO = -13
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZGGHRD', -INFO )
+ RETURN
+ END IF
+*
+* Initialize Q and Z if desired.
+*
+ IF( ICOMPQ.EQ.3 )
+ $ CALL ZLASET( 'Full', N, N, CZERO, CONE, Q, LDQ )
+ IF( ICOMPZ.EQ.3 )
+ $ CALL ZLASET( 'Full', N, N, CZERO, CONE, Z, LDZ )
+*
+* Quick return if possible
+*
+ IF( N.LE.1 )
+ $ RETURN
+*
+* Zero out lower triangle of B
+*
+ DO 20 JCOL = 1, N - 1
+ DO 10 JROW = JCOL + 1, N
+ B( JROW, JCOL ) = CZERO
+ 10 CONTINUE
+ 20 CONTINUE
+*
+* Reduce A and B
+*
+ DO 40 JCOL = ILO, IHI - 2
+*
+ DO 30 JROW = IHI, JCOL + 2, -1
+*
+* Step 1: rotate rows JROW-1, JROW to kill A(JROW,JCOL)
+*
+ CTEMP = A( JROW-1, JCOL )
+ CALL ZLARTG( CTEMP, A( JROW, JCOL ), C, S,
+ $ A( JROW-1, JCOL ) )
+ A( JROW, JCOL ) = CZERO
+ CALL ZROT( N-JCOL, A( JROW-1, JCOL+1 ), LDA,
+ $ A( JROW, JCOL+1 ), LDA, C, S )
+ CALL ZROT( N+2-JROW, B( JROW-1, JROW-1 ), LDB,
+ $ B( JROW, JROW-1 ), LDB, C, S )
+ IF( ILQ )
+ $ CALL ZROT( N, Q( 1, JROW-1 ), 1, Q( 1, JROW ), 1, C,
+ $ DCONJG( S ) )
+*
+* Step 2: rotate columns JROW, JROW-1 to kill B(JROW,JROW-1)
+*
+ CTEMP = B( JROW, JROW )
+ CALL ZLARTG( CTEMP, B( JROW, JROW-1 ), C, S,
+ $ B( JROW, JROW ) )
+ B( JROW, JROW-1 ) = CZERO
+ CALL ZROT( IHI, A( 1, JROW ), 1, A( 1, JROW-1 ), 1, C, S )
+ CALL ZROT( JROW-1, B( 1, JROW ), 1, B( 1, JROW-1 ), 1, C,
+ $ S )
+ IF( ILZ )
+ $ CALL ZROT( N, Z( 1, JROW ), 1, Z( 1, JROW-1 ), 1, C, S )
+ 30 CONTINUE
+ 40 CONTINUE
+*
+ RETURN
+*
+* End of ZGGHRD
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.h
new file mode 100644
index 0000000000000000000000000000000000000000..d6f640db2b82c8b61cad9b8901dfacaf0f7cc3a3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zgghrd.h
@@ -0,0 +1,18 @@
+extern int v3p_netlib_zgghrd_(
+ char *compq,
+ char *compz,
+ v3p_netlib_integer *n,
+ v3p_netlib_integer *ilo,
+ v3p_netlib_integer *ihi,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *b,
+ v3p_netlib_integer *ldb,
+ v3p_netlib_doublecomplex *q,
+ v3p_netlib_integer *ldq,
+ v3p_netlib_doublecomplex *z__,
+ v3p_netlib_integer *ldz,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen compq_len,
+ v3p_netlib_ftnlen compz_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.P
new file mode 100644
index 0000000000000000000000000000000000000000..8811e9ce461277b7b02baa1af60dd22e8fe995da
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.P
@@ -0,0 +1,9 @@
+extern int zhgeqz_(char *job, char *compq, char *compz, integer *n, integer *ilo, integer *ihi, doublecomplex *h__, integer *ldh, doublecomplex *t, integer *ldt, doublecomplex *alpha, doublecomplex *beta, doublecomplex *q, integer *ldq, doublecomplex *z__, integer *ldz, doublecomplex *work, integer *lwork, doublereal *rwork, integer *info, ftnlen job_len, ftnlen compq_len, ftnlen compz_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zlaset_ 14 8 13 4 4 9 9 9 4 124 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: zlanhs_ 7 6 13 4 9 4 7 124 */
+/*:ref: zscal_ 14 4 4 9 9 4 */
+/*:ref: zlartg_ 14 5 9 9 7 9 9 */
+/*:ref: zrot_ 14 7 4 9 4 9 4 7 9 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.c
new file mode 100644
index 0000000000000000000000000000000000000000..f08880821caaabbdc8c400a29c6253befaac613f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.c
@@ -0,0 +1,1513 @@
+/* lapack/complex16/zhgeqz.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static doublecomplex c_b1 = {0.,0.};
+static doublecomplex c_b2 = {1.,0.};
+static integer c__1 = 1;
+static integer c__2 = 2;
+
+/*< >*/
+/* Subroutine */ int zhgeqz_(char *job, char *compq, char *compz, integer *n,
+ integer *ilo, integer *ihi, doublecomplex *h__, integer *ldh,
+ doublecomplex *t, integer *ldt, doublecomplex *alpha, doublecomplex *
+ beta, doublecomplex *q, integer *ldq, doublecomplex *z__, integer *
+ ldz, doublecomplex *work, integer *lwork, doublereal *rwork, integer *
+ info, ftnlen job_len, ftnlen compq_len, ftnlen compz_len)
+{
+ /* System generated locals */
+ integer h_dim1, h_offset, q_dim1, q_offset, t_dim1, t_offset, z_dim1,
+ z_offset, i__1, i__2, i__3, i__4, i__5, i__6;
+ doublereal d__1, d__2, d__3, d__4, d__5, d__6;
+ doublecomplex z__1, z__2, z__3, z__4, z__5, z__6;
+
+ /* Builtin functions */
+ double z_abs(doublecomplex *);
+ void d_cnjg(doublecomplex *, doublecomplex *);
+ double d_imag(doublecomplex *);
+ void z_div(doublecomplex *, doublecomplex *, doublecomplex *), pow_zi(
+ doublecomplex *, doublecomplex *, integer *), z_sqrt(
+ doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ doublereal c__;
+ integer j;
+ doublecomplex s, t1;
+ integer jc, in;
+ doublecomplex u12;
+ integer jr;
+ doublecomplex ad11, ad12, ad21, ad22;
+ integer jch;
+ logical ilq, ilz;
+ doublereal ulp;
+ doublecomplex abi22;
+ doublereal absb, atol, btol, temp;
+ extern /* Subroutine */ int zrot_(integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublereal *, doublecomplex *);
+ doublereal temp2;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ doublecomplex ctemp;
+ integer iiter, ilast, jiter;
+ doublereal anorm, bnorm;
+ integer maxit;
+ doublecomplex shift;
+ extern /* Subroutine */ int zscal_(integer *, doublecomplex *,
+ doublecomplex *, integer *);
+ doublereal tempr;
+ doublecomplex ctemp2, ctemp3;
+ logical ilazr2;
+ doublereal ascale, bscale;
+ extern doublereal dlamch_(char *, ftnlen);
+ doublecomplex signbc;
+ doublereal safmin;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+ doublecomplex eshift;
+ logical ilschr;
+ integer icompq, ilastm;
+ doublecomplex rtdisc;
+ integer ischur;
+ extern doublereal zlanhs_(char *, integer *, doublecomplex *, integer *,
+ doublereal *, ftnlen);
+ logical ilazro;
+ integer icompz, ifirst;
+ extern /* Subroutine */ int zlartg_(doublecomplex *, doublecomplex *,
+ doublereal *, doublecomplex *, doublecomplex *);
+ integer ifrstm;
+ extern /* Subroutine */ int zlaset_(char *, integer *, integer *,
+ doublecomplex *, doublecomplex *, doublecomplex *, integer *,
+ ftnlen);
+ integer istart;
+ logical lquery;
+ (void)job_len;
+ (void)compq_len;
+ (void)compz_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER COMPQ, COMPZ, JOB >*/
+/*< INTEGER IHI, ILO, INFO, LDH, LDQ, LDT, LDZ, LWORK, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< DOUBLE PRECISION RWORK( * ) >*/
+/*< >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZHGEQZ computes the eigenvalues of a complex matrix pair (H,T), */
+/* where H is an upper Hessenberg matrix and T is upper triangular, */
+/* using the single-shift QZ method. */
+/* Matrix pairs of this type are produced by the reduction to */
+/* generalized upper Hessenberg form of a complex matrix pair (A,B): */
+
+/* A = Q1*H*Z1**H, B = Q1*T*Z1**H, */
+
+/* as computed by ZGGHRD. */
+
+/* If JOB='S', then the Hessenberg-triangular pair (H,T) is */
+/* also reduced to generalized Schur form, */
+
+/* H = Q*S*Z**H, T = Q*P*Z**H, */
+
+/* where Q and Z are unitary matrices and S and P are upper triangular. */
+
+/* Optionally, the unitary matrix Q from the generalized Schur */
+/* factorization may be postmultiplied into an input matrix Q1, and the */
+/* unitary matrix Z may be postmultiplied into an input matrix Z1. */
+/* If Q1 and Z1 are the unitary matrices from ZGGHRD that reduced */
+/* the matrix pair (A,B) to generalized Hessenberg form, then the output */
+/* matrices Q1*Q and Z1*Z are the unitary factors from the generalized */
+/* Schur factorization of (A,B): */
+
+/* A = (Q1*Q)*S*(Z1*Z)**H, B = (Q1*Q)*P*(Z1*Z)**H. */
+
+/* To avoid overflow, eigenvalues of the matrix pair (H,T) */
+/* (equivalently, of (A,B)) are computed as a pair of complex values */
+/* (alpha,beta). If beta is nonzero, lambda = alpha / beta is an */
+/* eigenvalue of the generalized nonsymmetric eigenvalue problem (GNEP) */
+/* A*x = lambda*B*x */
+/* and if alpha is nonzero, mu = beta / alpha is an eigenvalue of the */
+/* alternate form of the GNEP */
+/* mu*A*y = B*y. */
+/* The values of alpha and beta for the i-th eigenvalue can be read */
+/* directly from the generalized Schur form: alpha = S(i,i), */
+/* beta = P(i,i). */
+
+/* Ref: C.B. Moler & G.W. Stewart, "An Algorithm for Generalized Matrix */
+/* Eigenvalue Problems", SIAM J. Numer. Anal., 10(1973), */
+/* pp. 241--256. */
+
+/* Arguments */
+/* ========= */
+
+/* JOB (input) CHARACTER*1 */
+/* = 'E': Compute eigenvalues only; */
+/* = 'S': Computer eigenvalues and the Schur form. */
+
+/* COMPQ (input) CHARACTER*1 */
+/* = 'N': Left Schur vectors (Q) are not computed; */
+/* = 'I': Q is initialized to the unit matrix and the matrix Q */
+/* of left Schur vectors of (H,T) is returned; */
+/* = 'V': Q must contain a unitary matrix Q1 on entry and */
+/* the product Q1*Q is returned. */
+
+/* COMPZ (input) CHARACTER*1 */
+/* = 'N': Right Schur vectors (Z) are not computed; */
+/* = 'I': Q is initialized to the unit matrix and the matrix Z */
+/* of right Schur vectors of (H,T) is returned; */
+/* = 'V': Z must contain a unitary matrix Z1 on entry and */
+/* the product Z1*Z is returned. */
+
+/* N (input) INTEGER */
+/* The order of the matrices H, T, Q, and Z. N >= 0. */
+
+/* ILO (input) INTEGER */
+/* IHI (input) INTEGER */
+/* ILO and IHI mark the rows and columns of H which are in */
+/* Hessenberg form. It is assumed that A is already upper */
+/* triangular in rows and columns 1:ILO-1 and IHI+1:N. */
+/* If N > 0, 1 <= ILO <= IHI <= N; if N = 0, ILO=1 and IHI=0. */
+
+/* H (input/output) COMPLEX*16 array, dimension (LDH, N) */
+/* On entry, the N-by-N upper Hessenberg matrix H. */
+/* On exit, if JOB = 'S', H contains the upper triangular */
+/* matrix S from the generalized Schur factorization. */
+/* If JOB = 'E', the diagonal of H matches that of S, but */
+/* the rest of H is unspecified. */
+
+/* LDH (input) INTEGER */
+/* The leading dimension of the array H. LDH >= max( 1, N ). */
+
+/* T (input/output) COMPLEX*16 array, dimension (LDT, N) */
+/* On entry, the N-by-N upper triangular matrix T. */
+/* On exit, if JOB = 'S', T contains the upper triangular */
+/* matrix P from the generalized Schur factorization. */
+/* If JOB = 'E', the diagonal of T matches that of P, but */
+/* the rest of T is unspecified. */
+
+/* LDT (input) INTEGER */
+/* The leading dimension of the array T. LDT >= max( 1, N ). */
+
+/* ALPHA (output) COMPLEX*16 array, dimension (N) */
+/* The complex scalars alpha that define the eigenvalues of */
+/* GNEP. ALPHA(i) = S(i,i) in the generalized Schur */
+/* factorization. */
+
+/* BETA (output) COMPLEX*16 array, dimension (N) */
+/* The real non-negative scalars beta that define the */
+/* eigenvalues of GNEP. BETA(i) = P(i,i) in the generalized */
+/* Schur factorization. */
+
+/* Together, the quantities alpha = ALPHA(j) and beta = BETA(j) */
+/* represent the j-th eigenvalue of the matrix pair (A,B), in */
+/* one of the forms lambda = alpha/beta or mu = beta/alpha. */
+/* Since either lambda or mu may overflow, they should not, */
+/* in general, be computed. */
+
+/* Q (input/output) COMPLEX*16 array, dimension (LDQ, N) */
+/* On entry, if COMPZ = 'V', the unitary matrix Q1 used in the */
+/* reduction of (A,B) to generalized Hessenberg form. */
+/* On exit, if COMPZ = 'I', the unitary matrix of left Schur */
+/* vectors of (H,T), and if COMPZ = 'V', the unitary matrix of */
+/* left Schur vectors of (A,B). */
+/* Not referenced if COMPZ = 'N'. */
+
+/* LDQ (input) INTEGER */
+/* The leading dimension of the array Q. LDQ >= 1. */
+/* If COMPQ='V' or 'I', then LDQ >= N. */
+
+/* Z (input/output) COMPLEX*16 array, dimension (LDZ, N) */
+/* On entry, if COMPZ = 'V', the unitary matrix Z1 used in the */
+/* reduction of (A,B) to generalized Hessenberg form. */
+/* On exit, if COMPZ = 'I', the unitary matrix of right Schur */
+/* vectors of (H,T), and if COMPZ = 'V', the unitary matrix of */
+/* right Schur vectors of (A,B). */
+/* Not referenced if COMPZ = 'N'. */
+
+/* LDZ (input) INTEGER */
+/* The leading dimension of the array Z. LDZ >= 1. */
+/* If COMPZ='V' or 'I', then LDZ >= N. */
+
+/* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK)) */
+/* On exit, if INFO >= 0, WORK(1) returns the optimal LWORK. */
+
+/* LWORK (input) INTEGER */
+/* The dimension of the array WORK. LWORK >= max(1,N). */
+
+/* If LWORK = -1, then a workspace query is assumed; the routine */
+/* only calculates the optimal size of the WORK array, returns */
+/* this value as the first entry of the WORK array, and no error */
+/* message related to LWORK is issued by XERBLA. */
+
+/* RWORK (workspace) DOUBLE PRECISION array, dimension (N) */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+/* = 1,...,N: the QZ iteration did not converge. (H,T) is not */
+/* in Schur form, but ALPHA(i) and BETA(i), */
+/* i=INFO+1,...,N should be correct. */
+/* = N+1,...,2*N: the shift calculation failed. (H,T) is not */
+/* in Schur form, but ALPHA(i) and BETA(i), */
+/* i=INFO-N+1,...,N should be correct. */
+
+/* Further Details */
+/* =============== */
+
+/* We assume that complex ABS works as long as its value is less than */
+/* overflow. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< COMPLEX*16 CZERO, CONE >*/
+/*< >*/
+/*< DOUBLE PRECISION ZERO, ONE >*/
+/*< PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) >*/
+/*< DOUBLE PRECISION HALF >*/
+/*< PARAMETER ( HALF = 0.5D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL ILAZR2, ILAZRO, ILQ, ILSCHR, ILZ, LQUERY >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< DOUBLE PRECISION DLAMCH, ZLANHS >*/
+/*< EXTERNAL LSAME, DLAMCH, ZLANHS >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZLARTG, ZLASET, ZROT, ZSCAL >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< >*/
+/* .. */
+/* .. Statement Functions .. */
+/*< DOUBLE PRECISION ABS1 >*/
+/* .. */
+/* .. Statement Function definitions .. */
+/*< ABS1( X ) = ABS( DBLE( X ) ) + ABS( DIMAG( X ) ) >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Decode JOB, COMPQ, COMPZ */
+
+/*< IF( LSAME( JOB, 'E' ) ) THEN >*/
+ /* Parameter adjustments */
+ h_dim1 = *ldh;
+ h_offset = 1 + h_dim1;
+ h__ -= h_offset;
+ t_dim1 = *ldt;
+ t_offset = 1 + t_dim1;
+ t -= t_offset;
+ --alpha;
+ --beta;
+ q_dim1 = *ldq;
+ q_offset = 1 + q_dim1;
+ q -= q_offset;
+ z_dim1 = *ldz;
+ z_offset = 1 + z_dim1;
+ z__ -= z_offset;
+ --work;
+ --rwork;
+
+ /* Function Body */
+ if (lsame_(job, "E", (ftnlen)1, (ftnlen)1)) {
+/*< ILSCHR = .FALSE. >*/
+ ilschr = FALSE_;
+/*< ISCHUR = 1 >*/
+ ischur = 1;
+/*< ELSE IF( LSAME( JOB, 'S' ) ) THEN >*/
+ } else if (lsame_(job, "S", (ftnlen)1, (ftnlen)1)) {
+/*< ILSCHR = .TRUE. >*/
+ ilschr = TRUE_;
+/*< ISCHUR = 2 >*/
+ ischur = 2;
+/*< ELSE >*/
+ } else {
+/*< ISCHUR = 0 >*/
+ ischur = 0;
+/*< END IF >*/
+ }
+
+/*< IF( LSAME( COMPQ, 'N' ) ) THEN >*/
+ if (lsame_(compq, "N", (ftnlen)1, (ftnlen)1)) {
+/*< ILQ = .FALSE. >*/
+ ilq = FALSE_;
+/*< ICOMPQ = 1 >*/
+ icompq = 1;
+/*< ELSE IF( LSAME( COMPQ, 'V' ) ) THEN >*/
+ } else if (lsame_(compq, "V", (ftnlen)1, (ftnlen)1)) {
+/*< ILQ = .TRUE. >*/
+ ilq = TRUE_;
+/*< ICOMPQ = 2 >*/
+ icompq = 2;
+/*< ELSE IF( LSAME( COMPQ, 'I' ) ) THEN >*/
+ } else if (lsame_(compq, "I", (ftnlen)1, (ftnlen)1)) {
+/*< ILQ = .TRUE. >*/
+ ilq = TRUE_;
+/*< ICOMPQ = 3 >*/
+ icompq = 3;
+/*< ELSE >*/
+ } else {
+/*< ICOMPQ = 0 >*/
+ icompq = 0;
+/*< END IF >*/
+ }
+
+/*< IF( LSAME( COMPZ, 'N' ) ) THEN >*/
+ if (lsame_(compz, "N", (ftnlen)1, (ftnlen)1)) {
+/*< ILZ = .FALSE. >*/
+ ilz = FALSE_;
+/*< ICOMPZ = 1 >*/
+ icompz = 1;
+/*< ELSE IF( LSAME( COMPZ, 'V' ) ) THEN >*/
+ } else if (lsame_(compz, "V", (ftnlen)1, (ftnlen)1)) {
+/*< ILZ = .TRUE. >*/
+ ilz = TRUE_;
+/*< ICOMPZ = 2 >*/
+ icompz = 2;
+/*< ELSE IF( LSAME( COMPZ, 'I' ) ) THEN >*/
+ } else if (lsame_(compz, "I", (ftnlen)1, (ftnlen)1)) {
+/*< ILZ = .TRUE. >*/
+ ilz = TRUE_;
+/*< ICOMPZ = 3 >*/
+ icompz = 3;
+/*< ELSE >*/
+ } else {
+/*< ICOMPZ = 0 >*/
+ icompz = 0;
+/*< END IF >*/
+ }
+
+/* Check Argument Values */
+
+/*< INFO = 0 >*/
+ *info = 0;
+/*< WORK( 1 ) = MAX( 1, N ) >*/
+ i__1 = max(1,*n);
+ work[1].r = (doublereal) i__1, work[1].i = 0.;
+/*< LQUERY = ( LWORK.EQ.-1 ) >*/
+ lquery = *lwork == -1;
+/*< IF( ISCHUR.EQ.0 ) THEN >*/
+ if (ischur == 0) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( ICOMPQ.EQ.0 ) THEN >*/
+ } else if (icompq == 0) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( ICOMPZ.EQ.0 ) THEN >*/
+ } else if (icompz == 0) {
+/*< INFO = -3 >*/
+ *info = -3;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( ILO.LT.1 ) THEN >*/
+ } else if (*ilo < 1) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( IHI.GT.N .OR. IHI.LT.ILO-1 ) THEN >*/
+ } else if (*ihi > *n || *ihi < *ilo - 1) {
+/*< INFO = -6 >*/
+ *info = -6;
+/*< ELSE IF( LDH.LT.N ) THEN >*/
+ } else if (*ldh < *n) {
+/*< INFO = -8 >*/
+ *info = -8;
+/*< ELSE IF( LDT.LT.N ) THEN >*/
+ } else if (*ldt < *n) {
+/*< INFO = -10 >*/
+ *info = -10;
+/*< ELSE IF( LDQ.LT.1 .OR. ( ILQ .AND. LDQ.LT.N ) ) THEN >*/
+ } else if (*ldq < 1 || (ilq && *ldq < *n)) {
+/*< INFO = -14 >*/
+ *info = -14;
+/*< ELSE IF( LDZ.LT.1 .OR. ( ILZ .AND. LDZ.LT.N ) ) THEN >*/
+ } else if (*ldz < 1 || (ilz && *ldz < *n)) {
+/*< INFO = -16 >*/
+ *info = -16;
+/*< ELSE IF( LWORK.LT.MAX( 1, N ) .AND. .NOT.LQUERY ) THEN >*/
+ } else if (*lwork < max(1,*n) && ! lquery) {
+/*< INFO = -18 >*/
+ *info = -18;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZHGEQZ', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZHGEQZ", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< ELSE IF( LQUERY ) THEN >*/
+ } else if (lquery) {
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/* WORK( 1 ) = CMPLX( 1 ) */
+/*< IF( N.LE.0 ) THEN >*/
+ if (*n <= 0) {
+/*< WORK( 1 ) = DCMPLX( 1 ) >*/
+ work[1].r = 1., work[1].i = 0.;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Initialize Q and Z */
+
+/*< >*/
+ if (icompq == 3) {
+ zlaset_("Full", n, n, &c_b1, &c_b2, &q[q_offset], ldq, (ftnlen)4);
+ }
+/*< >*/
+ if (icompz == 3) {
+ zlaset_("Full", n, n, &c_b1, &c_b2, &z__[z_offset], ldz, (ftnlen)4);
+ }
+
+/* Machine Constants */
+
+/*< IN = IHI + 1 - ILO >*/
+ in = *ihi + 1 - *ilo;
+/*< SAFMIN = DLAMCH( 'S' ) >*/
+ safmin = dlamch_("S", (ftnlen)1);
+/*< ULP = DLAMCH( 'E' )*DLAMCH( 'B' ) >*/
+ ulp = dlamch_("E", (ftnlen)1) * dlamch_("B", (ftnlen)1);
+/*< ANORM = ZLANHS( 'F', IN, H( ILO, ILO ), LDH, RWORK ) >*/
+ anorm = zlanhs_("F", &in, &h__[*ilo + *ilo * h_dim1], ldh, &rwork[1], (
+ ftnlen)1);
+/*< BNORM = ZLANHS( 'F', IN, T( ILO, ILO ), LDT, RWORK ) >*/
+ bnorm = zlanhs_("F", &in, &t[*ilo + *ilo * t_dim1], ldt, &rwork[1], (
+ ftnlen)1);
+/*< ATOL = MAX( SAFMIN, ULP*ANORM ) >*/
+/* Computing MAX */
+ d__1 = safmin, d__2 = ulp * anorm;
+ atol = max(d__1,d__2);
+/*< BTOL = MAX( SAFMIN, ULP*BNORM ) >*/
+/* Computing MAX */
+ d__1 = safmin, d__2 = ulp * bnorm;
+ btol = max(d__1,d__2);
+/*< ASCALE = ONE / MAX( SAFMIN, ANORM ) >*/
+ ascale = 1. / max(safmin,anorm);
+/*< BSCALE = ONE / MAX( SAFMIN, BNORM ) >*/
+ bscale = 1. / max(safmin,bnorm);
+
+
+/* Set Eigenvalues IHI+1:N */
+
+/*< DO 10 J = IHI + 1, N >*/
+ i__1 = *n;
+ for (j = *ihi + 1; j <= i__1; ++j) {
+/*< ABSB = ABS( T( J, J ) ) >*/
+ absb = z_abs(&t[j + j * t_dim1]);
+/*< IF( ABSB.GT.SAFMIN ) THEN >*/
+ if (absb > safmin) {
+/*< SIGNBC = DCONJG( T( J, J ) / ABSB ) >*/
+ i__2 = j + j * t_dim1;
+ z__2.r = t[i__2].r / absb, z__2.i = t[i__2].i / absb;
+ d_cnjg(&z__1, &z__2);
+ signbc.r = z__1.r, signbc.i = z__1.i;
+/*< T( J, J ) = ABSB >*/
+ i__2 = j + j * t_dim1;
+ t[i__2].r = absb, t[i__2].i = 0.;
+/*< IF( ILSCHR ) THEN >*/
+ if (ilschr) {
+/*< CALL ZSCAL( J-1, SIGNBC, T( 1, J ), 1 ) >*/
+ i__2 = j - 1;
+ zscal_(&i__2, &signbc, &t[j * t_dim1 + 1], &c__1);
+/*< CALL ZSCAL( J, SIGNBC, H( 1, J ), 1 ) >*/
+ zscal_(&j, &signbc, &h__[j * h_dim1 + 1], &c__1);
+/*< ELSE >*/
+ } else {
+/*< H( J, J ) = H( J, J )*SIGNBC >*/
+ i__2 = j + j * h_dim1;
+ i__3 = j + j * h_dim1;
+ z__1.r = h__[i__3].r * signbc.r - h__[i__3].i * signbc.i,
+ z__1.i = h__[i__3].r * signbc.i + h__[i__3].i *
+ signbc.r;
+ h__[i__2].r = z__1.r, h__[i__2].i = z__1.i;
+/*< END IF >*/
+ }
+/*< >*/
+ if (ilz) {
+ zscal_(n, &signbc, &z__[j * z_dim1 + 1], &c__1);
+ }
+/*< ELSE >*/
+ } else {
+/*< T( J, J ) = CZERO >*/
+ i__2 = j + j * t_dim1;
+ t[i__2].r = 0., t[i__2].i = 0.;
+/*< END IF >*/
+ }
+/*< ALPHA( J ) = H( J, J ) >*/
+ i__2 = j;
+ i__3 = j + j * h_dim1;
+ alpha[i__2].r = h__[i__3].r, alpha[i__2].i = h__[i__3].i;
+/*< BETA( J ) = T( J, J ) >*/
+ i__2 = j;
+ i__3 = j + j * t_dim1;
+ beta[i__2].r = t[i__3].r, beta[i__2].i = t[i__3].i;
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+
+/* If IHI < ILO, skip QZ steps */
+
+/*< >*/
+ if (*ihi < *ilo) {
+ goto L190;
+ }
+
+/* MAIN QZ ITERATION LOOP */
+
+/* Initialize dynamic indices */
+
+/* Eigenvalues ILAST+1:N have been found. */
+/* Column operations modify rows IFRSTM:whatever */
+/* Row operations modify columns whatever:ILASTM */
+
+/* If only eigenvalues are being computed, then */
+/* IFRSTM is the row of the last splitting row above row ILAST; */
+/* this is always at least ILO. */
+/* IITER counts iterations since the last eigenvalue was found, */
+/* to tell when to use an extraordinary shift. */
+/* MAXIT is the maximum number of QZ sweeps allowed. */
+
+/*< ILAST = IHI >*/
+ ilast = *ihi;
+/*< IF( ILSCHR ) THEN >*/
+ if (ilschr) {
+/*< IFRSTM = 1 >*/
+ ifrstm = 1;
+/*< ILASTM = N >*/
+ ilastm = *n;
+/*< ELSE >*/
+ } else {
+/*< IFRSTM = ILO >*/
+ ifrstm = *ilo;
+/*< ILASTM = IHI >*/
+ ilastm = *ihi;
+/*< END IF >*/
+ }
+/*< IITER = 0 >*/
+ iiter = 0;
+/*< ESHIFT = CZERO >*/
+ eshift.r = 0., eshift.i = 0.;
+/*< MAXIT = 30*( IHI-ILO+1 ) >*/
+ maxit = (*ihi - *ilo + 1) * 30;
+
+/*< DO 170 JITER = 1, MAXIT >*/
+ i__1 = maxit;
+ for (jiter = 1; jiter <= i__1; ++jiter) {
+
+/* Check for too many iterations. */
+
+/*< >*/
+ if (jiter > maxit) {
+ goto L180;
+ }
+
+/* Split the matrix if possible. */
+
+/* Two tests: */
+/* 1: H(j,j-1)=0 or j=ILO */
+/* 2: T(j,j)=0 */
+
+/* Special case: j=ILAST */
+
+/*< IF( ILAST.EQ.ILO ) THEN >*/
+ if (ilast == *ilo) {
+/*< GO TO 60 >*/
+ goto L60;
+/*< ELSE >*/
+ } else {
+/*< IF( ABS1( H( ILAST, ILAST-1 ) ).LE.ATOL ) THEN >*/
+ i__2 = ilast + (ilast - 1) * h_dim1;
+ if ((d__1 = h__[i__2].r, abs(d__1)) + (d__2 = d_imag(&h__[ilast +
+ (ilast - 1) * h_dim1]), abs(d__2)) <= atol) {
+/*< H( ILAST, ILAST-1 ) = CZERO >*/
+ i__2 = ilast + (ilast - 1) * h_dim1;
+ h__[i__2].r = 0., h__[i__2].i = 0.;
+/*< GO TO 60 >*/
+ goto L60;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/*< IF( ABS( T( ILAST, ILAST ) ).LE.BTOL ) THEN >*/
+ if (z_abs(&t[ilast + ilast * t_dim1]) <= btol) {
+/*< T( ILAST, ILAST ) = CZERO >*/
+ i__2 = ilast + ilast * t_dim1;
+ t[i__2].r = 0., t[i__2].i = 0.;
+/*< GO TO 50 >*/
+ goto L50;
+/*< END IF >*/
+ }
+
+/* General case: j<ILAST */
+
+/*< DO 40 J = ILAST - 1, ILO, -1 >*/
+ i__2 = *ilo;
+ for (j = ilast - 1; j >= i__2; --j) {
+
+/* Test 1: for H(j,j-1)=0 or j=ILO */
+
+/*< IF( J.EQ.ILO ) THEN >*/
+ if (j == *ilo) {
+/*< ILAZRO = .TRUE. >*/
+ ilazro = TRUE_;
+/*< ELSE >*/
+ } else {
+/*< IF( ABS1( H( J, J-1 ) ).LE.ATOL ) THEN >*/
+ i__3 = j + (j - 1) * h_dim1;
+ if ((d__1 = h__[i__3].r, abs(d__1)) + (d__2 = d_imag(&h__[j +
+ (j - 1) * h_dim1]), abs(d__2)) <= atol) {
+/*< H( J, J-1 ) = CZERO >*/
+ i__3 = j + (j - 1) * h_dim1;
+ h__[i__3].r = 0., h__[i__3].i = 0.;
+/*< ILAZRO = .TRUE. >*/
+ ilazro = TRUE_;
+/*< ELSE >*/
+ } else {
+/*< ILAZRO = .FALSE. >*/
+ ilazro = FALSE_;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/* Test 2: for T(j,j)=0 */
+
+/*< IF( ABS( T( J, J ) ).LT.BTOL ) THEN >*/
+ if (z_abs(&t[j + j * t_dim1]) < btol) {
+/*< T( J, J ) = CZERO >*/
+ i__3 = j + j * t_dim1;
+ t[i__3].r = 0., t[i__3].i = 0.;
+
+/* Test 1a: Check for 2 consecutive small subdiagonals in A */
+
+/*< ILAZR2 = .FALSE. >*/
+ ilazr2 = FALSE_;
+/*< IF( .NOT.ILAZRO ) THEN >*/
+ if (! ilazro) {
+/*< >*/
+ i__3 = j + (j - 1) * h_dim1;
+ i__4 = j + 1 + j * h_dim1;
+ i__5 = j + j * h_dim1;
+ if (((d__1 = h__[i__3].r, abs(d__1)) + (d__2 = d_imag(&
+ h__[j + (j - 1) * h_dim1]), abs(d__2))) * (ascale
+ * ((d__3 = h__[i__4].r, abs(d__3)) + (d__4 =
+ d_imag(&h__[j + 1 + j * h_dim1]), abs(d__4)))) <=
+ ((d__5 = h__[i__5].r, abs(d__5)) + (d__6 = d_imag(
+ &h__[j + j * h_dim1]), abs(d__6))) * (ascale *
+ atol)) {
+ ilazr2 = TRUE_;
+ }
+/*< END IF >*/
+ }
+
+/* If both tests pass (1 & 2), i.e., the leading diagonal */
+/* element of B in the block is zero, split a 1x1 block off */
+/* at the top. (I.e., at the J-th row/column) The leading */
+/* diagonal element of the remainder can also be zero, so */
+/* this may have to be done repeatedly. */
+
+/*< IF( ILAZRO .OR. ILAZR2 ) THEN >*/
+ if (ilazro || ilazr2) {
+/*< DO 20 JCH = J, ILAST - 1 >*/
+ i__3 = ilast - 1;
+ for (jch = j; jch <= i__3; ++jch) {
+/*< CTEMP = H( JCH, JCH ) >*/
+ i__4 = jch + jch * h_dim1;
+ ctemp.r = h__[i__4].r, ctemp.i = h__[i__4].i;
+/*< >*/
+ zlartg_(&ctemp, &h__[jch + 1 + jch * h_dim1], &c__, &
+ s, &h__[jch + jch * h_dim1]);
+/*< H( JCH+1, JCH ) = CZERO >*/
+ i__4 = jch + 1 + jch * h_dim1;
+ h__[i__4].r = 0., h__[i__4].i = 0.;
+/*< >*/
+ i__4 = ilastm - jch;
+ zrot_(&i__4, &h__[jch + (jch + 1) * h_dim1], ldh, &
+ h__[jch + 1 + (jch + 1) * h_dim1], ldh, &c__,
+ &s);
+/*< >*/
+ i__4 = ilastm - jch;
+ zrot_(&i__4, &t[jch + (jch + 1) * t_dim1], ldt, &t[
+ jch + 1 + (jch + 1) * t_dim1], ldt, &c__, &s);
+/*< >*/
+ if (ilq) {
+ d_cnjg(&z__1, &s);
+ zrot_(n, &q[jch * q_dim1 + 1], &c__1, &q[(jch + 1)
+ * q_dim1 + 1], &c__1, &c__, &z__1);
+ }
+/*< >*/
+ if (ilazr2) {
+ i__4 = jch + (jch - 1) * h_dim1;
+ i__5 = jch + (jch - 1) * h_dim1;
+ z__1.r = c__ * h__[i__5].r, z__1.i = c__ * h__[
+ i__5].i;
+ h__[i__4].r = z__1.r, h__[i__4].i = z__1.i;
+ }
+/*< ILAZR2 = .FALSE. >*/
+ ilazr2 = FALSE_;
+/*< IF( ABS1( T( JCH+1, JCH+1 ) ).GE.BTOL ) THEN >*/
+ i__4 = jch + 1 + (jch + 1) * t_dim1;
+ if ((d__1 = t[i__4].r, abs(d__1)) + (d__2 = d_imag(&t[
+ jch + 1 + (jch + 1) * t_dim1]), abs(d__2)) >=
+ btol) {
+/*< IF( JCH+1.GE.ILAST ) THEN >*/
+ if (jch + 1 >= ilast) {
+/*< GO TO 60 >*/
+ goto L60;
+/*< ELSE >*/
+ } else {
+/*< IFIRST = JCH + 1 >*/
+ ifirst = jch + 1;
+/*< GO TO 70 >*/
+ goto L70;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< T( JCH+1, JCH+1 ) = CZERO >*/
+ i__4 = jch + 1 + (jch + 1) * t_dim1;
+ t[i__4].r = 0., t[i__4].i = 0.;
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< GO TO 50 >*/
+ goto L50;
+/*< ELSE >*/
+ } else {
+
+/* Only test 2 passed -- chase the zero to T(ILAST,ILAST) */
+/* Then process as in the case T(ILAST,ILAST)=0 */
+
+/*< DO 30 JCH = J, ILAST - 1 >*/
+ i__3 = ilast - 1;
+ for (jch = j; jch <= i__3; ++jch) {
+/*< CTEMP = T( JCH, JCH+1 ) >*/
+ i__4 = jch + (jch + 1) * t_dim1;
+ ctemp.r = t[i__4].r, ctemp.i = t[i__4].i;
+/*< >*/
+ zlartg_(&ctemp, &t[jch + 1 + (jch + 1) * t_dim1], &
+ c__, &s, &t[jch + (jch + 1) * t_dim1]);
+/*< T( JCH+1, JCH+1 ) = CZERO >*/
+ i__4 = jch + 1 + (jch + 1) * t_dim1;
+ t[i__4].r = 0., t[i__4].i = 0.;
+/*< >*/
+ if (jch < ilastm - 1) {
+ i__4 = ilastm - jch - 1;
+ zrot_(&i__4, &t[jch + (jch + 2) * t_dim1], ldt, &
+ t[jch + 1 + (jch + 2) * t_dim1], ldt, &
+ c__, &s);
+ }
+/*< >*/
+ i__4 = ilastm - jch + 2;
+ zrot_(&i__4, &h__[jch + (jch - 1) * h_dim1], ldh, &
+ h__[jch + 1 + (jch - 1) * h_dim1], ldh, &c__,
+ &s);
+/*< >*/
+ if (ilq) {
+ d_cnjg(&z__1, &s);
+ zrot_(n, &q[jch * q_dim1 + 1], &c__1, &q[(jch + 1)
+ * q_dim1 + 1], &c__1, &c__, &z__1);
+ }
+/*< CTEMP = H( JCH+1, JCH ) >*/
+ i__4 = jch + 1 + jch * h_dim1;
+ ctemp.r = h__[i__4].r, ctemp.i = h__[i__4].i;
+/*< >*/
+ zlartg_(&ctemp, &h__[jch + 1 + (jch - 1) * h_dim1], &
+ c__, &s, &h__[jch + 1 + jch * h_dim1]);
+/*< H( JCH+1, JCH-1 ) = CZERO >*/
+ i__4 = jch + 1 + (jch - 1) * h_dim1;
+ h__[i__4].r = 0., h__[i__4].i = 0.;
+/*< >*/
+ i__4 = jch + 1 - ifrstm;
+ zrot_(&i__4, &h__[ifrstm + jch * h_dim1], &c__1, &h__[
+ ifrstm + (jch - 1) * h_dim1], &c__1, &c__, &s)
+ ;
+/*< >*/
+ i__4 = jch - ifrstm;
+ zrot_(&i__4, &t[ifrstm + jch * t_dim1], &c__1, &t[
+ ifrstm + (jch - 1) * t_dim1], &c__1, &c__, &s)
+ ;
+/*< >*/
+ if (ilz) {
+ zrot_(n, &z__[jch * z_dim1 + 1], &c__1, &z__[(jch
+ - 1) * z_dim1 + 1], &c__1, &c__, &s);
+ }
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< GO TO 50 >*/
+ goto L50;
+/*< END IF >*/
+ }
+/*< ELSE IF( ILAZRO ) THEN >*/
+ } else if (ilazro) {
+
+/* Only test 1 passed -- work on J:ILAST */
+
+/*< IFIRST = J >*/
+ ifirst = j;
+/*< GO TO 70 >*/
+ goto L70;
+/*< END IF >*/
+ }
+
+/* Neither test passed -- try next J */
+
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+
+/* (Drop-through is "impossible") */
+
+/*< INFO = 2*N + 1 >*/
+ *info = (*n << 1) + 1;
+/*< GO TO 210 >*/
+ goto L210;
+
+/* T(ILAST,ILAST)=0 -- clear H(ILAST,ILAST-1) to split off a */
+/* 1x1 block. */
+
+/*< 50 CONTINUE >*/
+L50:
+/*< CTEMP = H( ILAST, ILAST ) >*/
+ i__2 = ilast + ilast * h_dim1;
+ ctemp.r = h__[i__2].r, ctemp.i = h__[i__2].i;
+/*< >*/
+ zlartg_(&ctemp, &h__[ilast + (ilast - 1) * h_dim1], &c__, &s, &h__[
+ ilast + ilast * h_dim1]);
+/*< H( ILAST, ILAST-1 ) = CZERO >*/
+ i__2 = ilast + (ilast - 1) * h_dim1;
+ h__[i__2].r = 0., h__[i__2].i = 0.;
+/*< >*/
+ i__2 = ilast - ifrstm;
+ zrot_(&i__2, &h__[ifrstm + ilast * h_dim1], &c__1, &h__[ifrstm + (
+ ilast - 1) * h_dim1], &c__1, &c__, &s);
+/*< >*/
+ i__2 = ilast - ifrstm;
+ zrot_(&i__2, &t[ifrstm + ilast * t_dim1], &c__1, &t[ifrstm + (ilast -
+ 1) * t_dim1], &c__1, &c__, &s);
+/*< >*/
+ if (ilz) {
+ zrot_(n, &z__[ilast * z_dim1 + 1], &c__1, &z__[(ilast - 1) *
+ z_dim1 + 1], &c__1, &c__, &s);
+ }
+
+/* H(ILAST,ILAST-1)=0 -- Standardize B, set ALPHA and BETA */
+
+/*< 60 CONTINUE >*/
+L60:
+/*< ABSB = ABS( T( ILAST, ILAST ) ) >*/
+ absb = z_abs(&t[ilast + ilast * t_dim1]);
+/*< IF( ABSB.GT.SAFMIN ) THEN >*/
+ if (absb > safmin) {
+/*< SIGNBC = DCONJG( T( ILAST, ILAST ) / ABSB ) >*/
+ i__2 = ilast + ilast * t_dim1;
+ z__2.r = t[i__2].r / absb, z__2.i = t[i__2].i / absb;
+ d_cnjg(&z__1, &z__2);
+ signbc.r = z__1.r, signbc.i = z__1.i;
+/*< T( ILAST, ILAST ) = ABSB >*/
+ i__2 = ilast + ilast * t_dim1;
+ t[i__2].r = absb, t[i__2].i = 0.;
+/*< IF( ILSCHR ) THEN >*/
+ if (ilschr) {
+/*< CALL ZSCAL( ILAST-IFRSTM, SIGNBC, T( IFRSTM, ILAST ), 1 ) >*/
+ i__2 = ilast - ifrstm;
+ zscal_(&i__2, &signbc, &t[ifrstm + ilast * t_dim1], &c__1);
+/*< >*/
+ i__2 = ilast + 1 - ifrstm;
+ zscal_(&i__2, &signbc, &h__[ifrstm + ilast * h_dim1], &c__1);
+/*< ELSE >*/
+ } else {
+/*< H( ILAST, ILAST ) = H( ILAST, ILAST )*SIGNBC >*/
+ i__2 = ilast + ilast * h_dim1;
+ i__3 = ilast + ilast * h_dim1;
+ z__1.r = h__[i__3].r * signbc.r - h__[i__3].i * signbc.i,
+ z__1.i = h__[i__3].r * signbc.i + h__[i__3].i *
+ signbc.r;
+ h__[i__2].r = z__1.r, h__[i__2].i = z__1.i;
+/*< END IF >*/
+ }
+/*< >*/
+ if (ilz) {
+ zscal_(n, &signbc, &z__[ilast * z_dim1 + 1], &c__1);
+ }
+/*< ELSE >*/
+ } else {
+/*< T( ILAST, ILAST ) = CZERO >*/
+ i__2 = ilast + ilast * t_dim1;
+ t[i__2].r = 0., t[i__2].i = 0.;
+/*< END IF >*/
+ }
+/*< ALPHA( ILAST ) = H( ILAST, ILAST ) >*/
+ i__2 = ilast;
+ i__3 = ilast + ilast * h_dim1;
+ alpha[i__2].r = h__[i__3].r, alpha[i__2].i = h__[i__3].i;
+/*< BETA( ILAST ) = T( ILAST, ILAST ) >*/
+ i__2 = ilast;
+ i__3 = ilast + ilast * t_dim1;
+ beta[i__2].r = t[i__3].r, beta[i__2].i = t[i__3].i;
+
+/* Go to next block -- exit if finished. */
+
+/*< ILAST = ILAST - 1 >*/
+ --ilast;
+/*< >*/
+ if (ilast < *ilo) {
+ goto L190;
+ }
+
+/* Reset counters */
+
+/*< IITER = 0 >*/
+ iiter = 0;
+/*< ESHIFT = CZERO >*/
+ eshift.r = 0., eshift.i = 0.;
+/*< IF( .NOT.ILSCHR ) THEN >*/
+ if (! ilschr) {
+/*< ILASTM = ILAST >*/
+ ilastm = ilast;
+/*< >*/
+ if (ifrstm > ilast) {
+ ifrstm = *ilo;
+ }
+/*< END IF >*/
+ }
+/*< GO TO 160 >*/
+ goto L160;
+
+/* QZ step */
+
+/* This iteration only involves rows/columns IFIRST:ILAST. We */
+/* assume IFIRST < ILAST, and that the diagonal of B is non-zero. */
+
+/*< 70 CONTINUE >*/
+L70:
+/*< IITER = IITER + 1 >*/
+ ++iiter;
+/*< IF( .NOT.ILSCHR ) THEN >*/
+ if (! ilschr) {
+/*< IFRSTM = IFIRST >*/
+ ifrstm = ifirst;
+/*< END IF >*/
+ }
+
+/* Compute the Shift. */
+
+/* At this point, IFIRST < ILAST, and the diagonal elements of */
+/* T(IFIRST:ILAST,IFIRST,ILAST) are larger than BTOL (in */
+/* magnitude) */
+
+/*< IF( ( IITER / 10 )*10.NE.IITER ) THEN >*/
+ if (iiter / 10 * 10 != iiter) {
+
+/* The Wilkinson shift (AEP p.512), i.e., the eigenvalue of */
+/* the bottom-right 2x2 block of A inv(B) which is nearest to */
+/* the bottom-right element. */
+
+/* We factor B as U*D, where U has unit diagonals, and */
+/* compute (A*inv(D))*inv(U). */
+
+/*< >*/
+ i__2 = ilast - 1 + ilast * t_dim1;
+ z__2.r = bscale * t[i__2].r, z__2.i = bscale * t[i__2].i;
+ i__3 = ilast + ilast * t_dim1;
+ z__3.r = bscale * t[i__3].r, z__3.i = bscale * t[i__3].i;
+ z_div(&z__1, &z__2, &z__3);
+ u12.r = z__1.r, u12.i = z__1.i;
+/*< >*/
+ i__2 = ilast - 1 + (ilast - 1) * h_dim1;
+ z__2.r = ascale * h__[i__2].r, z__2.i = ascale * h__[i__2].i;
+ i__3 = ilast - 1 + (ilast - 1) * t_dim1;
+ z__3.r = bscale * t[i__3].r, z__3.i = bscale * t[i__3].i;
+ z_div(&z__1, &z__2, &z__3);
+ ad11.r = z__1.r, ad11.i = z__1.i;
+/*< >*/
+ i__2 = ilast + (ilast - 1) * h_dim1;
+ z__2.r = ascale * h__[i__2].r, z__2.i = ascale * h__[i__2].i;
+ i__3 = ilast - 1 + (ilast - 1) * t_dim1;
+ z__3.r = bscale * t[i__3].r, z__3.i = bscale * t[i__3].i;
+ z_div(&z__1, &z__2, &z__3);
+ ad21.r = z__1.r, ad21.i = z__1.i;
+/*< >*/
+ i__2 = ilast - 1 + ilast * h_dim1;
+ z__2.r = ascale * h__[i__2].r, z__2.i = ascale * h__[i__2].i;
+ i__3 = ilast + ilast * t_dim1;
+ z__3.r = bscale * t[i__3].r, z__3.i = bscale * t[i__3].i;
+ z_div(&z__1, &z__2, &z__3);
+ ad12.r = z__1.r, ad12.i = z__1.i;
+/*< >*/
+ i__2 = ilast + ilast * h_dim1;
+ z__2.r = ascale * h__[i__2].r, z__2.i = ascale * h__[i__2].i;
+ i__3 = ilast + ilast * t_dim1;
+ z__3.r = bscale * t[i__3].r, z__3.i = bscale * t[i__3].i;
+ z_div(&z__1, &z__2, &z__3);
+ ad22.r = z__1.r, ad22.i = z__1.i;
+/*< ABI22 = AD22 - U12*AD21 >*/
+ z__2.r = u12.r * ad21.r - u12.i * ad21.i, z__2.i = u12.r * ad21.i
+ + u12.i * ad21.r;
+ z__1.r = ad22.r - z__2.r, z__1.i = ad22.i - z__2.i;
+ abi22.r = z__1.r, abi22.i = z__1.i;
+
+/*< T1 = HALF*( AD11+ABI22 ) >*/
+ z__2.r = ad11.r + abi22.r, z__2.i = ad11.i + abi22.i;
+ z__1.r = z__2.r * .5, z__1.i = z__2.i * .5;
+ t1.r = z__1.r, t1.i = z__1.i;
+/*< RTDISC = SQRT( T1**2+AD12*AD21-AD11*AD22 ) >*/
+ pow_zi(&z__4, &t1, &c__2);
+ z__5.r = ad12.r * ad21.r - ad12.i * ad21.i, z__5.i = ad12.r *
+ ad21.i + ad12.i * ad21.r;
+ z__3.r = z__4.r + z__5.r, z__3.i = z__4.i + z__5.i;
+ z__6.r = ad11.r * ad22.r - ad11.i * ad22.i, z__6.i = ad11.r *
+ ad22.i + ad11.i * ad22.r;
+ z__2.r = z__3.r - z__6.r, z__2.i = z__3.i - z__6.i;
+ z_sqrt(&z__1, &z__2);
+ rtdisc.r = z__1.r, rtdisc.i = z__1.i;
+/*< >*/
+ z__1.r = t1.r - abi22.r, z__1.i = t1.i - abi22.i;
+ z__2.r = t1.r - abi22.r, z__2.i = t1.i - abi22.i;
+ temp = z__1.r * rtdisc.r + d_imag(&z__2) * d_imag(&rtdisc);
+/*< IF( TEMP.LE.ZERO ) THEN >*/
+ if (temp <= 0.) {
+/*< SHIFT = T1 + RTDISC >*/
+ z__1.r = t1.r + rtdisc.r, z__1.i = t1.i + rtdisc.i;
+ shift.r = z__1.r, shift.i = z__1.i;
+/*< ELSE >*/
+ } else {
+/*< SHIFT = T1 - RTDISC >*/
+ z__1.r = t1.r - rtdisc.r, z__1.i = t1.i - rtdisc.i;
+ shift.r = z__1.r, shift.i = z__1.i;
+/*< END IF >*/
+ }
+/*< ELSE >*/
+ } else {
+
+/* Exceptional shift. Chosen for no particularly good reason. */
+
+/*< >*/
+ i__2 = ilast - 1 + ilast * h_dim1;
+ z__4.r = ascale * h__[i__2].r, z__4.i = ascale * h__[i__2].i;
+ i__3 = ilast - 1 + (ilast - 1) * t_dim1;
+ z__5.r = bscale * t[i__3].r, z__5.i = bscale * t[i__3].i;
+ z_div(&z__3, &z__4, &z__5);
+ d_cnjg(&z__2, &z__3);
+ z__1.r = eshift.r + z__2.r, z__1.i = eshift.i + z__2.i;
+ eshift.r = z__1.r, eshift.i = z__1.i;
+/*< SHIFT = ESHIFT >*/
+ shift.r = eshift.r, shift.i = eshift.i;
+/*< END IF >*/
+ }
+
+/* Now check for two consecutive small subdiagonals. */
+
+/*< DO 80 J = ILAST - 1, IFIRST + 1, -1 >*/
+ i__2 = ifirst + 1;
+ for (j = ilast - 1; j >= i__2; --j) {
+/*< ISTART = J >*/
+ istart = j;
+/*< CTEMP = ASCALE*H( J, J ) - SHIFT*( BSCALE*T( J, J ) ) >*/
+ i__3 = j + j * h_dim1;
+ z__2.r = ascale * h__[i__3].r, z__2.i = ascale * h__[i__3].i;
+ i__4 = j + j * t_dim1;
+ z__4.r = bscale * t[i__4].r, z__4.i = bscale * t[i__4].i;
+ z__3.r = shift.r * z__4.r - shift.i * z__4.i, z__3.i = shift.r *
+ z__4.i + shift.i * z__4.r;
+ z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
+ ctemp.r = z__1.r, ctemp.i = z__1.i;
+/*< TEMP = ABS1( CTEMP ) >*/
+ temp = (d__1 = ctemp.r, abs(d__1)) + (d__2 = d_imag(&ctemp), abs(
+ d__2));
+/*< TEMP2 = ASCALE*ABS1( H( J+1, J ) ) >*/
+ i__3 = j + 1 + j * h_dim1;
+ temp2 = ascale * ((d__1 = h__[i__3].r, abs(d__1)) + (d__2 =
+ d_imag(&h__[j + 1 + j * h_dim1]), abs(d__2)));
+/*< TEMPR = MAX( TEMP, TEMP2 ) >*/
+ tempr = max(temp,temp2);
+/*< IF( TEMPR.LT.ONE .AND. TEMPR.NE.ZERO ) THEN >*/
+ if (tempr < 1. && tempr != 0.) {
+/*< TEMP = TEMP / TEMPR >*/
+ temp /= tempr;
+/*< TEMP2 = TEMP2 / TEMPR >*/
+ temp2 /= tempr;
+/*< END IF >*/
+ }
+/*< >*/
+ i__3 = j + (j - 1) * h_dim1;
+ if (((d__1 = h__[i__3].r, abs(d__1)) + (d__2 = d_imag(&h__[j + (j
+ - 1) * h_dim1]), abs(d__2))) * temp2 <= temp * atol) {
+ goto L90;
+ }
+/*< 80 CONTINUE >*/
+/* L80: */
+ }
+
+/*< ISTART = IFIRST >*/
+ istart = ifirst;
+/*< >*/
+ i__2 = ifirst + ifirst * h_dim1;
+ z__2.r = ascale * h__[i__2].r, z__2.i = ascale * h__[i__2].i;
+ i__3 = ifirst + ifirst * t_dim1;
+ z__4.r = bscale * t[i__3].r, z__4.i = bscale * t[i__3].i;
+ z__3.r = shift.r * z__4.r - shift.i * z__4.i, z__3.i = shift.r *
+ z__4.i + shift.i * z__4.r;
+ z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
+ ctemp.r = z__1.r, ctemp.i = z__1.i;
+/*< 90 CONTINUE >*/
+L90:
+
+/* Do an implicit-shift QZ sweep. */
+
+/* Initial Q */
+
+/*< CTEMP2 = ASCALE*H( ISTART+1, ISTART ) >*/
+ i__2 = istart + 1 + istart * h_dim1;
+ z__1.r = ascale * h__[i__2].r, z__1.i = ascale * h__[i__2].i;
+ ctemp2.r = z__1.r, ctemp2.i = z__1.i;
+/*< CALL ZLARTG( CTEMP, CTEMP2, C, S, CTEMP3 ) >*/
+ zlartg_(&ctemp, &ctemp2, &c__, &s, &ctemp3);
+
+/* Sweep */
+
+/*< DO 150 J = ISTART, ILAST - 1 >*/
+ i__2 = ilast - 1;
+ for (j = istart; j <= i__2; ++j) {
+/*< IF( J.GT.ISTART ) THEN >*/
+ if (j > istart) {
+/*< CTEMP = H( J, J-1 ) >*/
+ i__3 = j + (j - 1) * h_dim1;
+ ctemp.r = h__[i__3].r, ctemp.i = h__[i__3].i;
+/*< CALL ZLARTG( CTEMP, H( J+1, J-1 ), C, S, H( J, J-1 ) ) >*/
+ zlartg_(&ctemp, &h__[j + 1 + (j - 1) * h_dim1], &c__, &s, &
+ h__[j + (j - 1) * h_dim1]);
+/*< H( J+1, J-1 ) = CZERO >*/
+ i__3 = j + 1 + (j - 1) * h_dim1;
+ h__[i__3].r = 0., h__[i__3].i = 0.;
+/*< END IF >*/
+ }
+
+/*< DO 100 JC = J, ILASTM >*/
+ i__3 = ilastm;
+ for (jc = j; jc <= i__3; ++jc) {
+/*< CTEMP = C*H( J, JC ) + S*H( J+1, JC ) >*/
+ i__4 = j + jc * h_dim1;
+ z__2.r = c__ * h__[i__4].r, z__2.i = c__ * h__[i__4].i;
+ i__5 = j + 1 + jc * h_dim1;
+ z__3.r = s.r * h__[i__5].r - s.i * h__[i__5].i, z__3.i = s.r *
+ h__[i__5].i + s.i * h__[i__5].r;
+ z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
+ ctemp.r = z__1.r, ctemp.i = z__1.i;
+/*< H( J+1, JC ) = -DCONJG( S )*H( J, JC ) + C*H( J+1, JC ) >*/
+ i__4 = j + 1 + jc * h_dim1;
+ d_cnjg(&z__4, &s);
+ z__3.r = -z__4.r, z__3.i = -z__4.i;
+ i__5 = j + jc * h_dim1;
+ z__2.r = z__3.r * h__[i__5].r - z__3.i * h__[i__5].i, z__2.i =
+ z__3.r * h__[i__5].i + z__3.i * h__[i__5].r;
+ i__6 = j + 1 + jc * h_dim1;
+ z__5.r = c__ * h__[i__6].r, z__5.i = c__ * h__[i__6].i;
+ z__1.r = z__2.r + z__5.r, z__1.i = z__2.i + z__5.i;
+ h__[i__4].r = z__1.r, h__[i__4].i = z__1.i;
+/*< H( J, JC ) = CTEMP >*/
+ i__4 = j + jc * h_dim1;
+ h__[i__4].r = ctemp.r, h__[i__4].i = ctemp.i;
+/*< CTEMP2 = C*T( J, JC ) + S*T( J+1, JC ) >*/
+ i__4 = j + jc * t_dim1;
+ z__2.r = c__ * t[i__4].r, z__2.i = c__ * t[i__4].i;
+ i__5 = j + 1 + jc * t_dim1;
+ z__3.r = s.r * t[i__5].r - s.i * t[i__5].i, z__3.i = s.r * t[
+ i__5].i + s.i * t[i__5].r;
+ z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
+ ctemp2.r = z__1.r, ctemp2.i = z__1.i;
+/*< T( J+1, JC ) = -DCONJG( S )*T( J, JC ) + C*T( J+1, JC ) >*/
+ i__4 = j + 1 + jc * t_dim1;
+ d_cnjg(&z__4, &s);
+ z__3.r = -z__4.r, z__3.i = -z__4.i;
+ i__5 = j + jc * t_dim1;
+ z__2.r = z__3.r * t[i__5].r - z__3.i * t[i__5].i, z__2.i =
+ z__3.r * t[i__5].i + z__3.i * t[i__5].r;
+ i__6 = j + 1 + jc * t_dim1;
+ z__5.r = c__ * t[i__6].r, z__5.i = c__ * t[i__6].i;
+ z__1.r = z__2.r + z__5.r, z__1.i = z__2.i + z__5.i;
+ t[i__4].r = z__1.r, t[i__4].i = z__1.i;
+/*< T( J, JC ) = CTEMP2 >*/
+ i__4 = j + jc * t_dim1;
+ t[i__4].r = ctemp2.r, t[i__4].i = ctemp2.i;
+/*< 100 CONTINUE >*/
+/* L100: */
+ }
+/*< IF( ILQ ) THEN >*/
+ if (ilq) {
+/*< DO 110 JR = 1, N >*/
+ i__3 = *n;
+ for (jr = 1; jr <= i__3; ++jr) {
+/*< CTEMP = C*Q( JR, J ) + DCONJG( S )*Q( JR, J+1 ) >*/
+ i__4 = jr + j * q_dim1;
+ z__2.r = c__ * q[i__4].r, z__2.i = c__ * q[i__4].i;
+ d_cnjg(&z__4, &s);
+ i__5 = jr + (j + 1) * q_dim1;
+ z__3.r = z__4.r * q[i__5].r - z__4.i * q[i__5].i, z__3.i =
+ z__4.r * q[i__5].i + z__4.i * q[i__5].r;
+ z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
+ ctemp.r = z__1.r, ctemp.i = z__1.i;
+/*< Q( JR, J+1 ) = -S*Q( JR, J ) + C*Q( JR, J+1 ) >*/
+ i__4 = jr + (j + 1) * q_dim1;
+ z__3.r = -s.r, z__3.i = -s.i;
+ i__5 = jr + j * q_dim1;
+ z__2.r = z__3.r * q[i__5].r - z__3.i * q[i__5].i, z__2.i =
+ z__3.r * q[i__5].i + z__3.i * q[i__5].r;
+ i__6 = jr + (j + 1) * q_dim1;
+ z__4.r = c__ * q[i__6].r, z__4.i = c__ * q[i__6].i;
+ z__1.r = z__2.r + z__4.r, z__1.i = z__2.i + z__4.i;
+ q[i__4].r = z__1.r, q[i__4].i = z__1.i;
+/*< Q( JR, J ) = CTEMP >*/
+ i__4 = jr + j * q_dim1;
+ q[i__4].r = ctemp.r, q[i__4].i = ctemp.i;
+/*< 110 CONTINUE >*/
+/* L110: */
+ }
+/*< END IF >*/
+ }
+
+/*< CTEMP = T( J+1, J+1 ) >*/
+ i__3 = j + 1 + (j + 1) * t_dim1;
+ ctemp.r = t[i__3].r, ctemp.i = t[i__3].i;
+/*< CALL ZLARTG( CTEMP, T( J+1, J ), C, S, T( J+1, J+1 ) ) >*/
+ zlartg_(&ctemp, &t[j + 1 + j * t_dim1], &c__, &s, &t[j + 1 + (j +
+ 1) * t_dim1]);
+/*< T( J+1, J ) = CZERO >*/
+ i__3 = j + 1 + j * t_dim1;
+ t[i__3].r = 0., t[i__3].i = 0.;
+
+/*< DO 120 JR = IFRSTM, MIN( J+2, ILAST ) >*/
+/* Computing MIN */
+ i__4 = j + 2;
+ i__3 = min(i__4,ilast);
+ for (jr = ifrstm; jr <= i__3; ++jr) {
+/*< CTEMP = C*H( JR, J+1 ) + S*H( JR, J ) >*/
+ i__4 = jr + (j + 1) * h_dim1;
+ z__2.r = c__ * h__[i__4].r, z__2.i = c__ * h__[i__4].i;
+ i__5 = jr + j * h_dim1;
+ z__3.r = s.r * h__[i__5].r - s.i * h__[i__5].i, z__3.i = s.r *
+ h__[i__5].i + s.i * h__[i__5].r;
+ z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
+ ctemp.r = z__1.r, ctemp.i = z__1.i;
+/*< H( JR, J ) = -DCONJG( S )*H( JR, J+1 ) + C*H( JR, J ) >*/
+ i__4 = jr + j * h_dim1;
+ d_cnjg(&z__4, &s);
+ z__3.r = -z__4.r, z__3.i = -z__4.i;
+ i__5 = jr + (j + 1) * h_dim1;
+ z__2.r = z__3.r * h__[i__5].r - z__3.i * h__[i__5].i, z__2.i =
+ z__3.r * h__[i__5].i + z__3.i * h__[i__5].r;
+ i__6 = jr + j * h_dim1;
+ z__5.r = c__ * h__[i__6].r, z__5.i = c__ * h__[i__6].i;
+ z__1.r = z__2.r + z__5.r, z__1.i = z__2.i + z__5.i;
+ h__[i__4].r = z__1.r, h__[i__4].i = z__1.i;
+/*< H( JR, J+1 ) = CTEMP >*/
+ i__4 = jr + (j + 1) * h_dim1;
+ h__[i__4].r = ctemp.r, h__[i__4].i = ctemp.i;
+/*< 120 CONTINUE >*/
+/* L120: */
+ }
+/*< DO 130 JR = IFRSTM, J >*/
+ i__3 = j;
+ for (jr = ifrstm; jr <= i__3; ++jr) {
+/*< CTEMP = C*T( JR, J+1 ) + S*T( JR, J ) >*/
+ i__4 = jr + (j + 1) * t_dim1;
+ z__2.r = c__ * t[i__4].r, z__2.i = c__ * t[i__4].i;
+ i__5 = jr + j * t_dim1;
+ z__3.r = s.r * t[i__5].r - s.i * t[i__5].i, z__3.i = s.r * t[
+ i__5].i + s.i * t[i__5].r;
+ z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
+ ctemp.r = z__1.r, ctemp.i = z__1.i;
+/*< T( JR, J ) = -DCONJG( S )*T( JR, J+1 ) + C*T( JR, J ) >*/
+ i__4 = jr + j * t_dim1;
+ d_cnjg(&z__4, &s);
+ z__3.r = -z__4.r, z__3.i = -z__4.i;
+ i__5 = jr + (j + 1) * t_dim1;
+ z__2.r = z__3.r * t[i__5].r - z__3.i * t[i__5].i, z__2.i =
+ z__3.r * t[i__5].i + z__3.i * t[i__5].r;
+ i__6 = jr + j * t_dim1;
+ z__5.r = c__ * t[i__6].r, z__5.i = c__ * t[i__6].i;
+ z__1.r = z__2.r + z__5.r, z__1.i = z__2.i + z__5.i;
+ t[i__4].r = z__1.r, t[i__4].i = z__1.i;
+/*< T( JR, J+1 ) = CTEMP >*/
+ i__4 = jr + (j + 1) * t_dim1;
+ t[i__4].r = ctemp.r, t[i__4].i = ctemp.i;
+/*< 130 CONTINUE >*/
+/* L130: */
+ }
+/*< IF( ILZ ) THEN >*/
+ if (ilz) {
+/*< DO 140 JR = 1, N >*/
+ i__3 = *n;
+ for (jr = 1; jr <= i__3; ++jr) {
+/*< CTEMP = C*Z( JR, J+1 ) + S*Z( JR, J ) >*/
+ i__4 = jr + (j + 1) * z_dim1;
+ z__2.r = c__ * z__[i__4].r, z__2.i = c__ * z__[i__4].i;
+ i__5 = jr + j * z_dim1;
+ z__3.r = s.r * z__[i__5].r - s.i * z__[i__5].i, z__3.i =
+ s.r * z__[i__5].i + s.i * z__[i__5].r;
+ z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
+ ctemp.r = z__1.r, ctemp.i = z__1.i;
+/*< Z( JR, J ) = -DCONJG( S )*Z( JR, J+1 ) + C*Z( JR, J ) >*/
+ i__4 = jr + j * z_dim1;
+ d_cnjg(&z__4, &s);
+ z__3.r = -z__4.r, z__3.i = -z__4.i;
+ i__5 = jr + (j + 1) * z_dim1;
+ z__2.r = z__3.r * z__[i__5].r - z__3.i * z__[i__5].i,
+ z__2.i = z__3.r * z__[i__5].i + z__3.i * z__[i__5]
+ .r;
+ i__6 = jr + j * z_dim1;
+ z__5.r = c__ * z__[i__6].r, z__5.i = c__ * z__[i__6].i;
+ z__1.r = z__2.r + z__5.r, z__1.i = z__2.i + z__5.i;
+ z__[i__4].r = z__1.r, z__[i__4].i = z__1.i;
+/*< Z( JR, J+1 ) = CTEMP >*/
+ i__4 = jr + (j + 1) * z_dim1;
+ z__[i__4].r = ctemp.r, z__[i__4].i = ctemp.i;
+/*< 140 CONTINUE >*/
+/* L140: */
+ }
+/*< END IF >*/
+ }
+/*< 150 CONTINUE >*/
+/* L150: */
+ }
+
+/*< 160 CONTINUE >*/
+L160:
+
+/*< 170 CONTINUE >*/
+/* L170: */
+ ;
+ }
+
+/* Drop-through = non-convergence */
+
+/*< 180 CONTINUE >*/
+L180:
+/*< INFO = ILAST >*/
+ *info = ilast;
+/*< GO TO 210 >*/
+ goto L210;
+
+/* Successful completion of all QZ steps */
+
+/*< 190 CONTINUE >*/
+L190:
+
+/* Set Eigenvalues 1:ILO-1 */
+
+/*< DO 200 J = 1, ILO - 1 >*/
+ i__1 = *ilo - 1;
+ for (j = 1; j <= i__1; ++j) {
+/*< ABSB = ABS( T( J, J ) ) >*/
+ absb = z_abs(&t[j + j * t_dim1]);
+/*< IF( ABSB.GT.SAFMIN ) THEN >*/
+ if (absb > safmin) {
+/*< SIGNBC = DCONJG( T( J, J ) / ABSB ) >*/
+ i__2 = j + j * t_dim1;
+ z__2.r = t[i__2].r / absb, z__2.i = t[i__2].i / absb;
+ d_cnjg(&z__1, &z__2);
+ signbc.r = z__1.r, signbc.i = z__1.i;
+/*< T( J, J ) = ABSB >*/
+ i__2 = j + j * t_dim1;
+ t[i__2].r = absb, t[i__2].i = 0.;
+/*< IF( ILSCHR ) THEN >*/
+ if (ilschr) {
+/*< CALL ZSCAL( J-1, SIGNBC, T( 1, J ), 1 ) >*/
+ i__2 = j - 1;
+ zscal_(&i__2, &signbc, &t[j * t_dim1 + 1], &c__1);
+/*< CALL ZSCAL( J, SIGNBC, H( 1, J ), 1 ) >*/
+ zscal_(&j, &signbc, &h__[j * h_dim1 + 1], &c__1);
+/*< ELSE >*/
+ } else {
+/*< H( J, J ) = H( J, J )*SIGNBC >*/
+ i__2 = j + j * h_dim1;
+ i__3 = j + j * h_dim1;
+ z__1.r = h__[i__3].r * signbc.r - h__[i__3].i * signbc.i,
+ z__1.i = h__[i__3].r * signbc.i + h__[i__3].i *
+ signbc.r;
+ h__[i__2].r = z__1.r, h__[i__2].i = z__1.i;
+/*< END IF >*/
+ }
+/*< >*/
+ if (ilz) {
+ zscal_(n, &signbc, &z__[j * z_dim1 + 1], &c__1);
+ }
+/*< ELSE >*/
+ } else {
+/*< T( J, J ) = CZERO >*/
+ i__2 = j + j * t_dim1;
+ t[i__2].r = 0., t[i__2].i = 0.;
+/*< END IF >*/
+ }
+/*< ALPHA( J ) = H( J, J ) >*/
+ i__2 = j;
+ i__3 = j + j * h_dim1;
+ alpha[i__2].r = h__[i__3].r, alpha[i__2].i = h__[i__3].i;
+/*< BETA( J ) = T( J, J ) >*/
+ i__2 = j;
+ i__3 = j + j * t_dim1;
+ beta[i__2].r = t[i__3].r, beta[i__2].i = t[i__3].i;
+/*< 200 CONTINUE >*/
+/* L200: */
+ }
+
+/* Normal Termination */
+
+/*< INFO = 0 >*/
+ *info = 0;
+
+/* Exit (other than argument error) -- return optimal workspace size */
+
+/*< 210 CONTINUE >*/
+L210:
+/*< WORK( 1 ) = DCMPLX( N ) >*/
+ z__1.r = (doublereal) (*n), z__1.i = 0.;
+ work[1].r = z__1.r, work[1].i = z__1.i;
+/*< RETURN >*/
+ return 0;
+
+/* End of ZHGEQZ */
+
+/*< END >*/
+} /* zhgeqz_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.f
new file mode 100644
index 0000000000000000000000000000000000000000..123146deca8a42ff28d043c1ecbb7b144c52b59e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.f
@@ -0,0 +1,760 @@
+ SUBROUTINE ZHGEQZ( JOB, COMPQ, COMPZ, N, ILO, IHI, H, LDH, T, LDT,
+ $ ALPHA, BETA, Q, LDQ, Z, LDZ, WORK, LWORK,
+ $ RWORK, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER COMPQ, COMPZ, JOB
+ INTEGER IHI, ILO, INFO, LDH, LDQ, LDT, LDZ, LWORK, N
+* ..
+* .. Array Arguments ..
+ DOUBLE PRECISION RWORK( * )
+ COMPLEX*16 ALPHA( * ), BETA( * ), H( LDH, * ),
+ $ Q( LDQ, * ), T( LDT, * ), WORK( * ),
+ $ Z( LDZ, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZHGEQZ computes the eigenvalues of a complex matrix pair (H,T),
+* where H is an upper Hessenberg matrix and T is upper triangular,
+* using the single-shift QZ method.
+* Matrix pairs of this type are produced by the reduction to
+* generalized upper Hessenberg form of a complex matrix pair (A,B):
+*
+* A = Q1*H*Z1**H, B = Q1*T*Z1**H,
+*
+* as computed by ZGGHRD.
+*
+* If JOB='S', then the Hessenberg-triangular pair (H,T) is
+* also reduced to generalized Schur form,
+*
+* H = Q*S*Z**H, T = Q*P*Z**H,
+*
+* where Q and Z are unitary matrices and S and P are upper triangular.
+*
+* Optionally, the unitary matrix Q from the generalized Schur
+* factorization may be postmultiplied into an input matrix Q1, and the
+* unitary matrix Z may be postmultiplied into an input matrix Z1.
+* If Q1 and Z1 are the unitary matrices from ZGGHRD that reduced
+* the matrix pair (A,B) to generalized Hessenberg form, then the output
+* matrices Q1*Q and Z1*Z are the unitary factors from the generalized
+* Schur factorization of (A,B):
+*
+* A = (Q1*Q)*S*(Z1*Z)**H, B = (Q1*Q)*P*(Z1*Z)**H.
+*
+* To avoid overflow, eigenvalues of the matrix pair (H,T)
+* (equivalently, of (A,B)) are computed as a pair of complex values
+* (alpha,beta). If beta is nonzero, lambda = alpha / beta is an
+* eigenvalue of the generalized nonsymmetric eigenvalue problem (GNEP)
+* A*x = lambda*B*x
+* and if alpha is nonzero, mu = beta / alpha is an eigenvalue of the
+* alternate form of the GNEP
+* mu*A*y = B*y.
+* The values of alpha and beta for the i-th eigenvalue can be read
+* directly from the generalized Schur form: alpha = S(i,i),
+* beta = P(i,i).
+*
+* Ref: C.B. Moler & G.W. Stewart, "An Algorithm for Generalized Matrix
+* Eigenvalue Problems", SIAM J. Numer. Anal., 10(1973),
+* pp. 241--256.
+*
+* Arguments
+* =========
+*
+* JOB (input) CHARACTER*1
+* = 'E': Compute eigenvalues only;
+* = 'S': Computer eigenvalues and the Schur form.
+*
+* COMPQ (input) CHARACTER*1
+* = 'N': Left Schur vectors (Q) are not computed;
+* = 'I': Q is initialized to the unit matrix and the matrix Q
+* of left Schur vectors of (H,T) is returned;
+* = 'V': Q must contain a unitary matrix Q1 on entry and
+* the product Q1*Q is returned.
+*
+* COMPZ (input) CHARACTER*1
+* = 'N': Right Schur vectors (Z) are not computed;
+* = 'I': Q is initialized to the unit matrix and the matrix Z
+* of right Schur vectors of (H,T) is returned;
+* = 'V': Z must contain a unitary matrix Z1 on entry and
+* the product Z1*Z is returned.
+*
+* N (input) INTEGER
+* The order of the matrices H, T, Q, and Z. N >= 0.
+*
+* ILO (input) INTEGER
+* IHI (input) INTEGER
+* ILO and IHI mark the rows and columns of H which are in
+* Hessenberg form. It is assumed that A is already upper
+* triangular in rows and columns 1:ILO-1 and IHI+1:N.
+* If N > 0, 1 <= ILO <= IHI <= N; if N = 0, ILO=1 and IHI=0.
+*
+* H (input/output) COMPLEX*16 array, dimension (LDH, N)
+* On entry, the N-by-N upper Hessenberg matrix H.
+* On exit, if JOB = 'S', H contains the upper triangular
+* matrix S from the generalized Schur factorization.
+* If JOB = 'E', the diagonal of H matches that of S, but
+* the rest of H is unspecified.
+*
+* LDH (input) INTEGER
+* The leading dimension of the array H. LDH >= max( 1, N ).
+*
+* T (input/output) COMPLEX*16 array, dimension (LDT, N)
+* On entry, the N-by-N upper triangular matrix T.
+* On exit, if JOB = 'S', T contains the upper triangular
+* matrix P from the generalized Schur factorization.
+* If JOB = 'E', the diagonal of T matches that of P, but
+* the rest of T is unspecified.
+*
+* LDT (input) INTEGER
+* The leading dimension of the array T. LDT >= max( 1, N ).
+*
+* ALPHA (output) COMPLEX*16 array, dimension (N)
+* The complex scalars alpha that define the eigenvalues of
+* GNEP. ALPHA(i) = S(i,i) in the generalized Schur
+* factorization.
+*
+* BETA (output) COMPLEX*16 array, dimension (N)
+* The real non-negative scalars beta that define the
+* eigenvalues of GNEP. BETA(i) = P(i,i) in the generalized
+* Schur factorization.
+*
+* Together, the quantities alpha = ALPHA(j) and beta = BETA(j)
+* represent the j-th eigenvalue of the matrix pair (A,B), in
+* one of the forms lambda = alpha/beta or mu = beta/alpha.
+* Since either lambda or mu may overflow, they should not,
+* in general, be computed.
+*
+* Q (input/output) COMPLEX*16 array, dimension (LDQ, N)
+* On entry, if COMPZ = 'V', the unitary matrix Q1 used in the
+* reduction of (A,B) to generalized Hessenberg form.
+* On exit, if COMPZ = 'I', the unitary matrix of left Schur
+* vectors of (H,T), and if COMPZ = 'V', the unitary matrix of
+* left Schur vectors of (A,B).
+* Not referenced if COMPZ = 'N'.
+*
+* LDQ (input) INTEGER
+* The leading dimension of the array Q. LDQ >= 1.
+* If COMPQ='V' or 'I', then LDQ >= N.
+*
+* Z (input/output) COMPLEX*16 array, dimension (LDZ, N)
+* On entry, if COMPZ = 'V', the unitary matrix Z1 used in the
+* reduction of (A,B) to generalized Hessenberg form.
+* On exit, if COMPZ = 'I', the unitary matrix of right Schur
+* vectors of (H,T), and if COMPZ = 'V', the unitary matrix of
+* right Schur vectors of (A,B).
+* Not referenced if COMPZ = 'N'.
+*
+* LDZ (input) INTEGER
+* The leading dimension of the array Z. LDZ >= 1.
+* If COMPZ='V' or 'I', then LDZ >= N.
+*
+* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))
+* On exit, if INFO >= 0, WORK(1) returns the optimal LWORK.
+*
+* LWORK (input) INTEGER
+* The dimension of the array WORK. LWORK >= max(1,N).
+*
+* If LWORK = -1, then a workspace query is assumed; the routine
+* only calculates the optimal size of the WORK array, returns
+* this value as the first entry of the WORK array, and no error
+* message related to LWORK is issued by XERBLA.
+*
+* RWORK (workspace) DOUBLE PRECISION array, dimension (N)
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+* = 1,...,N: the QZ iteration did not converge. (H,T) is not
+* in Schur form, but ALPHA(i) and BETA(i),
+* i=INFO+1,...,N should be correct.
+* = N+1,...,2*N: the shift calculation failed. (H,T) is not
+* in Schur form, but ALPHA(i) and BETA(i),
+* i=INFO-N+1,...,N should be correct.
+*
+* Further Details
+* ===============
+*
+* We assume that complex ABS works as long as its value is less than
+* overflow.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ COMPLEX*16 CZERO, CONE
+ PARAMETER ( CZERO = ( 0.0D+0, 0.0D+0 ),
+ $ CONE = ( 1.0D+0, 0.0D+0 ) )
+ DOUBLE PRECISION ZERO, ONE
+ PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 )
+ DOUBLE PRECISION HALF
+ PARAMETER ( HALF = 0.5D+0 )
+* ..
+* .. Local Scalars ..
+ LOGICAL ILAZR2, ILAZRO, ILQ, ILSCHR, ILZ, LQUERY
+ INTEGER ICOMPQ, ICOMPZ, IFIRST, IFRSTM, IITER, ILAST,
+ $ ILASTM, IN, ISCHUR, ISTART, J, JC, JCH, JITER,
+ $ JR, MAXIT
+ DOUBLE PRECISION ABSB, ANORM, ASCALE, ATOL, BNORM, BSCALE, BTOL,
+ $ C, SAFMIN, TEMP, TEMP2, TEMPR, ULP
+ COMPLEX*16 ABI22, AD11, AD12, AD21, AD22, CTEMP, CTEMP2,
+ $ CTEMP3, ESHIFT, RTDISC, S, SHIFT, SIGNBC, T1,
+ $ U12, X
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ DOUBLE PRECISION DLAMCH, ZLANHS
+ EXTERNAL LSAME, DLAMCH, ZLANHS
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZLARTG, ZLASET, ZROT, ZSCAL
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DBLE, DCMPLX, DCONJG, DIMAG, MAX, MIN,
+ $ SQRT
+* ..
+* .. Statement Functions ..
+ DOUBLE PRECISION ABS1
+* ..
+* .. Statement Function definitions ..
+ ABS1( X ) = ABS( DBLE( X ) ) + ABS( DIMAG( X ) )
+* ..
+* .. Executable Statements ..
+*
+* Decode JOB, COMPQ, COMPZ
+*
+ IF( LSAME( JOB, 'E' ) ) THEN
+ ILSCHR = .FALSE.
+ ISCHUR = 1
+ ELSE IF( LSAME( JOB, 'S' ) ) THEN
+ ILSCHR = .TRUE.
+ ISCHUR = 2
+ ELSE
+ ISCHUR = 0
+ END IF
+*
+ IF( LSAME( COMPQ, 'N' ) ) THEN
+ ILQ = .FALSE.
+ ICOMPQ = 1
+ ELSE IF( LSAME( COMPQ, 'V' ) ) THEN
+ ILQ = .TRUE.
+ ICOMPQ = 2
+ ELSE IF( LSAME( COMPQ, 'I' ) ) THEN
+ ILQ = .TRUE.
+ ICOMPQ = 3
+ ELSE
+ ICOMPQ = 0
+ END IF
+*
+ IF( LSAME( COMPZ, 'N' ) ) THEN
+ ILZ = .FALSE.
+ ICOMPZ = 1
+ ELSE IF( LSAME( COMPZ, 'V' ) ) THEN
+ ILZ = .TRUE.
+ ICOMPZ = 2
+ ELSE IF( LSAME( COMPZ, 'I' ) ) THEN
+ ILZ = .TRUE.
+ ICOMPZ = 3
+ ELSE
+ ICOMPZ = 0
+ END IF
+*
+* Check Argument Values
+*
+ INFO = 0
+ WORK( 1 ) = MAX( 1, N )
+ LQUERY = ( LWORK.EQ.-1 )
+ IF( ISCHUR.EQ.0 ) THEN
+ INFO = -1
+ ELSE IF( ICOMPQ.EQ.0 ) THEN
+ INFO = -2
+ ELSE IF( ICOMPZ.EQ.0 ) THEN
+ INFO = -3
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -4
+ ELSE IF( ILO.LT.1 ) THEN
+ INFO = -5
+ ELSE IF( IHI.GT.N .OR. IHI.LT.ILO-1 ) THEN
+ INFO = -6
+ ELSE IF( LDH.LT.N ) THEN
+ INFO = -8
+ ELSE IF( LDT.LT.N ) THEN
+ INFO = -10
+ ELSE IF( LDQ.LT.1 .OR. ( ILQ .AND. LDQ.LT.N ) ) THEN
+ INFO = -14
+ ELSE IF( LDZ.LT.1 .OR. ( ILZ .AND. LDZ.LT.N ) ) THEN
+ INFO = -16
+ ELSE IF( LWORK.LT.MAX( 1, N ) .AND. .NOT.LQUERY ) THEN
+ INFO = -18
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZHGEQZ', -INFO )
+ RETURN
+ ELSE IF( LQUERY ) THEN
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+* WORK( 1 ) = CMPLX( 1 )
+ IF( N.LE.0 ) THEN
+ WORK( 1 ) = DCMPLX( 1 )
+ RETURN
+ END IF
+*
+* Initialize Q and Z
+*
+ IF( ICOMPQ.EQ.3 )
+ $ CALL ZLASET( 'Full', N, N, CZERO, CONE, Q, LDQ )
+ IF( ICOMPZ.EQ.3 )
+ $ CALL ZLASET( 'Full', N, N, CZERO, CONE, Z, LDZ )
+*
+* Machine Constants
+*
+ IN = IHI + 1 - ILO
+ SAFMIN = DLAMCH( 'S' )
+ ULP = DLAMCH( 'E' )*DLAMCH( 'B' )
+ ANORM = ZLANHS( 'F', IN, H( ILO, ILO ), LDH, RWORK )
+ BNORM = ZLANHS( 'F', IN, T( ILO, ILO ), LDT, RWORK )
+ ATOL = MAX( SAFMIN, ULP*ANORM )
+ BTOL = MAX( SAFMIN, ULP*BNORM )
+ ASCALE = ONE / MAX( SAFMIN, ANORM )
+ BSCALE = ONE / MAX( SAFMIN, BNORM )
+*
+*
+* Set Eigenvalues IHI+1:N
+*
+ DO 10 J = IHI + 1, N
+ ABSB = ABS( T( J, J ) )
+ IF( ABSB.GT.SAFMIN ) THEN
+ SIGNBC = DCONJG( T( J, J ) / ABSB )
+ T( J, J ) = ABSB
+ IF( ILSCHR ) THEN
+ CALL ZSCAL( J-1, SIGNBC, T( 1, J ), 1 )
+ CALL ZSCAL( J, SIGNBC, H( 1, J ), 1 )
+ ELSE
+ H( J, J ) = H( J, J )*SIGNBC
+ END IF
+ IF( ILZ )
+ $ CALL ZSCAL( N, SIGNBC, Z( 1, J ), 1 )
+ ELSE
+ T( J, J ) = CZERO
+ END IF
+ ALPHA( J ) = H( J, J )
+ BETA( J ) = T( J, J )
+ 10 CONTINUE
+*
+* If IHI < ILO, skip QZ steps
+*
+ IF( IHI.LT.ILO )
+ $ GO TO 190
+*
+* MAIN QZ ITERATION LOOP
+*
+* Initialize dynamic indices
+*
+* Eigenvalues ILAST+1:N have been found.
+* Column operations modify rows IFRSTM:whatever
+* Row operations modify columns whatever:ILASTM
+*
+* If only eigenvalues are being computed, then
+* IFRSTM is the row of the last splitting row above row ILAST;
+* this is always at least ILO.
+* IITER counts iterations since the last eigenvalue was found,
+* to tell when to use an extraordinary shift.
+* MAXIT is the maximum number of QZ sweeps allowed.
+*
+ ILAST = IHI
+ IF( ILSCHR ) THEN
+ IFRSTM = 1
+ ILASTM = N
+ ELSE
+ IFRSTM = ILO
+ ILASTM = IHI
+ END IF
+ IITER = 0
+ ESHIFT = CZERO
+ MAXIT = 30*( IHI-ILO+1 )
+*
+ DO 170 JITER = 1, MAXIT
+*
+* Check for too many iterations.
+*
+ IF( JITER.GT.MAXIT )
+ $ GO TO 180
+*
+* Split the matrix if possible.
+*
+* Two tests:
+* 1: H(j,j-1)=0 or j=ILO
+* 2: T(j,j)=0
+*
+* Special case: j=ILAST
+*
+ IF( ILAST.EQ.ILO ) THEN
+ GO TO 60
+ ELSE
+ IF( ABS1( H( ILAST, ILAST-1 ) ).LE.ATOL ) THEN
+ H( ILAST, ILAST-1 ) = CZERO
+ GO TO 60
+ END IF
+ END IF
+*
+ IF( ABS( T( ILAST, ILAST ) ).LE.BTOL ) THEN
+ T( ILAST, ILAST ) = CZERO
+ GO TO 50
+ END IF
+*
+* General case: j<ILAST
+*
+ DO 40 J = ILAST - 1, ILO, -1
+*
+* Test 1: for H(j,j-1)=0 or j=ILO
+*
+ IF( J.EQ.ILO ) THEN
+ ILAZRO = .TRUE.
+ ELSE
+ IF( ABS1( H( J, J-1 ) ).LE.ATOL ) THEN
+ H( J, J-1 ) = CZERO
+ ILAZRO = .TRUE.
+ ELSE
+ ILAZRO = .FALSE.
+ END IF
+ END IF
+*
+* Test 2: for T(j,j)=0
+*
+ IF( ABS( T( J, J ) ).LT.BTOL ) THEN
+ T( J, J ) = CZERO
+*
+* Test 1a: Check for 2 consecutive small subdiagonals in A
+*
+ ILAZR2 = .FALSE.
+ IF( .NOT.ILAZRO ) THEN
+ IF( ABS1( H( J, J-1 ) )*( ASCALE*ABS1( H( J+1,
+ $ J ) ) ).LE.ABS1( H( J, J ) )*( ASCALE*ATOL ) )
+ $ ILAZR2 = .TRUE.
+ END IF
+*
+* If both tests pass (1 & 2), i.e., the leading diagonal
+* element of B in the block is zero, split a 1x1 block off
+* at the top. (I.e., at the J-th row/column) The leading
+* diagonal element of the remainder can also be zero, so
+* this may have to be done repeatedly.
+*
+ IF( ILAZRO .OR. ILAZR2 ) THEN
+ DO 20 JCH = J, ILAST - 1
+ CTEMP = H( JCH, JCH )
+ CALL ZLARTG( CTEMP, H( JCH+1, JCH ), C, S,
+ $ H( JCH, JCH ) )
+ H( JCH+1, JCH ) = CZERO
+ CALL ZROT( ILASTM-JCH, H( JCH, JCH+1 ), LDH,
+ $ H( JCH+1, JCH+1 ), LDH, C, S )
+ CALL ZROT( ILASTM-JCH, T( JCH, JCH+1 ), LDT,
+ $ T( JCH+1, JCH+1 ), LDT, C, S )
+ IF( ILQ )
+ $ CALL ZROT( N, Q( 1, JCH ), 1, Q( 1, JCH+1 ), 1,
+ $ C, DCONJG( S ) )
+ IF( ILAZR2 )
+ $ H( JCH, JCH-1 ) = H( JCH, JCH-1 )*C
+ ILAZR2 = .FALSE.
+ IF( ABS1( T( JCH+1, JCH+1 ) ).GE.BTOL ) THEN
+ IF( JCH+1.GE.ILAST ) THEN
+ GO TO 60
+ ELSE
+ IFIRST = JCH + 1
+ GO TO 70
+ END IF
+ END IF
+ T( JCH+1, JCH+1 ) = CZERO
+ 20 CONTINUE
+ GO TO 50
+ ELSE
+*
+* Only test 2 passed -- chase the zero to T(ILAST,ILAST)
+* Then process as in the case T(ILAST,ILAST)=0
+*
+ DO 30 JCH = J, ILAST - 1
+ CTEMP = T( JCH, JCH+1 )
+ CALL ZLARTG( CTEMP, T( JCH+1, JCH+1 ), C, S,
+ $ T( JCH, JCH+1 ) )
+ T( JCH+1, JCH+1 ) = CZERO
+ IF( JCH.LT.ILASTM-1 )
+ $ CALL ZROT( ILASTM-JCH-1, T( JCH, JCH+2 ), LDT,
+ $ T( JCH+1, JCH+2 ), LDT, C, S )
+ CALL ZROT( ILASTM-JCH+2, H( JCH, JCH-1 ), LDH,
+ $ H( JCH+1, JCH-1 ), LDH, C, S )
+ IF( ILQ )
+ $ CALL ZROT( N, Q( 1, JCH ), 1, Q( 1, JCH+1 ), 1,
+ $ C, DCONJG( S ) )
+ CTEMP = H( JCH+1, JCH )
+ CALL ZLARTG( CTEMP, H( JCH+1, JCH-1 ), C, S,
+ $ H( JCH+1, JCH ) )
+ H( JCH+1, JCH-1 ) = CZERO
+ CALL ZROT( JCH+1-IFRSTM, H( IFRSTM, JCH ), 1,
+ $ H( IFRSTM, JCH-1 ), 1, C, S )
+ CALL ZROT( JCH-IFRSTM, T( IFRSTM, JCH ), 1,
+ $ T( IFRSTM, JCH-1 ), 1, C, S )
+ IF( ILZ )
+ $ CALL ZROT( N, Z( 1, JCH ), 1, Z( 1, JCH-1 ), 1,
+ $ C, S )
+ 30 CONTINUE
+ GO TO 50
+ END IF
+ ELSE IF( ILAZRO ) THEN
+*
+* Only test 1 passed -- work on J:ILAST
+*
+ IFIRST = J
+ GO TO 70
+ END IF
+*
+* Neither test passed -- try next J
+*
+ 40 CONTINUE
+*
+* (Drop-through is "impossible")
+*
+ INFO = 2*N + 1
+ GO TO 210
+*
+* T(ILAST,ILAST)=0 -- clear H(ILAST,ILAST-1) to split off a
+* 1x1 block.
+*
+ 50 CONTINUE
+ CTEMP = H( ILAST, ILAST )
+ CALL ZLARTG( CTEMP, H( ILAST, ILAST-1 ), C, S,
+ $ H( ILAST, ILAST ) )
+ H( ILAST, ILAST-1 ) = CZERO
+ CALL ZROT( ILAST-IFRSTM, H( IFRSTM, ILAST ), 1,
+ $ H( IFRSTM, ILAST-1 ), 1, C, S )
+ CALL ZROT( ILAST-IFRSTM, T( IFRSTM, ILAST ), 1,
+ $ T( IFRSTM, ILAST-1 ), 1, C, S )
+ IF( ILZ )
+ $ CALL ZROT( N, Z( 1, ILAST ), 1, Z( 1, ILAST-1 ), 1, C, S )
+*
+* H(ILAST,ILAST-1)=0 -- Standardize B, set ALPHA and BETA
+*
+ 60 CONTINUE
+ ABSB = ABS( T( ILAST, ILAST ) )
+ IF( ABSB.GT.SAFMIN ) THEN
+ SIGNBC = DCONJG( T( ILAST, ILAST ) / ABSB )
+ T( ILAST, ILAST ) = ABSB
+ IF( ILSCHR ) THEN
+ CALL ZSCAL( ILAST-IFRSTM, SIGNBC, T( IFRSTM, ILAST ), 1 )
+ CALL ZSCAL( ILAST+1-IFRSTM, SIGNBC, H( IFRSTM, ILAST ),
+ $ 1 )
+ ELSE
+ H( ILAST, ILAST ) = H( ILAST, ILAST )*SIGNBC
+ END IF
+ IF( ILZ )
+ $ CALL ZSCAL( N, SIGNBC, Z( 1, ILAST ), 1 )
+ ELSE
+ T( ILAST, ILAST ) = CZERO
+ END IF
+ ALPHA( ILAST ) = H( ILAST, ILAST )
+ BETA( ILAST ) = T( ILAST, ILAST )
+*
+* Go to next block -- exit if finished.
+*
+ ILAST = ILAST - 1
+ IF( ILAST.LT.ILO )
+ $ GO TO 190
+*
+* Reset counters
+*
+ IITER = 0
+ ESHIFT = CZERO
+ IF( .NOT.ILSCHR ) THEN
+ ILASTM = ILAST
+ IF( IFRSTM.GT.ILAST )
+ $ IFRSTM = ILO
+ END IF
+ GO TO 160
+*
+* QZ step
+*
+* This iteration only involves rows/columns IFIRST:ILAST. We
+* assume IFIRST < ILAST, and that the diagonal of B is non-zero.
+*
+ 70 CONTINUE
+ IITER = IITER + 1
+ IF( .NOT.ILSCHR ) THEN
+ IFRSTM = IFIRST
+ END IF
+*
+* Compute the Shift.
+*
+* At this point, IFIRST < ILAST, and the diagonal elements of
+* T(IFIRST:ILAST,IFIRST,ILAST) are larger than BTOL (in
+* magnitude)
+*
+ IF( ( IITER / 10 )*10.NE.IITER ) THEN
+*
+* The Wilkinson shift (AEP p.512), i.e., the eigenvalue of
+* the bottom-right 2x2 block of A inv(B) which is nearest to
+* the bottom-right element.
+*
+* We factor B as U*D, where U has unit diagonals, and
+* compute (A*inv(D))*inv(U).
+*
+ U12 = ( BSCALE*T( ILAST-1, ILAST ) ) /
+ $ ( BSCALE*T( ILAST, ILAST ) )
+ AD11 = ( ASCALE*H( ILAST-1, ILAST-1 ) ) /
+ $ ( BSCALE*T( ILAST-1, ILAST-1 ) )
+ AD21 = ( ASCALE*H( ILAST, ILAST-1 ) ) /
+ $ ( BSCALE*T( ILAST-1, ILAST-1 ) )
+ AD12 = ( ASCALE*H( ILAST-1, ILAST ) ) /
+ $ ( BSCALE*T( ILAST, ILAST ) )
+ AD22 = ( ASCALE*H( ILAST, ILAST ) ) /
+ $ ( BSCALE*T( ILAST, ILAST ) )
+ ABI22 = AD22 - U12*AD21
+*
+ T1 = HALF*( AD11+ABI22 )
+ RTDISC = SQRT( T1**2+AD12*AD21-AD11*AD22 )
+ TEMP = DBLE( T1-ABI22 )*DBLE( RTDISC ) +
+ $ DIMAG( T1-ABI22 )*DIMAG( RTDISC )
+ IF( TEMP.LE.ZERO ) THEN
+ SHIFT = T1 + RTDISC
+ ELSE
+ SHIFT = T1 - RTDISC
+ END IF
+ ELSE
+*
+* Exceptional shift. Chosen for no particularly good reason.
+*
+ ESHIFT = ESHIFT + DCONJG( ( ASCALE*H( ILAST-1, ILAST ) ) /
+ $ ( BSCALE*T( ILAST-1, ILAST-1 ) ) )
+ SHIFT = ESHIFT
+ END IF
+*
+* Now check for two consecutive small subdiagonals.
+*
+ DO 80 J = ILAST - 1, IFIRST + 1, -1
+ ISTART = J
+ CTEMP = ASCALE*H( J, J ) - SHIFT*( BSCALE*T( J, J ) )
+ TEMP = ABS1( CTEMP )
+ TEMP2 = ASCALE*ABS1( H( J+1, J ) )
+ TEMPR = MAX( TEMP, TEMP2 )
+ IF( TEMPR.LT.ONE .AND. TEMPR.NE.ZERO ) THEN
+ TEMP = TEMP / TEMPR
+ TEMP2 = TEMP2 / TEMPR
+ END IF
+ IF( ABS1( H( J, J-1 ) )*TEMP2.LE.TEMP*ATOL )
+ $ GO TO 90
+ 80 CONTINUE
+*
+ ISTART = IFIRST
+ CTEMP = ASCALE*H( IFIRST, IFIRST ) -
+ $ SHIFT*( BSCALE*T( IFIRST, IFIRST ) )
+ 90 CONTINUE
+*
+* Do an implicit-shift QZ sweep.
+*
+* Initial Q
+*
+ CTEMP2 = ASCALE*H( ISTART+1, ISTART )
+ CALL ZLARTG( CTEMP, CTEMP2, C, S, CTEMP3 )
+*
+* Sweep
+*
+ DO 150 J = ISTART, ILAST - 1
+ IF( J.GT.ISTART ) THEN
+ CTEMP = H( J, J-1 )
+ CALL ZLARTG( CTEMP, H( J+1, J-1 ), C, S, H( J, J-1 ) )
+ H( J+1, J-1 ) = CZERO
+ END IF
+*
+ DO 100 JC = J, ILASTM
+ CTEMP = C*H( J, JC ) + S*H( J+1, JC )
+ H( J+1, JC ) = -DCONJG( S )*H( J, JC ) + C*H( J+1, JC )
+ H( J, JC ) = CTEMP
+ CTEMP2 = C*T( J, JC ) + S*T( J+1, JC )
+ T( J+1, JC ) = -DCONJG( S )*T( J, JC ) + C*T( J+1, JC )
+ T( J, JC ) = CTEMP2
+ 100 CONTINUE
+ IF( ILQ ) THEN
+ DO 110 JR = 1, N
+ CTEMP = C*Q( JR, J ) + DCONJG( S )*Q( JR, J+1 )
+ Q( JR, J+1 ) = -S*Q( JR, J ) + C*Q( JR, J+1 )
+ Q( JR, J ) = CTEMP
+ 110 CONTINUE
+ END IF
+*
+ CTEMP = T( J+1, J+1 )
+ CALL ZLARTG( CTEMP, T( J+1, J ), C, S, T( J+1, J+1 ) )
+ T( J+1, J ) = CZERO
+*
+ DO 120 JR = IFRSTM, MIN( J+2, ILAST )
+ CTEMP = C*H( JR, J+1 ) + S*H( JR, J )
+ H( JR, J ) = -DCONJG( S )*H( JR, J+1 ) + C*H( JR, J )
+ H( JR, J+1 ) = CTEMP
+ 120 CONTINUE
+ DO 130 JR = IFRSTM, J
+ CTEMP = C*T( JR, J+1 ) + S*T( JR, J )
+ T( JR, J ) = -DCONJG( S )*T( JR, J+1 ) + C*T( JR, J )
+ T( JR, J+1 ) = CTEMP
+ 130 CONTINUE
+ IF( ILZ ) THEN
+ DO 140 JR = 1, N
+ CTEMP = C*Z( JR, J+1 ) + S*Z( JR, J )
+ Z( JR, J ) = -DCONJG( S )*Z( JR, J+1 ) + C*Z( JR, J )
+ Z( JR, J+1 ) = CTEMP
+ 140 CONTINUE
+ END IF
+ 150 CONTINUE
+*
+ 160 CONTINUE
+*
+ 170 CONTINUE
+*
+* Drop-through = non-convergence
+*
+ 180 CONTINUE
+ INFO = ILAST
+ GO TO 210
+*
+* Successful completion of all QZ steps
+*
+ 190 CONTINUE
+*
+* Set Eigenvalues 1:ILO-1
+*
+ DO 200 J = 1, ILO - 1
+ ABSB = ABS( T( J, J ) )
+ IF( ABSB.GT.SAFMIN ) THEN
+ SIGNBC = DCONJG( T( J, J ) / ABSB )
+ T( J, J ) = ABSB
+ IF( ILSCHR ) THEN
+ CALL ZSCAL( J-1, SIGNBC, T( 1, J ), 1 )
+ CALL ZSCAL( J, SIGNBC, H( 1, J ), 1 )
+ ELSE
+ H( J, J ) = H( J, J )*SIGNBC
+ END IF
+ IF( ILZ )
+ $ CALL ZSCAL( N, SIGNBC, Z( 1, J ), 1 )
+ ELSE
+ T( J, J ) = CZERO
+ END IF
+ ALPHA( J ) = H( J, J )
+ BETA( J ) = T( J, J )
+ 200 CONTINUE
+*
+* Normal Termination
+*
+ INFO = 0
+*
+* Exit (other than argument error) -- return optimal workspace size
+*
+ 210 CONTINUE
+ WORK( 1 ) = DCMPLX( N )
+ RETURN
+*
+* End of ZHGEQZ
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.h
new file mode 100644
index 0000000000000000000000000000000000000000..2cbc90f4e264fe6d0ad510c2e48dc01d5f7353a1
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhgeqz.h
@@ -0,0 +1,25 @@
+extern int v3p_netlib_zhgeqz_(
+ char *job,
+ char *compq,
+ char *compz,
+ v3p_netlib_integer *n,
+ v3p_netlib_integer *ilo,
+ v3p_netlib_integer *ihi,
+ v3p_netlib_doublecomplex *h__,
+ v3p_netlib_integer *ldh,
+ v3p_netlib_doublecomplex *t,
+ v3p_netlib_integer *ldt,
+ v3p_netlib_doublecomplex *alpha,
+ v3p_netlib_doublecomplex *beta,
+ v3p_netlib_doublecomplex *q,
+ v3p_netlib_integer *ldq,
+ v3p_netlib_doublecomplex *z__,
+ v3p_netlib_integer *ldz,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_integer *lwork,
+ v3p_netlib_doublereal *rwork,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen job_len,
+ v3p_netlib_ftnlen compq_len,
+ v3p_netlib_ftnlen compz_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhseqr.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhseqr.c
index 75758b7b6cc0a7a1184666a8811414013f8a2028..a74c85854685c90b46112e79641d043f8f5518d2 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhseqr.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zhseqr.c
@@ -59,7 +59,7 @@ static logical c_false = FALSE_;
doublereal unfl;
doublecomplex temp;
doublereal ovfl;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int zscal_(integer *, doublecomplex *,
doublecomplex *, integer *);
integer itemp;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.P
new file mode 100644
index 0000000000000000000000000000000000000000..6f0350a62f879e3e5971ea965242c80931edaea5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.P
@@ -0,0 +1,5 @@
+extern int zlacn2_(integer *n, doublecomplex *v, doublecomplex *x, doublereal *est, integer *kase, integer *isave);
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dzsum1_ 7 3 4 9 4 */
+/*:ref: izmax1_ 4 3 4 9 4 */
+/*:ref: zcopy_ 14 5 4 9 4 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.c
new file mode 100644
index 0000000000000000000000000000000000000000..6d93f7c21823093b2a7954cd5da2e1e7d73b0ab9
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.c
@@ -0,0 +1,389 @@
+/* lapack/complex16/zlacn2.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+
+/*< SUBROUTINE ZLACN2( N, V, X, EST, KASE, ISAVE ) >*/
+/* Subroutine */ int zlacn2_(integer *n, doublecomplex *v, doublecomplex *x,
+ doublereal *est, integer *kase, integer *isave)
+{
+ /* System generated locals */
+ integer i__1, i__2, i__3;
+ doublereal d__1, d__2;
+ doublecomplex z__1;
+
+ /* Builtin functions */
+ double z_abs(doublecomplex *), d_imag(doublecomplex *);
+
+ /* Local variables */
+ integer i__;
+ doublereal temp, absxi;
+ integer jlast;
+ extern /* Subroutine */ int zcopy_(integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *);
+ extern integer izmax1_(integer *, doublecomplex *, integer *);
+ extern doublereal dzsum1_(integer *, doublecomplex *, integer *), dlamch_(
+ char *, ftnlen);
+ doublereal safmin, altsgn, estold;
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER KASE, N >*/
+/*< DOUBLE PRECISION EST >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< INTEGER ISAVE( 3 ) >*/
+/*< COMPLEX*16 V( * ), X( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZLACN2 estimates the 1-norm of a square, complex matrix A. */
+/* Reverse communication is used for evaluating matrix-vector products. */
+
+/* Arguments */
+/* ========= */
+
+/* N (input) INTEGER */
+/* The order of the matrix. N >= 1. */
+
+/* V (workspace) COMPLEX*16 array, dimension (N) */
+/* On the final return, V = A*W, where EST = norm(V)/norm(W) */
+/* (W is not returned). */
+
+/* X (input/output) COMPLEX*16 array, dimension (N) */
+/* On an intermediate return, X should be overwritten by */
+/* A * X, if KASE=1, */
+/* A' * X, if KASE=2, */
+/* where A' is the conjugate transpose of A, and ZLACN2 must be */
+/* re-called with all the other parameters unchanged. */
+
+/* EST (input/output) DOUBLE PRECISION */
+/* On entry with KASE = 1 or 2 and ISAVE(1) = 3, EST should be */
+/* unchanged from the previous call to ZLACN2. */
+/* On exit, EST is an estimate (a lower bound) for norm(A). */
+
+/* KASE (input/output) INTEGER */
+/* On the initial call to ZLACN2, KASE should be 0. */
+/* On an intermediate return, KASE will be 1 or 2, indicating */
+/* whether X should be overwritten by A * X or A' * X. */
+/* On the final return from ZLACN2, KASE will again be 0. */
+
+/* ISAVE (input/output) INTEGER array, dimension (3) */
+/* ISAVE is used to save variables between calls to ZLACN2 */
+
+/* Further Details */
+/* ======= ======= */
+
+/* Contributed by Nick Higham, University of Manchester. */
+/* Originally named CONEST, dated March 16, 1988. */
+
+/* Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of */
+/* a real or complex matrix, with applications to condition estimation", */
+/* ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. */
+
+/* Last modified: April, 1999 */
+
+/* This is a thread safe version of ZLACON, which uses the array ISAVE */
+/* in place of a SAVE statement, as follows: */
+
+/* ZLACON ZLACN2 */
+/* JUMP ISAVE(1) */
+/* J ISAVE(2) */
+/* ITER ISAVE(3) */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< INTEGER ITMAX >*/
+/*< PARAMETER ( ITMAX = 5 ) >*/
+/*< DOUBLE PRECISION ONE, TWO >*/
+/*< PARAMETER ( ONE = 1.0D0, TWO = 2.0D0 ) >*/
+/*< COMPLEX*16 CZERO, CONE >*/
+/*< >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< INTEGER I, JLAST >*/
+/*< DOUBLE PRECISION ABSXI, ALTSGN, ESTOLD, SAFMIN, TEMP >*/
+/* .. */
+/* .. External Functions .. */
+/*< INTEGER IZMAX1 >*/
+/*< DOUBLE PRECISION DLAMCH, DZSUM1 >*/
+/*< EXTERNAL IZMAX1, DLAMCH, DZSUM1 >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL ZCOPY >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, DBLE, DCMPLX, DIMAG >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/*< SAFMIN = DLAMCH( 'Safe minimum' ) >*/
+ /* Parameter adjustments */
+ --isave;
+ --x;
+ --v;
+
+ /* Function Body */
+ safmin = dlamch_("Safe minimum", (ftnlen)12);
+/*< IF( KASE.EQ.0 ) THEN >*/
+ if (*kase == 0) {
+/*< DO 10 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< X( I ) = DCMPLX( ONE / DBLE( N ) ) >*/
+ i__2 = i__;
+ d__1 = 1. / (doublereal) (*n);
+ z__1.r = d__1, z__1.i = 0.;
+ x[i__2].r = z__1.r, x[i__2].i = z__1.i;
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< KASE = 1 >*/
+ *kase = 1;
+/*< ISAVE( 1 ) = 1 >*/
+ isave[1] = 1;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< GO TO ( 20, 40, 70, 90, 120 )ISAVE( 1 ) >*/
+ switch (isave[1]) {
+ case 1: goto L20;
+ case 2: goto L40;
+ case 3: goto L70;
+ case 4: goto L90;
+ case 5: goto L120;
+ }
+
+/* ................ ENTRY (ISAVE( 1 ) = 1) */
+/* FIRST ITERATION. X HAS BEEN OVERWRITTEN BY A*X. */
+
+/*< 20 CONTINUE >*/
+L20:
+/*< IF( N.EQ.1 ) THEN >*/
+ if (*n == 1) {
+/*< V( 1 ) = X( 1 ) >*/
+ v[1].r = x[1].r, v[1].i = x[1].i;
+/*< EST = ABS( V( 1 ) ) >*/
+ *est = z_abs(&v[1]);
+/* ... QUIT */
+/*< GO TO 130 >*/
+ goto L130;
+/*< END IF >*/
+ }
+/*< EST = DZSUM1( N, X, 1 ) >*/
+ *est = dzsum1_(n, &x[1], &c__1);
+
+/*< DO 30 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< ABSXI = ABS( X( I ) ) >*/
+ absxi = z_abs(&x[i__]);
+/*< IF( ABSXI.GT.SAFMIN ) THEN >*/
+ if (absxi > safmin) {
+/*< >*/
+ i__2 = i__;
+ i__3 = i__;
+ d__1 = x[i__3].r / absxi;
+ d__2 = d_imag(&x[i__]) / absxi;
+ z__1.r = d__1, z__1.i = d__2;
+ x[i__2].r = z__1.r, x[i__2].i = z__1.i;
+/*< ELSE >*/
+ } else {
+/*< X( I ) = CONE >*/
+ i__2 = i__;
+ x[i__2].r = 1., x[i__2].i = 0.;
+/*< END IF >*/
+ }
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< KASE = 2 >*/
+ *kase = 2;
+/*< ISAVE( 1 ) = 2 >*/
+ isave[1] = 2;
+/*< RETURN >*/
+ return 0;
+
+/* ................ ENTRY (ISAVE( 1 ) = 2) */
+/* FIRST ITERATION. X HAS BEEN OVERWRITTEN BY CTRANS(A)*X. */
+
+/*< 40 CONTINUE >*/
+L40:
+/*< ISAVE( 2 ) = IZMAX1( N, X, 1 ) >*/
+ isave[2] = izmax1_(n, &x[1], &c__1);
+/*< ISAVE( 3 ) = 2 >*/
+ isave[3] = 2;
+
+/* MAIN LOOP - ITERATIONS 2,3,...,ITMAX. */
+
+/*< 50 CONTINUE >*/
+L50:
+/*< DO 60 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< X( I ) = CZERO >*/
+ i__2 = i__;
+ x[i__2].r = 0., x[i__2].i = 0.;
+/*< 60 CONTINUE >*/
+/* L60: */
+ }
+/*< X( ISAVE( 2 ) ) = CONE >*/
+ i__1 = isave[2];
+ x[i__1].r = 1., x[i__1].i = 0.;
+/*< KASE = 1 >*/
+ *kase = 1;
+/*< ISAVE( 1 ) = 3 >*/
+ isave[1] = 3;
+/*< RETURN >*/
+ return 0;
+
+/* ................ ENTRY (ISAVE( 1 ) = 3) */
+/* X HAS BEEN OVERWRITTEN BY A*X. */
+
+/*< 70 CONTINUE >*/
+L70:
+/*< CALL ZCOPY( N, X, 1, V, 1 ) >*/
+ zcopy_(n, &x[1], &c__1, &v[1], &c__1);
+/*< ESTOLD = EST >*/
+ estold = *est;
+/*< EST = DZSUM1( N, V, 1 ) >*/
+ *est = dzsum1_(n, &v[1], &c__1);
+
+/* TEST FOR CYCLING. */
+/*< >*/
+ if (*est <= estold) {
+ goto L100;
+ }
+
+/*< DO 80 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< ABSXI = ABS( X( I ) ) >*/
+ absxi = z_abs(&x[i__]);
+/*< IF( ABSXI.GT.SAFMIN ) THEN >*/
+ if (absxi > safmin) {
+/*< >*/
+ i__2 = i__;
+ i__3 = i__;
+ d__1 = x[i__3].r / absxi;
+ d__2 = d_imag(&x[i__]) / absxi;
+ z__1.r = d__1, z__1.i = d__2;
+ x[i__2].r = z__1.r, x[i__2].i = z__1.i;
+/*< ELSE >*/
+ } else {
+/*< X( I ) = CONE >*/
+ i__2 = i__;
+ x[i__2].r = 1., x[i__2].i = 0.;
+/*< END IF >*/
+ }
+/*< 80 CONTINUE >*/
+/* L80: */
+ }
+/*< KASE = 2 >*/
+ *kase = 2;
+/*< ISAVE( 1 ) = 4 >*/
+ isave[1] = 4;
+/*< RETURN >*/
+ return 0;
+
+/* ................ ENTRY (ISAVE( 1 ) = 4) */
+/* X HAS BEEN OVERWRITTEN BY CTRANS(A)*X. */
+
+/*< 90 CONTINUE >*/
+L90:
+/*< JLAST = ISAVE( 2 ) >*/
+ jlast = isave[2];
+/*< ISAVE( 2 ) = IZMAX1( N, X, 1 ) >*/
+ isave[2] = izmax1_(n, &x[1], &c__1);
+/*< >*/
+ if (z_abs(&x[jlast]) != z_abs(&x[isave[2]]) && isave[3] < 5) {
+/*< ISAVE( 3 ) = ISAVE( 3 ) + 1 >*/
+ ++isave[3];
+/*< GO TO 50 >*/
+ goto L50;
+/*< END IF >*/
+ }
+
+/* ITERATION COMPLETE. FINAL STAGE. */
+
+/*< 100 CONTINUE >*/
+L100:
+/*< ALTSGN = ONE >*/
+ altsgn = 1.;
+/*< DO 110 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< X( I ) = DCMPLX( ALTSGN*( ONE+DBLE( I-1 ) / DBLE( N-1 ) ) ) >*/
+ i__2 = i__;
+ d__1 = altsgn * ((doublereal) (i__ - 1) / (doublereal) (*n - 1) + 1.);
+ z__1.r = d__1, z__1.i = 0.;
+ x[i__2].r = z__1.r, x[i__2].i = z__1.i;
+/*< ALTSGN = -ALTSGN >*/
+ altsgn = -altsgn;
+/*< 110 CONTINUE >*/
+/* L110: */
+ }
+/*< KASE = 1 >*/
+ *kase = 1;
+/*< ISAVE( 1 ) = 5 >*/
+ isave[1] = 5;
+/*< RETURN >*/
+ return 0;
+
+/* ................ ENTRY (ISAVE( 1 ) = 5) */
+/* X HAS BEEN OVERWRITTEN BY A*X. */
+
+/*< 120 CONTINUE >*/
+L120:
+/*< TEMP = TWO*( DZSUM1( N, X, 1 ) / DBLE( 3*N ) ) >*/
+ temp = dzsum1_(n, &x[1], &c__1) / (doublereal) (*n * 3) * 2.;
+/*< IF( TEMP.GT.EST ) THEN >*/
+ if (temp > *est) {
+/*< CALL ZCOPY( N, X, 1, V, 1 ) >*/
+ zcopy_(n, &x[1], &c__1, &v[1], &c__1);
+/*< EST = TEMP >*/
+ *est = temp;
+/*< END IF >*/
+ }
+
+/*< 130 CONTINUE >*/
+L130:
+/*< KASE = 0 >*/
+ *kase = 0;
+/*< RETURN >*/
+ return 0;
+
+/* End of ZLACN2 */
+
+/*< END >*/
+} /* zlacn2_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.f
new file mode 100644
index 0000000000000000000000000000000000000000..f099e853a063782a4d35b0a3dcefb23a5f43a3bd
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.f
@@ -0,0 +1,222 @@
+ SUBROUTINE ZLACN2( N, V, X, EST, KASE, ISAVE )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER KASE, N
+ DOUBLE PRECISION EST
+* ..
+* .. Array Arguments ..
+ INTEGER ISAVE( 3 )
+ COMPLEX*16 V( * ), X( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZLACN2 estimates the 1-norm of a square, complex matrix A.
+* Reverse communication is used for evaluating matrix-vector products.
+*
+* Arguments
+* =========
+*
+* N (input) INTEGER
+* The order of the matrix. N >= 1.
+*
+* V (workspace) COMPLEX*16 array, dimension (N)
+* On the final return, V = A*W, where EST = norm(V)/norm(W)
+* (W is not returned).
+*
+* X (input/output) COMPLEX*16 array, dimension (N)
+* On an intermediate return, X should be overwritten by
+* A * X, if KASE=1,
+* A' * X, if KASE=2,
+* where A' is the conjugate transpose of A, and ZLACN2 must be
+* re-called with all the other parameters unchanged.
+*
+* EST (input/output) DOUBLE PRECISION
+* On entry with KASE = 1 or 2 and ISAVE(1) = 3, EST should be
+* unchanged from the previous call to ZLACN2.
+* On exit, EST is an estimate (a lower bound) for norm(A).
+*
+* KASE (input/output) INTEGER
+* On the initial call to ZLACN2, KASE should be 0.
+* On an intermediate return, KASE will be 1 or 2, indicating
+* whether X should be overwritten by A * X or A' * X.
+* On the final return from ZLACN2, KASE will again be 0.
+*
+* ISAVE (input/output) INTEGER array, dimension (3)
+* ISAVE is used to save variables between calls to ZLACN2
+*
+* Further Details
+* ======= =======
+*
+* Contributed by Nick Higham, University of Manchester.
+* Originally named CONEST, dated March 16, 1988.
+*
+* Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of
+* a real or complex matrix, with applications to condition estimation",
+* ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988.
+*
+* Last modified: April, 1999
+*
+* This is a thread safe version of ZLACON, which uses the array ISAVE
+* in place of a SAVE statement, as follows:
+*
+* ZLACON ZLACN2
+* JUMP ISAVE(1)
+* J ISAVE(2)
+* ITER ISAVE(3)
+*
+* =====================================================================
+*
+* .. Parameters ..
+ INTEGER ITMAX
+ PARAMETER ( ITMAX = 5 )
+ DOUBLE PRECISION ONE, TWO
+ PARAMETER ( ONE = 1.0D0, TWO = 2.0D0 )
+ COMPLEX*16 CZERO, CONE
+ PARAMETER ( CZERO = ( 0.0D0, 0.0D0 ),
+ $ CONE = ( 1.0D0, 0.0D0 ) )
+* ..
+* .. Local Scalars ..
+ INTEGER I, JLAST
+ DOUBLE PRECISION ABSXI, ALTSGN, ESTOLD, SAFMIN, TEMP
+* ..
+* .. External Functions ..
+ INTEGER IZMAX1
+ DOUBLE PRECISION DLAMCH, DZSUM1
+ EXTERNAL IZMAX1, DLAMCH, DZSUM1
+* ..
+* .. External Subroutines ..
+ EXTERNAL ZCOPY
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DBLE, DCMPLX, DIMAG
+* ..
+* .. Executable Statements ..
+*
+ SAFMIN = DLAMCH( 'Safe minimum' )
+ IF( KASE.EQ.0 ) THEN
+ DO 10 I = 1, N
+ X( I ) = DCMPLX( ONE / DBLE( N ) )
+ 10 CONTINUE
+ KASE = 1
+ ISAVE( 1 ) = 1
+ RETURN
+ END IF
+*
+ GO TO ( 20, 40, 70, 90, 120 )ISAVE( 1 )
+*
+* ................ ENTRY (ISAVE( 1 ) = 1)
+* FIRST ITERATION. X HAS BEEN OVERWRITTEN BY A*X.
+*
+ 20 CONTINUE
+ IF( N.EQ.1 ) THEN
+ V( 1 ) = X( 1 )
+ EST = ABS( V( 1 ) )
+* ... QUIT
+ GO TO 130
+ END IF
+ EST = DZSUM1( N, X, 1 )
+*
+ DO 30 I = 1, N
+ ABSXI = ABS( X( I ) )
+ IF( ABSXI.GT.SAFMIN ) THEN
+ X( I ) = DCMPLX( DBLE( X( I ) ) / ABSXI,
+ $ DIMAG( X( I ) ) / ABSXI )
+ ELSE
+ X( I ) = CONE
+ END IF
+ 30 CONTINUE
+ KASE = 2
+ ISAVE( 1 ) = 2
+ RETURN
+*
+* ................ ENTRY (ISAVE( 1 ) = 2)
+* FIRST ITERATION. X HAS BEEN OVERWRITTEN BY CTRANS(A)*X.
+*
+ 40 CONTINUE
+ ISAVE( 2 ) = IZMAX1( N, X, 1 )
+ ISAVE( 3 ) = 2
+*
+* MAIN LOOP - ITERATIONS 2,3,...,ITMAX.
+*
+ 50 CONTINUE
+ DO 60 I = 1, N
+ X( I ) = CZERO
+ 60 CONTINUE
+ X( ISAVE( 2 ) ) = CONE
+ KASE = 1
+ ISAVE( 1 ) = 3
+ RETURN
+*
+* ................ ENTRY (ISAVE( 1 ) = 3)
+* X HAS BEEN OVERWRITTEN BY A*X.
+*
+ 70 CONTINUE
+ CALL ZCOPY( N, X, 1, V, 1 )
+ ESTOLD = EST
+ EST = DZSUM1( N, V, 1 )
+*
+* TEST FOR CYCLING.
+ IF( EST.LE.ESTOLD )
+ $ GO TO 100
+*
+ DO 80 I = 1, N
+ ABSXI = ABS( X( I ) )
+ IF( ABSXI.GT.SAFMIN ) THEN
+ X( I ) = DCMPLX( DBLE( X( I ) ) / ABSXI,
+ $ DIMAG( X( I ) ) / ABSXI )
+ ELSE
+ X( I ) = CONE
+ END IF
+ 80 CONTINUE
+ KASE = 2
+ ISAVE( 1 ) = 4
+ RETURN
+*
+* ................ ENTRY (ISAVE( 1 ) = 4)
+* X HAS BEEN OVERWRITTEN BY CTRANS(A)*X.
+*
+ 90 CONTINUE
+ JLAST = ISAVE( 2 )
+ ISAVE( 2 ) = IZMAX1( N, X, 1 )
+ IF( ( ABS( X( JLAST ) ).NE.ABS( X( ISAVE( 2 ) ) ) ) .AND.
+ $ ( ISAVE( 3 ).LT.ITMAX ) ) THEN
+ ISAVE( 3 ) = ISAVE( 3 ) + 1
+ GO TO 50
+ END IF
+*
+* ITERATION COMPLETE. FINAL STAGE.
+*
+ 100 CONTINUE
+ ALTSGN = ONE
+ DO 110 I = 1, N
+ X( I ) = DCMPLX( ALTSGN*( ONE+DBLE( I-1 ) / DBLE( N-1 ) ) )
+ ALTSGN = -ALTSGN
+ 110 CONTINUE
+ KASE = 1
+ ISAVE( 1 ) = 5
+ RETURN
+*
+* ................ ENTRY (ISAVE( 1 ) = 5)
+* X HAS BEEN OVERWRITTEN BY A*X.
+*
+ 120 CONTINUE
+ TEMP = TWO*( DZSUM1( N, X, 1 ) / DBLE( 3*N ) )
+ IF( TEMP.GT.EST ) THEN
+ CALL ZCOPY( N, X, 1, V, 1 )
+ EST = TEMP
+ END IF
+*
+ 130 CONTINUE
+ KASE = 0
+ RETURN
+*
+* End of ZLACN2
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.h
new file mode 100644
index 0000000000000000000000000000000000000000..332d066ded5db01718b8c987d866fade738c98c6
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacn2.h
@@ -0,0 +1,8 @@
+extern int v3p_netlib_zlacn2_(
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *v,
+ v3p_netlib_doublecomplex *x,
+ v3p_netlib_doublereal *est,
+ v3p_netlib_integer *kase,
+ v3p_netlib_integer *isave
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacpy.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacpy.c
index eaeb9a28c4d69206538659a053352f0e8619a572..ad1eb85759e4f9e0a545a1cace5b2111ac4a54d2 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacpy.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlacpy.c
@@ -25,7 +25,7 @@ extern "C" {
/* Local variables */
integer i__, j;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
(void)uplo_len;
/* -- LAPACK auxiliary routine (version 3.0) -- */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlange.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlange.c
index ea951f755a4d098f7877e0ff78c8de9f62dd0f80..ac55b03df3fc03f95ff0161cafba99c86e03b310 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlange.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlange.c
@@ -33,7 +33,7 @@ doublereal zlange_(char *norm, integer *m, integer *n, doublecomplex *a,
/* Local variables */
integer i__, j;
doublereal sum, scale;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
doublereal value=0;
extern /* Subroutine */ int zlassq_(integer *, doublecomplex *, integer *,
doublereal *, doublereal *);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlanhs.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlanhs.c
index 1a4792007aa5aa1af7ddd6386050bd51759b4265..34237f65889a0abf82cc6a3b7b1a6d89907e2092 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlanhs.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlanhs.c
@@ -33,7 +33,7 @@ doublereal zlanhs_(char *norm, integer *n, doublecomplex *a, integer *lda,
/* Local variables */
integer i__, j;
doublereal sum, scale;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
doublereal value=0;
extern /* Subroutine */ int zlassq_(integer *, doublecomplex *, integer *,
doublereal *, doublereal *);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarf.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarf.c
index bac6f7a31aad8c16ac372c9382b755f579279e92..acc28e1dc3309fc2e972d0101c28ccf02f7642dc 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarf.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarf.c
@@ -31,7 +31,7 @@ static integer c__1 = 1;
doublecomplex z__1;
/* Local variables */
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int zgerc_(integer *, integer *, doublecomplex *,
doublecomplex *, integer *, doublecomplex *, integer *,
doublecomplex *, integer *), zgemv_(char *, integer *, integer *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarfb.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarfb.c
index f4d1a6a8b1b65af0e9e4c9973385072e1c18b8d2..fc4a8c0c942a731a0e1c3b61fbffde3f626f9831 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarfb.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarfb.c
@@ -37,7 +37,7 @@ static integer c__1 = 1;
/* Local variables */
integer i__, j;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int zgemm_(char *, char *, integer *, integer *,
integer *, doublecomplex *, doublecomplex *, integer *,
doublecomplex *, integer *, doublecomplex *, doublecomplex *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarft.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarft.c
index 3fdd66aba81308e4f6261d242fb6ea2d7f239d27..82f8d694c2ccd72651274858fa3716a2e80f67a7 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarft.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarft.c
@@ -32,7 +32,7 @@ static integer c__1 = 1;
/* Local variables */
integer i__, j;
doublecomplex vii;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int zgemv_(char *, integer *, integer *,
doublecomplex *, doublecomplex *, integer *, doublecomplex *,
integer *, doublecomplex *, doublecomplex *, integer *, ftnlen),
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarfx.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarfx.c
index d331d50245d74909f07276b5e689f34eb7c769d4..9d2dfbf3d8489b31b646edb0770a83f2ce2e5e74 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarfx.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlarfx.c
@@ -52,7 +52,7 @@ static integer c__1 = 1;
integer j;
doublecomplex t1, t2, t3, t4, t5, t6, t7, t8, t9, v1, v2, v3, v4, v5, v6,
v7, v8, v9, t10, v10, sum;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int zgerc_(integer *, integer *, doublecomplex *,
doublecomplex *, integer *, doublecomplex *, integer *,
doublecomplex *, integer *), zgemv_(char *, integer *, integer *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.P
new file mode 100644
index 0000000000000000000000000000000000000000..dd978c4e49e64321f2d3708ef75cc3a434fe9b0c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.P
@@ -0,0 +1,3 @@
+extern int zlartg_(doublecomplex *f, doublecomplex *g, doublereal *cs, doublecomplex *sn, doublecomplex *r__);
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dlapy2_ 7 2 7 7 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.c
new file mode 100644
index 0000000000000000000000000000000000000000..111e44310bd3614d3f1bc0c9e21494915aa51cfb
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.c
@@ -0,0 +1,382 @@
+/* lapack/complex16/zlartg.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< SUBROUTINE ZLARTG( F, G, CS, SN, R ) >*/
+/* Subroutine */ int zlartg_(doublecomplex *f, doublecomplex *g, doublereal *
+ cs, doublecomplex *sn, doublecomplex *r__)
+{
+ /* System generated locals */
+ integer i__1;
+ doublereal d__1, d__2, d__3, d__4, d__5, d__6, d__7, d__8, d__9, d__10;
+ doublecomplex z__1, z__2, z__3;
+
+ /* Builtin functions */
+ double log(doublereal), pow_di(doublereal *, integer *), d_imag(
+ doublecomplex *), sqrt(doublereal);
+ void d_cnjg(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ doublereal d__;
+ integer i__;
+ doublereal f2, g2;
+ doublecomplex ff;
+ doublereal di, dr;
+ doublecomplex fs, gs;
+ doublereal f2s, g2s, eps, scale;
+ integer count;
+ doublereal safmn2;
+ extern doublereal dlapy2_(doublereal *, doublereal *);
+ doublereal safmx2;
+ extern doublereal dlamch_(char *, ftnlen);
+ doublereal safmin;
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< DOUBLE PRECISION CS >*/
+/*< COMPLEX*16 F, G, R, SN >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZLARTG generates a plane rotation so that */
+
+/* [ CS SN ] [ F ] [ R ] */
+/* [ __ ] . [ ] = [ ] where CS**2 + |SN|**2 = 1. */
+/* [ -SN CS ] [ G ] [ 0 ] */
+
+/* This is a faster version of the BLAS1 routine ZROTG, except for */
+/* the following differences: */
+/* F and G are unchanged on return. */
+/* If G=0, then CS=1 and SN=0. */
+/* If F=0, then CS=0 and SN is chosen so that R is real. */
+
+/* Arguments */
+/* ========= */
+
+/* F (input) COMPLEX*16 */
+/* The first component of vector to be rotated. */
+
+/* G (input) COMPLEX*16 */
+/* The second component of vector to be rotated. */
+
+/* CS (output) DOUBLE PRECISION */
+/* The cosine of the rotation. */
+
+/* SN (output) COMPLEX*16 */
+/* The sine of the rotation. */
+
+/* R (output) COMPLEX*16 */
+/* The nonzero component of the rotated vector. */
+
+/* Further Details */
+/* ======= ======= */
+
+/* 3-5-96 - Modified with a new algorithm by W. Kahan and J. Demmel */
+
+/* This version has a few statements commented out for thread safety */
+/* (machine parameters are computed on each entry). 10 feb 03, SJH. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION TWO, ONE, ZERO >*/
+/*< PARAMETER ( TWO = 2.0D+0, ONE = 1.0D+0, ZERO = 0.0D+0 ) >*/
+/*< COMPLEX*16 CZERO >*/
+/*< PARAMETER ( CZERO = ( 0.0D+0, 0.0D+0 ) ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/* LOGICAL FIRST */
+/*< INTEGER COUNT, I >*/
+/*< >*/
+/*< COMPLEX*16 FF, FS, GS >*/
+/* .. */
+/* .. External Functions .. */
+/*< DOUBLE PRECISION DLAMCH, DLAPY2 >*/
+/*< EXTERNAL DLAMCH, DLAPY2 >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< >*/
+/* .. */
+/* .. Statement Functions .. */
+/*< DOUBLE PRECISION ABS1, ABSSQ >*/
+/* .. */
+/* .. Save statement .. */
+/* SAVE FIRST, SAFMX2, SAFMIN, SAFMN2 */
+/* .. */
+/* .. Data statements .. */
+/* DATA FIRST / .TRUE. / */
+/* .. */
+/* .. Statement Function definitions .. */
+/*< ABS1( FF ) = MAX( ABS( DBLE( FF ) ), ABS( DIMAG( FF ) ) ) >*/
+/*< ABSSQ( FF ) = DBLE( FF )**2 + DIMAG( FF )**2 >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* IF( FIRST ) THEN */
+/*< SAFMIN = DLAMCH( 'S' ) >*/
+ safmin = dlamch_("S", (ftnlen)1);
+/*< EPS = DLAMCH( 'E' ) >*/
+ eps = dlamch_("E", (ftnlen)1);
+/*< >*/
+ d__1 = dlamch_("B", (ftnlen)1);
+ i__1 = (integer) (log(safmin / eps) / log(dlamch_("B", (ftnlen)1)) / 2.);
+ safmn2 = pow_di(&d__1, &i__1);
+/*< SAFMX2 = ONE / SAFMN2 >*/
+ safmx2 = 1. / safmn2;
+/* FIRST = .FALSE. */
+/* END IF */
+/*< SCALE = MAX( ABS1( F ), ABS1( G ) ) >*/
+/* Computing MAX */
+/* Computing MAX */
+ d__7 = (d__1 = f->r, abs(d__1)), d__8 = (d__2 = d_imag(f), abs(d__2));
+/* Computing MAX */
+ d__9 = (d__3 = g->r, abs(d__3)), d__10 = (d__4 = d_imag(g), abs(d__4));
+ d__5 = max(d__7,d__8), d__6 = max(d__9,d__10);
+ scale = max(d__5,d__6);
+/*< FS = F >*/
+ fs.r = f->r, fs.i = f->i;
+/*< GS = G >*/
+ gs.r = g->r, gs.i = g->i;
+/*< COUNT = 0 >*/
+ count = 0;
+/*< IF( SCALE.GE.SAFMX2 ) THEN >*/
+ if (scale >= safmx2) {
+/*< 10 CONTINUE >*/
+L10:
+/*< COUNT = COUNT + 1 >*/
+ ++count;
+/*< FS = FS*SAFMN2 >*/
+ z__1.r = safmn2 * fs.r, z__1.i = safmn2 * fs.i;
+ fs.r = z__1.r, fs.i = z__1.i;
+/*< GS = GS*SAFMN2 >*/
+ z__1.r = safmn2 * gs.r, z__1.i = safmn2 * gs.i;
+ gs.r = z__1.r, gs.i = z__1.i;
+/*< SCALE = SCALE*SAFMN2 >*/
+ scale *= safmn2;
+/*< >*/
+ if (scale >= safmx2) {
+ goto L10;
+ }
+/*< ELSE IF( SCALE.LE.SAFMN2 ) THEN >*/
+ } else if (scale <= safmn2) {
+/*< IF( G.EQ.CZERO ) THEN >*/
+ if (g->r == 0. && g->i == 0.) {
+/*< CS = ONE >*/
+ *cs = 1.;
+/*< SN = CZERO >*/
+ sn->r = 0., sn->i = 0.;
+/*< R = F >*/
+ r__->r = f->r, r__->i = f->i;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+/*< 20 CONTINUE >*/
+L20:
+/*< COUNT = COUNT - 1 >*/
+ --count;
+/*< FS = FS*SAFMX2 >*/
+ z__1.r = safmx2 * fs.r, z__1.i = safmx2 * fs.i;
+ fs.r = z__1.r, fs.i = z__1.i;
+/*< GS = GS*SAFMX2 >*/
+ z__1.r = safmx2 * gs.r, z__1.i = safmx2 * gs.i;
+ gs.r = z__1.r, gs.i = z__1.i;
+/*< SCALE = SCALE*SAFMX2 >*/
+ scale *= safmx2;
+/*< >*/
+ if (scale <= safmn2) {
+ goto L20;
+ }
+/*< END IF >*/
+ }
+/*< F2 = ABSSQ( FS ) >*/
+/* Computing 2nd power */
+ d__1 = fs.r;
+/* Computing 2nd power */
+ d__2 = d_imag(&fs);
+ f2 = d__1 * d__1 + d__2 * d__2;
+/*< G2 = ABSSQ( GS ) >*/
+/* Computing 2nd power */
+ d__1 = gs.r;
+/* Computing 2nd power */
+ d__2 = d_imag(&gs);
+ g2 = d__1 * d__1 + d__2 * d__2;
+/*< IF( F2.LE.MAX( G2, ONE )*SAFMIN ) THEN >*/
+ if (f2 <= max(g2,1.) * safmin) {
+
+/* This is a rare case: F is very small. */
+
+/*< IF( F.EQ.CZERO ) THEN >*/
+ if (f->r == 0. && f->i == 0.) {
+/*< CS = ZERO >*/
+ *cs = 0.;
+/*< R = DLAPY2( DBLE( G ), DIMAG( G ) ) >*/
+ d__2 = g->r;
+ d__3 = d_imag(g);
+ d__1 = dlapy2_(&d__2, &d__3);
+ r__->r = d__1, r__->i = 0.;
+/* Do complex/real division explicitly with two real divisions */
+/*< D = DLAPY2( DBLE( GS ), DIMAG( GS ) ) >*/
+ d__1 = gs.r;
+ d__2 = d_imag(&gs);
+ d__ = dlapy2_(&d__1, &d__2);
+/*< SN = DCMPLX( DBLE( GS ) / D, -DIMAG( GS ) / D ) >*/
+ d__1 = gs.r / d__;
+ d__2 = -d_imag(&gs) / d__;
+ z__1.r = d__1, z__1.i = d__2;
+ sn->r = z__1.r, sn->i = z__1.i;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+/*< F2S = DLAPY2( DBLE( FS ), DIMAG( FS ) ) >*/
+ d__1 = fs.r;
+ d__2 = d_imag(&fs);
+ f2s = dlapy2_(&d__1, &d__2);
+/* G2 and G2S are accurate */
+/* G2 is at least SAFMIN, and G2S is at least SAFMN2 */
+/*< G2S = SQRT( G2 ) >*/
+ g2s = sqrt(g2);
+/* Error in CS from underflow in F2S is at most */
+/* UNFL / SAFMN2 .lt. sqrt(UNFL*EPS) .lt. EPS */
+/* If MAX(G2,ONE)=G2, then F2 .lt. G2*SAFMIN, */
+/* and so CS .lt. sqrt(SAFMIN) */
+/* If MAX(G2,ONE)=ONE, then F2 .lt. SAFMIN */
+/* and so CS .lt. sqrt(SAFMIN)/SAFMN2 = sqrt(EPS) */
+/* Therefore, CS = F2S/G2S / sqrt( 1 + (F2S/G2S)**2 ) = F2S/G2S */
+/*< CS = F2S / G2S >*/
+ *cs = f2s / g2s;
+/* Make sure abs(FF) = 1 */
+/* Do complex/real division explicitly with 2 real divisions */
+/*< IF( ABS1( F ).GT.ONE ) THEN >*/
+/* Computing MAX */
+ d__3 = (d__1 = f->r, abs(d__1)), d__4 = (d__2 = d_imag(f), abs(d__2));
+ if (max(d__3,d__4) > 1.) {
+/*< D = DLAPY2( DBLE( F ), DIMAG( F ) ) >*/
+ d__1 = f->r;
+ d__2 = d_imag(f);
+ d__ = dlapy2_(&d__1, &d__2);
+/*< FF = DCMPLX( DBLE( F ) / D, DIMAG( F ) / D ) >*/
+ d__1 = f->r / d__;
+ d__2 = d_imag(f) / d__;
+ z__1.r = d__1, z__1.i = d__2;
+ ff.r = z__1.r, ff.i = z__1.i;
+/*< ELSE >*/
+ } else {
+/*< DR = SAFMX2*DBLE( F ) >*/
+ dr = safmx2 * f->r;
+/*< DI = SAFMX2*DIMAG( F ) >*/
+ di = safmx2 * d_imag(f);
+/*< D = DLAPY2( DR, DI ) >*/
+ d__ = dlapy2_(&dr, &di);
+/*< FF = DCMPLX( DR / D, DI / D ) >*/
+ d__1 = dr / d__;
+ d__2 = di / d__;
+ z__1.r = d__1, z__1.i = d__2;
+ ff.r = z__1.r, ff.i = z__1.i;
+/*< END IF >*/
+ }
+/*< SN = FF*DCMPLX( DBLE( GS ) / G2S, -DIMAG( GS ) / G2S ) >*/
+ d__1 = gs.r / g2s;
+ d__2 = -d_imag(&gs) / g2s;
+ z__2.r = d__1, z__2.i = d__2;
+ z__1.r = ff.r * z__2.r - ff.i * z__2.i, z__1.i = ff.r * z__2.i + ff.i
+ * z__2.r;
+ sn->r = z__1.r, sn->i = z__1.i;
+/*< R = CS*F + SN*G >*/
+ z__2.r = *cs * f->r, z__2.i = *cs * f->i;
+ z__3.r = sn->r * g->r - sn->i * g->i, z__3.i = sn->r * g->i + sn->i *
+ g->r;
+ z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
+ r__->r = z__1.r, r__->i = z__1.i;
+/*< ELSE >*/
+ } else {
+
+/* This is the most common case. */
+/* Neither F2 nor F2/G2 are less than SAFMIN */
+/* F2S cannot overflow, and it is accurate */
+
+/*< F2S = SQRT( ONE+G2 / F2 ) >*/
+ f2s = sqrt(g2 / f2 + 1.);
+/* Do the F2S(real)*FS(complex) multiply with two real multiplies */
+/*< R = DCMPLX( F2S*DBLE( FS ), F2S*DIMAG( FS ) ) >*/
+ d__1 = f2s * fs.r;
+ d__2 = f2s * d_imag(&fs);
+ z__1.r = d__1, z__1.i = d__2;
+ r__->r = z__1.r, r__->i = z__1.i;
+/*< CS = ONE / F2S >*/
+ *cs = 1. / f2s;
+/*< D = F2 + G2 >*/
+ d__ = f2 + g2;
+/* Do complex/real division explicitly with two real divisions */
+/*< SN = DCMPLX( DBLE( R ) / D, DIMAG( R ) / D ) >*/
+ d__1 = r__->r / d__;
+ d__2 = d_imag(r__) / d__;
+ z__1.r = d__1, z__1.i = d__2;
+ sn->r = z__1.r, sn->i = z__1.i;
+/*< SN = SN*DCONJG( GS ) >*/
+ d_cnjg(&z__2, &gs);
+ z__1.r = sn->r * z__2.r - sn->i * z__2.i, z__1.i = sn->r * z__2.i +
+ sn->i * z__2.r;
+ sn->r = z__1.r, sn->i = z__1.i;
+/*< IF( COUNT.NE.0 ) THEN >*/
+ if (count != 0) {
+/*< IF( COUNT.GT.0 ) THEN >*/
+ if (count > 0) {
+/*< DO 30 I = 1, COUNT >*/
+ i__1 = count;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< R = R*SAFMX2 >*/
+ z__1.r = safmx2 * r__->r, z__1.i = safmx2 * r__->i;
+ r__->r = z__1.r, r__->i = z__1.i;
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< ELSE >*/
+ } else {
+/*< DO 40 I = 1, -COUNT >*/
+ i__1 = -count;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< R = R*SAFMN2 >*/
+ z__1.r = safmn2 * r__->r, z__1.i = safmn2 * r__->i;
+ r__->r = z__1.r, r__->i = z__1.i;
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< RETURN >*/
+ return 0;
+
+/* End of ZLARTG */
+
+/*< END >*/
+} /* zlartg_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.f
new file mode 100644
index 0000000000000000000000000000000000000000..44376ee21f900f5a50bd46df7d5511be94de313f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.f
@@ -0,0 +1,196 @@
+ SUBROUTINE ZLARTG( F, G, CS, SN, R )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ DOUBLE PRECISION CS
+ COMPLEX*16 F, G, R, SN
+* ..
+*
+* Purpose
+* =======
+*
+* ZLARTG generates a plane rotation so that
+*
+* [ CS SN ] [ F ] [ R ]
+* [ __ ] . [ ] = [ ] where CS**2 + |SN|**2 = 1.
+* [ -SN CS ] [ G ] [ 0 ]
+*
+* This is a faster version of the BLAS1 routine ZROTG, except for
+* the following differences:
+* F and G are unchanged on return.
+* If G=0, then CS=1 and SN=0.
+* If F=0, then CS=0 and SN is chosen so that R is real.
+*
+* Arguments
+* =========
+*
+* F (input) COMPLEX*16
+* The first component of vector to be rotated.
+*
+* G (input) COMPLEX*16
+* The second component of vector to be rotated.
+*
+* CS (output) DOUBLE PRECISION
+* The cosine of the rotation.
+*
+* SN (output) COMPLEX*16
+* The sine of the rotation.
+*
+* R (output) COMPLEX*16
+* The nonzero component of the rotated vector.
+*
+* Further Details
+* ======= =======
+*
+* 3-5-96 - Modified with a new algorithm by W. Kahan and J. Demmel
+*
+* This version has a few statements commented out for thread safety
+* (machine parameters are computed on each entry). 10 feb 03, SJH.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION TWO, ONE, ZERO
+ PARAMETER ( TWO = 2.0D+0, ONE = 1.0D+0, ZERO = 0.0D+0 )
+ COMPLEX*16 CZERO
+ PARAMETER ( CZERO = ( 0.0D+0, 0.0D+0 ) )
+* ..
+* .. Local Scalars ..
+* LOGICAL FIRST
+ INTEGER COUNT, I
+ DOUBLE PRECISION D, DI, DR, EPS, F2, F2S, G2, G2S, SAFMIN,
+ $ SAFMN2, SAFMX2, SCALE
+ COMPLEX*16 FF, FS, GS
+* ..
+* .. External Functions ..
+ DOUBLE PRECISION DLAMCH, DLAPY2
+ EXTERNAL DLAMCH, DLAPY2
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DBLE, DCMPLX, DCONJG, DIMAG, INT, LOG,
+ $ MAX, SQRT
+* ..
+* .. Statement Functions ..
+ DOUBLE PRECISION ABS1, ABSSQ
+* ..
+* .. Save statement ..
+* SAVE FIRST, SAFMX2, SAFMIN, SAFMN2
+* ..
+* .. Data statements ..
+* DATA FIRST / .TRUE. /
+* ..
+* .. Statement Function definitions ..
+ ABS1( FF ) = MAX( ABS( DBLE( FF ) ), ABS( DIMAG( FF ) ) )
+ ABSSQ( FF ) = DBLE( FF )**2 + DIMAG( FF )**2
+* ..
+* .. Executable Statements ..
+*
+* IF( FIRST ) THEN
+ SAFMIN = DLAMCH( 'S' )
+ EPS = DLAMCH( 'E' )
+ SAFMN2 = DLAMCH( 'B' )**INT( LOG( SAFMIN / EPS ) /
+ $ LOG( DLAMCH( 'B' ) ) / TWO )
+ SAFMX2 = ONE / SAFMN2
+* FIRST = .FALSE.
+* END IF
+ SCALE = MAX( ABS1( F ), ABS1( G ) )
+ FS = F
+ GS = G
+ COUNT = 0
+ IF( SCALE.GE.SAFMX2 ) THEN
+ 10 CONTINUE
+ COUNT = COUNT + 1
+ FS = FS*SAFMN2
+ GS = GS*SAFMN2
+ SCALE = SCALE*SAFMN2
+ IF( SCALE.GE.SAFMX2 )
+ $ GO TO 10
+ ELSE IF( SCALE.LE.SAFMN2 ) THEN
+ IF( G.EQ.CZERO ) THEN
+ CS = ONE
+ SN = CZERO
+ R = F
+ RETURN
+ END IF
+ 20 CONTINUE
+ COUNT = COUNT - 1
+ FS = FS*SAFMX2
+ GS = GS*SAFMX2
+ SCALE = SCALE*SAFMX2
+ IF( SCALE.LE.SAFMN2 )
+ $ GO TO 20
+ END IF
+ F2 = ABSSQ( FS )
+ G2 = ABSSQ( GS )
+ IF( F2.LE.MAX( G2, ONE )*SAFMIN ) THEN
+*
+* This is a rare case: F is very small.
+*
+ IF( F.EQ.CZERO ) THEN
+ CS = ZERO
+ R = DLAPY2( DBLE( G ), DIMAG( G ) )
+* Do complex/real division explicitly with two real divisions
+ D = DLAPY2( DBLE( GS ), DIMAG( GS ) )
+ SN = DCMPLX( DBLE( GS ) / D, -DIMAG( GS ) / D )
+ RETURN
+ END IF
+ F2S = DLAPY2( DBLE( FS ), DIMAG( FS ) )
+* G2 and G2S are accurate
+* G2 is at least SAFMIN, and G2S is at least SAFMN2
+ G2S = SQRT( G2 )
+* Error in CS from underflow in F2S is at most
+* UNFL / SAFMN2 .lt. sqrt(UNFL*EPS) .lt. EPS
+* If MAX(G2,ONE)=G2, then F2 .lt. G2*SAFMIN,
+* and so CS .lt. sqrt(SAFMIN)
+* If MAX(G2,ONE)=ONE, then F2 .lt. SAFMIN
+* and so CS .lt. sqrt(SAFMIN)/SAFMN2 = sqrt(EPS)
+* Therefore, CS = F2S/G2S / sqrt( 1 + (F2S/G2S)**2 ) = F2S/G2S
+ CS = F2S / G2S
+* Make sure abs(FF) = 1
+* Do complex/real division explicitly with 2 real divisions
+ IF( ABS1( F ).GT.ONE ) THEN
+ D = DLAPY2( DBLE( F ), DIMAG( F ) )
+ FF = DCMPLX( DBLE( F ) / D, DIMAG( F ) / D )
+ ELSE
+ DR = SAFMX2*DBLE( F )
+ DI = SAFMX2*DIMAG( F )
+ D = DLAPY2( DR, DI )
+ FF = DCMPLX( DR / D, DI / D )
+ END IF
+ SN = FF*DCMPLX( DBLE( GS ) / G2S, -DIMAG( GS ) / G2S )
+ R = CS*F + SN*G
+ ELSE
+*
+* This is the most common case.
+* Neither F2 nor F2/G2 are less than SAFMIN
+* F2S cannot overflow, and it is accurate
+*
+ F2S = SQRT( ONE+G2 / F2 )
+* Do the F2S(real)*FS(complex) multiply with two real multiplies
+ R = DCMPLX( F2S*DBLE( FS ), F2S*DIMAG( FS ) )
+ CS = ONE / F2S
+ D = F2 + G2
+* Do complex/real division explicitly with two real divisions
+ SN = DCMPLX( DBLE( R ) / D, DIMAG( R ) / D )
+ SN = SN*DCONJG( GS )
+ IF( COUNT.NE.0 ) THEN
+ IF( COUNT.GT.0 ) THEN
+ DO 30 I = 1, COUNT
+ R = R*SAFMX2
+ 30 CONTINUE
+ ELSE
+ DO 40 I = 1, -COUNT
+ R = R*SAFMN2
+ 40 CONTINUE
+ END IF
+ END IF
+ END IF
+ RETURN
+*
+* End of ZLARTG
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.h
new file mode 100644
index 0000000000000000000000000000000000000000..759c403fc984a653748fabafe728c3f0ba331ad6
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlartg.h
@@ -0,0 +1,7 @@
+extern int v3p_netlib_zlartg_(
+ v3p_netlib_doublecomplex *f,
+ v3p_netlib_doublecomplex *g,
+ v3p_netlib_doublereal *cs,
+ v3p_netlib_doublecomplex *sn,
+ v3p_netlib_doublecomplex *r__
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlascl.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlascl.c
index b3f0fc55a9e1eab03f0711e7bcfbffad1c866c04..57d2b6b9c4ee0bde802d398e19b479b8f50b7e96 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlascl.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlascl.c
@@ -29,7 +29,7 @@ extern "C" {
doublereal mul, cto1;
logical done;
doublereal ctoc;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
integer itype;
doublereal cfrom1;
extern doublereal dlamch_(char *, ftnlen);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaset.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaset.c
index 6c64820222787418fac4d2970265b6ede5075379..301147a0b477906a2775aa6932021c5af6829b48 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaset.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaset.c
@@ -25,7 +25,7 @@ extern "C" {
/* Local variables */
integer i__, j;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
(void)uplo_len;
/* -- LAPACK auxiliary routine (version 3.0) -- */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.P
new file mode 100644
index 0000000000000000000000000000000000000000..2c6a18240ae7c5c5565501d1b30302f10b247466
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.P
@@ -0,0 +1 @@
+extern int zlaswp_(integer *n, doublecomplex *a, integer *lda, integer *k1, integer *k2, integer *ipiv, integer *incx);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.c
new file mode 100644
index 0000000000000000000000000000000000000000..a1da3bfb837aea904cf3a7e4a50e4313fc3debf8
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.c
@@ -0,0 +1,226 @@
+/* lapack/complex16/zlaswp.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< SUBROUTINE ZLASWP( N, A, LDA, K1, K2, IPIV, INCX ) >*/
+/* Subroutine */ int zlaswp_(integer *n, doublecomplex *a, integer *lda,
+ integer *k1, integer *k2, integer *ipiv, integer *incx)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, i__1, i__2, i__3, i__4, i__5, i__6;
+
+ /* Local variables */
+ integer i__, j, k, i1, i2, n32, ip, ix, ix0, inc;
+ doublecomplex temp;
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER INCX, K1, K2, LDA, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< INTEGER IPIV( * ) >*/
+/*< COMPLEX*16 A( LDA, * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZLASWP performs a series of row interchanges on the matrix A. */
+/* One row interchange is initiated for each of rows K1 through K2 of A. */
+
+/* Arguments */
+/* ========= */
+
+/* N (input) INTEGER */
+/* The number of columns of the matrix A. */
+
+/* A (input/output) COMPLEX*16 array, dimension (LDA,N) */
+/* On entry, the matrix of column dimension N to which the row */
+/* interchanges will be applied. */
+/* On exit, the permuted matrix. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. */
+
+/* K1 (input) INTEGER */
+/* The first element of IPIV for which a row interchange will */
+/* be done. */
+
+/* K2 (input) INTEGER */
+/* The last element of IPIV for which a row interchange will */
+/* be done. */
+
+/* IPIV (input) INTEGER array, dimension (K2*abs(INCX)) */
+/* The vector of pivot indices. Only the elements in positions */
+/* K1 through K2 of IPIV are accessed. */
+/* IPIV(K) = L implies rows K and L are to be interchanged. */
+
+/* INCX (input) INTEGER */
+/* The increment between successive values of IPIV. If IPIV */
+/* is negative, the pivots are applied in reverse order. */
+
+/* Further Details */
+/* =============== */
+
+/* Modified by */
+/* R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA */
+
+/* ===================================================================== */
+
+/* .. Local Scalars .. */
+/*< INTEGER I, I1, I2, INC, IP, IX, IX0, J, K, N32 >*/
+/*< COMPLEX*16 TEMP >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Interchange row I with row IPIV(I) for each of rows K1 through K2. */
+
+/*< IF( INCX.GT.0 ) THEN >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ --ipiv;
+
+ /* Function Body */
+ if (*incx > 0) {
+/*< IX0 = K1 >*/
+ ix0 = *k1;
+/*< I1 = K1 >*/
+ i1 = *k1;
+/*< I2 = K2 >*/
+ i2 = *k2;
+/*< INC = 1 >*/
+ inc = 1;
+/*< ELSE IF( INCX.LT.0 ) THEN >*/
+ } else if (*incx < 0) {
+/*< IX0 = 1 + ( 1-K2 )*INCX >*/
+ ix0 = (1 - *k2) * *incx + 1;
+/*< I1 = K2 >*/
+ i1 = *k2;
+/*< I2 = K1 >*/
+ i2 = *k1;
+/*< INC = -1 >*/
+ inc = -1;
+/*< ELSE >*/
+ } else {
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< N32 = ( N / 32 )*32 >*/
+ n32 = *n / 32 << 5;
+/*< IF( N32.NE.0 ) THEN >*/
+ if (n32 != 0) {
+/*< DO 30 J = 1, N32, 32 >*/
+ i__1 = n32;
+ for (j = 1; j <= i__1; j += 32) {
+/*< IX = IX0 >*/
+ ix = ix0;
+/*< DO 20 I = I1, I2, INC >*/
+ i__2 = i2;
+ i__3 = inc;
+ for (i__ = i1; i__3 < 0 ? i__ >= i__2 : i__ <= i__2; i__ += i__3)
+ {
+/*< IP = IPIV( IX ) >*/
+ ip = ipiv[ix];
+/*< IF( IP.NE.I ) THEN >*/
+ if (ip != i__) {
+/*< DO 10 K = J, J + 31 >*/
+ i__4 = j + 31;
+ for (k = j; k <= i__4; ++k) {
+/*< TEMP = A( I, K ) >*/
+ i__5 = i__ + k * a_dim1;
+ temp.r = a[i__5].r, temp.i = a[i__5].i;
+/*< A( I, K ) = A( IP, K ) >*/
+ i__5 = i__ + k * a_dim1;
+ i__6 = ip + k * a_dim1;
+ a[i__5].r = a[i__6].r, a[i__5].i = a[i__6].i;
+/*< A( IP, K ) = TEMP >*/
+ i__5 = ip + k * a_dim1;
+ a[i__5].r = temp.r, a[i__5].i = temp.i;
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< END IF >*/
+ }
+/*< IX = IX + INCX >*/
+ ix += *incx;
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< END IF >*/
+ }
+/*< IF( N32.NE.N ) THEN >*/
+ if (n32 != *n) {
+/*< N32 = N32 + 1 >*/
+ ++n32;
+/*< IX = IX0 >*/
+ ix = ix0;
+/*< DO 50 I = I1, I2, INC >*/
+ i__1 = i2;
+ i__3 = inc;
+ for (i__ = i1; i__3 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__3) {
+/*< IP = IPIV( IX ) >*/
+ ip = ipiv[ix];
+/*< IF( IP.NE.I ) THEN >*/
+ if (ip != i__) {
+/*< DO 40 K = N32, N >*/
+ i__2 = *n;
+ for (k = n32; k <= i__2; ++k) {
+/*< TEMP = A( I, K ) >*/
+ i__4 = i__ + k * a_dim1;
+ temp.r = a[i__4].r, temp.i = a[i__4].i;
+/*< A( I, K ) = A( IP, K ) >*/
+ i__4 = i__ + k * a_dim1;
+ i__5 = ip + k * a_dim1;
+ a[i__4].r = a[i__5].r, a[i__4].i = a[i__5].i;
+/*< A( IP, K ) = TEMP >*/
+ i__4 = ip + k * a_dim1;
+ a[i__4].r = temp.r, a[i__4].i = temp.i;
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+/*< END IF >*/
+ }
+/*< IX = IX + INCX >*/
+ ix += *incx;
+/*< 50 CONTINUE >*/
+/* L50: */
+ }
+/*< END IF >*/
+ }
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZLASWP */
+
+/*< END >*/
+} /* zlaswp_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.f
new file mode 100644
index 0000000000000000000000000000000000000000..29edd05f70cc70345bc68d572b066823ec2e4016
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.f
@@ -0,0 +1,120 @@
+ SUBROUTINE ZLASWP( N, A, LDA, K1, K2, IPIV, INCX )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER INCX, K1, K2, LDA, N
+* ..
+* .. Array Arguments ..
+ INTEGER IPIV( * )
+ COMPLEX*16 A( LDA, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZLASWP performs a series of row interchanges on the matrix A.
+* One row interchange is initiated for each of rows K1 through K2 of A.
+*
+* Arguments
+* =========
+*
+* N (input) INTEGER
+* The number of columns of the matrix A.
+*
+* A (input/output) COMPLEX*16 array, dimension (LDA,N)
+* On entry, the matrix of column dimension N to which the row
+* interchanges will be applied.
+* On exit, the permuted matrix.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A.
+*
+* K1 (input) INTEGER
+* The first element of IPIV for which a row interchange will
+* be done.
+*
+* K2 (input) INTEGER
+* The last element of IPIV for which a row interchange will
+* be done.
+*
+* IPIV (input) INTEGER array, dimension (K2*abs(INCX))
+* The vector of pivot indices. Only the elements in positions
+* K1 through K2 of IPIV are accessed.
+* IPIV(K) = L implies rows K and L are to be interchanged.
+*
+* INCX (input) INTEGER
+* The increment between successive values of IPIV. If IPIV
+* is negative, the pivots are applied in reverse order.
+*
+* Further Details
+* ===============
+*
+* Modified by
+* R. C. Whaley, Computer Science Dept., Univ. of Tenn., Knoxville, USA
+*
+* =====================================================================
+*
+* .. Local Scalars ..
+ INTEGER I, I1, I2, INC, IP, IX, IX0, J, K, N32
+ COMPLEX*16 TEMP
+* ..
+* .. Executable Statements ..
+*
+* Interchange row I with row IPIV(I) for each of rows K1 through K2.
+*
+ IF( INCX.GT.0 ) THEN
+ IX0 = K1
+ I1 = K1
+ I2 = K2
+ INC = 1
+ ELSE IF( INCX.LT.0 ) THEN
+ IX0 = 1 + ( 1-K2 )*INCX
+ I1 = K2
+ I2 = K1
+ INC = -1
+ ELSE
+ RETURN
+ END IF
+*
+ N32 = ( N / 32 )*32
+ IF( N32.NE.0 ) THEN
+ DO 30 J = 1, N32, 32
+ IX = IX0
+ DO 20 I = I1, I2, INC
+ IP = IPIV( IX )
+ IF( IP.NE.I ) THEN
+ DO 10 K = J, J + 31
+ TEMP = A( I, K )
+ A( I, K ) = A( IP, K )
+ A( IP, K ) = TEMP
+ 10 CONTINUE
+ END IF
+ IX = IX + INCX
+ 20 CONTINUE
+ 30 CONTINUE
+ END IF
+ IF( N32.NE.N ) THEN
+ N32 = N32 + 1
+ IX = IX0
+ DO 50 I = I1, I2, INC
+ IP = IPIV( IX )
+ IF( IP.NE.I ) THEN
+ DO 40 K = N32, N
+ TEMP = A( I, K )
+ A( I, K ) = A( IP, K )
+ A( IP, K ) = TEMP
+ 40 CONTINUE
+ END IF
+ IX = IX + INCX
+ 50 CONTINUE
+ END IF
+*
+ RETURN
+*
+* End of ZLASWP
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.h
new file mode 100644
index 0000000000000000000000000000000000000000..97b2bdc135f25deb214d447c610bb2828216e60c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlaswp.h
@@ -0,0 +1,9 @@
+extern int v3p_netlib_zlaswp_(
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_integer *k1,
+ v3p_netlib_integer *k2,
+ v3p_netlib_integer *ipiv,
+ v3p_netlib_integer *incx
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.P
new file mode 100644
index 0000000000000000000000000000000000000000..e264d8859dfc4c1c457c77fc25dc060797bdace6
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.P
@@ -0,0 +1,10 @@
+extern int zlatdf_(integer *ijob, integer *n, doublecomplex *z__, integer *ldz, doublecomplex *rhs, doublereal *rdsum, doublereal *rdscal, integer *ipiv, integer *jpiv);
+/*:ref: zlaswp_ 14 7 4 9 4 4 4 4 4 */
+/*:ref: zdotc_ 9 6 9 4 9 4 9 4 */
+/*:ref: zaxpy_ 14 6 4 9 9 4 9 4 */
+/*:ref: zcopy_ 14 5 4 9 4 9 4 */
+/*:ref: zlassq_ 14 5 4 9 4 7 7 */
+/*:ref: zgecon_ 14 10 13 4 9 4 7 7 9 7 4 124 */
+/*:ref: zscal_ 14 4 4 9 9 4 */
+/*:ref: zgesc2_ 14 7 4 9 4 9 4 4 7 */
+/*:ref: dzasum_ 7 3 4 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.c
new file mode 100644
index 0000000000000000000000000000000000000000..5b7af23394e2302784e028d473146196ac09c390
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.c
@@ -0,0 +1,444 @@
+/* lapack/complex16/zlatdf.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static doublecomplex c_b1 = {1.,0.};
+static integer c__1 = 1;
+static integer c_n1 = -1;
+static doublereal c_b24 = 1.;
+
+/*< >*/
+/* Subroutine */ int zlatdf_(integer *ijob, integer *n, doublecomplex *z__,
+ integer *ldz, doublecomplex *rhs, doublereal *rdsum, doublereal *
+ rdscal, integer *ipiv, integer *jpiv)
+{
+ /* System generated locals */
+ integer z_dim1, z_offset, i__1, i__2, i__3, i__4, i__5;
+ doublecomplex z__1, z__2, z__3;
+
+ /* Builtin functions */
+ void z_div(doublecomplex *, doublecomplex *, doublecomplex *);
+ double z_abs(doublecomplex *);
+ void z_sqrt(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ integer i__, j, k;
+ doublecomplex bm, bp, xm[2], xp[2];
+ integer info;
+ doublecomplex temp, work[8];
+ doublereal scale;
+ extern /* Subroutine */ int zscal_(integer *, doublecomplex *,
+ doublecomplex *, integer *);
+ doublecomplex pmone;
+ extern /* Double Complex */ VOID zdotc_(doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *);
+ doublereal rtemp, sminu, rwork[2];
+ extern /* Subroutine */ int zcopy_(integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *);
+ doublereal splus;
+ extern /* Subroutine */ int zaxpy_(integer *, doublecomplex *,
+ doublecomplex *, integer *, doublecomplex *, integer *), zgesc2_(
+ integer *, doublecomplex *, integer *, doublecomplex *, integer *,
+ integer *, doublereal *), zgecon_(char *, integer *,
+ doublecomplex *, integer *, doublereal *, doublereal *,
+ doublecomplex *, doublereal *, integer *, ftnlen);
+ extern doublereal dzasum_(integer *, doublecomplex *, integer *);
+ extern /* Subroutine */ int zlassq_(integer *, doublecomplex *, integer *,
+ doublereal *, doublereal *), zlaswp_(integer *, doublecomplex *,
+ integer *, integer *, integer *, integer *, integer *);
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER IJOB, LDZ, N >*/
+/*< DOUBLE PRECISION RDSCAL, RDSUM >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< INTEGER IPIV( * ), JPIV( * ) >*/
+/*< COMPLEX*16 RHS( * ), Z( LDZ, * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZLATDF computes the contribution to the reciprocal Dif-estimate */
+/* by solving for x in Z * x = b, where b is chosen such that the norm */
+/* of x is as large as possible. It is assumed that LU decomposition */
+/* of Z has been computed by ZGETC2. On entry RHS = f holds the */
+/* contribution from earlier solved sub-systems, and on return RHS = x. */
+
+/* The factorization of Z returned by ZGETC2 has the form */
+/* Z = P * L * U * Q, where P and Q are permutation matrices. L is lower */
+/* triangular with unit diagonal elements and U is upper triangular. */
+
+/* Arguments */
+/* ========= */
+
+/* IJOB (input) INTEGER */
+/* IJOB = 2: First compute an approximative null-vector e */
+/* of Z using ZGECON, e is normalized and solve for */
+/* Zx = +-e - f with the sign giving the greater value of */
+/* 2-norm(x). About 5 times as expensive as Default. */
+/* IJOB .ne. 2: Local look ahead strategy where */
+/* all entries of the r.h.s. b is choosen as either +1 or */
+/* -1. Default. */
+
+/* N (input) INTEGER */
+/* The number of columns of the matrix Z. */
+
+/* Z (input) DOUBLE PRECISION array, dimension (LDZ, N) */
+/* On entry, the LU part of the factorization of the n-by-n */
+/* matrix Z computed by ZGETC2: Z = P * L * U * Q */
+
+/* LDZ (input) INTEGER */
+/* The leading dimension of the array Z. LDA >= max(1, N). */
+
+/* RHS (input/output) DOUBLE PRECISION array, dimension (N). */
+/* On entry, RHS contains contributions from other subsystems. */
+/* On exit, RHS contains the solution of the subsystem with */
+/* entries according to the value of IJOB (see above). */
+
+/* RDSUM (input/output) DOUBLE PRECISION */
+/* On entry, the sum of squares of computed contributions to */
+/* the Dif-estimate under computation by ZTGSYL, where the */
+/* scaling factor RDSCAL (see below) has been factored out. */
+/* On exit, the corresponding sum of squares updated with the */
+/* contributions from the current sub-system. */
+/* If TRANS = 'T' RDSUM is not touched. */
+/* NOTE: RDSUM only makes sense when ZTGSY2 is called by CTGSYL. */
+
+/* RDSCAL (input/output) DOUBLE PRECISION */
+/* On entry, scaling factor used to prevent overflow in RDSUM. */
+/* On exit, RDSCAL is updated w.r.t. the current contributions */
+/* in RDSUM. */
+/* If TRANS = 'T', RDSCAL is not touched. */
+/* NOTE: RDSCAL only makes sense when ZTGSY2 is called by */
+/* ZTGSYL. */
+
+/* IPIV (input) INTEGER array, dimension (N). */
+/* The pivot indices; for 1 <= i <= N, row i of the */
+/* matrix has been interchanged with row IPIV(i). */
+
+/* JPIV (input) INTEGER array, dimension (N). */
+/* The pivot indices; for 1 <= j <= N, column j of the */
+/* matrix has been interchanged with column JPIV(j). */
+
+/* Further Details */
+/* =============== */
+
+/* Based on contributions by */
+/* Bo Kagstrom and Peter Poromaa, Department of Computing Science, */
+/* Umea University, S-901 87 Umea, Sweden. */
+
+/* This routine is a further developed implementation of algorithm */
+/* BSOLVE in [1] using complete pivoting in the LU factorization. */
+
+/* [1] Bo Kagstrom and Lars Westin, */
+/* Generalized Schur Methods with Condition Estimators for */
+/* Solving the Generalized Sylvester Equation, IEEE Transactions */
+/* on Automatic Control, Vol. 34, No. 7, July 1989, pp 745-751. */
+
+/* [2] Peter Poromaa, */
+/* On Efficient and Robust Estimators for the Separation */
+/* between two Regular Matrix Pairs with Applications in */
+/* Condition Estimation. Report UMINF-95.05, Department of */
+/* Computing Science, Umea University, S-901 87 Umea, Sweden, */
+/* 1995. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< INTEGER MAXDIM >*/
+/*< PARAMETER ( MAXDIM = 2 ) >*/
+/*< DOUBLE PRECISION ZERO, ONE >*/
+/*< PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) >*/
+/*< COMPLEX*16 CONE >*/
+/*< PARAMETER ( CONE = ( 1.0D+0, 0.0D+0 ) ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< INTEGER I, INFO, J, K >*/
+/*< DOUBLE PRECISION RTEMP, SCALE, SMINU, SPLUS >*/
+/*< COMPLEX*16 BM, BP, PMONE, TEMP >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< DOUBLE PRECISION RWORK( MAXDIM ) >*/
+/*< COMPLEX*16 WORK( 4*MAXDIM ), XM( MAXDIM ), XP( MAXDIM ) >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< >*/
+/* .. */
+/* .. External Functions .. */
+/*< DOUBLE PRECISION DZASUM >*/
+/*< COMPLEX*16 ZDOTC >*/
+/*< EXTERNAL DZASUM, ZDOTC >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, DBLE, SQRT >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/*< IF( IJOB.NE.2 ) THEN >*/
+ /* Parameter adjustments */
+ z_dim1 = *ldz;
+ z_offset = 1 + z_dim1;
+ z__ -= z_offset;
+ --rhs;
+ --ipiv;
+ --jpiv;
+
+ /* Function Body */
+ if (*ijob != 2) {
+
+/* Apply permutations IPIV to RHS */
+
+/*< CALL ZLASWP( 1, RHS, LDZ, 1, N-1, IPIV, 1 ) >*/
+ i__1 = *n - 1;
+ zlaswp_(&c__1, &rhs[1], ldz, &c__1, &i__1, &ipiv[1], &c__1);
+
+/* Solve for L-part choosing RHS either to +1 or -1. */
+
+/*< PMONE = -CONE >*/
+ z__1.r = -1., z__1.i = -0.;
+ pmone.r = z__1.r, pmone.i = z__1.i;
+/*< DO 10 J = 1, N - 1 >*/
+ i__1 = *n - 1;
+ for (j = 1; j <= i__1; ++j) {
+/*< BP = RHS( J ) + CONE >*/
+ i__2 = j;
+ z__1.r = rhs[i__2].r + 1., z__1.i = rhs[i__2].i + 0.;
+ bp.r = z__1.r, bp.i = z__1.i;
+/*< BM = RHS( J ) - CONE >*/
+ i__2 = j;
+ z__1.r = rhs[i__2].r - 1., z__1.i = rhs[i__2].i - 0.;
+ bm.r = z__1.r, bm.i = z__1.i;
+/*< SPLUS = ONE >*/
+ splus = 1.;
+
+/* Lockahead for L- part RHS(1:N-1) = +-1 */
+/* SPLUS and SMIN computed more efficiently than in BSOLVE[1]. */
+
+/*< >*/
+ i__2 = *n - j;
+ zdotc_(&z__1, &i__2, &z__[j + 1 + j * z_dim1], &c__1, &z__[j + 1
+ + j * z_dim1], &c__1);
+ splus += z__1.r;
+/*< SMINU = DBLE( ZDOTC( N-J, Z( J+1, J ), 1, RHS( J+1 ), 1 ) ) >*/
+ i__2 = *n - j;
+ zdotc_(&z__1, &i__2, &z__[j + 1 + j * z_dim1], &c__1, &rhs[j + 1],
+ &c__1);
+ sminu = z__1.r;
+/*< SPLUS = SPLUS*DBLE( RHS( J ) ) >*/
+ i__2 = j;
+ splus *= rhs[i__2].r;
+/*< IF( SPLUS.GT.SMINU ) THEN >*/
+ if (splus > sminu) {
+/*< RHS( J ) = BP >*/
+ i__2 = j;
+ rhs[i__2].r = bp.r, rhs[i__2].i = bp.i;
+/*< ELSE IF( SMINU.GT.SPLUS ) THEN >*/
+ } else if (sminu > splus) {
+/*< RHS( J ) = BM >*/
+ i__2 = j;
+ rhs[i__2].r = bm.r, rhs[i__2].i = bm.i;
+/*< ELSE >*/
+ } else {
+
+/* In this case the updating sums are equal and we can */
+/* choose RHS(J) +1 or -1. The first time this happens we */
+/* choose -1, thereafter +1. This is a simple way to get */
+/* good estimates of matrices like Byers well-known example */
+/* (see [1]). (Not done in BSOLVE.) */
+
+/*< RHS( J ) = RHS( J ) + PMONE >*/
+ i__2 = j;
+ i__3 = j;
+ z__1.r = rhs[i__3].r + pmone.r, z__1.i = rhs[i__3].i +
+ pmone.i;
+ rhs[i__2].r = z__1.r, rhs[i__2].i = z__1.i;
+/*< PMONE = CONE >*/
+ pmone.r = 1., pmone.i = 0.;
+/*< END IF >*/
+ }
+
+/* Compute the remaining r.h.s. */
+
+/*< TEMP = -RHS( J ) >*/
+ i__2 = j;
+ z__1.r = -rhs[i__2].r, z__1.i = -rhs[i__2].i;
+ temp.r = z__1.r, temp.i = z__1.i;
+/*< CALL ZAXPY( N-J, TEMP, Z( J+1, J ), 1, RHS( J+1 ), 1 ) >*/
+ i__2 = *n - j;
+ zaxpy_(&i__2, &temp, &z__[j + 1 + j * z_dim1], &c__1, &rhs[j + 1],
+ &c__1);
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+
+/* Solve for U- part, lockahead for RHS(N) = +-1. This is not done */
+/* In BSOLVE and will hopefully give us a better estimate because */
+/* any ill-conditioning of the original matrix is transfered to U */
+/* and not to L. U(N, N) is an approximation to sigma_min(LU). */
+
+/*< CALL ZCOPY( N-1, RHS, 1, WORK, 1 ) >*/
+ i__1 = *n - 1;
+ zcopy_(&i__1, &rhs[1], &c__1, work, &c__1);
+/*< WORK( N ) = RHS( N ) + CONE >*/
+ i__1 = *n - 1;
+ i__2 = *n;
+ z__1.r = rhs[i__2].r + 1., z__1.i = rhs[i__2].i + 0.;
+ work[i__1].r = z__1.r, work[i__1].i = z__1.i;
+/*< RHS( N ) = RHS( N ) - CONE >*/
+ i__1 = *n;
+ i__2 = *n;
+ z__1.r = rhs[i__2].r - 1., z__1.i = rhs[i__2].i - 0.;
+ rhs[i__1].r = z__1.r, rhs[i__1].i = z__1.i;
+/*< SPLUS = ZERO >*/
+ splus = 0.;
+/*< SMINU = ZERO >*/
+ sminu = 0.;
+/*< DO 30 I = N, 1, -1 >*/
+ for (i__ = *n; i__ >= 1; --i__) {
+/*< TEMP = CONE / Z( I, I ) >*/
+ z_div(&z__1, &c_b1, &z__[i__ + i__ * z_dim1]);
+ temp.r = z__1.r, temp.i = z__1.i;
+/*< WORK( I ) = WORK( I )*TEMP >*/
+ i__1 = i__ - 1;
+ i__2 = i__ - 1;
+ z__1.r = work[i__2].r * temp.r - work[i__2].i * temp.i, z__1.i =
+ work[i__2].r * temp.i + work[i__2].i * temp.r;
+ work[i__1].r = z__1.r, work[i__1].i = z__1.i;
+/*< RHS( I ) = RHS( I )*TEMP >*/
+ i__1 = i__;
+ i__2 = i__;
+ z__1.r = rhs[i__2].r * temp.r - rhs[i__2].i * temp.i, z__1.i =
+ rhs[i__2].r * temp.i + rhs[i__2].i * temp.r;
+ rhs[i__1].r = z__1.r, rhs[i__1].i = z__1.i;
+/*< DO 20 K = I + 1, N >*/
+ i__1 = *n;
+ for (k = i__ + 1; k <= i__1; ++k) {
+/*< WORK( I ) = WORK( I ) - WORK( K )*( Z( I, K )*TEMP ) >*/
+ i__2 = i__ - 1;
+ i__3 = i__ - 1;
+ i__4 = k - 1;
+ i__5 = i__ + k * z_dim1;
+ z__3.r = z__[i__5].r * temp.r - z__[i__5].i * temp.i, z__3.i =
+ z__[i__5].r * temp.i + z__[i__5].i * temp.r;
+ z__2.r = work[i__4].r * z__3.r - work[i__4].i * z__3.i,
+ z__2.i = work[i__4].r * z__3.i + work[i__4].i *
+ z__3.r;
+ z__1.r = work[i__3].r - z__2.r, z__1.i = work[i__3].i -
+ z__2.i;
+ work[i__2].r = z__1.r, work[i__2].i = z__1.i;
+/*< RHS( I ) = RHS( I ) - RHS( K )*( Z( I, K )*TEMP ) >*/
+ i__2 = i__;
+ i__3 = i__;
+ i__4 = k;
+ i__5 = i__ + k * z_dim1;
+ z__3.r = z__[i__5].r * temp.r - z__[i__5].i * temp.i, z__3.i =
+ z__[i__5].r * temp.i + z__[i__5].i * temp.r;
+ z__2.r = rhs[i__4].r * z__3.r - rhs[i__4].i * z__3.i, z__2.i =
+ rhs[i__4].r * z__3.i + rhs[i__4].i * z__3.r;
+ z__1.r = rhs[i__3].r - z__2.r, z__1.i = rhs[i__3].i - z__2.i;
+ rhs[i__2].r = z__1.r, rhs[i__2].i = z__1.i;
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< SPLUS = SPLUS + ABS( WORK( I ) ) >*/
+ splus += z_abs(&work[i__ - 1]);
+/*< SMINU = SMINU + ABS( RHS( I ) ) >*/
+ sminu += z_abs(&rhs[i__]);
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< >*/
+ if (splus > sminu) {
+ zcopy_(n, work, &c__1, &rhs[1], &c__1);
+ }
+
+/* Apply the permutations JPIV to the computed solution (RHS) */
+
+/*< CALL ZLASWP( 1, RHS, LDZ, 1, N-1, JPIV, -1 ) >*/
+ i__1 = *n - 1;
+ zlaswp_(&c__1, &rhs[1], ldz, &c__1, &i__1, &jpiv[1], &c_n1);
+
+/* Compute the sum of squares */
+
+/*< CALL ZLASSQ( N, RHS, 1, RDSCAL, RDSUM ) >*/
+ zlassq_(n, &rhs[1], &c__1, rdscal, rdsum);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* ENTRY IJOB = 2 */
+
+/* Compute approximate nullvector XM of Z */
+
+/*< CALL ZGECON( 'I', N, Z, LDZ, ONE, RTEMP, WORK, RWORK, INFO ) >*/
+ zgecon_("I", n, &z__[z_offset], ldz, &c_b24, &rtemp, work, rwork, &info, (
+ ftnlen)1);
+/*< CALL ZCOPY( N, WORK( N+1 ), 1, XM, 1 ) >*/
+ zcopy_(n, &work[*n], &c__1, xm, &c__1);
+
+/* Compute RHS */
+
+/*< CALL ZLASWP( 1, XM, LDZ, 1, N-1, IPIV, -1 ) >*/
+ i__1 = *n - 1;
+ zlaswp_(&c__1, xm, ldz, &c__1, &i__1, &ipiv[1], &c_n1);
+/*< TEMP = CONE / SQRT( ZDOTC( N, XM, 1, XM, 1 ) ) >*/
+ zdotc_(&z__3, n, xm, &c__1, xm, &c__1);
+ z_sqrt(&z__2, &z__3);
+ z_div(&z__1, &c_b1, &z__2);
+ temp.r = z__1.r, temp.i = z__1.i;
+/*< CALL ZSCAL( N, TEMP, XM, 1 ) >*/
+ zscal_(n, &temp, xm, &c__1);
+/*< CALL ZCOPY( N, XM, 1, XP, 1 ) >*/
+ zcopy_(n, xm, &c__1, xp, &c__1);
+/*< CALL ZAXPY( N, CONE, RHS, 1, XP, 1 ) >*/
+ zaxpy_(n, &c_b1, &rhs[1], &c__1, xp, &c__1);
+/*< CALL ZAXPY( N, -CONE, XM, 1, RHS, 1 ) >*/
+ z__1.r = -1., z__1.i = -0.;
+ zaxpy_(n, &z__1, xm, &c__1, &rhs[1], &c__1);
+/*< CALL ZGESC2( N, Z, LDZ, RHS, IPIV, JPIV, SCALE ) >*/
+ zgesc2_(n, &z__[z_offset], ldz, &rhs[1], &ipiv[1], &jpiv[1], &scale);
+/*< CALL ZGESC2( N, Z, LDZ, XP, IPIV, JPIV, SCALE ) >*/
+ zgesc2_(n, &z__[z_offset], ldz, xp, &ipiv[1], &jpiv[1], &scale);
+/*< >*/
+ if (dzasum_(n, xp, &c__1) > dzasum_(n, &rhs[1], &c__1)) {
+ zcopy_(n, xp, &c__1, &rhs[1], &c__1);
+ }
+
+/* Compute the sum of squares */
+
+/*< CALL ZLASSQ( N, RHS, 1, RDSCAL, RDSUM ) >*/
+ zlassq_(n, &rhs[1], &c__1, rdscal, rdsum);
+/*< RETURN >*/
+ return 0;
+
+/* End of ZLATDF */
+
+/*< END >*/
+} /* zlatdf_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.f
new file mode 100644
index 0000000000000000000000000000000000000000..6092895754f4d542f7070ac6501806ac82c2fa8d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.f
@@ -0,0 +1,242 @@
+ SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV,
+ $ JPIV )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER IJOB, LDZ, N
+ DOUBLE PRECISION RDSCAL, RDSUM
+* ..
+* .. Array Arguments ..
+ INTEGER IPIV( * ), JPIV( * )
+ COMPLEX*16 RHS( * ), Z( LDZ, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZLATDF computes the contribution to the reciprocal Dif-estimate
+* by solving for x in Z * x = b, where b is chosen such that the norm
+* of x is as large as possible. It is assumed that LU decomposition
+* of Z has been computed by ZGETC2. On entry RHS = f holds the
+* contribution from earlier solved sub-systems, and on return RHS = x.
+*
+* The factorization of Z returned by ZGETC2 has the form
+* Z = P * L * U * Q, where P and Q are permutation matrices. L is lower
+* triangular with unit diagonal elements and U is upper triangular.
+*
+* Arguments
+* =========
+*
+* IJOB (input) INTEGER
+* IJOB = 2: First compute an approximative null-vector e
+* of Z using ZGECON, e is normalized and solve for
+* Zx = +-e - f with the sign giving the greater value of
+* 2-norm(x). About 5 times as expensive as Default.
+* IJOB .ne. 2: Local look ahead strategy where
+* all entries of the r.h.s. b is choosen as either +1 or
+* -1. Default.
+*
+* N (input) INTEGER
+* The number of columns of the matrix Z.
+*
+* Z (input) DOUBLE PRECISION array, dimension (LDZ, N)
+* On entry, the LU part of the factorization of the n-by-n
+* matrix Z computed by ZGETC2: Z = P * L * U * Q
+*
+* LDZ (input) INTEGER
+* The leading dimension of the array Z. LDA >= max(1, N).
+*
+* RHS (input/output) DOUBLE PRECISION array, dimension (N).
+* On entry, RHS contains contributions from other subsystems.
+* On exit, RHS contains the solution of the subsystem with
+* entries according to the value of IJOB (see above).
+*
+* RDSUM (input/output) DOUBLE PRECISION
+* On entry, the sum of squares of computed contributions to
+* the Dif-estimate under computation by ZTGSYL, where the
+* scaling factor RDSCAL (see below) has been factored out.
+* On exit, the corresponding sum of squares updated with the
+* contributions from the current sub-system.
+* If TRANS = 'T' RDSUM is not touched.
+* NOTE: RDSUM only makes sense when ZTGSY2 is called by CTGSYL.
+*
+* RDSCAL (input/output) DOUBLE PRECISION
+* On entry, scaling factor used to prevent overflow in RDSUM.
+* On exit, RDSCAL is updated w.r.t. the current contributions
+* in RDSUM.
+* If TRANS = 'T', RDSCAL is not touched.
+* NOTE: RDSCAL only makes sense when ZTGSY2 is called by
+* ZTGSYL.
+*
+* IPIV (input) INTEGER array, dimension (N).
+* The pivot indices; for 1 <= i <= N, row i of the
+* matrix has been interchanged with row IPIV(i).
+*
+* JPIV (input) INTEGER array, dimension (N).
+* The pivot indices; for 1 <= j <= N, column j of the
+* matrix has been interchanged with column JPIV(j).
+*
+* Further Details
+* ===============
+*
+* Based on contributions by
+* Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+* Umea University, S-901 87 Umea, Sweden.
+*
+* This routine is a further developed implementation of algorithm
+* BSOLVE in [1] using complete pivoting in the LU factorization.
+*
+* [1] Bo Kagstrom and Lars Westin,
+* Generalized Schur Methods with Condition Estimators for
+* Solving the Generalized Sylvester Equation, IEEE Transactions
+* on Automatic Control, Vol. 34, No. 7, July 1989, pp 745-751.
+*
+* [2] Peter Poromaa,
+* On Efficient and Robust Estimators for the Separation
+* between two Regular Matrix Pairs with Applications in
+* Condition Estimation. Report UMINF-95.05, Department of
+* Computing Science, Umea University, S-901 87 Umea, Sweden,
+* 1995.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ INTEGER MAXDIM
+ PARAMETER ( MAXDIM = 2 )
+ DOUBLE PRECISION ZERO, ONE
+ PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 )
+ COMPLEX*16 CONE
+ PARAMETER ( CONE = ( 1.0D+0, 0.0D+0 ) )
+* ..
+* .. Local Scalars ..
+ INTEGER I, INFO, J, K
+ DOUBLE PRECISION RTEMP, SCALE, SMINU, SPLUS
+ COMPLEX*16 BM, BP, PMONE, TEMP
+* ..
+* .. Local Arrays ..
+ DOUBLE PRECISION RWORK( MAXDIM )
+ COMPLEX*16 WORK( 4*MAXDIM ), XM( MAXDIM ), XP( MAXDIM )
+* ..
+* .. External Subroutines ..
+ EXTERNAL ZAXPY, ZCOPY, ZGECON, ZGESC2, ZLASSQ, ZLASWP,
+ $ ZSCAL
+* ..
+* .. External Functions ..
+ DOUBLE PRECISION DZASUM
+ COMPLEX*16 ZDOTC
+ EXTERNAL DZASUM, ZDOTC
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DBLE, SQRT
+* ..
+* .. Executable Statements ..
+*
+ IF( IJOB.NE.2 ) THEN
+*
+* Apply permutations IPIV to RHS
+*
+ CALL ZLASWP( 1, RHS, LDZ, 1, N-1, IPIV, 1 )
+*
+* Solve for L-part choosing RHS either to +1 or -1.
+*
+ PMONE = -CONE
+ DO 10 J = 1, N - 1
+ BP = RHS( J ) + CONE
+ BM = RHS( J ) - CONE
+ SPLUS = ONE
+*
+* Lockahead for L- part RHS(1:N-1) = +-1
+* SPLUS and SMIN computed more efficiently than in BSOLVE[1].
+*
+ SPLUS = SPLUS + DBLE( ZDOTC( N-J, Z( J+1, J ), 1, Z( J+1,
+ $ J ), 1 ) )
+ SMINU = DBLE( ZDOTC( N-J, Z( J+1, J ), 1, RHS( J+1 ), 1 ) )
+ SPLUS = SPLUS*DBLE( RHS( J ) )
+ IF( SPLUS.GT.SMINU ) THEN
+ RHS( J ) = BP
+ ELSE IF( SMINU.GT.SPLUS ) THEN
+ RHS( J ) = BM
+ ELSE
+*
+* In this case the updating sums are equal and we can
+* choose RHS(J) +1 or -1. The first time this happens we
+* choose -1, thereafter +1. This is a simple way to get
+* good estimates of matrices like Byers well-known example
+* (see [1]). (Not done in BSOLVE.)
+*
+ RHS( J ) = RHS( J ) + PMONE
+ PMONE = CONE
+ END IF
+*
+* Compute the remaining r.h.s.
+*
+ TEMP = -RHS( J )
+ CALL ZAXPY( N-J, TEMP, Z( J+1, J ), 1, RHS( J+1 ), 1 )
+ 10 CONTINUE
+*
+* Solve for U- part, lockahead for RHS(N) = +-1. This is not done
+* In BSOLVE and will hopefully give us a better estimate because
+* any ill-conditioning of the original matrix is transfered to U
+* and not to L. U(N, N) is an approximation to sigma_min(LU).
+*
+ CALL ZCOPY( N-1, RHS, 1, WORK, 1 )
+ WORK( N ) = RHS( N ) + CONE
+ RHS( N ) = RHS( N ) - CONE
+ SPLUS = ZERO
+ SMINU = ZERO
+ DO 30 I = N, 1, -1
+ TEMP = CONE / Z( I, I )
+ WORK( I ) = WORK( I )*TEMP
+ RHS( I ) = RHS( I )*TEMP
+ DO 20 K = I + 1, N
+ WORK( I ) = WORK( I ) - WORK( K )*( Z( I, K )*TEMP )
+ RHS( I ) = RHS( I ) - RHS( K )*( Z( I, K )*TEMP )
+ 20 CONTINUE
+ SPLUS = SPLUS + ABS( WORK( I ) )
+ SMINU = SMINU + ABS( RHS( I ) )
+ 30 CONTINUE
+ IF( SPLUS.GT.SMINU )
+ $ CALL ZCOPY( N, WORK, 1, RHS, 1 )
+*
+* Apply the permutations JPIV to the computed solution (RHS)
+*
+ CALL ZLASWP( 1, RHS, LDZ, 1, N-1, JPIV, -1 )
+*
+* Compute the sum of squares
+*
+ CALL ZLASSQ( N, RHS, 1, RDSCAL, RDSUM )
+ RETURN
+ END IF
+*
+* ENTRY IJOB = 2
+*
+* Compute approximate nullvector XM of Z
+*
+ CALL ZGECON( 'I', N, Z, LDZ, ONE, RTEMP, WORK, RWORK, INFO )
+ CALL ZCOPY( N, WORK( N+1 ), 1, XM, 1 )
+*
+* Compute RHS
+*
+ CALL ZLASWP( 1, XM, LDZ, 1, N-1, IPIV, -1 )
+ TEMP = CONE / SQRT( ZDOTC( N, XM, 1, XM, 1 ) )
+ CALL ZSCAL( N, TEMP, XM, 1 )
+ CALL ZCOPY( N, XM, 1, XP, 1 )
+ CALL ZAXPY( N, CONE, RHS, 1, XP, 1 )
+ CALL ZAXPY( N, -CONE, XM, 1, RHS, 1 )
+ CALL ZGESC2( N, Z, LDZ, RHS, IPIV, JPIV, SCALE )
+ CALL ZGESC2( N, Z, LDZ, XP, IPIV, JPIV, SCALE )
+ IF( DZASUM( N, XP, 1 ).GT.DZASUM( N, RHS, 1 ) )
+ $ CALL ZCOPY( N, XP, 1, RHS, 1 )
+*
+* Compute the sum of squares
+*
+ CALL ZLASSQ( N, RHS, 1, RDSCAL, RDSUM )
+ RETURN
+*
+* End of ZLATDF
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.h
new file mode 100644
index 0000000000000000000000000000000000000000..29a9b0aa648050e0763201ee1f070250f853c8c8
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatdf.h
@@ -0,0 +1,11 @@
+extern int v3p_netlib_zlatdf_(
+ v3p_netlib_integer *ijob,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *z__,
+ v3p_netlib_integer *ldz,
+ v3p_netlib_doublecomplex *rhs,
+ v3p_netlib_doublereal *rdsum,
+ v3p_netlib_doublereal *rdscal,
+ v3p_netlib_integer *ipiv,
+ v3p_netlib_integer *jpiv
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatrs.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatrs.c
index 21a9e5b50191651bf596e048320f3ce5710df47a..b6689dd45ad8ebb927137f1aa156dce8e518c314 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatrs.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zlatrs.c
@@ -46,7 +46,7 @@ static doublereal c_b36 = .5;
doublereal xmax, grow;
extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
integer *);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
doublereal tscal;
doublecomplex uscal;
integer jlast;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.P
new file mode 100644
index 0000000000000000000000000000000000000000..a56f5e77886830cb263b7fb6960da70c2a1913f8
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.P
@@ -0,0 +1 @@
+extern int zrot_(integer *n, doublecomplex *cx, integer *incx, doublecomplex *cy, integer *incy, doublereal *c__, doublecomplex *s);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.c
new file mode 100644
index 0000000000000000000000000000000000000000..31a71f1113cddba4cf3909a39a90723b914a461c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.c
@@ -0,0 +1,192 @@
+/* lapack/complex16/zrot.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< SUBROUTINE ZROT( N, CX, INCX, CY, INCY, C, S ) >*/
+/* Subroutine */ int zrot_(integer *n, doublecomplex *cx, integer *incx,
+ doublecomplex *cy, integer *incy, doublereal *c__, doublecomplex *s)
+{
+ /* System generated locals */
+ integer i__1, i__2, i__3, i__4;
+ doublecomplex z__1, z__2, z__3, z__4;
+
+ /* Builtin functions */
+ void d_cnjg(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ integer i__, ix, iy;
+ doublecomplex stemp;
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER INCX, INCY, N >*/
+/*< DOUBLE PRECISION C >*/
+/*< COMPLEX*16 S >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< COMPLEX*16 CX( * ), CY( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZROT applies a plane rotation, where the cos (C) is real and the */
+/* sin (S) is complex, and the vectors CX and CY are complex. */
+
+/* Arguments */
+/* ========= */
+
+/* N (input) INTEGER */
+/* The number of elements in the vectors CX and CY. */
+
+/* CX (input/output) COMPLEX*16 array, dimension (N) */
+/* On input, the vector X. */
+/* On output, CX is overwritten with C*X + S*Y. */
+
+/* INCX (input) INTEGER */
+/* The increment between successive values of CY. INCX <> 0. */
+
+/* CY (input/output) COMPLEX*16 array, dimension (N) */
+/* On input, the vector Y. */
+/* On output, CY is overwritten with -CONJG(S)*X + C*Y. */
+
+/* INCY (input) INTEGER */
+/* The increment between successive values of CY. INCX <> 0. */
+
+/* C (input) DOUBLE PRECISION */
+/* S (input) COMPLEX*16 */
+/* C and S define a rotation */
+/* [ C S ] */
+/* [ -conjg(S) C ] */
+/* where C*C + S*CONJG(S) = 1.0. */
+
+/* ===================================================================== */
+
+/* .. Local Scalars .. */
+/*< INTEGER I, IX, IY >*/
+/*< COMPLEX*16 STEMP >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC DCONJG >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/*< >*/
+ /* Parameter adjustments */
+ --cy;
+ --cx;
+
+ /* Function Body */
+ if (*n <= 0) {
+ return 0;
+ }
+/*< >*/
+ if (*incx == 1 && *incy == 1) {
+ goto L20;
+ }
+
+/* Code for unequal increments or equal increments not equal to 1 */
+
+/*< IX = 1 >*/
+ ix = 1;
+/*< IY = 1 >*/
+ iy = 1;
+/*< >*/
+ if (*incx < 0) {
+ ix = (-(*n) + 1) * *incx + 1;
+ }
+/*< >*/
+ if (*incy < 0) {
+ iy = (-(*n) + 1) * *incy + 1;
+ }
+/*< DO 10 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< STEMP = C*CX( IX ) + S*CY( IY ) >*/
+ i__2 = ix;
+ z__2.r = *c__ * cx[i__2].r, z__2.i = *c__ * cx[i__2].i;
+ i__3 = iy;
+ z__3.r = s->r * cy[i__3].r - s->i * cy[i__3].i, z__3.i = s->r * cy[
+ i__3].i + s->i * cy[i__3].r;
+ z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
+ stemp.r = z__1.r, stemp.i = z__1.i;
+/*< CY( IY ) = C*CY( IY ) - DCONJG( S )*CX( IX ) >*/
+ i__2 = iy;
+ i__3 = iy;
+ z__2.r = *c__ * cy[i__3].r, z__2.i = *c__ * cy[i__3].i;
+ d_cnjg(&z__4, s);
+ i__4 = ix;
+ z__3.r = z__4.r * cx[i__4].r - z__4.i * cx[i__4].i, z__3.i = z__4.r *
+ cx[i__4].i + z__4.i * cx[i__4].r;
+ z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
+ cy[i__2].r = z__1.r, cy[i__2].i = z__1.i;
+/*< CX( IX ) = STEMP >*/
+ i__2 = ix;
+ cx[i__2].r = stemp.r, cx[i__2].i = stemp.i;
+/*< IX = IX + INCX >*/
+ ix += *incx;
+/*< IY = IY + INCY >*/
+ iy += *incy;
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< RETURN >*/
+ return 0;
+
+/* Code for both increments equal to 1 */
+
+/*< 20 CONTINUE >*/
+L20:
+/*< DO 30 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< STEMP = C*CX( I ) + S*CY( I ) >*/
+ i__2 = i__;
+ z__2.r = *c__ * cx[i__2].r, z__2.i = *c__ * cx[i__2].i;
+ i__3 = i__;
+ z__3.r = s->r * cy[i__3].r - s->i * cy[i__3].i, z__3.i = s->r * cy[
+ i__3].i + s->i * cy[i__3].r;
+ z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
+ stemp.r = z__1.r, stemp.i = z__1.i;
+/*< CY( I ) = C*CY( I ) - DCONJG( S )*CX( I ) >*/
+ i__2 = i__;
+ i__3 = i__;
+ z__2.r = *c__ * cy[i__3].r, z__2.i = *c__ * cy[i__3].i;
+ d_cnjg(&z__4, s);
+ i__4 = i__;
+ z__3.r = z__4.r * cx[i__4].r - z__4.i * cx[i__4].i, z__3.i = z__4.r *
+ cx[i__4].i + z__4.i * cx[i__4].r;
+ z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
+ cy[i__2].r = z__1.r, cy[i__2].i = z__1.i;
+/*< CX( I ) = STEMP >*/
+ i__2 = i__;
+ cx[i__2].r = stemp.r, cx[i__2].i = stemp.i;
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< RETURN >*/
+ return 0;
+/*< END >*/
+} /* zrot_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.f
new file mode 100644
index 0000000000000000000000000000000000000000..ec1ebe646a92c6944bf578d2dc6853d0f7200940
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.f
@@ -0,0 +1,92 @@
+ SUBROUTINE ZROT( N, CX, INCX, CY, INCY, C, S )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER INCX, INCY, N
+ DOUBLE PRECISION C
+ COMPLEX*16 S
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 CX( * ), CY( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZROT applies a plane rotation, where the cos (C) is real and the
+* sin (S) is complex, and the vectors CX and CY are complex.
+*
+* Arguments
+* =========
+*
+* N (input) INTEGER
+* The number of elements in the vectors CX and CY.
+*
+* CX (input/output) COMPLEX*16 array, dimension (N)
+* On input, the vector X.
+* On output, CX is overwritten with C*X + S*Y.
+*
+* INCX (input) INTEGER
+* The increment between successive values of CY. INCX <> 0.
+*
+* CY (input/output) COMPLEX*16 array, dimension (N)
+* On input, the vector Y.
+* On output, CY is overwritten with -CONJG(S)*X + C*Y.
+*
+* INCY (input) INTEGER
+* The increment between successive values of CY. INCX <> 0.
+*
+* C (input) DOUBLE PRECISION
+* S (input) COMPLEX*16
+* C and S define a rotation
+* [ C S ]
+* [ -conjg(S) C ]
+* where C*C + S*CONJG(S) = 1.0.
+*
+* =====================================================================
+*
+* .. Local Scalars ..
+ INTEGER I, IX, IY
+ COMPLEX*16 STEMP
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC DCONJG
+* ..
+* .. Executable Statements ..
+*
+ IF( N.LE.0 )
+ $ RETURN
+ IF( INCX.EQ.1 .AND. INCY.EQ.1 )
+ $ GO TO 20
+*
+* Code for unequal increments or equal increments not equal to 1
+*
+ IX = 1
+ IY = 1
+ IF( INCX.LT.0 )
+ $ IX = ( -N+1 )*INCX + 1
+ IF( INCY.LT.0 )
+ $ IY = ( -N+1 )*INCY + 1
+ DO 10 I = 1, N
+ STEMP = C*CX( IX ) + S*CY( IY )
+ CY( IY ) = C*CY( IY ) - DCONJG( S )*CX( IX )
+ CX( IX ) = STEMP
+ IX = IX + INCX
+ IY = IY + INCY
+ 10 CONTINUE
+ RETURN
+*
+* Code for both increments equal to 1
+*
+ 20 CONTINUE
+ DO 30 I = 1, N
+ STEMP = C*CX( I ) + S*CY( I )
+ CY( I ) = C*CY( I ) - DCONJG( S )*CX( I )
+ CX( I ) = STEMP
+ 30 CONTINUE
+ RETURN
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.h
new file mode 100644
index 0000000000000000000000000000000000000000..8134e571e418d30d89f867726ee3665a8f1efc16
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zrot.h
@@ -0,0 +1,9 @@
+extern int v3p_netlib_zrot_(
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *cx,
+ v3p_netlib_integer *incx,
+ v3p_netlib_doublecomplex *cy,
+ v3p_netlib_integer *incy,
+ v3p_netlib_doublereal *c__,
+ v3p_netlib_doublecomplex *s
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.P
new file mode 100644
index 0000000000000000000000000000000000000000..e69577bf2f7bdf59dd5902a3dca0f56901a3b8e3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.P
@@ -0,0 +1,6 @@
+extern int ztgex2_(logical *wantq, logical *wantz, integer *n, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb, doublecomplex *q, integer *ldq, doublecomplex *z__, integer *ldz, integer *j1, integer *info);
+/*:ref: zlacpy_ 14 8 13 4 4 9 4 9 4 124 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: zlassq_ 14 5 4 9 4 7 7 */
+/*:ref: zlartg_ 14 5 9 9 7 9 9 */
+/*:ref: zrot_ 14 7 4 9 4 9 4 7 9 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.c
new file mode 100644
index 0000000000000000000000000000000000000000..4bdb1ec4e9dc0ad9567f57ad83f954ea186ee57e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.c
@@ -0,0 +1,480 @@
+/* lapack/complex16/ztgex2.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__2 = 2;
+static integer c__1 = 1;
+
+/*< >*/
+/* Subroutine */ int ztgex2_(logical *wantq, logical *wantz, integer *n,
+ doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb,
+ doublecomplex *q, integer *ldq, doublecomplex *z__, integer *ldz,
+ integer *j1, integer *info)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, b_dim1, b_offset, q_dim1, q_offset, z_dim1,
+ z_offset, i__1, i__2, i__3;
+ doublereal d__1;
+ doublecomplex z__1, z__2, z__3;
+
+ /* Builtin functions */
+ double sqrt(doublereal), z_abs(doublecomplex *);
+ void d_cnjg(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ doublecomplex f, g;
+ integer i__, m;
+ doublecomplex s[4] /* was [2][2] */, t[4] /* was [2][2] */;
+ doublereal cq, sa, sb, cz;
+ doublecomplex sq;
+ doublereal ss, ws;
+ doublecomplex sz;
+ doublereal eps, sum;
+ logical weak;
+ doublecomplex cdum, work[8];
+ extern /* Subroutine */ int zrot_(integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublereal *, doublecomplex *);
+ doublereal scale;
+ extern doublereal dlamch_(char *, ftnlen);
+ logical dtrong;
+ doublereal thresh;
+ extern /* Subroutine */ int zlacpy_(char *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *, ftnlen),
+ zlartg_(doublecomplex *, doublecomplex *, doublereal *,
+ doublecomplex *, doublecomplex *);
+ doublereal smlnum;
+ extern /* Subroutine */ int zlassq_(integer *, doublecomplex *, integer *,
+ doublereal *, doublereal *);
+
+
+/* -- LAPACK auxiliary routine (version 3.2.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* June 2010 */
+
+/* .. Scalar Arguments .. */
+/*< LOGICAL WANTQ, WANTZ >*/
+/*< INTEGER INFO, J1, LDA, LDB, LDQ, LDZ, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZTGEX2 swaps adjacent diagonal 1 by 1 blocks (A11,B11) and (A22,B22) */
+/* in an upper triangular matrix pair (A, B) by an unitary equivalence */
+/* transformation. */
+
+/* (A, B) must be in generalized Schur canonical form, that is, A and */
+/* B are both upper triangular. */
+
+/* Optionally, the matrices Q and Z of generalized Schur vectors are */
+/* updated. */
+
+/* Q(in) * A(in) * Z(in)' = Q(out) * A(out) * Z(out)' */
+/* Q(in) * B(in) * Z(in)' = Q(out) * B(out) * Z(out)' */
+
+
+/* Arguments */
+/* ========= */
+
+/* WANTQ (input) LOGICAL */
+/* .TRUE. : update the left transformation matrix Q; */
+/* .FALSE.: do not update Q. */
+
+/* WANTZ (input) LOGICAL */
+/* .TRUE. : update the right transformation matrix Z; */
+/* .FALSE.: do not update Z. */
+
+/* N (input) INTEGER */
+/* The order of the matrices A and B. N >= 0. */
+
+/* A (input/output) COMPLEX*16 arrays, dimensions (LDA,N) */
+/* On entry, the matrix A in the pair (A, B). */
+/* On exit, the updated matrix A. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,N). */
+
+/* B (input/output) COMPLEX*16 arrays, dimensions (LDB,N) */
+/* On entry, the matrix B in the pair (A, B). */
+/* On exit, the updated matrix B. */
+
+/* LDB (input) INTEGER */
+/* The leading dimension of the array B. LDB >= max(1,N). */
+
+/* Q (input/output) COMPLEX*16 array, dimension (LDZ,N) */
+/* If WANTQ = .TRUE, on entry, the unitary matrix Q. On exit, */
+/* the updated matrix Q. */
+/* Not referenced if WANTQ = .FALSE.. */
+
+/* LDQ (input) INTEGER */
+/* The leading dimension of the array Q. LDQ >= 1; */
+/* If WANTQ = .TRUE., LDQ >= N. */
+
+/* Z (input/output) COMPLEX*16 array, dimension (LDZ,N) */
+/* If WANTZ = .TRUE, on entry, the unitary matrix Z. On exit, */
+/* the updated matrix Z. */
+/* Not referenced if WANTZ = .FALSE.. */
+
+/* LDZ (input) INTEGER */
+/* The leading dimension of the array Z. LDZ >= 1; */
+/* If WANTZ = .TRUE., LDZ >= N. */
+
+/* J1 (input) INTEGER */
+/* The index to the first block (A11, B11). */
+
+/* INFO (output) INTEGER */
+/* =0: Successful exit. */
+/* =1: The transformed matrix pair (A, B) would be too far */
+/* from generalized Schur form; the problem is ill- */
+/* conditioned. */
+
+
+/* Further Details */
+/* =============== */
+
+/* Based on contributions by */
+/* Bo Kagstrom and Peter Poromaa, Department of Computing Science, */
+/* Umea University, S-901 87 Umea, Sweden. */
+
+/* In the current code both weak and strong stability tests are */
+/* performed. The user can omit the strong stability test by changing */
+/* the internal logical parameter WANDS to .FALSE.. See ref. [2] for */
+/* details. */
+
+/* [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the */
+/* Generalized Real Schur Form of a Regular Matrix Pair (A, B), in */
+/* M.S. Moonen et al (eds), Linear Algebra for Large Scale and */
+/* Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. */
+
+/* [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified */
+/* Eigenvalues of a Regular Matrix Pair (A, B) and Condition */
+/* Estimation: Theory, Algorithms and Software, Report UMINF-94.04, */
+/* Department of Computing Science, Umea University, S-901 87 Umea, */
+/* Sweden, 1994. Also as LAPACK Working Note 87. To appear in */
+/* Numerical Algorithms, 1996. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< COMPLEX*16 CZERO, CONE >*/
+/*< >*/
+/*< DOUBLE PRECISION TWENTY >*/
+/*< PARAMETER ( TWENTY = 2.0D+1 ) >*/
+/*< INTEGER LDST >*/
+/*< PARAMETER ( LDST = 2 ) >*/
+/*< LOGICAL WANDS >*/
+/*< PARAMETER ( WANDS = .TRUE. ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL DTRONG, WEAK >*/
+/*< INTEGER I, M >*/
+/*< >*/
+/*< COMPLEX*16 CDUM, F, G, SQ, SZ >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< COMPLEX*16 S( LDST, LDST ), T( LDST, LDST ), WORK( 8 ) >*/
+/* .. */
+/* .. External Functions .. */
+/*< DOUBLE PRECISION DLAMCH >*/
+/*< EXTERNAL DLAMCH >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL ZLACPY, ZLARTG, ZLASSQ, ZROT >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, DBLE, DCONJG, MAX, SQRT >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ b_dim1 = *ldb;
+ b_offset = 1 + b_dim1;
+ b -= b_offset;
+ q_dim1 = *ldq;
+ q_offset = 1 + q_dim1;
+ q -= q_offset;
+ z_dim1 = *ldz;
+ z_offset = 1 + z_dim1;
+ z__ -= z_offset;
+
+ /* Function Body */
+ *info = 0;
+
+/* Quick return if possible */
+
+/*< >*/
+ if (*n <= 1) {
+ return 0;
+ }
+
+/*< M = LDST >*/
+ m = 2;
+/*< WEAK = .FALSE. >*/
+ weak = FALSE_;
+/*< DTRONG = .FALSE. >*/
+ dtrong = FALSE_;
+
+/* Make a local copy of selected block in (A, B) */
+
+/*< CALL ZLACPY( 'Full', M, M, A( J1, J1 ), LDA, S, LDST ) >*/
+ zlacpy_("Full", &m, &m, &a[*j1 + *j1 * a_dim1], lda, s, &c__2, (ftnlen)4);
+/*< CALL ZLACPY( 'Full', M, M, B( J1, J1 ), LDB, T, LDST ) >*/
+ zlacpy_("Full", &m, &m, &b[*j1 + *j1 * b_dim1], ldb, t, &c__2, (ftnlen)4);
+
+/* Compute the threshold for testing the acceptance of swapping. */
+
+/*< EPS = DLAMCH( 'P' ) >*/
+ eps = dlamch_("P", (ftnlen)1);
+/*< SMLNUM = DLAMCH( 'S' ) / EPS >*/
+ smlnum = dlamch_("S", (ftnlen)1) / eps;
+/*< SCALE = DBLE( CZERO ) >*/
+ scale = 0.;
+/*< SUM = DBLE( CONE ) >*/
+ sum = 1.;
+/*< CALL ZLACPY( 'Full', M, M, S, LDST, WORK, M ) >*/
+ zlacpy_("Full", &m, &m, s, &c__2, work, &m, (ftnlen)4);
+/*< CALL ZLACPY( 'Full', M, M, T, LDST, WORK( M*M+1 ), M ) >*/
+ zlacpy_("Full", &m, &m, t, &c__2, &work[m * m], &m, (ftnlen)4);
+/*< CALL ZLASSQ( 2*M*M, WORK, 1, SCALE, SUM ) >*/
+ i__1 = (m << 1) * m;
+ zlassq_(&i__1, work, &c__1, &scale, &sum);
+/*< SA = SCALE*SQRT( SUM ) >*/
+ sa = scale * sqrt(sum);
+
+/* THRES has been changed from */
+/* THRESH = MAX( TEN*EPS*SA, SMLNUM ) */
+/* to */
+/* THRESH = MAX( TWENTY*EPS*SA, SMLNUM ) */
+/* on 04/01/10. */
+/* "Bug" reported by Ondra Kamenik, confirmed by Julie Langou, fixed by */
+/* Jim Demmel and Guillaume Revy. See forum post 1783. */
+
+/*< THRESH = MAX( TWENTY*EPS*SA, SMLNUM ) >*/
+/* Computing MAX */
+ d__1 = eps * 20. * sa;
+ thresh = max(d__1,smlnum);
+
+/* Compute unitary QL and RQ that swap 1-by-1 and 1-by-1 blocks */
+/* using Givens rotations and perform the swap tentatively. */
+
+/*< F = S( 2, 2 )*T( 1, 1 ) - T( 2, 2 )*S( 1, 1 ) >*/
+ z__2.r = s[3].r * t[0].r - s[3].i * t[0].i, z__2.i = s[3].r * t[0].i + s[
+ 3].i * t[0].r;
+ z__3.r = t[3].r * s[0].r - t[3].i * s[0].i, z__3.i = t[3].r * s[0].i + t[
+ 3].i * s[0].r;
+ z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
+ f.r = z__1.r, f.i = z__1.i;
+/*< G = S( 2, 2 )*T( 1, 2 ) - T( 2, 2 )*S( 1, 2 ) >*/
+ z__2.r = s[3].r * t[2].r - s[3].i * t[2].i, z__2.i = s[3].r * t[2].i + s[
+ 3].i * t[2].r;
+ z__3.r = t[3].r * s[2].r - t[3].i * s[2].i, z__3.i = t[3].r * s[2].i + t[
+ 3].i * s[2].r;
+ z__1.r = z__2.r - z__3.r, z__1.i = z__2.i - z__3.i;
+ g.r = z__1.r, g.i = z__1.i;
+/*< SA = ABS( S( 2, 2 ) ) >*/
+ sa = z_abs(&s[3]);
+/*< SB = ABS( T( 2, 2 ) ) >*/
+ sb = z_abs(&t[3]);
+/*< CALL ZLARTG( G, F, CZ, SZ, CDUM ) >*/
+ zlartg_(&g, &f, &cz, &sz, &cdum);
+/*< SZ = -SZ >*/
+ z__1.r = -sz.r, z__1.i = -sz.i;
+ sz.r = z__1.r, sz.i = z__1.i;
+/*< CALL ZROT( 2, S( 1, 1 ), 1, S( 1, 2 ), 1, CZ, DCONJG( SZ ) ) >*/
+ d_cnjg(&z__1, &sz);
+ zrot_(&c__2, s, &c__1, &s[2], &c__1, &cz, &z__1);
+/*< CALL ZROT( 2, T( 1, 1 ), 1, T( 1, 2 ), 1, CZ, DCONJG( SZ ) ) >*/
+ d_cnjg(&z__1, &sz);
+ zrot_(&c__2, t, &c__1, &t[2], &c__1, &cz, &z__1);
+/*< IF( SA.GE.SB ) THEN >*/
+ if (sa >= sb) {
+/*< CALL ZLARTG( S( 1, 1 ), S( 2, 1 ), CQ, SQ, CDUM ) >*/
+ zlartg_(s, &s[1], &cq, &sq, &cdum);
+/*< ELSE >*/
+ } else {
+/*< CALL ZLARTG( T( 1, 1 ), T( 2, 1 ), CQ, SQ, CDUM ) >*/
+ zlartg_(t, &t[1], &cq, &sq, &cdum);
+/*< END IF >*/
+ }
+/*< CALL ZROT( 2, S( 1, 1 ), LDST, S( 2, 1 ), LDST, CQ, SQ ) >*/
+ zrot_(&c__2, s, &c__2, &s[1], &c__2, &cq, &sq);
+/*< CALL ZROT( 2, T( 1, 1 ), LDST, T( 2, 1 ), LDST, CQ, SQ ) >*/
+ zrot_(&c__2, t, &c__2, &t[1], &c__2, &cq, &sq);
+
+/* Weak stability test: |S21| + |T21| <= O(EPS F-norm((S, T))) */
+
+/*< WS = ABS( S( 2, 1 ) ) + ABS( T( 2, 1 ) ) >*/
+ ws = z_abs(&s[1]) + z_abs(&t[1]);
+/*< WEAK = WS.LE.THRESH >*/
+ weak = ws <= thresh;
+/*< >*/
+ if (! weak) {
+ goto L20;
+ }
+
+/*< IF( WANDS ) THEN >*/
+ if (TRUE_) {
+
+/* Strong stability test: */
+/* F-norm((A-QL'*S*QR, B-QL'*T*QR)) <= O(EPS*F-norm((A, B))) */
+
+/*< CALL ZLACPY( 'Full', M, M, S, LDST, WORK, M ) >*/
+ zlacpy_("Full", &m, &m, s, &c__2, work, &m, (ftnlen)4);
+/*< CALL ZLACPY( 'Full', M, M, T, LDST, WORK( M*M+1 ), M ) >*/
+ zlacpy_("Full", &m, &m, t, &c__2, &work[m * m], &m, (ftnlen)4);
+/*< CALL ZROT( 2, WORK, 1, WORK( 3 ), 1, CZ, -DCONJG( SZ ) ) >*/
+ d_cnjg(&z__2, &sz);
+ z__1.r = -z__2.r, z__1.i = -z__2.i;
+ zrot_(&c__2, work, &c__1, &work[2], &c__1, &cz, &z__1);
+/*< CALL ZROT( 2, WORK( 5 ), 1, WORK( 7 ), 1, CZ, -DCONJG( SZ ) ) >*/
+ d_cnjg(&z__2, &sz);
+ z__1.r = -z__2.r, z__1.i = -z__2.i;
+ zrot_(&c__2, &work[4], &c__1, &work[6], &c__1, &cz, &z__1);
+/*< CALL ZROT( 2, WORK, 2, WORK( 2 ), 2, CQ, -SQ ) >*/
+ z__1.r = -sq.r, z__1.i = -sq.i;
+ zrot_(&c__2, work, &c__2, &work[1], &c__2, &cq, &z__1);
+/*< CALL ZROT( 2, WORK( 5 ), 2, WORK( 6 ), 2, CQ, -SQ ) >*/
+ z__1.r = -sq.r, z__1.i = -sq.i;
+ zrot_(&c__2, &work[4], &c__2, &work[5], &c__2, &cq, &z__1);
+/*< DO 10 I = 1, 2 >*/
+ for (i__ = 1; i__ <= 2; ++i__) {
+/*< WORK( I ) = WORK( I ) - A( J1+I-1, J1 ) >*/
+ i__1 = i__ - 1;
+ i__2 = i__ - 1;
+ i__3 = *j1 + i__ - 1 + *j1 * a_dim1;
+ z__1.r = work[i__2].r - a[i__3].r, z__1.i = work[i__2].i - a[i__3]
+ .i;
+ work[i__1].r = z__1.r, work[i__1].i = z__1.i;
+/*< WORK( I+2 ) = WORK( I+2 ) - A( J1+I-1, J1+1 ) >*/
+ i__1 = i__ + 1;
+ i__2 = i__ + 1;
+ i__3 = *j1 + i__ - 1 + (*j1 + 1) * a_dim1;
+ z__1.r = work[i__2].r - a[i__3].r, z__1.i = work[i__2].i - a[i__3]
+ .i;
+ work[i__1].r = z__1.r, work[i__1].i = z__1.i;
+/*< WORK( I+4 ) = WORK( I+4 ) - B( J1+I-1, J1 ) >*/
+ i__1 = i__ + 3;
+ i__2 = i__ + 3;
+ i__3 = *j1 + i__ - 1 + *j1 * b_dim1;
+ z__1.r = work[i__2].r - b[i__3].r, z__1.i = work[i__2].i - b[i__3]
+ .i;
+ work[i__1].r = z__1.r, work[i__1].i = z__1.i;
+/*< WORK( I+6 ) = WORK( I+6 ) - B( J1+I-1, J1+1 ) >*/
+ i__1 = i__ + 5;
+ i__2 = i__ + 5;
+ i__3 = *j1 + i__ - 1 + (*j1 + 1) * b_dim1;
+ z__1.r = work[i__2].r - b[i__3].r, z__1.i = work[i__2].i - b[i__3]
+ .i;
+ work[i__1].r = z__1.r, work[i__1].i = z__1.i;
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< SCALE = DBLE( CZERO ) >*/
+ scale = 0.;
+/*< SUM = DBLE( CONE ) >*/
+ sum = 1.;
+/*< CALL ZLASSQ( 2*M*M, WORK, 1, SCALE, SUM ) >*/
+ i__1 = (m << 1) * m;
+ zlassq_(&i__1, work, &c__1, &scale, &sum);
+/*< SS = SCALE*SQRT( SUM ) >*/
+ ss = scale * sqrt(sum);
+/*< DTRONG = SS.LE.THRESH >*/
+ dtrong = ss <= thresh;
+/*< >*/
+ if (! dtrong) {
+ goto L20;
+ }
+/*< END IF >*/
+ }
+
+/* If the swap is accepted ("weakly" and "strongly"), apply the */
+/* equivalence transformations to the original matrix pair (A,B) */
+
+/*< >*/
+ i__1 = *j1 + 1;
+ d_cnjg(&z__1, &sz);
+ zrot_(&i__1, &a[*j1 * a_dim1 + 1], &c__1, &a[(*j1 + 1) * a_dim1 + 1], &
+ c__1, &cz, &z__1);
+/*< >*/
+ i__1 = *j1 + 1;
+ d_cnjg(&z__1, &sz);
+ zrot_(&i__1, &b[*j1 * b_dim1 + 1], &c__1, &b[(*j1 + 1) * b_dim1 + 1], &
+ c__1, &cz, &z__1);
+/*< CALL ZROT( N-J1+1, A( J1, J1 ), LDA, A( J1+1, J1 ), LDA, CQ, SQ ) >*/
+ i__1 = *n - *j1 + 1;
+ zrot_(&i__1, &a[*j1 + *j1 * a_dim1], lda, &a[*j1 + 1 + *j1 * a_dim1], lda,
+ &cq, &sq);
+/*< CALL ZROT( N-J1+1, B( J1, J1 ), LDB, B( J1+1, J1 ), LDB, CQ, SQ ) >*/
+ i__1 = *n - *j1 + 1;
+ zrot_(&i__1, &b[*j1 + *j1 * b_dim1], ldb, &b[*j1 + 1 + *j1 * b_dim1], ldb,
+ &cq, &sq);
+
+/* Set N1 by N2 (2,1) blocks to 0 */
+
+/*< A( J1+1, J1 ) = CZERO >*/
+ i__1 = *j1 + 1 + *j1 * a_dim1;
+ a[i__1].r = 0., a[i__1].i = 0.;
+/*< B( J1+1, J1 ) = CZERO >*/
+ i__1 = *j1 + 1 + *j1 * b_dim1;
+ b[i__1].r = 0., b[i__1].i = 0.;
+
+/* Accumulate transformations into Q and Z if requested. */
+
+/*< >*/
+ if (*wantz) {
+ d_cnjg(&z__1, &sz);
+ zrot_(n, &z__[*j1 * z_dim1 + 1], &c__1, &z__[(*j1 + 1) * z_dim1 + 1],
+ &c__1, &cz, &z__1);
+ }
+/*< >*/
+ if (*wantq) {
+ d_cnjg(&z__1, &sq);
+ zrot_(n, &q[*j1 * q_dim1 + 1], &c__1, &q[(*j1 + 1) * q_dim1 + 1], &
+ c__1, &cq, &z__1);
+ }
+
+/* Exit with INFO = 0 if swap was successfully performed. */
+
+/*< RETURN >*/
+ return 0;
+
+/* Exit with INFO = 1 if swap was rejected. */
+
+/*< 20 CONTINUE >*/
+L20:
+/*< INFO = 1 >*/
+ *info = 1;
+/*< RETURN >*/
+ return 0;
+
+/* End of ZTGEX2 */
+
+/*< END >*/
+} /* ztgex2_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.f
new file mode 100644
index 0000000000000000000000000000000000000000..a715c1a6f391c4e3d5934d7652367844abc46216
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.f
@@ -0,0 +1,275 @@
+ SUBROUTINE ZTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
+ $ LDZ, J1, INFO )
+*
+* -- LAPACK auxiliary routine (version 3.2.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* June 2010
+*
+* .. Scalar Arguments ..
+ LOGICAL WANTQ, WANTZ
+ INTEGER INFO, J1, LDA, LDB, LDQ, LDZ, N
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 A( LDA, * ), B( LDB, * ), Q( LDQ, * ),
+ $ Z( LDZ, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZTGEX2 swaps adjacent diagonal 1 by 1 blocks (A11,B11) and (A22,B22)
+* in an upper triangular matrix pair (A, B) by an unitary equivalence
+* transformation.
+*
+* (A, B) must be in generalized Schur canonical form, that is, A and
+* B are both upper triangular.
+*
+* Optionally, the matrices Q and Z of generalized Schur vectors are
+* updated.
+*
+* Q(in) * A(in) * Z(in)' = Q(out) * A(out) * Z(out)'
+* Q(in) * B(in) * Z(in)' = Q(out) * B(out) * Z(out)'
+*
+*
+* Arguments
+* =========
+*
+* WANTQ (input) LOGICAL
+* .TRUE. : update the left transformation matrix Q;
+* .FALSE.: do not update Q.
+*
+* WANTZ (input) LOGICAL
+* .TRUE. : update the right transformation matrix Z;
+* .FALSE.: do not update Z.
+*
+* N (input) INTEGER
+* The order of the matrices A and B. N >= 0.
+*
+* A (input/output) COMPLEX*16 arrays, dimensions (LDA,N)
+* On entry, the matrix A in the pair (A, B).
+* On exit, the updated matrix A.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,N).
+*
+* B (input/output) COMPLEX*16 arrays, dimensions (LDB,N)
+* On entry, the matrix B in the pair (A, B).
+* On exit, the updated matrix B.
+*
+* LDB (input) INTEGER
+* The leading dimension of the array B. LDB >= max(1,N).
+*
+* Q (input/output) COMPLEX*16 array, dimension (LDZ,N)
+* If WANTQ = .TRUE, on entry, the unitary matrix Q. On exit,
+* the updated matrix Q.
+* Not referenced if WANTQ = .FALSE..
+*
+* LDQ (input) INTEGER
+* The leading dimension of the array Q. LDQ >= 1;
+* If WANTQ = .TRUE., LDQ >= N.
+*
+* Z (input/output) COMPLEX*16 array, dimension (LDZ,N)
+* If WANTZ = .TRUE, on entry, the unitary matrix Z. On exit,
+* the updated matrix Z.
+* Not referenced if WANTZ = .FALSE..
+*
+* LDZ (input) INTEGER
+* The leading dimension of the array Z. LDZ >= 1;
+* If WANTZ = .TRUE., LDZ >= N.
+*
+* J1 (input) INTEGER
+* The index to the first block (A11, B11).
+*
+* INFO (output) INTEGER
+* =0: Successful exit.
+* =1: The transformed matrix pair (A, B) would be too far
+* from generalized Schur form; the problem is ill-
+* conditioned.
+*
+*
+* Further Details
+* ===============
+*
+* Based on contributions by
+* Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+* Umea University, S-901 87 Umea, Sweden.
+*
+* In the current code both weak and strong stability tests are
+* performed. The user can omit the strong stability test by changing
+* the internal logical parameter WANDS to .FALSE.. See ref. [2] for
+* details.
+*
+* [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
+* Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
+* M.S. Moonen et al (eds), Linear Algebra for Large Scale and
+* Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
+*
+* [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified
+* Eigenvalues of a Regular Matrix Pair (A, B) and Condition
+* Estimation: Theory, Algorithms and Software, Report UMINF-94.04,
+* Department of Computing Science, Umea University, S-901 87 Umea,
+* Sweden, 1994. Also as LAPACK Working Note 87. To appear in
+* Numerical Algorithms, 1996.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ COMPLEX*16 CZERO, CONE
+ PARAMETER ( CZERO = ( 0.0D+0, 0.0D+0 ),
+ $ CONE = ( 1.0D+0, 0.0D+0 ) )
+ DOUBLE PRECISION TWENTY
+ PARAMETER ( TWENTY = 2.0D+1 )
+ INTEGER LDST
+ PARAMETER ( LDST = 2 )
+ LOGICAL WANDS
+ PARAMETER ( WANDS = .TRUE. )
+* ..
+* .. Local Scalars ..
+ LOGICAL DTRONG, WEAK
+ INTEGER I, M
+ DOUBLE PRECISION CQ, CZ, EPS, SA, SB, SCALE, SMLNUM, SS, SUM,
+ $ THRESH, WS
+ COMPLEX*16 CDUM, F, G, SQ, SZ
+* ..
+* .. Local Arrays ..
+ COMPLEX*16 S( LDST, LDST ), T( LDST, LDST ), WORK( 8 )
+* ..
+* .. External Functions ..
+ DOUBLE PRECISION DLAMCH
+ EXTERNAL DLAMCH
+* ..
+* .. External Subroutines ..
+ EXTERNAL ZLACPY, ZLARTG, ZLASSQ, ZROT
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DBLE, DCONJG, MAX, SQRT
+* ..
+* .. Executable Statements ..
+*
+ INFO = 0
+*
+* Quick return if possible
+*
+ IF( N.LE.1 )
+ $ RETURN
+*
+ M = LDST
+ WEAK = .FALSE.
+ DTRONG = .FALSE.
+*
+* Make a local copy of selected block in (A, B)
+*
+ CALL ZLACPY( 'Full', M, M, A( J1, J1 ), LDA, S, LDST )
+ CALL ZLACPY( 'Full', M, M, B( J1, J1 ), LDB, T, LDST )
+*
+* Compute the threshold for testing the acceptance of swapping.
+*
+ EPS = DLAMCH( 'P' )
+ SMLNUM = DLAMCH( 'S' ) / EPS
+ SCALE = DBLE( CZERO )
+ SUM = DBLE( CONE )
+ CALL ZLACPY( 'Full', M, M, S, LDST, WORK, M )
+ CALL ZLACPY( 'Full', M, M, T, LDST, WORK( M*M+1 ), M )
+ CALL ZLASSQ( 2*M*M, WORK, 1, SCALE, SUM )
+ SA = SCALE*SQRT( SUM )
+*
+* THRES has been changed from
+* THRESH = MAX( TEN*EPS*SA, SMLNUM )
+* to
+* THRESH = MAX( TWENTY*EPS*SA, SMLNUM )
+* on 04/01/10.
+* "Bug" reported by Ondra Kamenik, confirmed by Julie Langou, fixed by
+* Jim Demmel and Guillaume Revy. See forum post 1783.
+*
+ THRESH = MAX( TWENTY*EPS*SA, SMLNUM )
+*
+* Compute unitary QL and RQ that swap 1-by-1 and 1-by-1 blocks
+* using Givens rotations and perform the swap tentatively.
+*
+ F = S( 2, 2 )*T( 1, 1 ) - T( 2, 2 )*S( 1, 1 )
+ G = S( 2, 2 )*T( 1, 2 ) - T( 2, 2 )*S( 1, 2 )
+ SA = ABS( S( 2, 2 ) )
+ SB = ABS( T( 2, 2 ) )
+ CALL ZLARTG( G, F, CZ, SZ, CDUM )
+ SZ = -SZ
+ CALL ZROT( 2, S( 1, 1 ), 1, S( 1, 2 ), 1, CZ, DCONJG( SZ ) )
+ CALL ZROT( 2, T( 1, 1 ), 1, T( 1, 2 ), 1, CZ, DCONJG( SZ ) )
+ IF( SA.GE.SB ) THEN
+ CALL ZLARTG( S( 1, 1 ), S( 2, 1 ), CQ, SQ, CDUM )
+ ELSE
+ CALL ZLARTG( T( 1, 1 ), T( 2, 1 ), CQ, SQ, CDUM )
+ END IF
+ CALL ZROT( 2, S( 1, 1 ), LDST, S( 2, 1 ), LDST, CQ, SQ )
+ CALL ZROT( 2, T( 1, 1 ), LDST, T( 2, 1 ), LDST, CQ, SQ )
+*
+* Weak stability test: |S21| + |T21| <= O(EPS F-norm((S, T)))
+*
+ WS = ABS( S( 2, 1 ) ) + ABS( T( 2, 1 ) )
+ WEAK = WS.LE.THRESH
+ IF( .NOT.WEAK )
+ $ GO TO 20
+*
+ IF( WANDS ) THEN
+*
+* Strong stability test:
+* F-norm((A-QL'*S*QR, B-QL'*T*QR)) <= O(EPS*F-norm((A, B)))
+*
+ CALL ZLACPY( 'Full', M, M, S, LDST, WORK, M )
+ CALL ZLACPY( 'Full', M, M, T, LDST, WORK( M*M+1 ), M )
+ CALL ZROT( 2, WORK, 1, WORK( 3 ), 1, CZ, -DCONJG( SZ ) )
+ CALL ZROT( 2, WORK( 5 ), 1, WORK( 7 ), 1, CZ, -DCONJG( SZ ) )
+ CALL ZROT( 2, WORK, 2, WORK( 2 ), 2, CQ, -SQ )
+ CALL ZROT( 2, WORK( 5 ), 2, WORK( 6 ), 2, CQ, -SQ )
+ DO 10 I = 1, 2
+ WORK( I ) = WORK( I ) - A( J1+I-1, J1 )
+ WORK( I+2 ) = WORK( I+2 ) - A( J1+I-1, J1+1 )
+ WORK( I+4 ) = WORK( I+4 ) - B( J1+I-1, J1 )
+ WORK( I+6 ) = WORK( I+6 ) - B( J1+I-1, J1+1 )
+ 10 CONTINUE
+ SCALE = DBLE( CZERO )
+ SUM = DBLE( CONE )
+ CALL ZLASSQ( 2*M*M, WORK, 1, SCALE, SUM )
+ SS = SCALE*SQRT( SUM )
+ DTRONG = SS.LE.THRESH
+ IF( .NOT.DTRONG )
+ $ GO TO 20
+ END IF
+*
+* If the swap is accepted ("weakly" and "strongly"), apply the
+* equivalence transformations to the original matrix pair (A,B)
+*
+ CALL ZROT( J1+1, A( 1, J1 ), 1, A( 1, J1+1 ), 1, CZ,
+ $ DCONJG( SZ ) )
+ CALL ZROT( J1+1, B( 1, J1 ), 1, B( 1, J1+1 ), 1, CZ,
+ $ DCONJG( SZ ) )
+ CALL ZROT( N-J1+1, A( J1, J1 ), LDA, A( J1+1, J1 ), LDA, CQ, SQ )
+ CALL ZROT( N-J1+1, B( J1, J1 ), LDB, B( J1+1, J1 ), LDB, CQ, SQ )
+*
+* Set N1 by N2 (2,1) blocks to 0
+*
+ A( J1+1, J1 ) = CZERO
+ B( J1+1, J1 ) = CZERO
+*
+* Accumulate transformations into Q and Z if requested.
+*
+ IF( WANTZ )
+ $ CALL ZROT( N, Z( 1, J1 ), 1, Z( 1, J1+1 ), 1, CZ,
+ $ DCONJG( SZ ) )
+ IF( WANTQ )
+ $ CALL ZROT( N, Q( 1, J1 ), 1, Q( 1, J1+1 ), 1, CQ,
+ $ DCONJG( SQ ) )
+*
+* Exit with INFO = 0 if swap was successfully performed.
+*
+ RETURN
+*
+* Exit with INFO = 1 if swap was rejected.
+*
+ 20 CONTINUE
+ INFO = 1
+ RETURN
+*
+* End of ZTGEX2
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.h
new file mode 100644
index 0000000000000000000000000000000000000000..054175dabaeb22592c6c2cfc4a75390486058db8
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgex2.h
@@ -0,0 +1,15 @@
+extern int v3p_netlib_ztgex2_(
+ v3p_netlib_logical *wantq,
+ v3p_netlib_logical *wantz,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *b,
+ v3p_netlib_integer *ldb,
+ v3p_netlib_doublecomplex *q,
+ v3p_netlib_integer *ldq,
+ v3p_netlib_doublecomplex *z__,
+ v3p_netlib_integer *ldz,
+ v3p_netlib_integer *j1,
+ v3p_netlib_integer *info
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.P
new file mode 100644
index 0000000000000000000000000000000000000000..54edf7fdcb74283c476986bdab47fa795f7c8225
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.P
@@ -0,0 +1,3 @@
+extern int ztgexc_(logical *wantq, logical *wantz, integer *n, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb, doublecomplex *q, integer *ldq, doublecomplex *z__, integer *ldz, integer *ifst, integer *ilst, integer *info);
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: ztgex2_ 14 13 12 12 4 9 4 9 4 9 4 9 4 4 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.c
new file mode 100644
index 0000000000000000000000000000000000000000..a238b765701e01b8cc2502fd9fc7dc615a9f2b74
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.c
@@ -0,0 +1,310 @@
+/* lapack/complex16/ztgexc.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< >*/
+/* Subroutine */ int ztgexc_(logical *wantq, logical *wantz, integer *n,
+ doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb,
+ doublecomplex *q, integer *ldq, doublecomplex *z__, integer *ldz,
+ integer *ifst, integer *ilst, integer *info)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, b_dim1, b_offset, q_dim1, q_offset, z_dim1,
+ z_offset, i__1;
+
+ /* Local variables */
+ integer here;
+ extern /* Subroutine */ int ztgex2_(logical *, logical *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *, integer *,
+ integer *), xerbla_(char *, integer *, ftnlen);
+
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< LOGICAL WANTQ, WANTZ >*/
+/*< INTEGER IFST, ILST, INFO, LDA, LDB, LDQ, LDZ, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZTGEXC reorders the generalized Schur decomposition of a complex */
+/* matrix pair (A,B), using an unitary equivalence transformation */
+/* (A, B) := Q * (A, B) * Z', so that the diagonal block of (A, B) with */
+/* row index IFST is moved to row ILST. */
+
+/* (A, B) must be in generalized Schur canonical form, that is, A and */
+/* B are both upper triangular. */
+
+/* Optionally, the matrices Q and Z of generalized Schur vectors are */
+/* updated. */
+
+/* Q(in) * A(in) * Z(in)' = Q(out) * A(out) * Z(out)' */
+/* Q(in) * B(in) * Z(in)' = Q(out) * B(out) * Z(out)' */
+
+/* Arguments */
+/* ========= */
+
+/* WANTQ (input) LOGICAL */
+/* .TRUE. : update the left transformation matrix Q; */
+/* .FALSE.: do not update Q. */
+
+/* WANTZ (input) LOGICAL */
+/* .TRUE. : update the right transformation matrix Z; */
+/* .FALSE.: do not update Z. */
+
+/* N (input) INTEGER */
+/* The order of the matrices A and B. N >= 0. */
+
+/* A (input/output) COMPLEX*16 array, dimension (LDA,N) */
+/* On entry, the upper triangular matrix A in the pair (A, B). */
+/* On exit, the updated matrix A. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,N). */
+
+/* B (input/output) COMPLEX*16 array, dimension (LDB,N) */
+/* On entry, the upper triangular matrix B in the pair (A, B). */
+/* On exit, the updated matrix B. */
+
+/* LDB (input) INTEGER */
+/* The leading dimension of the array B. LDB >= max(1,N). */
+
+/* Q (input/output) COMPLEX*16 array, dimension (LDZ,N) */
+/* On entry, if WANTQ = .TRUE., the unitary matrix Q. */
+/* On exit, the updated matrix Q. */
+/* If WANTQ = .FALSE., Q is not referenced. */
+
+/* LDQ (input) INTEGER */
+/* The leading dimension of the array Q. LDQ >= 1; */
+/* If WANTQ = .TRUE., LDQ >= N. */
+
+/* Z (input/output) COMPLEX*16 array, dimension (LDZ,N) */
+/* On entry, if WANTZ = .TRUE., the unitary matrix Z. */
+/* On exit, the updated matrix Z. */
+/* If WANTZ = .FALSE., Z is not referenced. */
+
+/* LDZ (input) INTEGER */
+/* The leading dimension of the array Z. LDZ >= 1; */
+/* If WANTZ = .TRUE., LDZ >= N. */
+
+/* IFST (input) INTEGER */
+/* ILST (input/output) INTEGER */
+/* Specify the reordering of the diagonal blocks of (A, B). */
+/* The block with row index IFST is moved to row ILST, by a */
+/* sequence of swapping between adjacent blocks. */
+
+/* INFO (output) INTEGER */
+/* =0: Successful exit. */
+/* <0: if INFO = -i, the i-th argument had an illegal value. */
+/* =1: The transformed matrix pair (A, B) would be too far */
+/* from generalized Schur form; the problem is ill- */
+/* conditioned. (A, B) may have been partially reordered, */
+/* and ILST points to the first row of the current */
+/* position of the block being moved. */
+
+
+/* Further Details */
+/* =============== */
+
+/* Based on contributions by */
+/* Bo Kagstrom and Peter Poromaa, Department of Computing Science, */
+/* Umea University, S-901 87 Umea, Sweden. */
+
+/* [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the */
+/* Generalized Real Schur Form of a Regular Matrix Pair (A, B), in */
+/* M.S. Moonen et al (eds), Linear Algebra for Large Scale and */
+/* Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. */
+
+/* [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified */
+/* Eigenvalues of a Regular Matrix Pair (A, B) and Condition */
+/* Estimation: Theory, Algorithms and Software, Report */
+/* UMINF - 94.04, Department of Computing Science, Umea University, */
+/* S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87. */
+/* To appear in Numerical Algorithms, 1996. */
+
+/* [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software */
+/* for Solving the Generalized Sylvester Equation and Estimating the */
+/* Separation between Regular Matrix Pairs, Report UMINF - 93.23, */
+/* Department of Computing Science, Umea University, S-901 87 Umea, */
+/* Sweden, December 1993, Revised April 1994, Also as LAPACK working */
+/* Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1, */
+/* 1996. */
+
+/* ===================================================================== */
+
+/* .. Local Scalars .. */
+/*< INTEGER HERE >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZTGEX2 >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC MAX >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Decode and test input arguments. */
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ b_dim1 = *ldb;
+ b_offset = 1 + b_dim1;
+ b -= b_offset;
+ q_dim1 = *ldq;
+ q_offset = 1 + q_dim1;
+ q -= q_offset;
+ z_dim1 = *ldz;
+ z_offset = 1 + z_dim1;
+ z__ -= z_offset;
+
+ /* Function Body */
+ *info = 0;
+/*< IF( N.LT.0 ) THEN >*/
+ if (*n < 0) {
+/*< INFO = -3 >*/
+ *info = -3;
+/*< ELSE IF( LDA.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*lda < max(1,*n)) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( LDB.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldb < max(1,*n)) {
+/*< INFO = -7 >*/
+ *info = -7;
+/*< ELSE IF( LDQ.LT.1 .OR. WANTQ .AND. ( LDQ.LT.MAX( 1, N ) ) ) THEN >*/
+ } else if (*ldq < 1 || (*wantq && *ldq < max(1,*n))) {
+/*< INFO = -9 >*/
+ *info = -9;
+/*< ELSE IF( LDZ.LT.1 .OR. WANTZ .AND. ( LDZ.LT.MAX( 1, N ) ) ) THEN >*/
+ } else if (*ldz < 1 || (*wantz && *ldz < max(1,*n))) {
+/*< INFO = -11 >*/
+ *info = -11;
+/*< ELSE IF( IFST.LT.1 .OR. IFST.GT.N ) THEN >*/
+ } else if (*ifst < 1 || *ifst > *n) {
+/*< INFO = -12 >*/
+ *info = -12;
+/*< ELSE IF( ILST.LT.1 .OR. ILST.GT.N ) THEN >*/
+ } else if (*ilst < 1 || *ilst > *n) {
+/*< INFO = -13 >*/
+ *info = -13;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZTGEXC', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZTGEXC", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< >*/
+ if (*n <= 1) {
+ return 0;
+ }
+/*< >*/
+ if (*ifst == *ilst) {
+ return 0;
+ }
+
+/*< IF( IFST.LT.ILST ) THEN >*/
+ if (*ifst < *ilst) {
+
+/*< HERE = IFST >*/
+ here = *ifst;
+
+/*< 10 CONTINUE >*/
+L10:
+
+/* Swap with next one below */
+
+/*< >*/
+ ztgex2_(wantq, wantz, n, &a[a_offset], lda, &b[b_offset], ldb, &q[
+ q_offset], ldq, &z__[z_offset], ldz, &here, info);
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< ILST = HERE >*/
+ *ilst = here;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+/*< HERE = HERE + 1 >*/
+ ++here;
+/*< >*/
+ if (here < *ilst) {
+ goto L10;
+ }
+/*< HERE = HERE - 1 >*/
+ --here;
+/*< ELSE >*/
+ } else {
+/*< HERE = IFST - 1 >*/
+ here = *ifst - 1;
+
+/*< 20 CONTINUE >*/
+L20:
+
+/* Swap with next one above */
+
+/*< >*/
+ ztgex2_(wantq, wantz, n, &a[a_offset], lda, &b[b_offset], ldb, &q[
+ q_offset], ldq, &z__[z_offset], ldz, &here, info);
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< ILST = HERE >*/
+ *ilst = here;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+/*< HERE = HERE - 1 >*/
+ --here;
+/*< >*/
+ if (here >= *ilst) {
+ goto L20;
+ }
+/*< HERE = HERE + 1 >*/
+ ++here;
+/*< END IF >*/
+ }
+/*< ILST = HERE >*/
+ *ilst = here;
+/*< RETURN >*/
+ return 0;
+
+/* End of ZTGEXC */
+
+/*< END >*/
+} /* ztgexc_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.f
new file mode 100644
index 0000000000000000000000000000000000000000..ce632369477a6b2a9b71a67c9502fd33c6613c0a
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.f
@@ -0,0 +1,207 @@
+ SUBROUTINE ZTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
+ $ LDZ, IFST, ILST, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ LOGICAL WANTQ, WANTZ
+ INTEGER IFST, ILST, INFO, LDA, LDB, LDQ, LDZ, N
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 A( LDA, * ), B( LDB, * ), Q( LDQ, * ),
+ $ Z( LDZ, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZTGEXC reorders the generalized Schur decomposition of a complex
+* matrix pair (A,B), using an unitary equivalence transformation
+* (A, B) := Q * (A, B) * Z', so that the diagonal block of (A, B) with
+* row index IFST is moved to row ILST.
+*
+* (A, B) must be in generalized Schur canonical form, that is, A and
+* B are both upper triangular.
+*
+* Optionally, the matrices Q and Z of generalized Schur vectors are
+* updated.
+*
+* Q(in) * A(in) * Z(in)' = Q(out) * A(out) * Z(out)'
+* Q(in) * B(in) * Z(in)' = Q(out) * B(out) * Z(out)'
+*
+* Arguments
+* =========
+*
+* WANTQ (input) LOGICAL
+* .TRUE. : update the left transformation matrix Q;
+* .FALSE.: do not update Q.
+*
+* WANTZ (input) LOGICAL
+* .TRUE. : update the right transformation matrix Z;
+* .FALSE.: do not update Z.
+*
+* N (input) INTEGER
+* The order of the matrices A and B. N >= 0.
+*
+* A (input/output) COMPLEX*16 array, dimension (LDA,N)
+* On entry, the upper triangular matrix A in the pair (A, B).
+* On exit, the updated matrix A.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,N).
+*
+* B (input/output) COMPLEX*16 array, dimension (LDB,N)
+* On entry, the upper triangular matrix B in the pair (A, B).
+* On exit, the updated matrix B.
+*
+* LDB (input) INTEGER
+* The leading dimension of the array B. LDB >= max(1,N).
+*
+* Q (input/output) COMPLEX*16 array, dimension (LDZ,N)
+* On entry, if WANTQ = .TRUE., the unitary matrix Q.
+* On exit, the updated matrix Q.
+* If WANTQ = .FALSE., Q is not referenced.
+*
+* LDQ (input) INTEGER
+* The leading dimension of the array Q. LDQ >= 1;
+* If WANTQ = .TRUE., LDQ >= N.
+*
+* Z (input/output) COMPLEX*16 array, dimension (LDZ,N)
+* On entry, if WANTZ = .TRUE., the unitary matrix Z.
+* On exit, the updated matrix Z.
+* If WANTZ = .FALSE., Z is not referenced.
+*
+* LDZ (input) INTEGER
+* The leading dimension of the array Z. LDZ >= 1;
+* If WANTZ = .TRUE., LDZ >= N.
+*
+* IFST (input) INTEGER
+* ILST (input/output) INTEGER
+* Specify the reordering of the diagonal blocks of (A, B).
+* The block with row index IFST is moved to row ILST, by a
+* sequence of swapping between adjacent blocks.
+*
+* INFO (output) INTEGER
+* =0: Successful exit.
+* <0: if INFO = -i, the i-th argument had an illegal value.
+* =1: The transformed matrix pair (A, B) would be too far
+* from generalized Schur form; the problem is ill-
+* conditioned. (A, B) may have been partially reordered,
+* and ILST points to the first row of the current
+* position of the block being moved.
+*
+*
+* Further Details
+* ===============
+*
+* Based on contributions by
+* Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+* Umea University, S-901 87 Umea, Sweden.
+*
+* [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
+* Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
+* M.S. Moonen et al (eds), Linear Algebra for Large Scale and
+* Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
+*
+* [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified
+* Eigenvalues of a Regular Matrix Pair (A, B) and Condition
+* Estimation: Theory, Algorithms and Software, Report
+* UMINF - 94.04, Department of Computing Science, Umea University,
+* S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87.
+* To appear in Numerical Algorithms, 1996.
+*
+* [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
+* for Solving the Generalized Sylvester Equation and Estimating the
+* Separation between Regular Matrix Pairs, Report UMINF - 93.23,
+* Department of Computing Science, Umea University, S-901 87 Umea,
+* Sweden, December 1993, Revised April 1994, Also as LAPACK working
+* Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1,
+* 1996.
+*
+* =====================================================================
+*
+* .. Local Scalars ..
+ INTEGER HERE
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZTGEX2
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC MAX
+* ..
+* .. Executable Statements ..
+*
+* Decode and test input arguments.
+ INFO = 0
+ IF( N.LT.0 ) THEN
+ INFO = -3
+ ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
+ INFO = -5
+ ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
+ INFO = -7
+ ELSE IF( LDQ.LT.1 .OR. WANTQ .AND. ( LDQ.LT.MAX( 1, N ) ) ) THEN
+ INFO = -9
+ ELSE IF( LDZ.LT.1 .OR. WANTZ .AND. ( LDZ.LT.MAX( 1, N ) ) ) THEN
+ INFO = -11
+ ELSE IF( IFST.LT.1 .OR. IFST.GT.N ) THEN
+ INFO = -12
+ ELSE IF( ILST.LT.1 .OR. ILST.GT.N ) THEN
+ INFO = -13
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZTGEXC', -INFO )
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( N.LE.1 )
+ $ RETURN
+ IF( IFST.EQ.ILST )
+ $ RETURN
+*
+ IF( IFST.LT.ILST ) THEN
+*
+ HERE = IFST
+*
+ 10 CONTINUE
+*
+* Swap with next one below
+*
+ CALL ZTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, LDZ,
+ $ HERE, INFO )
+ IF( INFO.NE.0 ) THEN
+ ILST = HERE
+ RETURN
+ END IF
+ HERE = HERE + 1
+ IF( HERE.LT.ILST )
+ $ GO TO 10
+ HERE = HERE - 1
+ ELSE
+ HERE = IFST - 1
+*
+ 20 CONTINUE
+*
+* Swap with next one above
+*
+ CALL ZTGEX2( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z, LDZ,
+ $ HERE, INFO )
+ IF( INFO.NE.0 ) THEN
+ ILST = HERE
+ RETURN
+ END IF
+ HERE = HERE - 1
+ IF( HERE.GE.ILST )
+ $ GO TO 20
+ HERE = HERE + 1
+ END IF
+ ILST = HERE
+ RETURN
+*
+* End of ZTGEXC
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.h
new file mode 100644
index 0000000000000000000000000000000000000000..1ec0cfce6b6b1332b0e0bfe35ebbb7ab58962915
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgexc.h
@@ -0,0 +1,16 @@
+extern int v3p_netlib_ztgexc_(
+ v3p_netlib_logical *wantq,
+ v3p_netlib_logical *wantz,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *b,
+ v3p_netlib_integer *ldb,
+ v3p_netlib_doublecomplex *q,
+ v3p_netlib_integer *ldq,
+ v3p_netlib_doublecomplex *z__,
+ v3p_netlib_integer *ldz,
+ v3p_netlib_integer *ifst,
+ v3p_netlib_integer *ilst,
+ v3p_netlib_integer *info
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.P
new file mode 100644
index 0000000000000000000000000000000000000000..beda671354b0370a9c2a436b7c9cea0f3bfbe09f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.P
@@ -0,0 +1,9 @@
+extern int ztgsen_(integer *ijob, logical *wantq, logical *wantz, logical *select, integer *n, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb, doublecomplex *alpha, doublecomplex *beta, doublecomplex *q, integer *ldq, doublecomplex *z__, integer *ldz, integer *m, doublereal *pl, doublereal *pr, doublereal *dif, doublecomplex *work, integer *lwork, integer *iwork, integer *liwork, integer *info);
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zlassq_ 14 5 4 9 4 7 7 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: ztgexc_ 14 14 12 12 4 9 4 9 4 9 4 9 4 4 4 4 */
+/*:ref: zlacpy_ 14 8 13 4 4 9 4 9 4 124 */
+/*:ref: ztgsyl_ 14 23 13 4 4 4 9 4 9 4 9 4 9 4 9 4 9 4 7 7 9 4 4 4 124 */
+/*:ref: zlacn2_ 14 6 4 9 9 7 4 4 */
+/*:ref: zscal_ 14 4 4 9 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.c
new file mode 100644
index 0000000000000000000000000000000000000000..07a265e4b015930566b822368449b07b65176ab3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.c
@@ -0,0 +1,974 @@
+/* lapack/complex16/ztgsen.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+
+/*< >*/
+/* Subroutine */ int ztgsen_(integer *ijob, logical *wantq, logical *wantz,
+ logical *select, integer *n, doublecomplex *a, integer *lda,
+ doublecomplex *b, integer *ldb, doublecomplex *alpha, doublecomplex *
+ beta, doublecomplex *q, integer *ldq, doublecomplex *z__, integer *
+ ldz, integer *m, doublereal *pl, doublereal *pr, doublereal *dif,
+ doublecomplex *work, integer *lwork, integer *iwork, integer *liwork,
+ integer *info)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, b_dim1, b_offset, q_dim1, q_offset, z_dim1,
+ z_offset, i__1, i__2, i__3;
+ doublecomplex z__1, z__2;
+
+ /* Builtin functions */
+ double sqrt(doublereal), z_abs(doublecomplex *);
+ void d_cnjg(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ integer i__, k, n1, n2, ks, mn2, ijb, kase, ierr;
+ doublereal dsum;
+ logical swap;
+ doublecomplex temp1, temp2;
+ integer isave[3];
+ extern /* Subroutine */ int zscal_(integer *, doublecomplex *,
+ doublecomplex *, integer *);
+ logical wantd;
+ integer lwmin;
+ logical wantp;
+ extern /* Subroutine */ int zlacn2_(integer *, doublecomplex *,
+ doublecomplex *, doublereal *, integer *, integer *);
+ logical wantd1, wantd2;
+ extern doublereal dlamch_(char *, ftnlen);
+ doublereal dscale, rdscal, safmin;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+ integer liwmin;
+ extern /* Subroutine */ int zlacpy_(char *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *, ftnlen),
+ ztgexc_(logical *, logical *, integer *, doublecomplex *, integer
+ *, doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, integer *, integer *, integer *),
+ zlassq_(integer *, doublecomplex *, integer *, doublereal *,
+ doublereal *);
+ logical lquery;
+ extern /* Subroutine */ int ztgsyl_(char *, integer *, integer *, integer
+ *, doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublereal *, doublereal *, doublecomplex *, integer *, integer *,
+ integer *, ftnlen);
+
+
+/* -- LAPACK routine (version 3.2.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* January 2007 */
+
+/* Modified to call ZLACN2 in place of ZLACON, 10 Feb 03, SJH. */
+
+/* .. Scalar Arguments .. */
+/*< LOGICAL WANTQ, WANTZ >*/
+/*< >*/
+/*< DOUBLE PRECISION PL, PR >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< LOGICAL SELECT( * ) >*/
+/*< INTEGER IWORK( * ) >*/
+/*< DOUBLE PRECISION DIF( * ) >*/
+/*< >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZTGSEN reorders the generalized Schur decomposition of a complex */
+/* matrix pair (A, B) (in terms of an unitary equivalence trans- */
+/* formation Q' * (A, B) * Z), so that a selected cluster of eigenvalues */
+/* appears in the leading diagonal blocks of the pair (A,B). The leading */
+/* columns of Q and Z form unitary bases of the corresponding left and */
+/* right eigenspaces (deflating subspaces). (A, B) must be in */
+/* generalized Schur canonical form, that is, A and B are both upper */
+/* triangular. */
+
+/* ZTGSEN also computes the generalized eigenvalues */
+
+/* w(j)= ALPHA(j) / BETA(j) */
+
+/* of the reordered matrix pair (A, B). */
+
+/* Optionally, the routine computes estimates of reciprocal condition */
+/* numbers for eigenvalues and eigenspaces. These are Difu[(A11,B11), */
+/* (A22,B22)] and Difl[(A11,B11), (A22,B22)], i.e. the separation(s) */
+/* between the matrix pairs (A11, B11) and (A22,B22) that correspond to */
+/* the selected cluster and the eigenvalues outside the cluster, resp., */
+/* and norms of "projections" onto left and right eigenspaces w.r.t. */
+/* the selected cluster in the (1,1)-block. */
+
+
+/* Arguments */
+/* ========= */
+
+/* IJOB (input) integer */
+/* Specifies whether condition numbers are required for the */
+/* cluster of eigenvalues (PL and PR) or the deflating subspaces */
+/* (Difu and Difl): */
+/* =0: Only reorder w.r.t. SELECT. No extras. */
+/* =1: Reciprocal of norms of "projections" onto left and right */
+/* eigenspaces w.r.t. the selected cluster (PL and PR). */
+/* =2: Upper bounds on Difu and Difl. F-norm-based estimate */
+/* (DIF(1:2)). */
+/* =3: Estimate of Difu and Difl. 1-norm-based estimate */
+/* (DIF(1:2)). */
+/* About 5 times as expensive as IJOB = 2. */
+/* =4: Compute PL, PR and DIF (i.e. 0, 1 and 2 above): Economic */
+/* version to get it all. */
+/* =5: Compute PL, PR and DIF (i.e. 0, 1 and 3 above) */
+
+/* WANTQ (input) LOGICAL */
+/* .TRUE. : update the left transformation matrix Q; */
+/* .FALSE.: do not update Q. */
+
+/* WANTZ (input) LOGICAL */
+/* .TRUE. : update the right transformation matrix Z; */
+/* .FALSE.: do not update Z. */
+
+/* SELECT (input) LOGICAL array, dimension (N) */
+/* SELECT specifies the eigenvalues in the selected cluster. To */
+/* select an eigenvalue w(j), SELECT(j) must be set to */
+/* .TRUE.. */
+
+/* N (input) INTEGER */
+/* The order of the matrices A and B. N >= 0. */
+
+/* A (input/output) COMPLEX*16 array, dimension(LDA,N) */
+/* On entry, the upper triangular matrix A, in generalized */
+/* Schur canonical form. */
+/* On exit, A is overwritten by the reordered matrix A. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,N). */
+
+/* B (input/output) COMPLEX*16 array, dimension(LDB,N) */
+/* On entry, the upper triangular matrix B, in generalized */
+/* Schur canonical form. */
+/* On exit, B is overwritten by the reordered matrix B. */
+
+/* LDB (input) INTEGER */
+/* The leading dimension of the array B. LDB >= max(1,N). */
+
+/* ALPHA (output) COMPLEX*16 array, dimension (N) */
+/* BETA (output) COMPLEX*16 array, dimension (N) */
+/* The diagonal elements of A and B, respectively, */
+/* when the pair (A,B) has been reduced to generalized Schur */
+/* form. ALPHA(i)/BETA(i) i=1,...,N are the generalized */
+/* eigenvalues. */
+
+/* Q (input/output) COMPLEX*16 array, dimension (LDQ,N) */
+/* On entry, if WANTQ = .TRUE., Q is an N-by-N matrix. */
+/* On exit, Q has been postmultiplied by the left unitary */
+/* transformation matrix which reorder (A, B); The leading M */
+/* columns of Q form orthonormal bases for the specified pair of */
+/* left eigenspaces (deflating subspaces). */
+/* If WANTQ = .FALSE., Q is not referenced. */
+
+/* LDQ (input) INTEGER */
+/* The leading dimension of the array Q. LDQ >= 1. */
+/* If WANTQ = .TRUE., LDQ >= N. */
+
+/* Z (input/output) COMPLEX*16 array, dimension (LDZ,N) */
+/* On entry, if WANTZ = .TRUE., Z is an N-by-N matrix. */
+/* On exit, Z has been postmultiplied by the left unitary */
+/* transformation matrix which reorder (A, B); The leading M */
+/* columns of Z form orthonormal bases for the specified pair of */
+/* left eigenspaces (deflating subspaces). */
+/* If WANTZ = .FALSE., Z is not referenced. */
+
+/* LDZ (input) INTEGER */
+/* The leading dimension of the array Z. LDZ >= 1. */
+/* If WANTZ = .TRUE., LDZ >= N. */
+
+/* M (output) INTEGER */
+/* The dimension of the specified pair of left and right */
+/* eigenspaces, (deflating subspaces) 0 <= M <= N. */
+
+/* PL (output) DOUBLE PRECISION */
+/* PR (output) DOUBLE PRECISION */
+/* If IJOB = 1, 4 or 5, PL, PR are lower bounds on the */
+/* reciprocal of the norm of "projections" onto left and right */
+/* eigenspace with respect to the selected cluster. */
+/* 0 < PL, PR <= 1. */
+/* If M = 0 or M = N, PL = PR = 1. */
+/* If IJOB = 0, 2 or 3 PL, PR are not referenced. */
+
+/* DIF (output) DOUBLE PRECISION array, dimension (2). */
+/* If IJOB >= 2, DIF(1:2) store the estimates of Difu and Difl. */
+/* If IJOB = 2 or 4, DIF(1:2) are F-norm-based upper bounds on */
+/* Difu and Difl. If IJOB = 3 or 5, DIF(1:2) are 1-norm-based */
+/* estimates of Difu and Difl, computed using reversed */
+/* communication with ZLACN2. */
+/* If M = 0 or N, DIF(1:2) = F-norm([A, B]). */
+/* If IJOB = 0 or 1, DIF is not referenced. */
+
+/* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK)) */
+/* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
+
+/* LWORK (input) INTEGER */
+/* The dimension of the array WORK. LWORK >= 1 */
+/* If IJOB = 1, 2 or 4, LWORK >= 2*M*(N-M) */
+/* If IJOB = 3 or 5, LWORK >= 4*M*(N-M) */
+
+/* If LWORK = -1, then a workspace query is assumed; the routine */
+/* only calculates the optimal size of the WORK array, returns */
+/* this value as the first entry of the WORK array, and no error */
+/* message related to LWORK is issued by XERBLA. */
+
+/* IWORK (workspace/output) INTEGER array, dimension (MAX(1,LIWORK)) */
+/* On exit, if INFO = 0, IWORK(1) returns the optimal LIWORK. */
+
+/* LIWORK (input) INTEGER */
+/* The dimension of the array IWORK. LIWORK >= 1. */
+/* If IJOB = 1, 2 or 4, LIWORK >= N+2; */
+/* If IJOB = 3 or 5, LIWORK >= MAX(N+2, 2*M*(N-M)); */
+
+/* If LIWORK = -1, then a workspace query is assumed; the */
+/* routine only calculates the optimal size of the IWORK array, */
+/* returns this value as the first entry of the IWORK array, and */
+/* no error message related to LIWORK is issued by XERBLA. */
+
+/* INFO (output) INTEGER */
+/* =0: Successful exit. */
+/* <0: If INFO = -i, the i-th argument had an illegal value. */
+/* =1: Reordering of (A, B) failed because the transformed */
+/* matrix pair (A, B) would be too far from generalized */
+/* Schur form; the problem is very ill-conditioned. */
+/* (A, B) may have been partially reordered. */
+/* If requested, 0 is returned in DIF(*), PL and PR. */
+
+
+/* Further Details */
+/* =============== */
+
+/* ZTGSEN first collects the selected eigenvalues by computing unitary */
+/* U and W that move them to the top left corner of (A, B). In other */
+/* words, the selected eigenvalues are the eigenvalues of (A11, B11) in */
+
+/* U'*(A, B)*W = (A11 A12) (B11 B12) n1 */
+/* ( 0 A22),( 0 B22) n2 */
+/* n1 n2 n1 n2 */
+
+/* where N = n1+n2 and U' means the conjugate transpose of U. The first */
+/* n1 columns of U and W span the specified pair of left and right */
+/* eigenspaces (deflating subspaces) of (A, B). */
+
+/* If (A, B) has been obtained from the generalized real Schur */
+/* decomposition of a matrix pair (C, D) = Q*(A, B)*Z', then the */
+/* reordered generalized Schur form of (C, D) is given by */
+
+/* (C, D) = (Q*U)*(U'*(A, B)*W)*(Z*W)', */
+
+/* and the first n1 columns of Q*U and Z*W span the corresponding */
+/* deflating subspaces of (C, D) (Q and Z store Q*U and Z*W, resp.). */
+
+/* Note that if the selected eigenvalue is sufficiently ill-conditioned, */
+/* then its value may differ significantly from its value before */
+/* reordering. */
+
+/* The reciprocal condition numbers of the left and right eigenspaces */
+/* spanned by the first n1 columns of U and W (or Q*U and Z*W) may */
+/* be returned in DIF(1:2), corresponding to Difu and Difl, resp. */
+
+/* The Difu and Difl are defined as: */
+
+/* Difu[(A11, B11), (A22, B22)] = sigma-min( Zu ) */
+/* and */
+/* Difl[(A11, B11), (A22, B22)] = Difu[(A22, B22), (A11, B11)], */
+
+/* where sigma-min(Zu) is the smallest singular value of the */
+/* (2*n1*n2)-by-(2*n1*n2) matrix */
+
+/* Zu = [ kron(In2, A11) -kron(A22', In1) ] */
+/* [ kron(In2, B11) -kron(B22', In1) ]. */
+
+/* Here, Inx is the identity matrix of size nx and A22' is the */
+/* transpose of A22. kron(X, Y) is the Kronecker product between */
+/* the matrices X and Y. */
+
+/* When DIF(2) is small, small changes in (A, B) can cause large changes */
+/* in the deflating subspace. An approximate (asymptotic) bound on the */
+/* maximum angular error in the computed deflating subspaces is */
+
+/* EPS * norm((A, B)) / DIF(2), */
+
+/* where EPS is the machine precision. */
+
+/* The reciprocal norm of the projectors on the left and right */
+/* eigenspaces associated with (A11, B11) may be returned in PL and PR. */
+/* They are computed as follows. First we compute L and R so that */
+/* P*(A, B)*Q is block diagonal, where */
+
+/* P = ( I -L ) n1 Q = ( I R ) n1 */
+/* ( 0 I ) n2 and ( 0 I ) n2 */
+/* n1 n2 n1 n2 */
+
+/* and (L, R) is the solution to the generalized Sylvester equation */
+
+/* A11*R - L*A22 = -A12 */
+/* B11*R - L*B22 = -B12 */
+
+/* Then PL = (F-norm(L)**2+1)**(-1/2) and PR = (F-norm(R)**2+1)**(-1/2). */
+/* An approximate (asymptotic) bound on the average absolute error of */
+/* the selected eigenvalues is */
+
+/* EPS * norm((A, B)) / PL. */
+
+/* There are also global error bounds which valid for perturbations up */
+/* to a certain restriction: A lower bound (x) on the smallest */
+/* F-norm(E,F) for which an eigenvalue of (A11, B11) may move and */
+/* coalesce with an eigenvalue of (A22, B22) under perturbation (E,F), */
+/* (i.e. (A + E, B + F), is */
+
+/* x = min(Difu,Difl)/((1/(PL*PL)+1/(PR*PR))**(1/2)+2*max(1/PL,1/PR)). */
+
+/* An approximate bound on x can be computed from DIF(1:2), PL and PR. */
+
+/* If y = ( F-norm(E,F) / x) <= 1, the angles between the perturbed */
+/* (L', R') and unperturbed (L, R) left and right deflating subspaces */
+/* associated with the selected cluster in the (1,1)-blocks can be */
+/* bounded as */
+
+/* max-angle(L, L') <= arctan( y * PL / (1 - y * (1 - PL * PL)**(1/2)) */
+/* max-angle(R, R') <= arctan( y * PR / (1 - y * (1 - PR * PR)**(1/2)) */
+
+/* See LAPACK User's Guide section 4.11 or the following references */
+/* for more information. */
+
+/* Note that if the default method for computing the Frobenius-norm- */
+/* based estimate DIF is not wanted (see ZLATDF), then the parameter */
+/* IDIFJB (see below) should be changed from 3 to 4 (routine ZLATDF */
+/* (IJOB = 2 will be used)). See ZTGSYL for more details. */
+
+/* Based on contributions by */
+/* Bo Kagstrom and Peter Poromaa, Department of Computing Science, */
+/* Umea University, S-901 87 Umea, Sweden. */
+
+/* References */
+/* ========== */
+
+/* [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the */
+/* Generalized Real Schur Form of a Regular Matrix Pair (A, B), in */
+/* M.S. Moonen et al (eds), Linear Algebra for Large Scale and */
+/* Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218. */
+
+/* [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified */
+/* Eigenvalues of a Regular Matrix Pair (A, B) and Condition */
+/* Estimation: Theory, Algorithms and Software, Report */
+/* UMINF - 94.04, Department of Computing Science, Umea University, */
+/* S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87. */
+/* To appear in Numerical Algorithms, 1996. */
+
+/* [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software */
+/* for Solving the Generalized Sylvester Equation and Estimating the */
+/* Separation between Regular Matrix Pairs, Report UMINF - 93.23, */
+/* Department of Computing Science, Umea University, S-901 87 Umea, */
+/* Sweden, December 1993, Revised April 1994, Also as LAPACK working */
+/* Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1, */
+/* 1996. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< INTEGER IDIFJB >*/
+/*< PARAMETER ( IDIFJB = 3 ) >*/
+/*< DOUBLE PRECISION ZERO, ONE >*/
+/*< PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL LQUERY, SWAP, WANTD, WANTD1, WANTD2, WANTP >*/
+/*< >*/
+/*< DOUBLE PRECISION DSCALE, DSUM, RDSCAL, SAFMIN >*/
+/*< COMPLEX*16 TEMP1, TEMP2 >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< INTEGER ISAVE( 3 ) >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, DCMPLX, DCONJG, MAX, SQRT >*/
+/* .. */
+/* .. External Functions .. */
+/*< DOUBLE PRECISION DLAMCH >*/
+/*< EXTERNAL DLAMCH >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Decode and test the input parameters */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ --select;
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ b_dim1 = *ldb;
+ b_offset = 1 + b_dim1;
+ b -= b_offset;
+ --alpha;
+ --beta;
+ q_dim1 = *ldq;
+ q_offset = 1 + q_dim1;
+ q -= q_offset;
+ z_dim1 = *ldz;
+ z_offset = 1 + z_dim1;
+ z__ -= z_offset;
+ --dif;
+ --work;
+ --iwork;
+
+ /* Function Body */
+ *info = 0;
+/*< LQUERY = ( LWORK.EQ.-1 .OR. LIWORK.EQ.-1 ) >*/
+ lquery = *lwork == -1 || *liwork == -1;
+
+/*< IF( IJOB.LT.0 .OR. IJOB.GT.5 ) THEN >*/
+ if (*ijob < 0 || *ijob > 5) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( LDA.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*lda < max(1,*n)) {
+/*< INFO = -7 >*/
+ *info = -7;
+/*< ELSE IF( LDB.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldb < max(1,*n)) {
+/*< INFO = -9 >*/
+ *info = -9;
+/*< ELSE IF( LDQ.LT.1 .OR. ( WANTQ .AND. LDQ.LT.N ) ) THEN >*/
+ } else if (*ldq < 1 || (*wantq && *ldq < *n)) {
+/*< INFO = -13 >*/
+ *info = -13;
+/*< ELSE IF( LDZ.LT.1 .OR. ( WANTZ .AND. LDZ.LT.N ) ) THEN >*/
+ } else if (*ldz < 1 || (*wantz && *ldz < *n)) {
+/*< INFO = -15 >*/
+ *info = -15;
+/*< END IF >*/
+ }
+
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZTGSEN', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZTGSEN", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< IERR = 0 >*/
+ ierr = 0;
+
+/*< WANTP = IJOB.EQ.1 .OR. IJOB.GE.4 >*/
+ wantp = *ijob == 1 || *ijob >= 4;
+/*< WANTD1 = IJOB.EQ.2 .OR. IJOB.EQ.4 >*/
+ wantd1 = *ijob == 2 || *ijob == 4;
+/*< WANTD2 = IJOB.EQ.3 .OR. IJOB.EQ.5 >*/
+ wantd2 = *ijob == 3 || *ijob == 5;
+/*< WANTD = WANTD1 .OR. WANTD2 >*/
+ wantd = wantd1 || wantd2;
+
+/* Set M to the dimension of the specified pair of deflating */
+/* subspaces. */
+
+/*< M = 0 >*/
+ *m = 0;
+/*< DO 10 K = 1, N >*/
+ i__1 = *n;
+ for (k = 1; k <= i__1; ++k) {
+/*< ALPHA( K ) = A( K, K ) >*/
+ i__2 = k;
+ i__3 = k + k * a_dim1;
+ alpha[i__2].r = a[i__3].r, alpha[i__2].i = a[i__3].i;
+/*< BETA( K ) = B( K, K ) >*/
+ i__2 = k;
+ i__3 = k + k * b_dim1;
+ beta[i__2].r = b[i__3].r, beta[i__2].i = b[i__3].i;
+/*< IF( K.LT.N ) THEN >*/
+ if (k < *n) {
+/*< >*/
+ if (select[k]) {
+ ++(*m);
+ }
+/*< ELSE >*/
+ } else {
+/*< >*/
+ if (select[*n]) {
+ ++(*m);
+ }
+/*< END IF >*/
+ }
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+
+/*< IF( IJOB.EQ.1 .OR. IJOB.EQ.2 .OR. IJOB.EQ.4 ) THEN >*/
+ if (*ijob == 1 || *ijob == 2 || *ijob == 4) {
+/*< LWMIN = MAX( 1, 2*M*( N-M ) ) >*/
+/* Computing MAX */
+ i__1 = 1, i__2 = (*m << 1) * (*n - *m);
+ lwmin = max(i__1,i__2);
+/*< LIWMIN = MAX( 1, N+2 ) >*/
+/* Computing MAX */
+ i__1 = 1, i__2 = *n + 2;
+ liwmin = max(i__1,i__2);
+/*< ELSE IF( IJOB.EQ.3 .OR. IJOB.EQ.5 ) THEN >*/
+ } else if (*ijob == 3 || *ijob == 5) {
+/*< LWMIN = MAX( 1, 4*M*( N-M ) ) >*/
+/* Computing MAX */
+ i__1 = 1, i__2 = (*m << 2) * (*n - *m);
+ lwmin = max(i__1,i__2);
+/*< LIWMIN = MAX( 1, 2*M*( N-M ), N+2 ) >*/
+/* Computing MAX */
+ i__1 = 1, i__2 = (*m << 1) * (*n - *m), i__1 = max(i__1,i__2), i__2 =
+ *n + 2;
+ liwmin = max(i__1,i__2);
+/*< ELSE >*/
+ } else {
+/*< LWMIN = 1 >*/
+ lwmin = 1;
+/*< LIWMIN = 1 >*/
+ liwmin = 1;
+/*< END IF >*/
+ }
+
+/*< WORK( 1 ) = LWMIN >*/
+ work[1].r = (doublereal) lwmin, work[1].i = 0.;
+/*< IWORK( 1 ) = LIWMIN >*/
+ iwork[1] = liwmin;
+
+/*< IF( LWORK.LT.LWMIN .AND. .NOT.LQUERY ) THEN >*/
+ if (*lwork < lwmin && ! lquery) {
+/*< INFO = -21 >*/
+ *info = -21;
+/*< ELSE IF( LIWORK.LT.LIWMIN .AND. .NOT.LQUERY ) THEN >*/
+ } else if (*liwork < liwmin && ! lquery) {
+/*< INFO = -23 >*/
+ *info = -23;
+/*< END IF >*/
+ }
+
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZTGSEN', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZTGSEN", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< ELSE IF( LQUERY ) THEN >*/
+ } else if (lquery) {
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible. */
+
+/*< IF( M.EQ.N .OR. M.EQ.0 ) THEN >*/
+ if (*m == *n || *m == 0) {
+/*< IF( WANTP ) THEN >*/
+ if (wantp) {
+/*< PL = ONE >*/
+ *pl = 1.;
+/*< PR = ONE >*/
+ *pr = 1.;
+/*< END IF >*/
+ }
+/*< IF( WANTD ) THEN >*/
+ if (wantd) {
+/*< DSCALE = ZERO >*/
+ dscale = 0.;
+/*< DSUM = ONE >*/
+ dsum = 1.;
+/*< DO 20 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< CALL ZLASSQ( N, A( 1, I ), 1, DSCALE, DSUM ) >*/
+ zlassq_(n, &a[i__ * a_dim1 + 1], &c__1, &dscale, &dsum);
+/*< CALL ZLASSQ( N, B( 1, I ), 1, DSCALE, DSUM ) >*/
+ zlassq_(n, &b[i__ * b_dim1 + 1], &c__1, &dscale, &dsum);
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< DIF( 1 ) = DSCALE*SQRT( DSUM ) >*/
+ dif[1] = dscale * sqrt(dsum);
+/*< DIF( 2 ) = DIF( 1 ) >*/
+ dif[2] = dif[1];
+/*< END IF >*/
+ }
+/*< GO TO 70 >*/
+ goto L70;
+/*< END IF >*/
+ }
+
+/* Get machine constant */
+
+/*< SAFMIN = DLAMCH( 'S' ) >*/
+ safmin = dlamch_("S", (ftnlen)1);
+
+/* Collect the selected blocks at the top-left corner of (A, B). */
+
+/*< KS = 0 >*/
+ ks = 0;
+/*< DO 30 K = 1, N >*/
+ i__1 = *n;
+ for (k = 1; k <= i__1; ++k) {
+/*< SWAP = SELECT( K ) >*/
+ swap = select[k];
+/*< IF( SWAP ) THEN >*/
+ if (swap) {
+/*< KS = KS + 1 >*/
+ ++ks;
+
+/* Swap the K-th block to position KS. Compute unitary Q */
+/* and Z that will swap adjacent diagonal blocks in (A, B). */
+
+/*< >*/
+ if (k != ks) {
+ ztgexc_(wantq, wantz, n, &a[a_offset], lda, &b[b_offset], ldb,
+ &q[q_offset], ldq, &z__[z_offset], ldz, &k, &ks, &
+ ierr);
+ }
+
+/*< IF( IERR.GT.0 ) THEN >*/
+ if (ierr > 0) {
+
+/* Swap is rejected: exit. */
+
+/*< INFO = 1 >*/
+ *info = 1;
+/*< IF( WANTP ) THEN >*/
+ if (wantp) {
+/*< PL = ZERO >*/
+ *pl = 0.;
+/*< PR = ZERO >*/
+ *pr = 0.;
+/*< END IF >*/
+ }
+/*< IF( WANTD ) THEN >*/
+ if (wantd) {
+/*< DIF( 1 ) = ZERO >*/
+ dif[1] = 0.;
+/*< DIF( 2 ) = ZERO >*/
+ dif[2] = 0.;
+/*< END IF >*/
+ }
+/*< GO TO 70 >*/
+ goto L70;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< IF( WANTP ) THEN >*/
+ if (wantp) {
+
+/* Solve generalized Sylvester equation for R and L: */
+/* A11 * R - L * A22 = A12 */
+/* B11 * R - L * B22 = B12 */
+
+/*< N1 = M >*/
+ n1 = *m;
+/*< N2 = N - M >*/
+ n2 = *n - *m;
+/*< I = N1 + 1 >*/
+ i__ = n1 + 1;
+/*< CALL ZLACPY( 'Full', N1, N2, A( 1, I ), LDA, WORK, N1 ) >*/
+ zlacpy_("Full", &n1, &n2, &a[i__ * a_dim1 + 1], lda, &work[1], &n1, (
+ ftnlen)4);
+/*< >*/
+ zlacpy_("Full", &n1, &n2, &b[i__ * b_dim1 + 1], ldb, &work[n1 * n2 +
+ 1], &n1, (ftnlen)4);
+/*< IJB = 0 >*/
+ ijb = 0;
+/*< >*/
+ i__1 = *lwork - (n1 << 1) * n2;
+ ztgsyl_("N", &ijb, &n1, &n2, &a[a_offset], lda, &a[i__ + i__ * a_dim1]
+ , lda, &work[1], &n1, &b[b_offset], ldb, &b[i__ + i__ *
+ b_dim1], ldb, &work[n1 * n2 + 1], &n1, &dscale, &dif[1], &
+ work[(n1 * n2 << 1) + 1], &i__1, &iwork[1], &ierr, (ftnlen)1);
+
+/* Estimate the reciprocal of norms of "projections" onto */
+/* left and right eigenspaces */
+
+/*< RDSCAL = ZERO >*/
+ rdscal = 0.;
+/*< DSUM = ONE >*/
+ dsum = 1.;
+/*< CALL ZLASSQ( N1*N2, WORK, 1, RDSCAL, DSUM ) >*/
+ i__1 = n1 * n2;
+ zlassq_(&i__1, &work[1], &c__1, &rdscal, &dsum);
+/*< PL = RDSCAL*SQRT( DSUM ) >*/
+ *pl = rdscal * sqrt(dsum);
+/*< IF( PL.EQ.ZERO ) THEN >*/
+ if (*pl == 0.) {
+/*< PL = ONE >*/
+ *pl = 1.;
+/*< ELSE >*/
+ } else {
+/*< PL = DSCALE / ( SQRT( DSCALE*DSCALE / PL+PL )*SQRT( PL ) ) >*/
+ *pl = dscale / (sqrt(dscale * dscale / *pl + *pl) * sqrt(*pl));
+/*< END IF >*/
+ }
+/*< RDSCAL = ZERO >*/
+ rdscal = 0.;
+/*< DSUM = ONE >*/
+ dsum = 1.;
+/*< CALL ZLASSQ( N1*N2, WORK( N1*N2+1 ), 1, RDSCAL, DSUM ) >*/
+ i__1 = n1 * n2;
+ zlassq_(&i__1, &work[n1 * n2 + 1], &c__1, &rdscal, &dsum);
+/*< PR = RDSCAL*SQRT( DSUM ) >*/
+ *pr = rdscal * sqrt(dsum);
+/*< IF( PR.EQ.ZERO ) THEN >*/
+ if (*pr == 0.) {
+/*< PR = ONE >*/
+ *pr = 1.;
+/*< ELSE >*/
+ } else {
+/*< PR = DSCALE / ( SQRT( DSCALE*DSCALE / PR+PR )*SQRT( PR ) ) >*/
+ *pr = dscale / (sqrt(dscale * dscale / *pr + *pr) * sqrt(*pr));
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< IF( WANTD ) THEN >*/
+ if (wantd) {
+
+/* Compute estimates Difu and Difl. */
+
+/*< IF( WANTD1 ) THEN >*/
+ if (wantd1) {
+/*< N1 = M >*/
+ n1 = *m;
+/*< N2 = N - M >*/
+ n2 = *n - *m;
+/*< I = N1 + 1 >*/
+ i__ = n1 + 1;
+/*< IJB = IDIFJB >*/
+ ijb = 3;
+
+/* Frobenius norm-based Difu estimate. */
+
+/*< >*/
+ i__1 = *lwork - (n1 << 1) * n2;
+ ztgsyl_("N", &ijb, &n1, &n2, &a[a_offset], lda, &a[i__ + i__ *
+ a_dim1], lda, &work[1], &n1, &b[b_offset], ldb, &b[i__ +
+ i__ * b_dim1], ldb, &work[n1 * n2 + 1], &n1, &dscale, &
+ dif[1], &work[(n1 * n2 << 1) + 1], &i__1, &iwork[1], &
+ ierr, (ftnlen)1);
+
+/* Frobenius norm-based Difl estimate. */
+
+/*< >*/
+ i__1 = *lwork - (n1 << 1) * n2;
+ ztgsyl_("N", &ijb, &n2, &n1, &a[i__ + i__ * a_dim1], lda, &a[
+ a_offset], lda, &work[1], &n2, &b[i__ + i__ * b_dim1],
+ ldb, &b[b_offset], ldb, &work[n1 * n2 + 1], &n2, &dscale,
+ &dif[2], &work[(n1 * n2 << 1) + 1], &i__1, &iwork[1], &
+ ierr, (ftnlen)1);
+/*< ELSE >*/
+ } else {
+
+/* Compute 1-norm-based estimates of Difu and Difl using */
+/* reversed communication with ZLACN2. In each step a */
+/* generalized Sylvester equation or a transposed variant */
+/* is solved. */
+
+/*< KASE = 0 >*/
+ kase = 0;
+/*< N1 = M >*/
+ n1 = *m;
+/*< N2 = N - M >*/
+ n2 = *n - *m;
+/*< I = N1 + 1 >*/
+ i__ = n1 + 1;
+/*< IJB = 0 >*/
+ ijb = 0;
+/*< MN2 = 2*N1*N2 >*/
+ mn2 = (n1 << 1) * n2;
+
+/* 1-norm-based estimate of Difu. */
+
+/*< 40 CONTINUE >*/
+L40:
+/*< >*/
+ zlacn2_(&mn2, &work[mn2 + 1], &work[1], &dif[1], &kase, isave);
+/*< IF( KASE.NE.0 ) THEN >*/
+ if (kase != 0) {
+/*< IF( KASE.EQ.1 ) THEN >*/
+ if (kase == 1) {
+
+/* Solve generalized Sylvester equation */
+
+/*< >*/
+ i__1 = *lwork - (n1 << 1) * n2;
+ ztgsyl_("N", &ijb, &n1, &n2, &a[a_offset], lda, &a[i__ +
+ i__ * a_dim1], lda, &work[1], &n1, &b[b_offset],
+ ldb, &b[i__ + i__ * b_dim1], ldb, &work[n1 * n2 +
+ 1], &n1, &dscale, &dif[1], &work[(n1 * n2 << 1) +
+ 1], &i__1, &iwork[1], &ierr, (ftnlen)1);
+/*< ELSE >*/
+ } else {
+
+/* Solve the transposed variant. */
+
+/*< >*/
+ i__1 = *lwork - (n1 << 1) * n2;
+ ztgsyl_("C", &ijb, &n1, &n2, &a[a_offset], lda, &a[i__ +
+ i__ * a_dim1], lda, &work[1], &n1, &b[b_offset],
+ ldb, &b[i__ + i__ * b_dim1], ldb, &work[n1 * n2 +
+ 1], &n1, &dscale, &dif[1], &work[(n1 * n2 << 1) +
+ 1], &i__1, &iwork[1], &ierr, (ftnlen)1);
+/*< END IF >*/
+ }
+/*< GO TO 40 >*/
+ goto L40;
+/*< END IF >*/
+ }
+/*< DIF( 1 ) = DSCALE / DIF( 1 ) >*/
+ dif[1] = dscale / dif[1];
+
+/* 1-norm-based estimate of Difl. */
+
+/*< 50 CONTINUE >*/
+L50:
+/*< >*/
+ zlacn2_(&mn2, &work[mn2 + 1], &work[1], &dif[2], &kase, isave);
+/*< IF( KASE.NE.0 ) THEN >*/
+ if (kase != 0) {
+/*< IF( KASE.EQ.1 ) THEN >*/
+ if (kase == 1) {
+
+/* Solve generalized Sylvester equation */
+
+/*< >*/
+ i__1 = *lwork - (n1 << 1) * n2;
+ ztgsyl_("N", &ijb, &n2, &n1, &a[i__ + i__ * a_dim1], lda,
+ &a[a_offset], lda, &work[1], &n2, &b[i__ + i__ *
+ b_dim1], ldb, &b[b_offset], ldb, &work[n1 * n2 +
+ 1], &n2, &dscale, &dif[2], &work[(n1 * n2 << 1) +
+ 1], &i__1, &iwork[1], &ierr, (ftnlen)1);
+/*< ELSE >*/
+ } else {
+
+/* Solve the transposed variant. */
+
+/*< >*/
+ i__1 = *lwork - (n1 << 1) * n2;
+ ztgsyl_("C", &ijb, &n2, &n1, &a[i__ + i__ * a_dim1], lda,
+ &a[a_offset], lda, &work[1], &n2, &b[b_offset],
+ ldb, &b[i__ + i__ * b_dim1], ldb, &work[n1 * n2 +
+ 1], &n2, &dscale, &dif[2], &work[(n1 * n2 << 1) +
+ 1], &i__1, &iwork[1], &ierr, (ftnlen)1);
+/*< END IF >*/
+ }
+/*< GO TO 50 >*/
+ goto L50;
+/*< END IF >*/
+ }
+/*< DIF( 2 ) = DSCALE / DIF( 2 ) >*/
+ dif[2] = dscale / dif[2];
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/* If B(K,K) is complex, make it real and positive (normalization */
+/* of the generalized Schur form) and Store the generalized */
+/* eigenvalues of reordered pair (A, B) */
+
+/*< DO 60 K = 1, N >*/
+ i__1 = *n;
+ for (k = 1; k <= i__1; ++k) {
+/*< DSCALE = ABS( B( K, K ) ) >*/
+ dscale = z_abs(&b[k + k * b_dim1]);
+/*< IF( DSCALE.GT.SAFMIN ) THEN >*/
+ if (dscale > safmin) {
+/*< TEMP1 = DCONJG( B( K, K ) / DSCALE ) >*/
+ i__2 = k + k * b_dim1;
+ z__2.r = b[i__2].r / dscale, z__2.i = b[i__2].i / dscale;
+ d_cnjg(&z__1, &z__2);
+ temp1.r = z__1.r, temp1.i = z__1.i;
+/*< TEMP2 = B( K, K ) / DSCALE >*/
+ i__2 = k + k * b_dim1;
+ z__1.r = b[i__2].r / dscale, z__1.i = b[i__2].i / dscale;
+ temp2.r = z__1.r, temp2.i = z__1.i;
+/*< B( K, K ) = DSCALE >*/
+ i__2 = k + k * b_dim1;
+ b[i__2].r = dscale, b[i__2].i = 0.;
+/*< CALL ZSCAL( N-K, TEMP1, B( K, K+1 ), LDB ) >*/
+ i__2 = *n - k;
+ zscal_(&i__2, &temp1, &b[k + (k + 1) * b_dim1], ldb);
+/*< CALL ZSCAL( N-K+1, TEMP1, A( K, K ), LDA ) >*/
+ i__2 = *n - k + 1;
+ zscal_(&i__2, &temp1, &a[k + k * a_dim1], lda);
+/*< >*/
+ if (*wantq) {
+ zscal_(n, &temp2, &q[k * q_dim1 + 1], &c__1);
+ }
+/*< ELSE >*/
+ } else {
+/*< B( K, K ) = DCMPLX( ZERO, ZERO ) >*/
+ i__2 = k + k * b_dim1;
+ b[i__2].r = 0., b[i__2].i = 0.;
+/*< END IF >*/
+ }
+
+/*< ALPHA( K ) = A( K, K ) >*/
+ i__2 = k;
+ i__3 = k + k * a_dim1;
+ alpha[i__2].r = a[i__3].r, alpha[i__2].i = a[i__3].i;
+/*< BETA( K ) = B( K, K ) >*/
+ i__2 = k;
+ i__3 = k + k * b_dim1;
+ beta[i__2].r = b[i__3].r, beta[i__2].i = b[i__3].i;
+
+/*< 60 CONTINUE >*/
+/* L60: */
+ }
+
+/*< 70 CONTINUE >*/
+L70:
+
+/*< WORK( 1 ) = LWMIN >*/
+ work[1].r = (doublereal) lwmin, work[1].i = 0.;
+/*< IWORK( 1 ) = LIWMIN >*/
+ iwork[1] = liwmin;
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZTGSEN */
+
+/*< END >*/
+} /* ztgsen_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.f
new file mode 100644
index 0000000000000000000000000000000000000000..0e8736f5c8ec8517650f3b2cb22eba7c92fe83ed
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.f
@@ -0,0 +1,652 @@
+ SUBROUTINE ZTGSEN( IJOB, WANTQ, WANTZ, SELECT, N, A, LDA, B, LDB,
+ $ ALPHA, BETA, Q, LDQ, Z, LDZ, M, PL, PR, DIF,
+ $ WORK, LWORK, IWORK, LIWORK, INFO )
+*
+* -- LAPACK routine (version 3.2.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* January 2007
+*
+* Modified to call ZLACN2 in place of ZLACON, 10 Feb 03, SJH.
+*
+* .. Scalar Arguments ..
+ LOGICAL WANTQ, WANTZ
+ INTEGER IJOB, INFO, LDA, LDB, LDQ, LDZ, LIWORK, LWORK,
+ $ M, N
+ DOUBLE PRECISION PL, PR
+* ..
+* .. Array Arguments ..
+ LOGICAL SELECT( * )
+ INTEGER IWORK( * )
+ DOUBLE PRECISION DIF( * )
+ COMPLEX*16 A( LDA, * ), ALPHA( * ), B( LDB, * ),
+ $ BETA( * ), Q( LDQ, * ), WORK( * ), Z( LDZ, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZTGSEN reorders the generalized Schur decomposition of a complex
+* matrix pair (A, B) (in terms of an unitary equivalence trans-
+* formation Q' * (A, B) * Z), so that a selected cluster of eigenvalues
+* appears in the leading diagonal blocks of the pair (A,B). The leading
+* columns of Q and Z form unitary bases of the corresponding left and
+* right eigenspaces (deflating subspaces). (A, B) must be in
+* generalized Schur canonical form, that is, A and B are both upper
+* triangular.
+*
+* ZTGSEN also computes the generalized eigenvalues
+*
+* w(j)= ALPHA(j) / BETA(j)
+*
+* of the reordered matrix pair (A, B).
+*
+* Optionally, the routine computes estimates of reciprocal condition
+* numbers for eigenvalues and eigenspaces. These are Difu[(A11,B11),
+* (A22,B22)] and Difl[(A11,B11), (A22,B22)], i.e. the separation(s)
+* between the matrix pairs (A11, B11) and (A22,B22) that correspond to
+* the selected cluster and the eigenvalues outside the cluster, resp.,
+* and norms of "projections" onto left and right eigenspaces w.r.t.
+* the selected cluster in the (1,1)-block.
+*
+*
+* Arguments
+* =========
+*
+* IJOB (input) integer
+* Specifies whether condition numbers are required for the
+* cluster of eigenvalues (PL and PR) or the deflating subspaces
+* (Difu and Difl):
+* =0: Only reorder w.r.t. SELECT. No extras.
+* =1: Reciprocal of norms of "projections" onto left and right
+* eigenspaces w.r.t. the selected cluster (PL and PR).
+* =2: Upper bounds on Difu and Difl. F-norm-based estimate
+* (DIF(1:2)).
+* =3: Estimate of Difu and Difl. 1-norm-based estimate
+* (DIF(1:2)).
+* About 5 times as expensive as IJOB = 2.
+* =4: Compute PL, PR and DIF (i.e. 0, 1 and 2 above): Economic
+* version to get it all.
+* =5: Compute PL, PR and DIF (i.e. 0, 1 and 3 above)
+*
+* WANTQ (input) LOGICAL
+* .TRUE. : update the left transformation matrix Q;
+* .FALSE.: do not update Q.
+*
+* WANTZ (input) LOGICAL
+* .TRUE. : update the right transformation matrix Z;
+* .FALSE.: do not update Z.
+*
+* SELECT (input) LOGICAL array, dimension (N)
+* SELECT specifies the eigenvalues in the selected cluster. To
+* select an eigenvalue w(j), SELECT(j) must be set to
+* .TRUE..
+*
+* N (input) INTEGER
+* The order of the matrices A and B. N >= 0.
+*
+* A (input/output) COMPLEX*16 array, dimension(LDA,N)
+* On entry, the upper triangular matrix A, in generalized
+* Schur canonical form.
+* On exit, A is overwritten by the reordered matrix A.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,N).
+*
+* B (input/output) COMPLEX*16 array, dimension(LDB,N)
+* On entry, the upper triangular matrix B, in generalized
+* Schur canonical form.
+* On exit, B is overwritten by the reordered matrix B.
+*
+* LDB (input) INTEGER
+* The leading dimension of the array B. LDB >= max(1,N).
+*
+* ALPHA (output) COMPLEX*16 array, dimension (N)
+* BETA (output) COMPLEX*16 array, dimension (N)
+* The diagonal elements of A and B, respectively,
+* when the pair (A,B) has been reduced to generalized Schur
+* form. ALPHA(i)/BETA(i) i=1,...,N are the generalized
+* eigenvalues.
+*
+* Q (input/output) COMPLEX*16 array, dimension (LDQ,N)
+* On entry, if WANTQ = .TRUE., Q is an N-by-N matrix.
+* On exit, Q has been postmultiplied by the left unitary
+* transformation matrix which reorder (A, B); The leading M
+* columns of Q form orthonormal bases for the specified pair of
+* left eigenspaces (deflating subspaces).
+* If WANTQ = .FALSE., Q is not referenced.
+*
+* LDQ (input) INTEGER
+* The leading dimension of the array Q. LDQ >= 1.
+* If WANTQ = .TRUE., LDQ >= N.
+*
+* Z (input/output) COMPLEX*16 array, dimension (LDZ,N)
+* On entry, if WANTZ = .TRUE., Z is an N-by-N matrix.
+* On exit, Z has been postmultiplied by the left unitary
+* transformation matrix which reorder (A, B); The leading M
+* columns of Z form orthonormal bases for the specified pair of
+* left eigenspaces (deflating subspaces).
+* If WANTZ = .FALSE., Z is not referenced.
+*
+* LDZ (input) INTEGER
+* The leading dimension of the array Z. LDZ >= 1.
+* If WANTZ = .TRUE., LDZ >= N.
+*
+* M (output) INTEGER
+* The dimension of the specified pair of left and right
+* eigenspaces, (deflating subspaces) 0 <= M <= N.
+*
+* PL (output) DOUBLE PRECISION
+* PR (output) DOUBLE PRECISION
+* If IJOB = 1, 4 or 5, PL, PR are lower bounds on the
+* reciprocal of the norm of "projections" onto left and right
+* eigenspace with respect to the selected cluster.
+* 0 < PL, PR <= 1.
+* If M = 0 or M = N, PL = PR = 1.
+* If IJOB = 0, 2 or 3 PL, PR are not referenced.
+*
+* DIF (output) DOUBLE PRECISION array, dimension (2).
+* If IJOB >= 2, DIF(1:2) store the estimates of Difu and Difl.
+* If IJOB = 2 or 4, DIF(1:2) are F-norm-based upper bounds on
+* Difu and Difl. If IJOB = 3 or 5, DIF(1:2) are 1-norm-based
+* estimates of Difu and Difl, computed using reversed
+* communication with ZLACN2.
+* If M = 0 or N, DIF(1:2) = F-norm([A, B]).
+* If IJOB = 0 or 1, DIF is not referenced.
+*
+* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))
+* On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
+*
+* LWORK (input) INTEGER
+* The dimension of the array WORK. LWORK >= 1
+* If IJOB = 1, 2 or 4, LWORK >= 2*M*(N-M)
+* If IJOB = 3 or 5, LWORK >= 4*M*(N-M)
+*
+* If LWORK = -1, then a workspace query is assumed; the routine
+* only calculates the optimal size of the WORK array, returns
+* this value as the first entry of the WORK array, and no error
+* message related to LWORK is issued by XERBLA.
+*
+* IWORK (workspace/output) INTEGER array, dimension (MAX(1,LIWORK))
+* On exit, if INFO = 0, IWORK(1) returns the optimal LIWORK.
+*
+* LIWORK (input) INTEGER
+* The dimension of the array IWORK. LIWORK >= 1.
+* If IJOB = 1, 2 or 4, LIWORK >= N+2;
+* If IJOB = 3 or 5, LIWORK >= MAX(N+2, 2*M*(N-M));
+*
+* If LIWORK = -1, then a workspace query is assumed; the
+* routine only calculates the optimal size of the IWORK array,
+* returns this value as the first entry of the IWORK array, and
+* no error message related to LIWORK is issued by XERBLA.
+*
+* INFO (output) INTEGER
+* =0: Successful exit.
+* <0: If INFO = -i, the i-th argument had an illegal value.
+* =1: Reordering of (A, B) failed because the transformed
+* matrix pair (A, B) would be too far from generalized
+* Schur form; the problem is very ill-conditioned.
+* (A, B) may have been partially reordered.
+* If requested, 0 is returned in DIF(*), PL and PR.
+*
+*
+* Further Details
+* ===============
+*
+* ZTGSEN first collects the selected eigenvalues by computing unitary
+* U and W that move them to the top left corner of (A, B). In other
+* words, the selected eigenvalues are the eigenvalues of (A11, B11) in
+*
+* U'*(A, B)*W = (A11 A12) (B11 B12) n1
+* ( 0 A22),( 0 B22) n2
+* n1 n2 n1 n2
+*
+* where N = n1+n2 and U' means the conjugate transpose of U. The first
+* n1 columns of U and W span the specified pair of left and right
+* eigenspaces (deflating subspaces) of (A, B).
+*
+* If (A, B) has been obtained from the generalized real Schur
+* decomposition of a matrix pair (C, D) = Q*(A, B)*Z', then the
+* reordered generalized Schur form of (C, D) is given by
+*
+* (C, D) = (Q*U)*(U'*(A, B)*W)*(Z*W)',
+*
+* and the first n1 columns of Q*U and Z*W span the corresponding
+* deflating subspaces of (C, D) (Q and Z store Q*U and Z*W, resp.).
+*
+* Note that if the selected eigenvalue is sufficiently ill-conditioned,
+* then its value may differ significantly from its value before
+* reordering.
+*
+* The reciprocal condition numbers of the left and right eigenspaces
+* spanned by the first n1 columns of U and W (or Q*U and Z*W) may
+* be returned in DIF(1:2), corresponding to Difu and Difl, resp.
+*
+* The Difu and Difl are defined as:
+*
+* Difu[(A11, B11), (A22, B22)] = sigma-min( Zu )
+* and
+* Difl[(A11, B11), (A22, B22)] = Difu[(A22, B22), (A11, B11)],
+*
+* where sigma-min(Zu) is the smallest singular value of the
+* (2*n1*n2)-by-(2*n1*n2) matrix
+*
+* Zu = [ kron(In2, A11) -kron(A22', In1) ]
+* [ kron(In2, B11) -kron(B22', In1) ].
+*
+* Here, Inx is the identity matrix of size nx and A22' is the
+* transpose of A22. kron(X, Y) is the Kronecker product between
+* the matrices X and Y.
+*
+* When DIF(2) is small, small changes in (A, B) can cause large changes
+* in the deflating subspace. An approximate (asymptotic) bound on the
+* maximum angular error in the computed deflating subspaces is
+*
+* EPS * norm((A, B)) / DIF(2),
+*
+* where EPS is the machine precision.
+*
+* The reciprocal norm of the projectors on the left and right
+* eigenspaces associated with (A11, B11) may be returned in PL and PR.
+* They are computed as follows. First we compute L and R so that
+* P*(A, B)*Q is block diagonal, where
+*
+* P = ( I -L ) n1 Q = ( I R ) n1
+* ( 0 I ) n2 and ( 0 I ) n2
+* n1 n2 n1 n2
+*
+* and (L, R) is the solution to the generalized Sylvester equation
+*
+* A11*R - L*A22 = -A12
+* B11*R - L*B22 = -B12
+*
+* Then PL = (F-norm(L)**2+1)**(-1/2) and PR = (F-norm(R)**2+1)**(-1/2).
+* An approximate (asymptotic) bound on the average absolute error of
+* the selected eigenvalues is
+*
+* EPS * norm((A, B)) / PL.
+*
+* There are also global error bounds which valid for perturbations up
+* to a certain restriction: A lower bound (x) on the smallest
+* F-norm(E,F) for which an eigenvalue of (A11, B11) may move and
+* coalesce with an eigenvalue of (A22, B22) under perturbation (E,F),
+* (i.e. (A + E, B + F), is
+*
+* x = min(Difu,Difl)/((1/(PL*PL)+1/(PR*PR))**(1/2)+2*max(1/PL,1/PR)).
+*
+* An approximate bound on x can be computed from DIF(1:2), PL and PR.
+*
+* If y = ( F-norm(E,F) / x) <= 1, the angles between the perturbed
+* (L', R') and unperturbed (L, R) left and right deflating subspaces
+* associated with the selected cluster in the (1,1)-blocks can be
+* bounded as
+*
+* max-angle(L, L') <= arctan( y * PL / (1 - y * (1 - PL * PL)**(1/2))
+* max-angle(R, R') <= arctan( y * PR / (1 - y * (1 - PR * PR)**(1/2))
+*
+* See LAPACK User's Guide section 4.11 or the following references
+* for more information.
+*
+* Note that if the default method for computing the Frobenius-norm-
+* based estimate DIF is not wanted (see ZLATDF), then the parameter
+* IDIFJB (see below) should be changed from 3 to 4 (routine ZLATDF
+* (IJOB = 2 will be used)). See ZTGSYL for more details.
+*
+* Based on contributions by
+* Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+* Umea University, S-901 87 Umea, Sweden.
+*
+* References
+* ==========
+*
+* [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the
+* Generalized Real Schur Form of a Regular Matrix Pair (A, B), in
+* M.S. Moonen et al (eds), Linear Algebra for Large Scale and
+* Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.
+*
+* [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified
+* Eigenvalues of a Regular Matrix Pair (A, B) and Condition
+* Estimation: Theory, Algorithms and Software, Report
+* UMINF - 94.04, Department of Computing Science, Umea University,
+* S-901 87 Umea, Sweden, 1994. Also as LAPACK Working Note 87.
+* To appear in Numerical Algorithms, 1996.
+*
+* [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
+* for Solving the Generalized Sylvester Equation and Estimating the
+* Separation between Regular Matrix Pairs, Report UMINF - 93.23,
+* Department of Computing Science, Umea University, S-901 87 Umea,
+* Sweden, December 1993, Revised April 1994, Also as LAPACK working
+* Note 75. To appear in ACM Trans. on Math. Software, Vol 22, No 1,
+* 1996.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ INTEGER IDIFJB
+ PARAMETER ( IDIFJB = 3 )
+ DOUBLE PRECISION ZERO, ONE
+ PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 )
+* ..
+* .. Local Scalars ..
+ LOGICAL LQUERY, SWAP, WANTD, WANTD1, WANTD2, WANTP
+ INTEGER I, IERR, IJB, K, KASE, KS, LIWMIN, LWMIN, MN2,
+ $ N1, N2
+ DOUBLE PRECISION DSCALE, DSUM, RDSCAL, SAFMIN
+ COMPLEX*16 TEMP1, TEMP2
+* ..
+* .. Local Arrays ..
+ INTEGER ISAVE( 3 )
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZLACN2, ZLACPY, ZLASSQ, ZSCAL, ZTGEXC,
+ $ ZTGSYL
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DCMPLX, DCONJG, MAX, SQRT
+* ..
+* .. External Functions ..
+ DOUBLE PRECISION DLAMCH
+ EXTERNAL DLAMCH
+* ..
+* .. Executable Statements ..
+*
+* Decode and test the input parameters
+*
+ INFO = 0
+ LQUERY = ( LWORK.EQ.-1 .OR. LIWORK.EQ.-1 )
+*
+ IF( IJOB.LT.0 .OR. IJOB.GT.5 ) THEN
+ INFO = -1
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -5
+ ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
+ INFO = -7
+ ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
+ INFO = -9
+ ELSE IF( LDQ.LT.1 .OR. ( WANTQ .AND. LDQ.LT.N ) ) THEN
+ INFO = -13
+ ELSE IF( LDZ.LT.1 .OR. ( WANTZ .AND. LDZ.LT.N ) ) THEN
+ INFO = -15
+ END IF
+*
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZTGSEN', -INFO )
+ RETURN
+ END IF
+*
+ IERR = 0
+*
+ WANTP = IJOB.EQ.1 .OR. IJOB.GE.4
+ WANTD1 = IJOB.EQ.2 .OR. IJOB.EQ.4
+ WANTD2 = IJOB.EQ.3 .OR. IJOB.EQ.5
+ WANTD = WANTD1 .OR. WANTD2
+*
+* Set M to the dimension of the specified pair of deflating
+* subspaces.
+*
+ M = 0
+ DO 10 K = 1, N
+ ALPHA( K ) = A( K, K )
+ BETA( K ) = B( K, K )
+ IF( K.LT.N ) THEN
+ IF( SELECT( K ) )
+ $ M = M + 1
+ ELSE
+ IF( SELECT( N ) )
+ $ M = M + 1
+ END IF
+ 10 CONTINUE
+*
+ IF( IJOB.EQ.1 .OR. IJOB.EQ.2 .OR. IJOB.EQ.4 ) THEN
+ LWMIN = MAX( 1, 2*M*( N-M ) )
+ LIWMIN = MAX( 1, N+2 )
+ ELSE IF( IJOB.EQ.3 .OR. IJOB.EQ.5 ) THEN
+ LWMIN = MAX( 1, 4*M*( N-M ) )
+ LIWMIN = MAX( 1, 2*M*( N-M ), N+2 )
+ ELSE
+ LWMIN = 1
+ LIWMIN = 1
+ END IF
+*
+ WORK( 1 ) = LWMIN
+ IWORK( 1 ) = LIWMIN
+*
+ IF( LWORK.LT.LWMIN .AND. .NOT.LQUERY ) THEN
+ INFO = -21
+ ELSE IF( LIWORK.LT.LIWMIN .AND. .NOT.LQUERY ) THEN
+ INFO = -23
+ END IF
+*
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZTGSEN', -INFO )
+ RETURN
+ ELSE IF( LQUERY ) THEN
+ RETURN
+ END IF
+*
+* Quick return if possible.
+*
+ IF( M.EQ.N .OR. M.EQ.0 ) THEN
+ IF( WANTP ) THEN
+ PL = ONE
+ PR = ONE
+ END IF
+ IF( WANTD ) THEN
+ DSCALE = ZERO
+ DSUM = ONE
+ DO 20 I = 1, N
+ CALL ZLASSQ( N, A( 1, I ), 1, DSCALE, DSUM )
+ CALL ZLASSQ( N, B( 1, I ), 1, DSCALE, DSUM )
+ 20 CONTINUE
+ DIF( 1 ) = DSCALE*SQRT( DSUM )
+ DIF( 2 ) = DIF( 1 )
+ END IF
+ GO TO 70
+ END IF
+*
+* Get machine constant
+*
+ SAFMIN = DLAMCH( 'S' )
+*
+* Collect the selected blocks at the top-left corner of (A, B).
+*
+ KS = 0
+ DO 30 K = 1, N
+ SWAP = SELECT( K )
+ IF( SWAP ) THEN
+ KS = KS + 1
+*
+* Swap the K-th block to position KS. Compute unitary Q
+* and Z that will swap adjacent diagonal blocks in (A, B).
+*
+ IF( K.NE.KS )
+ $ CALL ZTGEXC( WANTQ, WANTZ, N, A, LDA, B, LDB, Q, LDQ, Z,
+ $ LDZ, K, KS, IERR )
+*
+ IF( IERR.GT.0 ) THEN
+*
+* Swap is rejected: exit.
+*
+ INFO = 1
+ IF( WANTP ) THEN
+ PL = ZERO
+ PR = ZERO
+ END IF
+ IF( WANTD ) THEN
+ DIF( 1 ) = ZERO
+ DIF( 2 ) = ZERO
+ END IF
+ GO TO 70
+ END IF
+ END IF
+ 30 CONTINUE
+ IF( WANTP ) THEN
+*
+* Solve generalized Sylvester equation for R and L:
+* A11 * R - L * A22 = A12
+* B11 * R - L * B22 = B12
+*
+ N1 = M
+ N2 = N - M
+ I = N1 + 1
+ CALL ZLACPY( 'Full', N1, N2, A( 1, I ), LDA, WORK, N1 )
+ CALL ZLACPY( 'Full', N1, N2, B( 1, I ), LDB, WORK( N1*N2+1 ),
+ $ N1 )
+ IJB = 0
+ CALL ZTGSYL( 'N', IJB, N1, N2, A, LDA, A( I, I ), LDA, WORK,
+ $ N1, B, LDB, B( I, I ), LDB, WORK( N1*N2+1 ), N1,
+ $ DSCALE, DIF( 1 ), WORK( N1*N2*2+1 ),
+ $ LWORK-2*N1*N2, IWORK, IERR )
+*
+* Estimate the reciprocal of norms of "projections" onto
+* left and right eigenspaces
+*
+ RDSCAL = ZERO
+ DSUM = ONE
+ CALL ZLASSQ( N1*N2, WORK, 1, RDSCAL, DSUM )
+ PL = RDSCAL*SQRT( DSUM )
+ IF( PL.EQ.ZERO ) THEN
+ PL = ONE
+ ELSE
+ PL = DSCALE / ( SQRT( DSCALE*DSCALE / PL+PL )*SQRT( PL ) )
+ END IF
+ RDSCAL = ZERO
+ DSUM = ONE
+ CALL ZLASSQ( N1*N2, WORK( N1*N2+1 ), 1, RDSCAL, DSUM )
+ PR = RDSCAL*SQRT( DSUM )
+ IF( PR.EQ.ZERO ) THEN
+ PR = ONE
+ ELSE
+ PR = DSCALE / ( SQRT( DSCALE*DSCALE / PR+PR )*SQRT( PR ) )
+ END IF
+ END IF
+ IF( WANTD ) THEN
+*
+* Compute estimates Difu and Difl.
+*
+ IF( WANTD1 ) THEN
+ N1 = M
+ N2 = N - M
+ I = N1 + 1
+ IJB = IDIFJB
+*
+* Frobenius norm-based Difu estimate.
+*
+ CALL ZTGSYL( 'N', IJB, N1, N2, A, LDA, A( I, I ), LDA, WORK,
+ $ N1, B, LDB, B( I, I ), LDB, WORK( N1*N2+1 ),
+ $ N1, DSCALE, DIF( 1 ), WORK( N1*N2*2+1 ),
+ $ LWORK-2*N1*N2, IWORK, IERR )
+*
+* Frobenius norm-based Difl estimate.
+*
+ CALL ZTGSYL( 'N', IJB, N2, N1, A( I, I ), LDA, A, LDA, WORK,
+ $ N2, B( I, I ), LDB, B, LDB, WORK( N1*N2+1 ),
+ $ N2, DSCALE, DIF( 2 ), WORK( N1*N2*2+1 ),
+ $ LWORK-2*N1*N2, IWORK, IERR )
+ ELSE
+*
+* Compute 1-norm-based estimates of Difu and Difl using
+* reversed communication with ZLACN2. In each step a
+* generalized Sylvester equation or a transposed variant
+* is solved.
+*
+ KASE = 0
+ N1 = M
+ N2 = N - M
+ I = N1 + 1
+ IJB = 0
+ MN2 = 2*N1*N2
+*
+* 1-norm-based estimate of Difu.
+*
+ 40 CONTINUE
+ CALL ZLACN2( MN2, WORK( MN2+1 ), WORK, DIF( 1 ), KASE,
+ $ ISAVE )
+ IF( KASE.NE.0 ) THEN
+ IF( KASE.EQ.1 ) THEN
+*
+* Solve generalized Sylvester equation
+*
+ CALL ZTGSYL( 'N', IJB, N1, N2, A, LDA, A( I, I ), LDA,
+ $ WORK, N1, B, LDB, B( I, I ), LDB,
+ $ WORK( N1*N2+1 ), N1, DSCALE, DIF( 1 ),
+ $ WORK( N1*N2*2+1 ), LWORK-2*N1*N2, IWORK,
+ $ IERR )
+ ELSE
+*
+* Solve the transposed variant.
+*
+ CALL ZTGSYL( 'C', IJB, N1, N2, A, LDA, A( I, I ), LDA,
+ $ WORK, N1, B, LDB, B( I, I ), LDB,
+ $ WORK( N1*N2+1 ), N1, DSCALE, DIF( 1 ),
+ $ WORK( N1*N2*2+1 ), LWORK-2*N1*N2, IWORK,
+ $ IERR )
+ END IF
+ GO TO 40
+ END IF
+ DIF( 1 ) = DSCALE / DIF( 1 )
+*
+* 1-norm-based estimate of Difl.
+*
+ 50 CONTINUE
+ CALL ZLACN2( MN2, WORK( MN2+1 ), WORK, DIF( 2 ), KASE,
+ $ ISAVE )
+ IF( KASE.NE.0 ) THEN
+ IF( KASE.EQ.1 ) THEN
+*
+* Solve generalized Sylvester equation
+*
+ CALL ZTGSYL( 'N', IJB, N2, N1, A( I, I ), LDA, A, LDA,
+ $ WORK, N2, B( I, I ), LDB, B, LDB,
+ $ WORK( N1*N2+1 ), N2, DSCALE, DIF( 2 ),
+ $ WORK( N1*N2*2+1 ), LWORK-2*N1*N2, IWORK,
+ $ IERR )
+ ELSE
+*
+* Solve the transposed variant.
+*
+ CALL ZTGSYL( 'C', IJB, N2, N1, A( I, I ), LDA, A, LDA,
+ $ WORK, N2, B, LDB, B( I, I ), LDB,
+ $ WORK( N1*N2+1 ), N2, DSCALE, DIF( 2 ),
+ $ WORK( N1*N2*2+1 ), LWORK-2*N1*N2, IWORK,
+ $ IERR )
+ END IF
+ GO TO 50
+ END IF
+ DIF( 2 ) = DSCALE / DIF( 2 )
+ END IF
+ END IF
+*
+* If B(K,K) is complex, make it real and positive (normalization
+* of the generalized Schur form) and Store the generalized
+* eigenvalues of reordered pair (A, B)
+*
+ DO 60 K = 1, N
+ DSCALE = ABS( B( K, K ) )
+ IF( DSCALE.GT.SAFMIN ) THEN
+ TEMP1 = DCONJG( B( K, K ) / DSCALE )
+ TEMP2 = B( K, K ) / DSCALE
+ B( K, K ) = DSCALE
+ CALL ZSCAL( N-K, TEMP1, B( K, K+1 ), LDB )
+ CALL ZSCAL( N-K+1, TEMP1, A( K, K ), LDA )
+ IF( WANTQ )
+ $ CALL ZSCAL( N, TEMP2, Q( 1, K ), 1 )
+ ELSE
+ B( K, K ) = DCMPLX( ZERO, ZERO )
+ END IF
+*
+ ALPHA( K ) = A( K, K )
+ BETA( K ) = B( K, K )
+*
+ 60 CONTINUE
+*
+ 70 CONTINUE
+*
+ WORK( 1 ) = LWMIN
+ IWORK( 1 ) = LIWMIN
+*
+ RETURN
+*
+* End of ZTGSEN
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.h
new file mode 100644
index 0000000000000000000000000000000000000000..929307c3a3d9234651eed3d9775ba7ca96a1d94f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsen.h
@@ -0,0 +1,26 @@
+extern int v3p_netlib_ztgsen_(
+ v3p_netlib_integer *ijob,
+ v3p_netlib_logical *wantq,
+ v3p_netlib_logical *wantz,
+ v3p_netlib_logical *select,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *b,
+ v3p_netlib_integer *ldb,
+ v3p_netlib_doublecomplex *alpha,
+ v3p_netlib_doublecomplex *beta,
+ v3p_netlib_doublecomplex *q,
+ v3p_netlib_integer *ldq,
+ v3p_netlib_doublecomplex *z__,
+ v3p_netlib_integer *ldz,
+ v3p_netlib_integer *m,
+ v3p_netlib_doublereal *pl,
+ v3p_netlib_doublereal *pr,
+ v3p_netlib_doublereal *dif,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_integer *lwork,
+ v3p_netlib_integer *iwork,
+ v3p_netlib_integer *liwork,
+ v3p_netlib_integer *info
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.P
new file mode 100644
index 0000000000000000000000000000000000000000..b03764f5e5e44149fdb479b97a9ff3fe2717aa99
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.P
@@ -0,0 +1,8 @@
+extern int ztgsy2_(char *trans, integer *ijob, integer *m, integer *n, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb, doublecomplex *c__, integer *ldc, doublecomplex *d__, integer *ldd, doublecomplex *e, integer *lde, doublecomplex *f, integer *ldf, doublereal *scale, doublereal *rdsum, doublereal *rdscal, integer *info, ftnlen trans_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zgetc2_ 14 6 4 9 4 4 4 4 */
+/*:ref: zgesc2_ 14 7 4 9 4 9 4 4 7 */
+/*:ref: zscal_ 14 4 4 9 9 4 */
+/*:ref: zlatdf_ 14 9 4 4 9 4 9 7 7 4 4 */
+/*:ref: zaxpy_ 14 6 4 9 9 4 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.c
new file mode 100644
index 0000000000000000000000000000000000000000..f63589eb56a52b3690f4f3d7892fd2bd57a39e05
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.c
@@ -0,0 +1,608 @@
+/* lapack/complex16/ztgsy2.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__2 = 2;
+static integer c__1 = 1;
+
+/*< >*/
+/* Subroutine */ int ztgsy2_(char *trans, integer *ijob, integer *m, integer *
+ n, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb,
+ doublecomplex *c__, integer *ldc, doublecomplex *d__, integer *ldd,
+ doublecomplex *e, integer *lde, doublecomplex *f, integer *ldf,
+ doublereal *scale, doublereal *rdsum, doublereal *rdscal, integer *
+ info, ftnlen trans_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, d_dim1,
+ d_offset, e_dim1, e_offset, f_dim1, f_offset, i__1, i__2, i__3,
+ i__4;
+ doublecomplex z__1, z__2, z__3, z__4, z__5, z__6;
+
+ /* Builtin functions */
+ void d_cnjg(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ integer i__, j, k;
+ doublecomplex z__[4] /* was [2][2] */, rhs[2];
+ integer ierr, ipiv[2], jpiv[2];
+ doublecomplex alpha;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ extern /* Subroutine */ int zscal_(integer *, doublecomplex *,
+ doublecomplex *, integer *), zaxpy_(integer *, doublecomplex *,
+ doublecomplex *, integer *, doublecomplex *, integer *), zgesc2_(
+ integer *, doublecomplex *, integer *, doublecomplex *, integer *,
+ integer *, doublereal *), zgetc2_(integer *, doublecomplex *,
+ integer *, integer *, integer *, integer *);
+ doublereal scaloc;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen), zlatdf_(
+ integer *, integer *, doublecomplex *, integer *, doublecomplex *,
+ doublereal *, doublereal *, integer *, integer *);
+ logical notran;
+ (void)trans_len;
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER TRANS >*/
+/*< INTEGER IJOB, INFO, LDA, LDB, LDC, LDD, LDE, LDF, M, N >*/
+/*< DOUBLE PRECISION RDSCAL, RDSUM, SCALE >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZTGSY2 solves the generalized Sylvester equation */
+
+/* A * R - L * B = scale * C (1) */
+/* D * R - L * E = scale * F */
+
+/* using Level 1 and 2 BLAS, where R and L are unknown M-by-N matrices, */
+/* (A, D), (B, E) and (C, F) are given matrix pairs of size M-by-M, */
+/* N-by-N and M-by-N, respectively. A, B, D and E are upper triangular */
+/* (i.e., (A,D) and (B,E) in generalized Schur form). */
+
+/* The solution (R, L) overwrites (C, F). 0 <= SCALE <= 1 is an output */
+/* scaling factor chosen to avoid overflow. */
+
+/* In matrix notation solving equation (1) corresponds to solve */
+/* Zx = scale * b, where Z is defined as */
+
+/* Z = [ kron(In, A) -kron(B', Im) ] (2) */
+/* [ kron(In, D) -kron(E', Im) ], */
+
+/* Ik is the identity matrix of size k and X' is the transpose of X. */
+/* kron(X, Y) is the Kronecker product between the matrices X and Y. */
+
+/* If TRANS = 'C', y in the conjugate transposed system Z'y = scale*b */
+/* is solved for, which is equivalent to solve for R and L in */
+
+/* A' * R + D' * L = scale * C (3) */
+/* R * B' + L * E' = scale * -F */
+
+/* This case is used to compute an estimate of Dif[(A, D), (B, E)] = */
+/* = sigma_min(Z) using reverse communicaton with ZLACON. */
+
+/* ZTGSY2 also (IJOB >= 1) contributes to the computation in ZTGSYL */
+/* of an upper bound on the separation between to matrix pairs. Then */
+/* the input (A, D), (B, E) are sub-pencils of two matrix pairs in */
+/* ZTGSYL. */
+
+/* Arguments */
+/* ========= */
+
+/* TRANS (input) CHARACTER*1 */
+/* = 'N', solve the generalized Sylvester equation (1). */
+/* = 'T': solve the 'transposed' system (3). */
+
+/* IJOB (input) INTEGER */
+/* Specifies what kind of functionality to be performed. */
+/* =0: solve (1) only. */
+/* =1: A contribution from this subsystem to a Frobenius */
+/* norm-based estimate of the separation between two matrix */
+/* pairs is computed. (look ahead strategy is used). */
+/* =2: A contribution from this subsystem to a Frobenius */
+/* norm-based estimate of the separation between two matrix */
+/* pairs is computed. (DGECON on sub-systems is used.) */
+/* Not referenced if TRANS = 'T'. */
+
+/* M (input) INTEGER */
+/* On entry, M specifies the order of A and D, and the row */
+/* dimension of C, F, R and L. */
+
+/* N (input) INTEGER */
+/* On entry, N specifies the order of B and E, and the column */
+/* dimension of C, F, R and L. */
+
+/* A (input) COMPLEX*16 array, dimension (LDA, M) */
+/* On entry, A contains an upper triangular matrix. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the matrix A. LDA >= max(1, M). */
+
+/* B (input) COMPLEX*16 array, dimension (LDB, N) */
+/* On entry, B contains an upper triangular matrix. */
+
+/* LDB (input) INTEGER */
+/* The leading dimension of the matrix B. LDB >= max(1, N). */
+
+/* C (input/output) COMPLEX*16 array, dimension (LDC, N) */
+/* On entry, C contains the right-hand-side of the first matrix */
+/* equation in (1). */
+/* On exit, if IJOB = 0, C has been overwritten by the solution */
+/* R. */
+
+/* LDC (input) INTEGER */
+/* The leading dimension of the matrix C. LDC >= max(1, M). */
+
+/* D (input) COMPLEX*16 array, dimension (LDD, M) */
+/* On entry, D contains an upper triangular matrix. */
+
+/* LDD (input) INTEGER */
+/* The leading dimension of the matrix D. LDD >= max(1, M). */
+
+/* E (input) COMPLEX*16 array, dimension (LDE, N) */
+/* On entry, E contains an upper triangular matrix. */
+
+/* LDE (input) INTEGER */
+/* The leading dimension of the matrix E. LDE >= max(1, N). */
+
+/* F (input/output) COMPLEX*16 array, dimension (LDF, N) */
+/* On entry, F contains the right-hand-side of the second matrix */
+/* equation in (1). */
+/* On exit, if IJOB = 0, F has been overwritten by the solution */
+/* L. */
+
+/* LDF (input) INTEGER */
+/* The leading dimension of the matrix F. LDF >= max(1, M). */
+
+/* SCALE (output) DOUBLE PRECISION */
+/* On exit, 0 <= SCALE <= 1. If 0 < SCALE < 1, the solutions */
+/* R and L (C and F on entry) will hold the solutions to a */
+/* slightly perturbed system but the input matrices A, B, D and */
+/* E have not been changed. If SCALE = 0, R and L will hold the */
+/* solutions to the homogeneous system with C = F = 0. */
+/* Normally, SCALE = 1. */
+
+/* RDSUM (input/output) DOUBLE PRECISION */
+/* On entry, the sum of squares of computed contributions to */
+/* the Dif-estimate under computation by ZTGSYL, where the */
+/* scaling factor RDSCAL (see below) has been factored out. */
+/* On exit, the corresponding sum of squares updated with the */
+/* contributions from the current sub-system. */
+/* If TRANS = 'T' RDSUM is not touched. */
+/* NOTE: RDSUM only makes sense when ZTGSY2 is called by */
+/* ZTGSYL. */
+
+/* RDSCAL (input/output) DOUBLE PRECISION */
+/* On entry, scaling factor used to prevent overflow in RDSUM. */
+/* On exit, RDSCAL is updated w.r.t. the current contributions */
+/* in RDSUM. */
+/* If TRANS = 'T', RDSCAL is not touched. */
+/* NOTE: RDSCAL only makes sense when ZTGSY2 is called by */
+/* ZTGSYL. */
+
+/* INFO (output) INTEGER */
+/* On exit, if INFO is set to */
+/* =0: Successful exit */
+/* <0: If INFO = -i, input argument number i is illegal. */
+/* >0: The matrix pairs (A, D) and (B, E) have common or very */
+/* close eigenvalues. */
+
+/* Further Details */
+/* =============== */
+
+/* Based on contributions by */
+/* Bo Kagstrom and Peter Poromaa, Department of Computing Science, */
+/* Umea University, S-901 87 Umea, Sweden. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ZERO, ONE >*/
+/*< INTEGER LDZ >*/
+/*< PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0, LDZ = 2 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL NOTRAN >*/
+/*< INTEGER I, IERR, J, K >*/
+/*< DOUBLE PRECISION SCALOC >*/
+/*< COMPLEX*16 ALPHA >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< INTEGER IPIV( LDZ ), JPIV( LDZ ) >*/
+/*< COMPLEX*16 RHS( LDZ ), Z( LDZ, LDZ ) >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< EXTERNAL LSAME >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZAXPY, ZGESC2, ZGETC2, ZLATDF, ZSCAL >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC DCMPLX, DCONJG, MAX >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Decode and test input parameters */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ b_dim1 = *ldb;
+ b_offset = 1 + b_dim1;
+ b -= b_offset;
+ c_dim1 = *ldc;
+ c_offset = 1 + c_dim1;
+ c__ -= c_offset;
+ d_dim1 = *ldd;
+ d_offset = 1 + d_dim1;
+ d__ -= d_offset;
+ e_dim1 = *lde;
+ e_offset = 1 + e_dim1;
+ e -= e_offset;
+ f_dim1 = *ldf;
+ f_offset = 1 + f_dim1;
+ f -= f_offset;
+
+ /* Function Body */
+ *info = 0;
+/*< IERR = 0 >*/
+ ierr = 0;
+/*< NOTRAN = LSAME( TRANS, 'N' ) >*/
+ notran = lsame_(trans, "N", (ftnlen)1, (ftnlen)1);
+/*< IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN >*/
+ if (! notran && ! lsame_(trans, "C", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( NOTRAN ) THEN >*/
+ } else if (notran) {
+/*< IF( ( IJOB.LT.0 ) .OR. ( IJOB.GT.2 ) ) THEN >*/
+ if (*ijob < 0 || *ijob > 2) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< IF( INFO.EQ.0 ) THEN >*/
+ if (*info == 0) {
+/*< IF( M.LE.0 ) THEN >*/
+ if (*m <= 0) {
+/*< INFO = -3 >*/
+ *info = -3;
+/*< ELSE IF( N.LE.0 ) THEN >*/
+ } else if (*n <= 0) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( LDA.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*lda < max(1,*m)) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( LDB.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldb < max(1,*n)) {
+/*< INFO = -8 >*/
+ *info = -8;
+/*< ELSE IF( LDC.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*ldc < max(1,*m)) {
+/*< INFO = -10 >*/
+ *info = -10;
+/*< ELSE IF( LDD.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*ldd < max(1,*m)) {
+/*< INFO = -12 >*/
+ *info = -12;
+/*< ELSE IF( LDE.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*lde < max(1,*n)) {
+/*< INFO = -14 >*/
+ *info = -14;
+/*< ELSE IF( LDF.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*ldf < max(1,*m)) {
+/*< INFO = -16 >*/
+ *info = -16;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZTGSY2', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZTGSY2", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< IF( NOTRAN ) THEN >*/
+ if (notran) {
+
+/* Solve (I, J) - system */
+/* A(I, I) * R(I, J) - L(I, J) * B(J, J) = C(I, J) */
+/* D(I, I) * R(I, J) - L(I, J) * E(J, J) = F(I, J) */
+/* for I = M, M - 1, ..., 1; J = 1, 2, ..., N */
+
+/*< SCALE = ONE >*/
+ *scale = 1.;
+/*< SCALOC = ONE >*/
+ scaloc = 1.;
+/*< DO 30 J = 1, N >*/
+ i__1 = *n;
+ for (j = 1; j <= i__1; ++j) {
+/*< DO 20 I = M, 1, -1 >*/
+ for (i__ = *m; i__ >= 1; --i__) {
+
+/* Build 2 by 2 system */
+
+/*< Z( 1, 1 ) = A( I, I ) >*/
+ i__2 = i__ + i__ * a_dim1;
+ z__[0].r = a[i__2].r, z__[0].i = a[i__2].i;
+/*< Z( 2, 1 ) = D( I, I ) >*/
+ i__2 = i__ + i__ * d_dim1;
+ z__[1].r = d__[i__2].r, z__[1].i = d__[i__2].i;
+/*< Z( 1, 2 ) = -B( J, J ) >*/
+ i__2 = j + j * b_dim1;
+ z__1.r = -b[i__2].r, z__1.i = -b[i__2].i;
+ z__[2].r = z__1.r, z__[2].i = z__1.i;
+/*< Z( 2, 2 ) = -E( J, J ) >*/
+ i__2 = j + j * e_dim1;
+ z__1.r = -e[i__2].r, z__1.i = -e[i__2].i;
+ z__[3].r = z__1.r, z__[3].i = z__1.i;
+
+/* Set up right hand side(s) */
+
+/*< RHS( 1 ) = C( I, J ) >*/
+ i__2 = i__ + j * c_dim1;
+ rhs[0].r = c__[i__2].r, rhs[0].i = c__[i__2].i;
+/*< RHS( 2 ) = F( I, J ) >*/
+ i__2 = i__ + j * f_dim1;
+ rhs[1].r = f[i__2].r, rhs[1].i = f[i__2].i;
+
+/* Solve Z * x = RHS */
+
+/*< CALL ZGETC2( LDZ, Z, LDZ, IPIV, JPIV, IERR ) >*/
+ zgetc2_(&c__2, z__, &c__2, ipiv, jpiv, &ierr);
+/*< >*/
+ if (ierr > 0) {
+ *info = ierr;
+ }
+/*< IF( IJOB.EQ.0 ) THEN >*/
+ if (*ijob == 0) {
+/*< CALL ZGESC2( LDZ, Z, LDZ, RHS, IPIV, JPIV, SCALOC ) >*/
+ zgesc2_(&c__2, z__, &c__2, rhs, ipiv, jpiv, &scaloc);
+/*< IF( SCALOC.NE.ONE ) THEN >*/
+ if (scaloc != 1.) {
+/*< DO 10 K = 1, N >*/
+ i__2 = *n;
+ for (k = 1; k <= i__2; ++k) {
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &c__[k * c_dim1 + 1], &c__1);
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &f[k * f_dim1 + 1], &c__1);
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< SCALE = SCALE*SCALOC >*/
+ *scale *= scaloc;
+/*< END IF >*/
+ }
+/*< ELSE >*/
+ } else {
+/*< >*/
+ zlatdf_(ijob, &c__2, z__, &c__2, rhs, rdsum, rdscal, ipiv,
+ jpiv);
+/*< END IF >*/
+ }
+
+/* Unpack solution vector(s) */
+
+/*< C( I, J ) = RHS( 1 ) >*/
+ i__2 = i__ + j * c_dim1;
+ c__[i__2].r = rhs[0].r, c__[i__2].i = rhs[0].i;
+/*< F( I, J ) = RHS( 2 ) >*/
+ i__2 = i__ + j * f_dim1;
+ f[i__2].r = rhs[1].r, f[i__2].i = rhs[1].i;
+
+/* Substitute R(I, J) and L(I, J) into remaining equation. */
+
+/*< IF( I.GT.1 ) THEN >*/
+ if (i__ > 1) {
+/*< ALPHA = -RHS( 1 ) >*/
+ z__1.r = -rhs[0].r, z__1.i = -rhs[0].i;
+ alpha.r = z__1.r, alpha.i = z__1.i;
+/*< CALL ZAXPY( I-1, ALPHA, A( 1, I ), 1, C( 1, J ), 1 ) >*/
+ i__2 = i__ - 1;
+ zaxpy_(&i__2, &alpha, &a[i__ * a_dim1 + 1], &c__1, &c__[j
+ * c_dim1 + 1], &c__1);
+/*< CALL ZAXPY( I-1, ALPHA, D( 1, I ), 1, F( 1, J ), 1 ) >*/
+ i__2 = i__ - 1;
+ zaxpy_(&i__2, &alpha, &d__[i__ * d_dim1 + 1], &c__1, &f[j
+ * f_dim1 + 1], &c__1);
+/*< END IF >*/
+ }
+/*< IF( J.LT.N ) THEN >*/
+ if (j < *n) {
+/*< >*/
+ i__2 = *n - j;
+ zaxpy_(&i__2, &rhs[1], &b[j + (j + 1) * b_dim1], ldb, &
+ c__[i__ + (j + 1) * c_dim1], ldc);
+/*< >*/
+ i__2 = *n - j;
+ zaxpy_(&i__2, &rhs[1], &e[j + (j + 1) * e_dim1], lde, &f[
+ i__ + (j + 1) * f_dim1], ldf);
+/*< END IF >*/
+ }
+
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< ELSE >*/
+ } else {
+
+/* Solve transposed (I, J) - system: */
+/* A(I, I)' * R(I, J) + D(I, I)' * L(J, J) = C(I, J) */
+/* R(I, I) * B(J, J) + L(I, J) * E(J, J) = -F(I, J) */
+/* for I = 1, 2, ..., M, J = N, N - 1, ..., 1 */
+
+/*< SCALE = ONE >*/
+ *scale = 1.;
+/*< SCALOC = ONE >*/
+ scaloc = 1.;
+/*< DO 80 I = 1, M >*/
+ i__1 = *m;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< DO 70 J = N, 1, -1 >*/
+ for (j = *n; j >= 1; --j) {
+
+/* Build 2 by 2 system Z' */
+
+/*< Z( 1, 1 ) = DCONJG( A( I, I ) ) >*/
+ d_cnjg(&z__1, &a[i__ + i__ * a_dim1]);
+ z__[0].r = z__1.r, z__[0].i = z__1.i;
+/*< Z( 2, 1 ) = -DCONJG( B( J, J ) ) >*/
+ d_cnjg(&z__2, &b[j + j * b_dim1]);
+ z__1.r = -z__2.r, z__1.i = -z__2.i;
+ z__[1].r = z__1.r, z__[1].i = z__1.i;
+/*< Z( 1, 2 ) = DCONJG( D( I, I ) ) >*/
+ d_cnjg(&z__1, &d__[i__ + i__ * d_dim1]);
+ z__[2].r = z__1.r, z__[2].i = z__1.i;
+/*< Z( 2, 2 ) = -DCONJG( E( J, J ) ) >*/
+ d_cnjg(&z__2, &e[j + j * e_dim1]);
+ z__1.r = -z__2.r, z__1.i = -z__2.i;
+ z__[3].r = z__1.r, z__[3].i = z__1.i;
+
+
+/* Set up right hand side(s) */
+
+/*< RHS( 1 ) = C( I, J ) >*/
+ i__2 = i__ + j * c_dim1;
+ rhs[0].r = c__[i__2].r, rhs[0].i = c__[i__2].i;
+/*< RHS( 2 ) = F( I, J ) >*/
+ i__2 = i__ + j * f_dim1;
+ rhs[1].r = f[i__2].r, rhs[1].i = f[i__2].i;
+
+/* Solve Z' * x = RHS */
+
+/*< CALL ZGETC2( LDZ, Z, LDZ, IPIV, JPIV, IERR ) >*/
+ zgetc2_(&c__2, z__, &c__2, ipiv, jpiv, &ierr);
+/*< >*/
+ if (ierr > 0) {
+ *info = ierr;
+ }
+/*< CALL ZGESC2( LDZ, Z, LDZ, RHS, IPIV, JPIV, SCALOC ) >*/
+ zgesc2_(&c__2, z__, &c__2, rhs, ipiv, jpiv, &scaloc);
+/*< IF( SCALOC.NE.ONE ) THEN >*/
+ if (scaloc != 1.) {
+/*< DO 40 K = 1, N >*/
+ i__2 = *n;
+ for (k = 1; k <= i__2; ++k) {
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &c__[k * c_dim1 + 1], &c__1);
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &f[k * f_dim1 + 1], &c__1);
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+/*< SCALE = SCALE*SCALOC >*/
+ *scale *= scaloc;
+/*< END IF >*/
+ }
+
+/* Unpack solution vector(s) */
+
+/*< C( I, J ) = RHS( 1 ) >*/
+ i__2 = i__ + j * c_dim1;
+ c__[i__2].r = rhs[0].r, c__[i__2].i = rhs[0].i;
+/*< F( I, J ) = RHS( 2 ) >*/
+ i__2 = i__ + j * f_dim1;
+ f[i__2].r = rhs[1].r, f[i__2].i = rhs[1].i;
+
+/* Substitute R(I, J) and L(I, J) into remaining equation. */
+
+/*< DO 50 K = 1, J - 1 >*/
+ i__2 = j - 1;
+ for (k = 1; k <= i__2; ++k) {
+/*< >*/
+ i__3 = i__ + k * f_dim1;
+ i__4 = i__ + k * f_dim1;
+ d_cnjg(&z__4, &b[k + j * b_dim1]);
+ z__3.r = rhs[0].r * z__4.r - rhs[0].i * z__4.i, z__3.i =
+ rhs[0].r * z__4.i + rhs[0].i * z__4.r;
+ z__2.r = f[i__4].r + z__3.r, z__2.i = f[i__4].i + z__3.i;
+ d_cnjg(&z__6, &e[k + j * e_dim1]);
+ z__5.r = rhs[1].r * z__6.r - rhs[1].i * z__6.i, z__5.i =
+ rhs[1].r * z__6.i + rhs[1].i * z__6.r;
+ z__1.r = z__2.r + z__5.r, z__1.i = z__2.i + z__5.i;
+ f[i__3].r = z__1.r, f[i__3].i = z__1.i;
+/*< 50 CONTINUE >*/
+/* L50: */
+ }
+/*< DO 60 K = I + 1, M >*/
+ i__2 = *m;
+ for (k = i__ + 1; k <= i__2; ++k) {
+/*< >*/
+ i__3 = k + j * c_dim1;
+ i__4 = k + j * c_dim1;
+ d_cnjg(&z__4, &a[i__ + k * a_dim1]);
+ z__3.r = z__4.r * rhs[0].r - z__4.i * rhs[0].i, z__3.i =
+ z__4.r * rhs[0].i + z__4.i * rhs[0].r;
+ z__2.r = c__[i__4].r - z__3.r, z__2.i = c__[i__4].i -
+ z__3.i;
+ d_cnjg(&z__6, &d__[i__ + k * d_dim1]);
+ z__5.r = z__6.r * rhs[1].r - z__6.i * rhs[1].i, z__5.i =
+ z__6.r * rhs[1].i + z__6.i * rhs[1].r;
+ z__1.r = z__2.r - z__5.r, z__1.i = z__2.i - z__5.i;
+ c__[i__3].r = z__1.r, c__[i__3].i = z__1.i;
+/*< 60 CONTINUE >*/
+/* L60: */
+ }
+
+/*< 70 CONTINUE >*/
+/* L70: */
+ }
+/*< 80 CONTINUE >*/
+/* L80: */
+ }
+/*< END IF >*/
+ }
+/*< RETURN >*/
+ return 0;
+
+/* End of ZTGSY2 */
+
+/*< END >*/
+} /* ztgsy2_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.f
new file mode 100644
index 0000000000000000000000000000000000000000..bcf692b668a8847d55ab92d99ecd332bae3e7be3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.f
@@ -0,0 +1,362 @@
+ SUBROUTINE ZTGSY2( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
+ $ LDD, E, LDE, F, LDF, SCALE, RDSUM, RDSCAL,
+ $ INFO )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER TRANS
+ INTEGER IJOB, INFO, LDA, LDB, LDC, LDD, LDE, LDF, M, N
+ DOUBLE PRECISION RDSCAL, RDSUM, SCALE
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 A( LDA, * ), B( LDB, * ), C( LDC, * ),
+ $ D( LDD, * ), E( LDE, * ), F( LDF, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZTGSY2 solves the generalized Sylvester equation
+*
+* A * R - L * B = scale * C (1)
+* D * R - L * E = scale * F
+*
+* using Level 1 and 2 BLAS, where R and L are unknown M-by-N matrices,
+* (A, D), (B, E) and (C, F) are given matrix pairs of size M-by-M,
+* N-by-N and M-by-N, respectively. A, B, D and E are upper triangular
+* (i.e., (A,D) and (B,E) in generalized Schur form).
+*
+* The solution (R, L) overwrites (C, F). 0 <= SCALE <= 1 is an output
+* scaling factor chosen to avoid overflow.
+*
+* In matrix notation solving equation (1) corresponds to solve
+* Zx = scale * b, where Z is defined as
+*
+* Z = [ kron(In, A) -kron(B', Im) ] (2)
+* [ kron(In, D) -kron(E', Im) ],
+*
+* Ik is the identity matrix of size k and X' is the transpose of X.
+* kron(X, Y) is the Kronecker product between the matrices X and Y.
+*
+* If TRANS = 'C', y in the conjugate transposed system Z'y = scale*b
+* is solved for, which is equivalent to solve for R and L in
+*
+* A' * R + D' * L = scale * C (3)
+* R * B' + L * E' = scale * -F
+*
+* This case is used to compute an estimate of Dif[(A, D), (B, E)] =
+* = sigma_min(Z) using reverse communicaton with ZLACON.
+*
+* ZTGSY2 also (IJOB >= 1) contributes to the computation in ZTGSYL
+* of an upper bound on the separation between to matrix pairs. Then
+* the input (A, D), (B, E) are sub-pencils of two matrix pairs in
+* ZTGSYL.
+*
+* Arguments
+* =========
+*
+* TRANS (input) CHARACTER*1
+* = 'N', solve the generalized Sylvester equation (1).
+* = 'T': solve the 'transposed' system (3).
+*
+* IJOB (input) INTEGER
+* Specifies what kind of functionality to be performed.
+* =0: solve (1) only.
+* =1: A contribution from this subsystem to a Frobenius
+* norm-based estimate of the separation between two matrix
+* pairs is computed. (look ahead strategy is used).
+* =2: A contribution from this subsystem to a Frobenius
+* norm-based estimate of the separation between two matrix
+* pairs is computed. (DGECON on sub-systems is used.)
+* Not referenced if TRANS = 'T'.
+*
+* M (input) INTEGER
+* On entry, M specifies the order of A and D, and the row
+* dimension of C, F, R and L.
+*
+* N (input) INTEGER
+* On entry, N specifies the order of B and E, and the column
+* dimension of C, F, R and L.
+*
+* A (input) COMPLEX*16 array, dimension (LDA, M)
+* On entry, A contains an upper triangular matrix.
+*
+* LDA (input) INTEGER
+* The leading dimension of the matrix A. LDA >= max(1, M).
+*
+* B (input) COMPLEX*16 array, dimension (LDB, N)
+* On entry, B contains an upper triangular matrix.
+*
+* LDB (input) INTEGER
+* The leading dimension of the matrix B. LDB >= max(1, N).
+*
+* C (input/output) COMPLEX*16 array, dimension (LDC, N)
+* On entry, C contains the right-hand-side of the first matrix
+* equation in (1).
+* On exit, if IJOB = 0, C has been overwritten by the solution
+* R.
+*
+* LDC (input) INTEGER
+* The leading dimension of the matrix C. LDC >= max(1, M).
+*
+* D (input) COMPLEX*16 array, dimension (LDD, M)
+* On entry, D contains an upper triangular matrix.
+*
+* LDD (input) INTEGER
+* The leading dimension of the matrix D. LDD >= max(1, M).
+*
+* E (input) COMPLEX*16 array, dimension (LDE, N)
+* On entry, E contains an upper triangular matrix.
+*
+* LDE (input) INTEGER
+* The leading dimension of the matrix E. LDE >= max(1, N).
+*
+* F (input/output) COMPLEX*16 array, dimension (LDF, N)
+* On entry, F contains the right-hand-side of the second matrix
+* equation in (1).
+* On exit, if IJOB = 0, F has been overwritten by the solution
+* L.
+*
+* LDF (input) INTEGER
+* The leading dimension of the matrix F. LDF >= max(1, M).
+*
+* SCALE (output) DOUBLE PRECISION
+* On exit, 0 <= SCALE <= 1. If 0 < SCALE < 1, the solutions
+* R and L (C and F on entry) will hold the solutions to a
+* slightly perturbed system but the input matrices A, B, D and
+* E have not been changed. If SCALE = 0, R and L will hold the
+* solutions to the homogeneous system with C = F = 0.
+* Normally, SCALE = 1.
+*
+* RDSUM (input/output) DOUBLE PRECISION
+* On entry, the sum of squares of computed contributions to
+* the Dif-estimate under computation by ZTGSYL, where the
+* scaling factor RDSCAL (see below) has been factored out.
+* On exit, the corresponding sum of squares updated with the
+* contributions from the current sub-system.
+* If TRANS = 'T' RDSUM is not touched.
+* NOTE: RDSUM only makes sense when ZTGSY2 is called by
+* ZTGSYL.
+*
+* RDSCAL (input/output) DOUBLE PRECISION
+* On entry, scaling factor used to prevent overflow in RDSUM.
+* On exit, RDSCAL is updated w.r.t. the current contributions
+* in RDSUM.
+* If TRANS = 'T', RDSCAL is not touched.
+* NOTE: RDSCAL only makes sense when ZTGSY2 is called by
+* ZTGSYL.
+*
+* INFO (output) INTEGER
+* On exit, if INFO is set to
+* =0: Successful exit
+* <0: If INFO = -i, input argument number i is illegal.
+* >0: The matrix pairs (A, D) and (B, E) have common or very
+* close eigenvalues.
+*
+* Further Details
+* ===============
+*
+* Based on contributions by
+* Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+* Umea University, S-901 87 Umea, Sweden.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ZERO, ONE
+ INTEGER LDZ
+ PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0, LDZ = 2 )
+* ..
+* .. Local Scalars ..
+ LOGICAL NOTRAN
+ INTEGER I, IERR, J, K
+ DOUBLE PRECISION SCALOC
+ COMPLEX*16 ALPHA
+* ..
+* .. Local Arrays ..
+ INTEGER IPIV( LDZ ), JPIV( LDZ )
+ COMPLEX*16 RHS( LDZ ), Z( LDZ, LDZ )
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ EXTERNAL LSAME
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZAXPY, ZGESC2, ZGETC2, ZLATDF, ZSCAL
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC DCMPLX, DCONJG, MAX
+* ..
+* .. Executable Statements ..
+*
+* Decode and test input parameters
+*
+ INFO = 0
+ IERR = 0
+ NOTRAN = LSAME( TRANS, 'N' )
+ IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN
+ INFO = -1
+ ELSE IF( NOTRAN ) THEN
+ IF( ( IJOB.LT.0 ) .OR. ( IJOB.GT.2 ) ) THEN
+ INFO = -2
+ END IF
+ END IF
+ IF( INFO.EQ.0 ) THEN
+ IF( M.LE.0 ) THEN
+ INFO = -3
+ ELSE IF( N.LE.0 ) THEN
+ INFO = -4
+ ELSE IF( LDA.LT.MAX( 1, M ) ) THEN
+ INFO = -5
+ ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
+ INFO = -8
+ ELSE IF( LDC.LT.MAX( 1, M ) ) THEN
+ INFO = -10
+ ELSE IF( LDD.LT.MAX( 1, M ) ) THEN
+ INFO = -12
+ ELSE IF( LDE.LT.MAX( 1, N ) ) THEN
+ INFO = -14
+ ELSE IF( LDF.LT.MAX( 1, M ) ) THEN
+ INFO = -16
+ END IF
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZTGSY2', -INFO )
+ RETURN
+ END IF
+*
+ IF( NOTRAN ) THEN
+*
+* Solve (I, J) - system
+* A(I, I) * R(I, J) - L(I, J) * B(J, J) = C(I, J)
+* D(I, I) * R(I, J) - L(I, J) * E(J, J) = F(I, J)
+* for I = M, M - 1, ..., 1; J = 1, 2, ..., N
+*
+ SCALE = ONE
+ SCALOC = ONE
+ DO 30 J = 1, N
+ DO 20 I = M, 1, -1
+*
+* Build 2 by 2 system
+*
+ Z( 1, 1 ) = A( I, I )
+ Z( 2, 1 ) = D( I, I )
+ Z( 1, 2 ) = -B( J, J )
+ Z( 2, 2 ) = -E( J, J )
+*
+* Set up right hand side(s)
+*
+ RHS( 1 ) = C( I, J )
+ RHS( 2 ) = F( I, J )
+*
+* Solve Z * x = RHS
+*
+ CALL ZGETC2( LDZ, Z, LDZ, IPIV, JPIV, IERR )
+ IF( IERR.GT.0 )
+ $ INFO = IERR
+ IF( IJOB.EQ.0 ) THEN
+ CALL ZGESC2( LDZ, Z, LDZ, RHS, IPIV, JPIV, SCALOC )
+ IF( SCALOC.NE.ONE ) THEN
+ DO 10 K = 1, N
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ),
+ $ C( 1, K ), 1 )
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ),
+ $ F( 1, K ), 1 )
+ 10 CONTINUE
+ SCALE = SCALE*SCALOC
+ END IF
+ ELSE
+ CALL ZLATDF( IJOB, LDZ, Z, LDZ, RHS, RDSUM, RDSCAL,
+ $ IPIV, JPIV )
+ END IF
+*
+* Unpack solution vector(s)
+*
+ C( I, J ) = RHS( 1 )
+ F( I, J ) = RHS( 2 )
+*
+* Substitute R(I, J) and L(I, J) into remaining equation.
+*
+ IF( I.GT.1 ) THEN
+ ALPHA = -RHS( 1 )
+ CALL ZAXPY( I-1, ALPHA, A( 1, I ), 1, C( 1, J ), 1 )
+ CALL ZAXPY( I-1, ALPHA, D( 1, I ), 1, F( 1, J ), 1 )
+ END IF
+ IF( J.LT.N ) THEN
+ CALL ZAXPY( N-J, RHS( 2 ), B( J, J+1 ), LDB,
+ $ C( I, J+1 ), LDC )
+ CALL ZAXPY( N-J, RHS( 2 ), E( J, J+1 ), LDE,
+ $ F( I, J+1 ), LDF )
+ END IF
+*
+ 20 CONTINUE
+ 30 CONTINUE
+ ELSE
+*
+* Solve transposed (I, J) - system:
+* A(I, I)' * R(I, J) + D(I, I)' * L(J, J) = C(I, J)
+* R(I, I) * B(J, J) + L(I, J) * E(J, J) = -F(I, J)
+* for I = 1, 2, ..., M, J = N, N - 1, ..., 1
+*
+ SCALE = ONE
+ SCALOC = ONE
+ DO 80 I = 1, M
+ DO 70 J = N, 1, -1
+*
+* Build 2 by 2 system Z'
+*
+ Z( 1, 1 ) = DCONJG( A( I, I ) )
+ Z( 2, 1 ) = -DCONJG( B( J, J ) )
+ Z( 1, 2 ) = DCONJG( D( I, I ) )
+ Z( 2, 2 ) = -DCONJG( E( J, J ) )
+*
+*
+* Set up right hand side(s)
+*
+ RHS( 1 ) = C( I, J )
+ RHS( 2 ) = F( I, J )
+*
+* Solve Z' * x = RHS
+*
+ CALL ZGETC2( LDZ, Z, LDZ, IPIV, JPIV, IERR )
+ IF( IERR.GT.0 )
+ $ INFO = IERR
+ CALL ZGESC2( LDZ, Z, LDZ, RHS, IPIV, JPIV, SCALOC )
+ IF( SCALOC.NE.ONE ) THEN
+ DO 40 K = 1, N
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ), C( 1, K ),
+ $ 1 )
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ), F( 1, K ),
+ $ 1 )
+ 40 CONTINUE
+ SCALE = SCALE*SCALOC
+ END IF
+*
+* Unpack solution vector(s)
+*
+ C( I, J ) = RHS( 1 )
+ F( I, J ) = RHS( 2 )
+*
+* Substitute R(I, J) and L(I, J) into remaining equation.
+*
+ DO 50 K = 1, J - 1
+ F( I, K ) = F( I, K ) + RHS( 1 )*DCONJG( B( K, J ) ) +
+ $ RHS( 2 )*DCONJG( E( K, J ) )
+ 50 CONTINUE
+ DO 60 K = I + 1, M
+ C( K, J ) = C( K, J ) - DCONJG( A( I, K ) )*RHS( 1 ) -
+ $ DCONJG( D( I, K ) )*RHS( 2 )
+ 60 CONTINUE
+*
+ 70 CONTINUE
+ 80 CONTINUE
+ END IF
+ RETURN
+*
+* End of ZTGSY2
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.h
new file mode 100644
index 0000000000000000000000000000000000000000..05aecf15de87f9e607b9af03cf5a6a53e109a89b
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsy2.h
@@ -0,0 +1,23 @@
+extern int v3p_netlib_ztgsy2_(
+ char *trans,
+ v3p_netlib_integer *ijob,
+ v3p_netlib_integer *m,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *b,
+ v3p_netlib_integer *ldb,
+ v3p_netlib_doublecomplex *c__,
+ v3p_netlib_integer *ldc,
+ v3p_netlib_doublecomplex *d__,
+ v3p_netlib_integer *ldd,
+ v3p_netlib_doublecomplex *e,
+ v3p_netlib_integer *lde,
+ v3p_netlib_doublecomplex *f,
+ v3p_netlib_integer *ldf,
+ v3p_netlib_doublereal *scale,
+ v3p_netlib_doublereal *rdsum,
+ v3p_netlib_doublereal *rdscal,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen trans_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.P
new file mode 100644
index 0000000000000000000000000000000000000000..f1263246949ae7e33eb660e388c2754407024cb2
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.P
@@ -0,0 +1,9 @@
+extern int ztgsyl_(char *trans, integer *ijob, integer *m, integer *n, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb, doublecomplex *c__, integer *ldc, doublecomplex *d__, integer *ldd, doublecomplex *e, integer *lde, doublecomplex *f, integer *ldf, doublereal *scale, doublereal *dif, doublecomplex *work, integer *lwork, integer *iwork, integer *info, ftnlen trans_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: ilaenv_ 4 9 4 13 13 4 4 4 4 124 124 */
+/*:ref: zlaset_ 14 8 13 4 4 9 9 9 4 124 */
+/*:ref: ztgsy2_ 14 21 13 4 4 4 9 4 9 4 9 4 9 4 9 4 9 4 7 7 7 4 124 */
+/*:ref: zlacpy_ 14 8 13 4 4 9 4 9 4 124 */
+/*:ref: zscal_ 14 4 4 9 9 4 */
+/*:ref: zgemm_ 14 15 13 13 4 4 4 9 9 4 9 4 9 9 4 124 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.c
new file mode 100644
index 0000000000000000000000000000000000000000..8df2f5e372d139911167cae04d8542cd7f2b5706
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.c
@@ -0,0 +1,978 @@
+/* lapack/complex16/ztgsyl.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static doublecomplex c_b1 = {0.,0.};
+static integer c__2 = 2;
+static integer c_n1 = -1;
+static integer c__5 = 5;
+static integer c__1 = 1;
+static doublecomplex c_b44 = {-1.,0.};
+static doublecomplex c_b45 = {1.,0.};
+
+/*< >*/
+/* Subroutine */ int ztgsyl_(char *trans, integer *ijob, integer *m, integer *
+ n, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb,
+ doublecomplex *c__, integer *ldc, doublecomplex *d__, integer *ldd,
+ doublecomplex *e, integer *lde, doublecomplex *f, integer *ldf,
+ doublereal *scale, doublereal *dif, doublecomplex *work, integer *
+ lwork, integer *iwork, integer *info, ftnlen trans_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, d_dim1,
+ d_offset, e_dim1, e_offset, f_dim1, f_offset, i__1, i__2, i__3,
+ i__4;
+ doublecomplex z__1;
+
+ /* Builtin functions */
+ double sqrt(doublereal);
+
+ /* Local variables */
+ integer i__, j, k, p, q, ie, je, mb, nb, is, js, pq;
+ doublereal dsum;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ integer ifunc, linfo;
+ extern /* Subroutine */ int zscal_(integer *, doublecomplex *,
+ doublecomplex *, integer *), zgemm_(char *, char *, integer *,
+ integer *, integer *, doublecomplex *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, doublecomplex *,
+ integer *, ftnlen, ftnlen);
+ integer lwmin;
+ doublereal scale2, dscale;
+ extern /* Subroutine */ int ztgsy2_(char *, integer *, integer *, integer
+ *, doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublereal *, doublereal *, doublereal *, integer *, ftnlen);
+ doublereal scaloc;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+ extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
+ integer *, integer *, ftnlen, ftnlen);
+ integer iround;
+ logical notran;
+ integer isolve;
+ extern /* Subroutine */ int zlacpy_(char *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *, ftnlen),
+ zlaset_(char *, integer *, integer *, doublecomplex *,
+ doublecomplex *, doublecomplex *, integer *, ftnlen);
+ logical lquery;
+ (void)trans_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* January 2007 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER TRANS >*/
+/*< >*/
+/*< DOUBLE PRECISION DIF, SCALE >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< INTEGER IWORK( * ) >*/
+/*< >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZTGSYL solves the generalized Sylvester equation: */
+
+/* A * R - L * B = scale * C (1) */
+/* D * R - L * E = scale * F */
+
+/* where R and L are unknown m-by-n matrices, (A, D), (B, E) and */
+/* (C, F) are given matrix pairs of size m-by-m, n-by-n and m-by-n, */
+/* respectively, with complex entries. A, B, D and E are upper */
+/* triangular (i.e., (A,D) and (B,E) in generalized Schur form). */
+
+/* The solution (R, L) overwrites (C, F). 0 <= SCALE <= 1 */
+/* is an output scaling factor chosen to avoid overflow. */
+
+/* In matrix notation (1) is equivalent to solve Zx = scale*b, where Z */
+/* is defined as */
+
+/* Z = [ kron(In, A) -kron(B', Im) ] (2) */
+/* [ kron(In, D) -kron(E', Im) ], */
+
+/* Here Ix is the identity matrix of size x and X' is the conjugate */
+/* transpose of X. Kron(X, Y) is the Kronecker product between the */
+/* matrices X and Y. */
+
+/* If TRANS = 'C', y in the conjugate transposed system Z'*y = scale*b */
+/* is solved for, which is equivalent to solve for R and L in */
+
+/* A' * R + D' * L = scale * C (3) */
+/* R * B' + L * E' = scale * -F */
+
+/* This case (TRANS = 'C') is used to compute an one-norm-based estimate */
+/* of Dif[(A,D), (B,E)], the separation between the matrix pairs (A,D) */
+/* and (B,E), using ZLACON. */
+
+/* If IJOB >= 1, ZTGSYL computes a Frobenius norm-based estimate of */
+/* Dif[(A,D),(B,E)]. That is, the reciprocal of a lower bound on the */
+/* reciprocal of the smallest singular value of Z. */
+
+/* This is a level-3 BLAS algorithm. */
+
+/* Arguments */
+/* ========= */
+
+/* TRANS (input) CHARACTER*1 */
+/* = 'N': solve the generalized sylvester equation (1). */
+/* = 'C': solve the "conjugate transposed" system (3). */
+
+/* IJOB (input) INTEGER */
+/* Specifies what kind of functionality to be performed. */
+/* =0: solve (1) only. */
+/* =1: The functionality of 0 and 3. */
+/* =2: The functionality of 0 and 4. */
+/* =3: Only an estimate of Dif[(A,D), (B,E)] is computed. */
+/* (look ahead strategy is used). */
+/* =4: Only an estimate of Dif[(A,D), (B,E)] is computed. */
+/* (ZGECON on sub-systems is used). */
+/* Not referenced if TRANS = 'C'. */
+
+/* M (input) INTEGER */
+/* The order of the matrices A and D, and the row dimension of */
+/* the matrices C, F, R and L. */
+
+/* N (input) INTEGER */
+/* The order of the matrices B and E, and the column dimension */
+/* of the matrices C, F, R and L. */
+
+/* A (input) COMPLEX*16 array, dimension (LDA, M) */
+/* The upper triangular matrix A. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1, M). */
+
+/* B (input) COMPLEX*16 array, dimension (LDB, N) */
+/* The upper triangular matrix B. */
+
+/* LDB (input) INTEGER */
+/* The leading dimension of the array B. LDB >= max(1, N). */
+
+/* C (input/output) COMPLEX*16 array, dimension (LDC, N) */
+/* On entry, C contains the right-hand-side of the first matrix */
+/* equation in (1) or (3). */
+/* On exit, if IJOB = 0, 1 or 2, C has been overwritten by */
+/* the solution R. If IJOB = 3 or 4 and TRANS = 'N', C holds R, */
+/* the solution achieved during the computation of the */
+/* Dif-estimate. */
+
+/* LDC (input) INTEGER */
+/* The leading dimension of the array C. LDC >= max(1, M). */
+
+/* D (input) COMPLEX*16 array, dimension (LDD, M) */
+/* The upper triangular matrix D. */
+
+/* LDD (input) INTEGER */
+/* The leading dimension of the array D. LDD >= max(1, M). */
+
+/* E (input) COMPLEX*16 array, dimension (LDE, N) */
+/* The upper triangular matrix E. */
+
+/* LDE (input) INTEGER */
+/* The leading dimension of the array E. LDE >= max(1, N). */
+
+/* F (input/output) COMPLEX*16 array, dimension (LDF, N) */
+/* On entry, F contains the right-hand-side of the second matrix */
+/* equation in (1) or (3). */
+/* On exit, if IJOB = 0, 1 or 2, F has been overwritten by */
+/* the solution L. If IJOB = 3 or 4 and TRANS = 'N', F holds L, */
+/* the solution achieved during the computation of the */
+/* Dif-estimate. */
+
+/* LDF (input) INTEGER */
+/* The leading dimension of the array F. LDF >= max(1, M). */
+
+/* DIF (output) DOUBLE PRECISION */
+/* On exit DIF is the reciprocal of a lower bound of the */
+/* reciprocal of the Dif-function, i.e. DIF is an upper bound of */
+/* Dif[(A,D), (B,E)] = sigma-min(Z), where Z as in (2). */
+/* IF IJOB = 0 or TRANS = 'C', DIF is not referenced. */
+
+/* SCALE (output) DOUBLE PRECISION */
+/* On exit SCALE is the scaling factor in (1) or (3). */
+/* If 0 < SCALE < 1, C and F hold the solutions R and L, resp., */
+/* to a slightly perturbed system but the input matrices A, B, */
+/* D and E have not been changed. If SCALE = 0, R and L will */
+/* hold the solutions to the homogenious system with C = F = 0. */
+
+/* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK)) */
+/* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
+
+/* LWORK (input) INTEGER */
+/* The dimension of the array WORK. LWORK > = 1. */
+/* If IJOB = 1 or 2 and TRANS = 'N', LWORK >= max(1,2*M*N). */
+
+/* If LWORK = -1, then a workspace query is assumed; the routine */
+/* only calculates the optimal size of the WORK array, returns */
+/* this value as the first entry of the WORK array, and no error */
+/* message related to LWORK is issued by XERBLA. */
+
+/* IWORK (workspace) INTEGER array, dimension (M+N+2) */
+
+/* INFO (output) INTEGER */
+/* =0: successful exit */
+/* <0: If INFO = -i, the i-th argument had an illegal value. */
+/* >0: (A, D) and (B, E) have common or very close */
+/* eigenvalues. */
+
+/* Further Details */
+/* =============== */
+
+/* Based on contributions by */
+/* Bo Kagstrom and Peter Poromaa, Department of Computing Science, */
+/* Umea University, S-901 87 Umea, Sweden. */
+
+/* [1] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software */
+/* for Solving the Generalized Sylvester Equation and Estimating the */
+/* Separation between Regular Matrix Pairs, Report UMINF - 93.23, */
+/* Department of Computing Science, Umea University, S-901 87 Umea, */
+/* Sweden, December 1993, Revised April 1994, Also as LAPACK Working */
+/* Note 75. To appear in ACM Trans. on Math. Software, Vol 22, */
+/* No 1, 1996. */
+
+/* [2] B. Kagstrom, A Perturbation Analysis of the Generalized Sylvester */
+/* Equation (AR - LB, DR - LE ) = (C, F), SIAM J. Matrix Anal. */
+/* Appl., 15(4):1045-1060, 1994. */
+
+/* [3] B. Kagstrom and L. Westin, Generalized Schur Methods with */
+/* Condition Estimators for Solving the Generalized Sylvester */
+/* Equation, IEEE Transactions on Automatic Control, Vol. 34, No. 7, */
+/* July 1989, pp 745-751. */
+
+/* ===================================================================== */
+/* Replaced various illegal calls to CCOPY by calls to CLASET. */
+/* Sven Hammarling, 1/5/02. */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ZERO, ONE >*/
+/*< PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) >*/
+/*< COMPLEX*16 CZERO >*/
+/*< PARAMETER ( CZERO = (0.0D+0, 0.0D+0) ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL LQUERY, NOTRAN >*/
+/*< >*/
+/*< DOUBLE PRECISION DSCALE, DSUM, SCALE2, SCALOC >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< INTEGER ILAENV >*/
+/*< EXTERNAL LSAME, ILAENV >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZGEMM, ZLACPY, ZLASET, ZSCAL, ZTGSY2 >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC DBLE, DCMPLX, MAX, SQRT >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Decode and test input parameters */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ b_dim1 = *ldb;
+ b_offset = 1 + b_dim1;
+ b -= b_offset;
+ c_dim1 = *ldc;
+ c_offset = 1 + c_dim1;
+ c__ -= c_offset;
+ d_dim1 = *ldd;
+ d_offset = 1 + d_dim1;
+ d__ -= d_offset;
+ e_dim1 = *lde;
+ e_offset = 1 + e_dim1;
+ e -= e_offset;
+ f_dim1 = *ldf;
+ f_offset = 1 + f_dim1;
+ f -= f_offset;
+ --work;
+ --iwork;
+
+ /* Function Body */
+ *info = 0;
+/*< NOTRAN = LSAME( TRANS, 'N' ) >*/
+ notran = lsame_(trans, "N", (ftnlen)1, (ftnlen)1);
+/*< LQUERY = ( LWORK.EQ.-1 ) >*/
+ lquery = *lwork == -1;
+
+/*< IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN >*/
+ if (! notran && ! lsame_(trans, "C", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( NOTRAN ) THEN >*/
+ } else if (notran) {
+/*< IF( ( IJOB.LT.0 ) .OR. ( IJOB.GT.4 ) ) THEN >*/
+ if (*ijob < 0 || *ijob > 4) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< IF( INFO.EQ.0 ) THEN >*/
+ if (*info == 0) {
+/*< IF( M.LE.0 ) THEN >*/
+ if (*m <= 0) {
+/*< INFO = -3 >*/
+ *info = -3;
+/*< ELSE IF( N.LE.0 ) THEN >*/
+ } else if (*n <= 0) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( LDA.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*lda < max(1,*m)) {
+/*< INFO = -6 >*/
+ *info = -6;
+/*< ELSE IF( LDB.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldb < max(1,*n)) {
+/*< INFO = -8 >*/
+ *info = -8;
+/*< ELSE IF( LDC.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*ldc < max(1,*m)) {
+/*< INFO = -10 >*/
+ *info = -10;
+/*< ELSE IF( LDD.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*ldd < max(1,*m)) {
+/*< INFO = -12 >*/
+ *info = -12;
+/*< ELSE IF( LDE.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*lde < max(1,*n)) {
+/*< INFO = -14 >*/
+ *info = -14;
+/*< ELSE IF( LDF.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*ldf < max(1,*m)) {
+/*< INFO = -16 >*/
+ *info = -16;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/*< IF( INFO.EQ.0 ) THEN >*/
+ if (*info == 0) {
+/*< IF( NOTRAN ) THEN >*/
+ if (notran) {
+/*< IF( IJOB.EQ.1 .OR. IJOB.EQ.2 ) THEN >*/
+ if (*ijob == 1 || *ijob == 2) {
+/*< LWMIN = MAX( 1, 2*M*N ) >*/
+/* Computing MAX */
+ i__1 = 1, i__2 = (*m << 1) * *n;
+ lwmin = max(i__1,i__2);
+/*< ELSE >*/
+ } else {
+/*< LWMIN = 1 >*/
+ lwmin = 1;
+/*< END IF >*/
+ }
+/*< ELSE >*/
+ } else {
+/*< LWMIN = 1 >*/
+ lwmin = 1;
+/*< END IF >*/
+ }
+/*< WORK( 1 ) = LWMIN >*/
+ work[1].r = (doublereal) lwmin, work[1].i = 0.;
+
+/*< IF( LWORK.LT.LWMIN .AND. .NOT.LQUERY ) THEN >*/
+ if (*lwork < lwmin && ! lquery) {
+/*< INFO = -20 >*/
+ *info = -20;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZTGSYL', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZTGSYL", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< ELSE IF( LQUERY ) THEN >*/
+ } else if (lquery) {
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< IF( M.EQ.0 .OR. N.EQ.0 ) THEN >*/
+ if (*m == 0 || *n == 0) {
+/*< SCALE = 1 >*/
+ *scale = 1.;
+/*< IF( NOTRAN ) THEN >*/
+ if (notran) {
+/*< IF( IJOB.NE.0 ) THEN >*/
+ if (*ijob != 0) {
+/*< DIF = 0 >*/
+ *dif = 0.;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Determine optimal block sizes MB and NB */
+
+/*< MB = ILAENV( 2, 'ZTGSYL', TRANS, M, N, -1, -1 ) >*/
+ mb = ilaenv_(&c__2, "ZTGSYL", trans, m, n, &c_n1, &c_n1, (ftnlen)6, (
+ ftnlen)1);
+/*< NB = ILAENV( 5, 'ZTGSYL', TRANS, M, N, -1, -1 ) >*/
+ nb = ilaenv_(&c__5, "ZTGSYL", trans, m, n, &c_n1, &c_n1, (ftnlen)6, (
+ ftnlen)1);
+
+/*< ISOLVE = 1 >*/
+ isolve = 1;
+/*< IFUNC = 0 >*/
+ ifunc = 0;
+/*< IF( NOTRAN ) THEN >*/
+ if (notran) {
+/*< IF( IJOB.GE.3 ) THEN >*/
+ if (*ijob >= 3) {
+/*< IFUNC = IJOB - 2 >*/
+ ifunc = *ijob - 2;
+/*< CALL ZLASET( 'F', M, N, CZERO, CZERO, C, LDC ) >*/
+ zlaset_("F", m, n, &c_b1, &c_b1, &c__[c_offset], ldc, (ftnlen)1);
+/*< CALL ZLASET( 'F', M, N, CZERO, CZERO, F, LDF ) >*/
+ zlaset_("F", m, n, &c_b1, &c_b1, &f[f_offset], ldf, (ftnlen)1);
+/*< ELSE IF( IJOB.GE.1 .AND. NOTRAN ) THEN >*/
+ } else if (*ijob >= 1 && notran) {
+/*< ISOLVE = 2 >*/
+ isolve = 2;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/*< >*/
+ if ((mb <= 1 && nb <= 1) || (mb >= *m && nb >= *n)) {
+
+/* Use unblocked Level 2 solver */
+
+/*< DO 30 IROUND = 1, ISOLVE >*/
+ i__1 = isolve;
+ for (iround = 1; iround <= i__1; ++iround) {
+
+/*< SCALE = ONE >*/
+ *scale = 1.;
+/*< DSCALE = ZERO >*/
+ dscale = 0.;
+/*< DSUM = ONE >*/
+ dsum = 1.;
+/*< PQ = M*N >*/
+ pq = *m * *n;
+/*< >*/
+ ztgsy2_(trans, &ifunc, m, n, &a[a_offset], lda, &b[b_offset], ldb,
+ &c__[c_offset], ldc, &d__[d_offset], ldd, &e[e_offset],
+ lde, &f[f_offset], ldf, scale, &dsum, &dscale, info, (
+ ftnlen)1);
+/*< IF( DSCALE.NE.ZERO ) THEN >*/
+ if (dscale != 0.) {
+/*< IF( IJOB.EQ.1 .OR. IJOB.EQ.3 ) THEN >*/
+ if (*ijob == 1 || *ijob == 3) {
+/*< DIF = SQRT( DBLE( 2*M*N ) ) / ( DSCALE*SQRT( DSUM ) ) >*/
+ *dif = sqrt((doublereal) ((*m << 1) * *n)) / (dscale *
+ sqrt(dsum));
+/*< ELSE >*/
+ } else {
+/*< DIF = SQRT( DBLE( PQ ) ) / ( DSCALE*SQRT( DSUM ) ) >*/
+ *dif = sqrt((doublereal) pq) / (dscale * sqrt(dsum));
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< IF( ISOLVE.EQ.2 .AND. IROUND.EQ.1 ) THEN >*/
+ if (isolve == 2 && iround == 1) {
+/*< IF( NOTRAN ) THEN >*/
+ if (notran) {
+/*< IFUNC = IJOB >*/
+ ifunc = *ijob;
+/*< END IF >*/
+ }
+/*< SCALE2 = SCALE >*/
+ scale2 = *scale;
+/*< CALL ZLACPY( 'F', M, N, C, LDC, WORK, M ) >*/
+ zlacpy_("F", m, n, &c__[c_offset], ldc, &work[1], m, (ftnlen)
+ 1);
+/*< CALL ZLACPY( 'F', M, N, F, LDF, WORK( M*N+1 ), M ) >*/
+ zlacpy_("F", m, n, &f[f_offset], ldf, &work[*m * *n + 1], m, (
+ ftnlen)1);
+/*< CALL ZLASET( 'F', M, N, CZERO, CZERO, C, LDC ) >*/
+ zlaset_("F", m, n, &c_b1, &c_b1, &c__[c_offset], ldc, (ftnlen)
+ 1);
+/*< CALL ZLASET( 'F', M, N, CZERO, CZERO, F, LDF ) >*/
+ zlaset_("F", m, n, &c_b1, &c_b1, &f[f_offset], ldf, (ftnlen)1)
+ ;
+/*< ELSE IF( ISOLVE.EQ.2 .AND. IROUND.EQ.2 ) THEN >*/
+ } else if (isolve == 2 && iround == 2) {
+/*< CALL ZLACPY( 'F', M, N, WORK, M, C, LDC ) >*/
+ zlacpy_("F", m, n, &work[1], m, &c__[c_offset], ldc, (ftnlen)
+ 1);
+/*< CALL ZLACPY( 'F', M, N, WORK( M*N+1 ), M, F, LDF ) >*/
+ zlacpy_("F", m, n, &work[*m * *n + 1], m, &f[f_offset], ldf, (
+ ftnlen)1);
+/*< SCALE = SCALE2 >*/
+ *scale = scale2;
+/*< END IF >*/
+ }
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+
+/*< RETURN >*/
+ return 0;
+
+/*< END IF >*/
+ }
+
+/* Determine block structure of A */
+
+/*< P = 0 >*/
+ p = 0;
+/*< I = 1 >*/
+ i__ = 1;
+/*< 40 CONTINUE >*/
+L40:
+/*< >*/
+ if (i__ > *m) {
+ goto L50;
+ }
+/*< P = P + 1 >*/
+ ++p;
+/*< IWORK( P ) = I >*/
+ iwork[p] = i__;
+/*< I = I + MB >*/
+ i__ += mb;
+/*< >*/
+ if (i__ >= *m) {
+ goto L50;
+ }
+/*< GO TO 40 >*/
+ goto L40;
+/*< 50 CONTINUE >*/
+L50:
+/*< IWORK( P+1 ) = M + 1 >*/
+ iwork[p + 1] = *m + 1;
+/*< >*/
+ if (iwork[p] == iwork[p + 1]) {
+ --p;
+ }
+
+/* Determine block structure of B */
+
+/*< Q = P + 1 >*/
+ q = p + 1;
+/*< J = 1 >*/
+ j = 1;
+/*< 60 CONTINUE >*/
+L60:
+/*< >*/
+ if (j > *n) {
+ goto L70;
+ }
+
+/*< Q = Q + 1 >*/
+ ++q;
+/*< IWORK( Q ) = J >*/
+ iwork[q] = j;
+/*< J = J + NB >*/
+ j += nb;
+/*< >*/
+ if (j >= *n) {
+ goto L70;
+ }
+/*< GO TO 60 >*/
+ goto L60;
+
+/*< 70 CONTINUE >*/
+L70:
+/*< IWORK( Q+1 ) = N + 1 >*/
+ iwork[q + 1] = *n + 1;
+/*< >*/
+ if (iwork[q] == iwork[q + 1]) {
+ --q;
+ }
+
+/*< IF( NOTRAN ) THEN >*/
+ if (notran) {
+/*< DO 150 IROUND = 1, ISOLVE >*/
+ i__1 = isolve;
+ for (iround = 1; iround <= i__1; ++iround) {
+
+/* Solve (I, J) - subsystem */
+/* A(I, I) * R(I, J) - L(I, J) * B(J, J) = C(I, J) */
+/* D(I, I) * R(I, J) - L(I, J) * E(J, J) = F(I, J) */
+/* for I = P, P - 1, ..., 1; J = 1, 2, ..., Q */
+
+/*< PQ = 0 >*/
+ pq = 0;
+/*< SCALE = ONE >*/
+ *scale = 1.;
+/*< DSCALE = ZERO >*/
+ dscale = 0.;
+/*< DSUM = ONE >*/
+ dsum = 1.;
+/*< DO 130 J = P + 2, Q >*/
+ i__2 = q;
+ for (j = p + 2; j <= i__2; ++j) {
+/*< JS = IWORK( J ) >*/
+ js = iwork[j];
+/*< JE = IWORK( J+1 ) - 1 >*/
+ je = iwork[j + 1] - 1;
+/*< NB = JE - JS + 1 >*/
+ nb = je - js + 1;
+/*< DO 120 I = P, 1, -1 >*/
+ for (i__ = p; i__ >= 1; --i__) {
+/*< IS = IWORK( I ) >*/
+ is = iwork[i__];
+/*< IE = IWORK( I+1 ) - 1 >*/
+ ie = iwork[i__ + 1] - 1;
+/*< MB = IE - IS + 1 >*/
+ mb = ie - is + 1;
+/*< >*/
+ ztgsy2_(trans, &ifunc, &mb, &nb, &a[is + is * a_dim1],
+ lda, &b[js + js * b_dim1], ldb, &c__[is + js *
+ c_dim1], ldc, &d__[is + is * d_dim1], ldd, &e[js
+ + js * e_dim1], lde, &f[is + js * f_dim1], ldf, &
+ scaloc, &dsum, &dscale, &linfo, (ftnlen)1);
+/*< >*/
+ if (linfo > 0) {
+ *info = linfo;
+ }
+/*< PQ = PQ + MB*NB >*/
+ pq += mb * nb;
+/*< IF( SCALOC.NE.ONE ) THEN >*/
+ if (scaloc != 1.) {
+/*< DO 80 K = 1, JS - 1 >*/
+ i__3 = js - 1;
+ for (k = 1; k <= i__3; ++k) {
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &c__[k * c_dim1 + 1], &c__1);
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &f[k * f_dim1 + 1], &c__1);
+/*< 80 CONTINUE >*/
+/* L80: */
+ }
+/*< DO 90 K = JS, JE >*/
+ i__3 = je;
+ for (k = js; k <= i__3; ++k) {
+/*< >*/
+ i__4 = is - 1;
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(&i__4, &z__1, &c__[k * c_dim1 + 1], &c__1);
+/*< >*/
+ i__4 = is - 1;
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(&i__4, &z__1, &f[k * f_dim1 + 1], &c__1);
+/*< 90 CONTINUE >*/
+/* L90: */
+ }
+/*< DO 100 K = JS, JE >*/
+ i__3 = je;
+ for (k = js; k <= i__3; ++k) {
+/*< >*/
+ i__4 = *m - ie;
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(&i__4, &z__1, &c__[ie + 1 + k * c_dim1], &
+ c__1);
+/*< >*/
+ i__4 = *m - ie;
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(&i__4, &z__1, &f[ie + 1 + k * f_dim1], &
+ c__1);
+/*< 100 CONTINUE >*/
+/* L100: */
+ }
+/*< DO 110 K = JE + 1, N >*/
+ i__3 = *n;
+ for (k = je + 1; k <= i__3; ++k) {
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &c__[k * c_dim1 + 1], &c__1);
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &f[k * f_dim1 + 1], &c__1);
+/*< 110 CONTINUE >*/
+/* L110: */
+ }
+/*< SCALE = SCALE*SCALOC >*/
+ *scale *= scaloc;
+/*< END IF >*/
+ }
+
+/* Substitute R(I,J) and L(I,J) into remaining equation. */
+
+/*< IF( I.GT.1 ) THEN >*/
+ if (i__ > 1) {
+/*< >*/
+ i__3 = is - 1;
+ zgemm_("N", "N", &i__3, &nb, &mb, &c_b44, &a[is *
+ a_dim1 + 1], lda, &c__[is + js * c_dim1], ldc,
+ &c_b45, &c__[js * c_dim1 + 1], ldc, (ftnlen)
+ 1, (ftnlen)1);
+/*< >*/
+ i__3 = is - 1;
+ zgemm_("N", "N", &i__3, &nb, &mb, &c_b44, &d__[is *
+ d_dim1 + 1], ldd, &c__[is + js * c_dim1], ldc,
+ &c_b45, &f[js * f_dim1 + 1], ldf, (ftnlen)1,
+ (ftnlen)1);
+/*< END IF >*/
+ }
+/*< IF( J.LT.Q ) THEN >*/
+ if (j < q) {
+/*< >*/
+ i__3 = *n - je;
+ zgemm_("N", "N", &mb, &i__3, &nb, &c_b45, &f[is + js *
+ f_dim1], ldf, &b[js + (je + 1) * b_dim1],
+ ldb, &c_b45, &c__[is + (je + 1) * c_dim1],
+ ldc, (ftnlen)1, (ftnlen)1);
+/*< >*/
+ i__3 = *n - je;
+ zgemm_("N", "N", &mb, &i__3, &nb, &c_b45, &f[is + js *
+ f_dim1], ldf, &e[js + (je + 1) * e_dim1],
+ lde, &c_b45, &f[is + (je + 1) * f_dim1], ldf,
+ (ftnlen)1, (ftnlen)1);
+/*< END IF >*/
+ }
+/*< 120 CONTINUE >*/
+/* L120: */
+ }
+/*< 130 CONTINUE >*/
+/* L130: */
+ }
+/*< IF( DSCALE.NE.ZERO ) THEN >*/
+ if (dscale != 0.) {
+/*< IF( IJOB.EQ.1 .OR. IJOB.EQ.3 ) THEN >*/
+ if (*ijob == 1 || *ijob == 3) {
+/*< DIF = SQRT( DBLE( 2*M*N ) ) / ( DSCALE*SQRT( DSUM ) ) >*/
+ *dif = sqrt((doublereal) ((*m << 1) * *n)) / (dscale *
+ sqrt(dsum));
+/*< ELSE >*/
+ } else {
+/*< DIF = SQRT( DBLE( PQ ) ) / ( DSCALE*SQRT( DSUM ) ) >*/
+ *dif = sqrt((doublereal) pq) / (dscale * sqrt(dsum));
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< IF( ISOLVE.EQ.2 .AND. IROUND.EQ.1 ) THEN >*/
+ if (isolve == 2 && iround == 1) {
+/*< IF( NOTRAN ) THEN >*/
+ if (notran) {
+/*< IFUNC = IJOB >*/
+ ifunc = *ijob;
+/*< END IF >*/
+ }
+/*< SCALE2 = SCALE >*/
+ scale2 = *scale;
+/*< CALL ZLACPY( 'F', M, N, C, LDC, WORK, M ) >*/
+ zlacpy_("F", m, n, &c__[c_offset], ldc, &work[1], m, (ftnlen)
+ 1);
+/*< CALL ZLACPY( 'F', M, N, F, LDF, WORK( M*N+1 ), M ) >*/
+ zlacpy_("F", m, n, &f[f_offset], ldf, &work[*m * *n + 1], m, (
+ ftnlen)1);
+/*< CALL ZLASET( 'F', M, N, CZERO, CZERO, C, LDC ) >*/
+ zlaset_("F", m, n, &c_b1, &c_b1, &c__[c_offset], ldc, (ftnlen)
+ 1);
+/*< CALL ZLASET( 'F', M, N, CZERO, CZERO, F, LDF ) >*/
+ zlaset_("F", m, n, &c_b1, &c_b1, &f[f_offset], ldf, (ftnlen)1)
+ ;
+/*< ELSE IF( ISOLVE.EQ.2 .AND. IROUND.EQ.2 ) THEN >*/
+ } else if (isolve == 2 && iround == 2) {
+/*< CALL ZLACPY( 'F', M, N, WORK, M, C, LDC ) >*/
+ zlacpy_("F", m, n, &work[1], m, &c__[c_offset], ldc, (ftnlen)
+ 1);
+/*< CALL ZLACPY( 'F', M, N, WORK( M*N+1 ), M, F, LDF ) >*/
+ zlacpy_("F", m, n, &work[*m * *n + 1], m, &f[f_offset], ldf, (
+ ftnlen)1);
+/*< SCALE = SCALE2 >*/
+ *scale = scale2;
+/*< END IF >*/
+ }
+/*< 150 CONTINUE >*/
+/* L150: */
+ }
+/*< ELSE >*/
+ } else {
+
+/* Solve transposed (I, J)-subsystem */
+/* A(I, I)' * R(I, J) + D(I, I)' * L(I, J) = C(I, J) */
+/* R(I, J) * B(J, J) + L(I, J) * E(J, J) = -F(I, J) */
+/* for I = 1,2,..., P; J = Q, Q-1,..., 1 */
+
+/*< SCALE = ONE >*/
+ *scale = 1.;
+/*< DO 210 I = 1, P >*/
+ i__1 = p;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< IS = IWORK( I ) >*/
+ is = iwork[i__];
+/*< IE = IWORK( I+1 ) - 1 >*/
+ ie = iwork[i__ + 1] - 1;
+/*< MB = IE - IS + 1 >*/
+ mb = ie - is + 1;
+/*< DO 200 J = Q, P + 2, -1 >*/
+ i__2 = p + 2;
+ for (j = q; j >= i__2; --j) {
+/*< JS = IWORK( J ) >*/
+ js = iwork[j];
+/*< JE = IWORK( J+1 ) - 1 >*/
+ je = iwork[j + 1] - 1;
+/*< NB = JE - JS + 1 >*/
+ nb = je - js + 1;
+/*< >*/
+ ztgsy2_(trans, &ifunc, &mb, &nb, &a[is + is * a_dim1], lda, &
+ b[js + js * b_dim1], ldb, &c__[is + js * c_dim1], ldc,
+ &d__[is + is * d_dim1], ldd, &e[js + js * e_dim1],
+ lde, &f[is + js * f_dim1], ldf, &scaloc, &dsum, &
+ dscale, &linfo, (ftnlen)1);
+/*< >*/
+ if (linfo > 0) {
+ *info = linfo;
+ }
+/*< IF( SCALOC.NE.ONE ) THEN >*/
+ if (scaloc != 1.) {
+/*< DO 160 K = 1, JS - 1 >*/
+ i__3 = js - 1;
+ for (k = 1; k <= i__3; ++k) {
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &c__[k * c_dim1 + 1], &c__1);
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &f[k * f_dim1 + 1], &c__1);
+/*< 160 CONTINUE >*/
+/* L160: */
+ }
+/*< DO 170 K = JS, JE >*/
+ i__3 = je;
+ for (k = js; k <= i__3; ++k) {
+/*< >*/
+ i__4 = is - 1;
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(&i__4, &z__1, &c__[k * c_dim1 + 1], &c__1);
+/*< >*/
+ i__4 = is - 1;
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(&i__4, &z__1, &f[k * f_dim1 + 1], &c__1);
+/*< 170 CONTINUE >*/
+/* L170: */
+ }
+/*< DO 180 K = JS, JE >*/
+ i__3 = je;
+ for (k = js; k <= i__3; ++k) {
+/*< >*/
+ i__4 = *m - ie;
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(&i__4, &z__1, &c__[ie + 1 + k * c_dim1], &c__1)
+ ;
+/*< >*/
+ i__4 = *m - ie;
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(&i__4, &z__1, &f[ie + 1 + k * f_dim1], &c__1);
+/*< 180 CONTINUE >*/
+/* L180: */
+ }
+/*< DO 190 K = JE + 1, N >*/
+ i__3 = *n;
+ for (k = je + 1; k <= i__3; ++k) {
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &c__[k * c_dim1 + 1], &c__1);
+/*< >*/
+ z__1.r = scaloc, z__1.i = 0.;
+ zscal_(m, &z__1, &f[k * f_dim1 + 1], &c__1);
+/*< 190 CONTINUE >*/
+/* L190: */
+ }
+/*< SCALE = SCALE*SCALOC >*/
+ *scale *= scaloc;
+/*< END IF >*/
+ }
+
+/* Substitute R(I,J) and L(I,J) into remaining equation. */
+
+/*< IF( J.GT.P+2 ) THEN >*/
+ if (j > p + 2) {
+/*< >*/
+ i__3 = js - 1;
+ zgemm_("N", "C", &mb, &i__3, &nb, &c_b45, &c__[is + js *
+ c_dim1], ldc, &b[js * b_dim1 + 1], ldb, &c_b45, &
+ f[is + f_dim1], ldf, (ftnlen)1, (ftnlen)1);
+/*< >*/
+ i__3 = js - 1;
+ zgemm_("N", "C", &mb, &i__3, &nb, &c_b45, &f[is + js *
+ f_dim1], ldf, &e[js * e_dim1 + 1], lde, &c_b45, &
+ f[is + f_dim1], ldf, (ftnlen)1, (ftnlen)1);
+/*< END IF >*/
+ }
+/*< IF( I.LT.P ) THEN >*/
+ if (i__ < p) {
+/*< >*/
+ i__3 = *m - ie;
+ zgemm_("C", "N", &i__3, &nb, &mb, &c_b44, &a[is + (ie + 1)
+ * a_dim1], lda, &c__[is + js * c_dim1], ldc, &
+ c_b45, &c__[ie + 1 + js * c_dim1], ldc, (ftnlen)1,
+ (ftnlen)1);
+/*< >*/
+ i__3 = *m - ie;
+ zgemm_("C", "N", &i__3, &nb, &mb, &c_b44, &d__[is + (ie +
+ 1) * d_dim1], ldd, &f[is + js * f_dim1], ldf, &
+ c_b45, &c__[ie + 1 + js * c_dim1], ldc, (ftnlen)1,
+ (ftnlen)1);
+/*< END IF >*/
+ }
+/*< 200 CONTINUE >*/
+/* L200: */
+ }
+/*< 210 CONTINUE >*/
+/* L210: */
+ }
+/*< END IF >*/
+ }
+
+/*< WORK( 1 ) = LWMIN >*/
+ work[1].r = (doublereal) lwmin, work[1].i = 0.;
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZTGSYL */
+
+/*< END >*/
+} /* ztgsyl_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.f
new file mode 100644
index 0000000000000000000000000000000000000000..f9e2bfc8417908b311f88391c32b83b0e8e0adc5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.f
@@ -0,0 +1,575 @@
+ SUBROUTINE ZTGSYL( TRANS, IJOB, M, N, A, LDA, B, LDB, C, LDC, D,
+ $ LDD, E, LDE, F, LDF, SCALE, DIF, WORK, LWORK,
+ $ IWORK, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* January 2007
+*
+* .. Scalar Arguments ..
+ CHARACTER TRANS
+ INTEGER IJOB, INFO, LDA, LDB, LDC, LDD, LDE, LDF,
+ $ LWORK, M, N
+ DOUBLE PRECISION DIF, SCALE
+* ..
+* .. Array Arguments ..
+ INTEGER IWORK( * )
+ COMPLEX*16 A( LDA, * ), B( LDB, * ), C( LDC, * ),
+ $ D( LDD, * ), E( LDE, * ), F( LDF, * ),
+ $ WORK( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZTGSYL solves the generalized Sylvester equation:
+*
+* A * R - L * B = scale * C (1)
+* D * R - L * E = scale * F
+*
+* where R and L are unknown m-by-n matrices, (A, D), (B, E) and
+* (C, F) are given matrix pairs of size m-by-m, n-by-n and m-by-n,
+* respectively, with complex entries. A, B, D and E are upper
+* triangular (i.e., (A,D) and (B,E) in generalized Schur form).
+*
+* The solution (R, L) overwrites (C, F). 0 <= SCALE <= 1
+* is an output scaling factor chosen to avoid overflow.
+*
+* In matrix notation (1) is equivalent to solve Zx = scale*b, where Z
+* is defined as
+*
+* Z = [ kron(In, A) -kron(B', Im) ] (2)
+* [ kron(In, D) -kron(E', Im) ],
+*
+* Here Ix is the identity matrix of size x and X' is the conjugate
+* transpose of X. Kron(X, Y) is the Kronecker product between the
+* matrices X and Y.
+*
+* If TRANS = 'C', y in the conjugate transposed system Z'*y = scale*b
+* is solved for, which is equivalent to solve for R and L in
+*
+* A' * R + D' * L = scale * C (3)
+* R * B' + L * E' = scale * -F
+*
+* This case (TRANS = 'C') is used to compute an one-norm-based estimate
+* of Dif[(A,D), (B,E)], the separation between the matrix pairs (A,D)
+* and (B,E), using ZLACON.
+*
+* If IJOB >= 1, ZTGSYL computes a Frobenius norm-based estimate of
+* Dif[(A,D),(B,E)]. That is, the reciprocal of a lower bound on the
+* reciprocal of the smallest singular value of Z.
+*
+* This is a level-3 BLAS algorithm.
+*
+* Arguments
+* =========
+*
+* TRANS (input) CHARACTER*1
+* = 'N': solve the generalized sylvester equation (1).
+* = 'C': solve the "conjugate transposed" system (3).
+*
+* IJOB (input) INTEGER
+* Specifies what kind of functionality to be performed.
+* =0: solve (1) only.
+* =1: The functionality of 0 and 3.
+* =2: The functionality of 0 and 4.
+* =3: Only an estimate of Dif[(A,D), (B,E)] is computed.
+* (look ahead strategy is used).
+* =4: Only an estimate of Dif[(A,D), (B,E)] is computed.
+* (ZGECON on sub-systems is used).
+* Not referenced if TRANS = 'C'.
+*
+* M (input) INTEGER
+* The order of the matrices A and D, and the row dimension of
+* the matrices C, F, R and L.
+*
+* N (input) INTEGER
+* The order of the matrices B and E, and the column dimension
+* of the matrices C, F, R and L.
+*
+* A (input) COMPLEX*16 array, dimension (LDA, M)
+* The upper triangular matrix A.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1, M).
+*
+* B (input) COMPLEX*16 array, dimension (LDB, N)
+* The upper triangular matrix B.
+*
+* LDB (input) INTEGER
+* The leading dimension of the array B. LDB >= max(1, N).
+*
+* C (input/output) COMPLEX*16 array, dimension (LDC, N)
+* On entry, C contains the right-hand-side of the first matrix
+* equation in (1) or (3).
+* On exit, if IJOB = 0, 1 or 2, C has been overwritten by
+* the solution R. If IJOB = 3 or 4 and TRANS = 'N', C holds R,
+* the solution achieved during the computation of the
+* Dif-estimate.
+*
+* LDC (input) INTEGER
+* The leading dimension of the array C. LDC >= max(1, M).
+*
+* D (input) COMPLEX*16 array, dimension (LDD, M)
+* The upper triangular matrix D.
+*
+* LDD (input) INTEGER
+* The leading dimension of the array D. LDD >= max(1, M).
+*
+* E (input) COMPLEX*16 array, dimension (LDE, N)
+* The upper triangular matrix E.
+*
+* LDE (input) INTEGER
+* The leading dimension of the array E. LDE >= max(1, N).
+*
+* F (input/output) COMPLEX*16 array, dimension (LDF, N)
+* On entry, F contains the right-hand-side of the second matrix
+* equation in (1) or (3).
+* On exit, if IJOB = 0, 1 or 2, F has been overwritten by
+* the solution L. If IJOB = 3 or 4 and TRANS = 'N', F holds L,
+* the solution achieved during the computation of the
+* Dif-estimate.
+*
+* LDF (input) INTEGER
+* The leading dimension of the array F. LDF >= max(1, M).
+*
+* DIF (output) DOUBLE PRECISION
+* On exit DIF is the reciprocal of a lower bound of the
+* reciprocal of the Dif-function, i.e. DIF is an upper bound of
+* Dif[(A,D), (B,E)] = sigma-min(Z), where Z as in (2).
+* IF IJOB = 0 or TRANS = 'C', DIF is not referenced.
+*
+* SCALE (output) DOUBLE PRECISION
+* On exit SCALE is the scaling factor in (1) or (3).
+* If 0 < SCALE < 1, C and F hold the solutions R and L, resp.,
+* to a slightly perturbed system but the input matrices A, B,
+* D and E have not been changed. If SCALE = 0, R and L will
+* hold the solutions to the homogenious system with C = F = 0.
+*
+* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))
+* On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
+*
+* LWORK (input) INTEGER
+* The dimension of the array WORK. LWORK > = 1.
+* If IJOB = 1 or 2 and TRANS = 'N', LWORK >= max(1,2*M*N).
+*
+* If LWORK = -1, then a workspace query is assumed; the routine
+* only calculates the optimal size of the WORK array, returns
+* this value as the first entry of the WORK array, and no error
+* message related to LWORK is issued by XERBLA.
+*
+* IWORK (workspace) INTEGER array, dimension (M+N+2)
+*
+* INFO (output) INTEGER
+* =0: successful exit
+* <0: If INFO = -i, the i-th argument had an illegal value.
+* >0: (A, D) and (B, E) have common or very close
+* eigenvalues.
+*
+* Further Details
+* ===============
+*
+* Based on contributions by
+* Bo Kagstrom and Peter Poromaa, Department of Computing Science,
+* Umea University, S-901 87 Umea, Sweden.
+*
+* [1] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software
+* for Solving the Generalized Sylvester Equation and Estimating the
+* Separation between Regular Matrix Pairs, Report UMINF - 93.23,
+* Department of Computing Science, Umea University, S-901 87 Umea,
+* Sweden, December 1993, Revised April 1994, Also as LAPACK Working
+* Note 75. To appear in ACM Trans. on Math. Software, Vol 22,
+* No 1, 1996.
+*
+* [2] B. Kagstrom, A Perturbation Analysis of the Generalized Sylvester
+* Equation (AR - LB, DR - LE ) = (C, F), SIAM J. Matrix Anal.
+* Appl., 15(4):1045-1060, 1994.
+*
+* [3] B. Kagstrom and L. Westin, Generalized Schur Methods with
+* Condition Estimators for Solving the Generalized Sylvester
+* Equation, IEEE Transactions on Automatic Control, Vol. 34, No. 7,
+* July 1989, pp 745-751.
+*
+* =====================================================================
+* Replaced various illegal calls to CCOPY by calls to CLASET.
+* Sven Hammarling, 1/5/02.
+*
+* .. Parameters ..
+ DOUBLE PRECISION ZERO, ONE
+ PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 )
+ COMPLEX*16 CZERO
+ PARAMETER ( CZERO = (0.0D+0, 0.0D+0) )
+* ..
+* .. Local Scalars ..
+ LOGICAL LQUERY, NOTRAN
+ INTEGER I, IE, IFUNC, IROUND, IS, ISOLVE, J, JE, JS, K,
+ $ LINFO, LWMIN, MB, NB, P, PQ, Q
+ DOUBLE PRECISION DSCALE, DSUM, SCALE2, SCALOC
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ INTEGER ILAENV
+ EXTERNAL LSAME, ILAENV
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZGEMM, ZLACPY, ZLASET, ZSCAL, ZTGSY2
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC DBLE, DCMPLX, MAX, SQRT
+* ..
+* .. Executable Statements ..
+*
+* Decode and test input parameters
+*
+ INFO = 0
+ NOTRAN = LSAME( TRANS, 'N' )
+ LQUERY = ( LWORK.EQ.-1 )
+*
+ IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN
+ INFO = -1
+ ELSE IF( NOTRAN ) THEN
+ IF( ( IJOB.LT.0 ) .OR. ( IJOB.GT.4 ) ) THEN
+ INFO = -2
+ END IF
+ END IF
+ IF( INFO.EQ.0 ) THEN
+ IF( M.LE.0 ) THEN
+ INFO = -3
+ ELSE IF( N.LE.0 ) THEN
+ INFO = -4
+ ELSE IF( LDA.LT.MAX( 1, M ) ) THEN
+ INFO = -6
+ ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
+ INFO = -8
+ ELSE IF( LDC.LT.MAX( 1, M ) ) THEN
+ INFO = -10
+ ELSE IF( LDD.LT.MAX( 1, M ) ) THEN
+ INFO = -12
+ ELSE IF( LDE.LT.MAX( 1, N ) ) THEN
+ INFO = -14
+ ELSE IF( LDF.LT.MAX( 1, M ) ) THEN
+ INFO = -16
+ END IF
+ END IF
+*
+ IF( INFO.EQ.0 ) THEN
+ IF( NOTRAN ) THEN
+ IF( IJOB.EQ.1 .OR. IJOB.EQ.2 ) THEN
+ LWMIN = MAX( 1, 2*M*N )
+ ELSE
+ LWMIN = 1
+ END IF
+ ELSE
+ LWMIN = 1
+ END IF
+ WORK( 1 ) = LWMIN
+*
+ IF( LWORK.LT.LWMIN .AND. .NOT.LQUERY ) THEN
+ INFO = -20
+ END IF
+ END IF
+*
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZTGSYL', -INFO )
+ RETURN
+ ELSE IF( LQUERY ) THEN
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( M.EQ.0 .OR. N.EQ.0 ) THEN
+ SCALE = 1
+ IF( NOTRAN ) THEN
+ IF( IJOB.NE.0 ) THEN
+ DIF = 0
+ END IF
+ END IF
+ RETURN
+ END IF
+*
+* Determine optimal block sizes MB and NB
+*
+ MB = ILAENV( 2, 'ZTGSYL', TRANS, M, N, -1, -1 )
+ NB = ILAENV( 5, 'ZTGSYL', TRANS, M, N, -1, -1 )
+*
+ ISOLVE = 1
+ IFUNC = 0
+ IF( NOTRAN ) THEN
+ IF( IJOB.GE.3 ) THEN
+ IFUNC = IJOB - 2
+ CALL ZLASET( 'F', M, N, CZERO, CZERO, C, LDC )
+ CALL ZLASET( 'F', M, N, CZERO, CZERO, F, LDF )
+ ELSE IF( IJOB.GE.1 .AND. NOTRAN ) THEN
+ ISOLVE = 2
+ END IF
+ END IF
+*
+ IF( ( MB.LE.1 .AND. NB.LE.1 ) .OR. ( MB.GE.M .AND. NB.GE.N ) )
+ $ THEN
+*
+* Use unblocked Level 2 solver
+*
+ DO 30 IROUND = 1, ISOLVE
+*
+ SCALE = ONE
+ DSCALE = ZERO
+ DSUM = ONE
+ PQ = M*N
+ CALL ZTGSY2( TRANS, IFUNC, M, N, A, LDA, B, LDB, C, LDC, D,
+ $ LDD, E, LDE, F, LDF, SCALE, DSUM, DSCALE,
+ $ INFO )
+ IF( DSCALE.NE.ZERO ) THEN
+ IF( IJOB.EQ.1 .OR. IJOB.EQ.3 ) THEN
+ DIF = SQRT( DBLE( 2*M*N ) ) / ( DSCALE*SQRT( DSUM ) )
+ ELSE
+ DIF = SQRT( DBLE( PQ ) ) / ( DSCALE*SQRT( DSUM ) )
+ END IF
+ END IF
+ IF( ISOLVE.EQ.2 .AND. IROUND.EQ.1 ) THEN
+ IF( NOTRAN ) THEN
+ IFUNC = IJOB
+ END IF
+ SCALE2 = SCALE
+ CALL ZLACPY( 'F', M, N, C, LDC, WORK, M )
+ CALL ZLACPY( 'F', M, N, F, LDF, WORK( M*N+1 ), M )
+ CALL ZLASET( 'F', M, N, CZERO, CZERO, C, LDC )
+ CALL ZLASET( 'F', M, N, CZERO, CZERO, F, LDF )
+ ELSE IF( ISOLVE.EQ.2 .AND. IROUND.EQ.2 ) THEN
+ CALL ZLACPY( 'F', M, N, WORK, M, C, LDC )
+ CALL ZLACPY( 'F', M, N, WORK( M*N+1 ), M, F, LDF )
+ SCALE = SCALE2
+ END IF
+ 30 CONTINUE
+*
+ RETURN
+*
+ END IF
+*
+* Determine block structure of A
+*
+ P = 0
+ I = 1
+ 40 CONTINUE
+ IF( I.GT.M )
+ $ GO TO 50
+ P = P + 1
+ IWORK( P ) = I
+ I = I + MB
+ IF( I.GE.M )
+ $ GO TO 50
+ GO TO 40
+ 50 CONTINUE
+ IWORK( P+1 ) = M + 1
+ IF( IWORK( P ).EQ.IWORK( P+1 ) )
+ $ P = P - 1
+*
+* Determine block structure of B
+*
+ Q = P + 1
+ J = 1
+ 60 CONTINUE
+ IF( J.GT.N )
+ $ GO TO 70
+*
+ Q = Q + 1
+ IWORK( Q ) = J
+ J = J + NB
+ IF( J.GE.N )
+ $ GO TO 70
+ GO TO 60
+*
+ 70 CONTINUE
+ IWORK( Q+1 ) = N + 1
+ IF( IWORK( Q ).EQ.IWORK( Q+1 ) )
+ $ Q = Q - 1
+*
+ IF( NOTRAN ) THEN
+ DO 150 IROUND = 1, ISOLVE
+*
+* Solve (I, J) - subsystem
+* A(I, I) * R(I, J) - L(I, J) * B(J, J) = C(I, J)
+* D(I, I) * R(I, J) - L(I, J) * E(J, J) = F(I, J)
+* for I = P, P - 1, ..., 1; J = 1, 2, ..., Q
+*
+ PQ = 0
+ SCALE = ONE
+ DSCALE = ZERO
+ DSUM = ONE
+ DO 130 J = P + 2, Q
+ JS = IWORK( J )
+ JE = IWORK( J+1 ) - 1
+ NB = JE - JS + 1
+ DO 120 I = P, 1, -1
+ IS = IWORK( I )
+ IE = IWORK( I+1 ) - 1
+ MB = IE - IS + 1
+ CALL ZTGSY2( TRANS, IFUNC, MB, NB, A( IS, IS ), LDA,
+ $ B( JS, JS ), LDB, C( IS, JS ), LDC,
+ $ D( IS, IS ), LDD, E( JS, JS ), LDE,
+ $ F( IS, JS ), LDF, SCALOC, DSUM, DSCALE,
+ $ LINFO )
+ IF( LINFO.GT.0 )
+ $ INFO = LINFO
+ PQ = PQ + MB*NB
+ IF( SCALOC.NE.ONE ) THEN
+ DO 80 K = 1, JS - 1
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ),
+ $ C( 1, K ), 1 )
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ),
+ $ F( 1, K ), 1 )
+ 80 CONTINUE
+ DO 90 K = JS, JE
+ CALL ZSCAL( IS-1, DCMPLX( SCALOC, ZERO ),
+ $ C( 1, K ), 1 )
+ CALL ZSCAL( IS-1, DCMPLX( SCALOC, ZERO ),
+ $ F( 1, K ), 1 )
+ 90 CONTINUE
+ DO 100 K = JS, JE
+ CALL ZSCAL( M-IE, DCMPLX( SCALOC, ZERO ),
+ $ C( IE+1, K ), 1 )
+ CALL ZSCAL( M-IE, DCMPLX( SCALOC, ZERO ),
+ $ F( IE+1, K ), 1 )
+ 100 CONTINUE
+ DO 110 K = JE + 1, N
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ),
+ $ C( 1, K ), 1 )
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ),
+ $ F( 1, K ), 1 )
+ 110 CONTINUE
+ SCALE = SCALE*SCALOC
+ END IF
+*
+* Substitute R(I,J) and L(I,J) into remaining equation.
+*
+ IF( I.GT.1 ) THEN
+ CALL ZGEMM( 'N', 'N', IS-1, NB, MB,
+ $ DCMPLX( -ONE, ZERO ), A( 1, IS ), LDA,
+ $ C( IS, JS ), LDC, DCMPLX( ONE, ZERO ),
+ $ C( 1, JS ), LDC )
+ CALL ZGEMM( 'N', 'N', IS-1, NB, MB,
+ $ DCMPLX( -ONE, ZERO ), D( 1, IS ), LDD,
+ $ C( IS, JS ), LDC, DCMPLX( ONE, ZERO ),
+ $ F( 1, JS ), LDF )
+ END IF
+ IF( J.LT.Q ) THEN
+ CALL ZGEMM( 'N', 'N', MB, N-JE, NB,
+ $ DCMPLX( ONE, ZERO ), F( IS, JS ), LDF,
+ $ B( JS, JE+1 ), LDB,
+ $ DCMPLX( ONE, ZERO ), C( IS, JE+1 ),
+ $ LDC )
+ CALL ZGEMM( 'N', 'N', MB, N-JE, NB,
+ $ DCMPLX( ONE, ZERO ), F( IS, JS ), LDF,
+ $ E( JS, JE+1 ), LDE,
+ $ DCMPLX( ONE, ZERO ), F( IS, JE+1 ),
+ $ LDF )
+ END IF
+ 120 CONTINUE
+ 130 CONTINUE
+ IF( DSCALE.NE.ZERO ) THEN
+ IF( IJOB.EQ.1 .OR. IJOB.EQ.3 ) THEN
+ DIF = SQRT( DBLE( 2*M*N ) ) / ( DSCALE*SQRT( DSUM ) )
+ ELSE
+ DIF = SQRT( DBLE( PQ ) ) / ( DSCALE*SQRT( DSUM ) )
+ END IF
+ END IF
+ IF( ISOLVE.EQ.2 .AND. IROUND.EQ.1 ) THEN
+ IF( NOTRAN ) THEN
+ IFUNC = IJOB
+ END IF
+ SCALE2 = SCALE
+ CALL ZLACPY( 'F', M, N, C, LDC, WORK, M )
+ CALL ZLACPY( 'F', M, N, F, LDF, WORK( M*N+1 ), M )
+ CALL ZLASET( 'F', M, N, CZERO, CZERO, C, LDC )
+ CALL ZLASET( 'F', M, N, CZERO, CZERO, F, LDF )
+ ELSE IF( ISOLVE.EQ.2 .AND. IROUND.EQ.2 ) THEN
+ CALL ZLACPY( 'F', M, N, WORK, M, C, LDC )
+ CALL ZLACPY( 'F', M, N, WORK( M*N+1 ), M, F, LDF )
+ SCALE = SCALE2
+ END IF
+ 150 CONTINUE
+ ELSE
+*
+* Solve transposed (I, J)-subsystem
+* A(I, I)' * R(I, J) + D(I, I)' * L(I, J) = C(I, J)
+* R(I, J) * B(J, J) + L(I, J) * E(J, J) = -F(I, J)
+* for I = 1,2,..., P; J = Q, Q-1,..., 1
+*
+ SCALE = ONE
+ DO 210 I = 1, P
+ IS = IWORK( I )
+ IE = IWORK( I+1 ) - 1
+ MB = IE - IS + 1
+ DO 200 J = Q, P + 2, -1
+ JS = IWORK( J )
+ JE = IWORK( J+1 ) - 1
+ NB = JE - JS + 1
+ CALL ZTGSY2( TRANS, IFUNC, MB, NB, A( IS, IS ), LDA,
+ $ B( JS, JS ), LDB, C( IS, JS ), LDC,
+ $ D( IS, IS ), LDD, E( JS, JS ), LDE,
+ $ F( IS, JS ), LDF, SCALOC, DSUM, DSCALE,
+ $ LINFO )
+ IF( LINFO.GT.0 )
+ $ INFO = LINFO
+ IF( SCALOC.NE.ONE ) THEN
+ DO 160 K = 1, JS - 1
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ), C( 1, K ),
+ $ 1 )
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ), F( 1, K ),
+ $ 1 )
+ 160 CONTINUE
+ DO 170 K = JS, JE
+ CALL ZSCAL( IS-1, DCMPLX( SCALOC, ZERO ),
+ $ C( 1, K ), 1 )
+ CALL ZSCAL( IS-1, DCMPLX( SCALOC, ZERO ),
+ $ F( 1, K ), 1 )
+ 170 CONTINUE
+ DO 180 K = JS, JE
+ CALL ZSCAL( M-IE, DCMPLX( SCALOC, ZERO ),
+ $ C( IE+1, K ), 1 )
+ CALL ZSCAL( M-IE, DCMPLX( SCALOC, ZERO ),
+ $ F( IE+1, K ), 1 )
+ 180 CONTINUE
+ DO 190 K = JE + 1, N
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ), C( 1, K ),
+ $ 1 )
+ CALL ZSCAL( M, DCMPLX( SCALOC, ZERO ), F( 1, K ),
+ $ 1 )
+ 190 CONTINUE
+ SCALE = SCALE*SCALOC
+ END IF
+*
+* Substitute R(I,J) and L(I,J) into remaining equation.
+*
+ IF( J.GT.P+2 ) THEN
+ CALL ZGEMM( 'N', 'C', MB, JS-1, NB,
+ $ DCMPLX( ONE, ZERO ), C( IS, JS ), LDC,
+ $ B( 1, JS ), LDB, DCMPLX( ONE, ZERO ),
+ $ F( IS, 1 ), LDF )
+ CALL ZGEMM( 'N', 'C', MB, JS-1, NB,
+ $ DCMPLX( ONE, ZERO ), F( IS, JS ), LDF,
+ $ E( 1, JS ), LDE, DCMPLX( ONE, ZERO ),
+ $ F( IS, 1 ), LDF )
+ END IF
+ IF( I.LT.P ) THEN
+ CALL ZGEMM( 'C', 'N', M-IE, NB, MB,
+ $ DCMPLX( -ONE, ZERO ), A( IS, IE+1 ), LDA,
+ $ C( IS, JS ), LDC, DCMPLX( ONE, ZERO ),
+ $ C( IE+1, JS ), LDC )
+ CALL ZGEMM( 'C', 'N', M-IE, NB, MB,
+ $ DCMPLX( -ONE, ZERO ), D( IS, IE+1 ), LDD,
+ $ F( IS, JS ), LDF, DCMPLX( ONE, ZERO ),
+ $ C( IE+1, JS ), LDC )
+ END IF
+ 200 CONTINUE
+ 210 CONTINUE
+ END IF
+*
+ WORK( 1 ) = LWMIN
+*
+ RETURN
+*
+* End of ZTGSYL
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.h
new file mode 100644
index 0000000000000000000000000000000000000000..371ec08509c01e3b4519967b8c91b8ea810ec8b5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztgsyl.h
@@ -0,0 +1,25 @@
+extern int v3p_netlib_ztgsyl_(
+ char *trans,
+ v3p_netlib_integer *ijob,
+ v3p_netlib_integer *m,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *b,
+ v3p_netlib_integer *ldb,
+ v3p_netlib_doublecomplex *c__,
+ v3p_netlib_integer *ldc,
+ v3p_netlib_doublecomplex *d__,
+ v3p_netlib_integer *ldd,
+ v3p_netlib_doublecomplex *e,
+ v3p_netlib_integer *lde,
+ v3p_netlib_doublecomplex *f,
+ v3p_netlib_integer *ldf,
+ v3p_netlib_doublereal *scale,
+ v3p_netlib_doublereal *dif,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_integer *lwork,
+ v3p_netlib_integer *iwork,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen trans_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrevc.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrevc.c
index dce452f8c16cc7038f854dc4b9ffada2b27dfc4a..7645926ececf47344d5a29b043f880223cdc87ca 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrevc.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrevc.c
@@ -44,7 +44,7 @@ static integer c__1 = 1;
doublereal unfl, ovfl, smin;
logical over;
doublereal scale;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
doublereal remax;
logical leftv, bothv;
extern /* Subroutine */ int zgemv_(char *, integer *, integer *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.P
new file mode 100644
index 0000000000000000000000000000000000000000..c3a4322c09c2310cebedb56a7c2209821cdeb67e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.P
@@ -0,0 +1,5 @@
+extern int ztrexc_(char *compq, integer *n, doublecomplex *t, integer *ldt, doublecomplex *q, integer *ldq, integer *ifst, integer *ilst, integer *info, ftnlen compq_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zlartg_ 14 5 9 9 7 9 9 */
+/*:ref: zrot_ 14 7 4 9 4 9 4 7 9 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.c
new file mode 100644
index 0000000000000000000000000000000000000000..e163868c0e2259bd6ea278af32db0bc0b91804ca
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.c
@@ -0,0 +1,278 @@
+/* lapack/complex16/ztrexc.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+
+/*< SUBROUTINE ZTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, INFO ) >*/
+/* Subroutine */ int ztrexc_(char *compq, integer *n, doublecomplex *t,
+ integer *ldt, doublecomplex *q, integer *ldq, integer *ifst, integer *
+ ilst, integer *info, ftnlen compq_len)
+{
+ /* System generated locals */
+ integer q_dim1, q_offset, t_dim1, t_offset, i__1, i__2, i__3;
+ doublecomplex z__1;
+
+ /* Builtin functions */
+ void d_cnjg(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ integer k, m1, m2, m3;
+ doublereal cs;
+ doublecomplex t11, t22, sn, temp;
+ extern /* Subroutine */ int zrot_(integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublereal *, doublecomplex *);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ logical wantq;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen), zlartg_(
+ doublecomplex *, doublecomplex *, doublereal *, doublecomplex *,
+ doublecomplex *);
+ (void)compq_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER COMPQ >*/
+/*< INTEGER IFST, ILST, INFO, LDQ, LDT, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< COMPLEX*16 Q( LDQ, * ), T( LDT, * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZTREXC reorders the Schur factorization of a complex matrix */
+/* A = Q*T*Q**H, so that the diagonal element of T with row index IFST */
+/* is moved to row ILST. */
+
+/* The Schur form T is reordered by a unitary similarity transformation */
+/* Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by */
+/* postmultplying it with Z. */
+
+/* Arguments */
+/* ========= */
+
+/* COMPQ (input) CHARACTER*1 */
+/* = 'V': update the matrix Q of Schur vectors; */
+/* = 'N': do not update Q. */
+
+/* N (input) INTEGER */
+/* The order of the matrix T. N >= 0. */
+
+/* T (input/output) COMPLEX*16 array, dimension (LDT,N) */
+/* On entry, the upper triangular matrix T. */
+/* On exit, the reordered upper triangular matrix. */
+
+/* LDT (input) INTEGER */
+/* The leading dimension of the array T. LDT >= max(1,N). */
+
+/* Q (input/output) COMPLEX*16 array, dimension (LDQ,N) */
+/* On entry, if COMPQ = 'V', the matrix Q of Schur vectors. */
+/* On exit, if COMPQ = 'V', Q has been postmultiplied by the */
+/* unitary transformation matrix Z which reorders T. */
+/* If COMPQ = 'N', Q is not referenced. */
+
+/* LDQ (input) INTEGER */
+/* The leading dimension of the array Q. LDQ >= max(1,N). */
+
+/* IFST (input) INTEGER */
+/* ILST (input) INTEGER */
+/* Specify the reordering of the diagonal elements of T: */
+/* The element with row index IFST is moved to row ILST by a */
+/* sequence of transpositions between adjacent elements. */
+/* 1 <= IFST <= N; 1 <= ILST <= N. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+
+/* ===================================================================== */
+
+/* .. Local Scalars .. */
+/*< LOGICAL WANTQ >*/
+/*< INTEGER K, M1, M2, M3 >*/
+/*< DOUBLE PRECISION CS >*/
+/*< COMPLEX*16 SN, T11, T22, TEMP >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< EXTERNAL LSAME >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZLARTG, ZROT >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC DCONJG, MAX >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Decode and test the input parameters. */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ t_dim1 = *ldt;
+ t_offset = 1 + t_dim1;
+ t -= t_offset;
+ q_dim1 = *ldq;
+ q_offset = 1 + q_dim1;
+ q -= q_offset;
+
+ /* Function Body */
+ *info = 0;
+/*< WANTQ = LSAME( COMPQ, 'V' ) >*/
+ wantq = lsame_(compq, "V", (ftnlen)1, (ftnlen)1);
+/*< IF( .NOT.LSAME( COMPQ, 'N' ) .AND. .NOT.WANTQ ) THEN >*/
+ if (! lsame_(compq, "N", (ftnlen)1, (ftnlen)1) && ! wantq) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( LDT.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldt < max(1,*n)) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( LDQ.LT.1 .OR. ( WANTQ .AND. LDQ.LT.MAX( 1, N ) ) ) THEN >*/
+ } else if (*ldq < 1 || (wantq && *ldq < max(1,*n))) {
+/*< INFO = -6 >*/
+ *info = -6;
+/*< ELSE IF( IFST.LT.1 .OR. IFST.GT.N ) THEN >*/
+ } else if (*ifst < 1 || *ifst > *n) {
+/*< INFO = -7 >*/
+ *info = -7;
+/*< ELSE IF( ILST.LT.1 .OR. ILST.GT.N ) THEN >*/
+ } else if (*ilst < 1 || *ilst > *n) {
+/*< INFO = -8 >*/
+ *info = -8;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZTREXC', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZTREXC", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< >*/
+ if (*n == 1 || *ifst == *ilst) {
+ return 0;
+ }
+
+/*< IF( IFST.LT.ILST ) THEN >*/
+ if (*ifst < *ilst) {
+
+/* Move the IFST-th diagonal element forward down the diagonal. */
+
+/*< M1 = 0 >*/
+ m1 = 0;
+/*< M2 = -1 >*/
+ m2 = -1;
+/*< M3 = 1 >*/
+ m3 = 1;
+/*< ELSE >*/
+ } else {
+
+/* Move the IFST-th diagonal element backward up the diagonal. */
+
+/*< M1 = -1 >*/
+ m1 = -1;
+/*< M2 = 0 >*/
+ m2 = 0;
+/*< M3 = -1 >*/
+ m3 = -1;
+/*< END IF >*/
+ }
+
+/*< DO 10 K = IFST + M1, ILST + M2, M3 >*/
+ i__1 = *ilst + m2;
+ i__2 = m3;
+ for (k = *ifst + m1; i__2 < 0 ? k >= i__1 : k <= i__1; k += i__2) {
+
+/* Interchange the k-th and (k+1)-th diagonal elements. */
+
+/*< T11 = T( K, K ) >*/
+ i__3 = k + k * t_dim1;
+ t11.r = t[i__3].r, t11.i = t[i__3].i;
+/*< T22 = T( K+1, K+1 ) >*/
+ i__3 = k + 1 + (k + 1) * t_dim1;
+ t22.r = t[i__3].r, t22.i = t[i__3].i;
+
+/* Determine the transformation to perform the interchange. */
+
+/*< CALL ZLARTG( T( K, K+1 ), T22-T11, CS, SN, TEMP ) >*/
+ z__1.r = t22.r - t11.r, z__1.i = t22.i - t11.i;
+ zlartg_(&t[k + (k + 1) * t_dim1], &z__1, &cs, &sn, &temp);
+
+/* Apply transformation to the matrix T. */
+
+/*< >*/
+ if (k + 2 <= *n) {
+ i__3 = *n - k - 1;
+ zrot_(&i__3, &t[k + (k + 2) * t_dim1], ldt, &t[k + 1 + (k + 2) *
+ t_dim1], ldt, &cs, &sn);
+ }
+/*< >*/
+ i__3 = k - 1;
+ d_cnjg(&z__1, &sn);
+ zrot_(&i__3, &t[k * t_dim1 + 1], &c__1, &t[(k + 1) * t_dim1 + 1], &
+ c__1, &cs, &z__1);
+
+/*< T( K, K ) = T22 >*/
+ i__3 = k + k * t_dim1;
+ t[i__3].r = t22.r, t[i__3].i = t22.i;
+/*< T( K+1, K+1 ) = T11 >*/
+ i__3 = k + 1 + (k + 1) * t_dim1;
+ t[i__3].r = t11.r, t[i__3].i = t11.i;
+
+/*< IF( WANTQ ) THEN >*/
+ if (wantq) {
+
+/* Accumulate transformation in the matrix Q. */
+
+/*< >*/
+ d_cnjg(&z__1, &sn);
+ zrot_(n, &q[k * q_dim1 + 1], &c__1, &q[(k + 1) * q_dim1 + 1], &
+ c__1, &cs, &z__1);
+/*< END IF >*/
+ }
+
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZTREXC */
+
+/*< END >*/
+} /* ztrexc_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.f
new file mode 100644
index 0000000000000000000000000000000000000000..e259e1225d86b285c99181285a922b1014ec2744
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.f
@@ -0,0 +1,163 @@
+ SUBROUTINE ZTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER COMPQ
+ INTEGER IFST, ILST, INFO, LDQ, LDT, N
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 Q( LDQ, * ), T( LDT, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZTREXC reorders the Schur factorization of a complex matrix
+* A = Q*T*Q**H, so that the diagonal element of T with row index IFST
+* is moved to row ILST.
+*
+* The Schur form T is reordered by a unitary similarity transformation
+* Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by
+* postmultplying it with Z.
+*
+* Arguments
+* =========
+*
+* COMPQ (input) CHARACTER*1
+* = 'V': update the matrix Q of Schur vectors;
+* = 'N': do not update Q.
+*
+* N (input) INTEGER
+* The order of the matrix T. N >= 0.
+*
+* T (input/output) COMPLEX*16 array, dimension (LDT,N)
+* On entry, the upper triangular matrix T.
+* On exit, the reordered upper triangular matrix.
+*
+* LDT (input) INTEGER
+* The leading dimension of the array T. LDT >= max(1,N).
+*
+* Q (input/output) COMPLEX*16 array, dimension (LDQ,N)
+* On entry, if COMPQ = 'V', the matrix Q of Schur vectors.
+* On exit, if COMPQ = 'V', Q has been postmultiplied by the
+* unitary transformation matrix Z which reorders T.
+* If COMPQ = 'N', Q is not referenced.
+*
+* LDQ (input) INTEGER
+* The leading dimension of the array Q. LDQ >= max(1,N).
+*
+* IFST (input) INTEGER
+* ILST (input) INTEGER
+* Specify the reordering of the diagonal elements of T:
+* The element with row index IFST is moved to row ILST by a
+* sequence of transpositions between adjacent elements.
+* 1 <= IFST <= N; 1 <= ILST <= N.
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+*
+* =====================================================================
+*
+* .. Local Scalars ..
+ LOGICAL WANTQ
+ INTEGER K, M1, M2, M3
+ DOUBLE PRECISION CS
+ COMPLEX*16 SN, T11, T22, TEMP
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ EXTERNAL LSAME
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZLARTG, ZROT
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC DCONJG, MAX
+* ..
+* .. Executable Statements ..
+*
+* Decode and test the input parameters.
+*
+ INFO = 0
+ WANTQ = LSAME( COMPQ, 'V' )
+ IF( .NOT.LSAME( COMPQ, 'N' ) .AND. .NOT.WANTQ ) THEN
+ INFO = -1
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -2
+ ELSE IF( LDT.LT.MAX( 1, N ) ) THEN
+ INFO = -4
+ ELSE IF( LDQ.LT.1 .OR. ( WANTQ .AND. LDQ.LT.MAX( 1, N ) ) ) THEN
+ INFO = -6
+ ELSE IF( IFST.LT.1 .OR. IFST.GT.N ) THEN
+ INFO = -7
+ ELSE IF( ILST.LT.1 .OR. ILST.GT.N ) THEN
+ INFO = -8
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZTREXC', -INFO )
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( N.EQ.1 .OR. IFST.EQ.ILST )
+ $ RETURN
+*
+ IF( IFST.LT.ILST ) THEN
+*
+* Move the IFST-th diagonal element forward down the diagonal.
+*
+ M1 = 0
+ M2 = -1
+ M3 = 1
+ ELSE
+*
+* Move the IFST-th diagonal element backward up the diagonal.
+*
+ M1 = -1
+ M2 = 0
+ M3 = -1
+ END IF
+*
+ DO 10 K = IFST + M1, ILST + M2, M3
+*
+* Interchange the k-th and (k+1)-th diagonal elements.
+*
+ T11 = T( K, K )
+ T22 = T( K+1, K+1 )
+*
+* Determine the transformation to perform the interchange.
+*
+ CALL ZLARTG( T( K, K+1 ), T22-T11, CS, SN, TEMP )
+*
+* Apply transformation to the matrix T.
+*
+ IF( K+2.LE.N )
+ $ CALL ZROT( N-K-1, T( K, K+2 ), LDT, T( K+1, K+2 ), LDT, CS,
+ $ SN )
+ CALL ZROT( K-1, T( 1, K ), 1, T( 1, K+1 ), 1, CS,
+ $ DCONJG( SN ) )
+*
+ T( K, K ) = T22
+ T( K+1, K+1 ) = T11
+*
+ IF( WANTQ ) THEN
+*
+* Accumulate transformation in the matrix Q.
+*
+ CALL ZROT( N, Q( 1, K ), 1, Q( 1, K+1 ), 1, CS,
+ $ DCONJG( SN ) )
+ END IF
+*
+ 10 CONTINUE
+*
+ RETURN
+*
+* End of ZTREXC
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.h
new file mode 100644
index 0000000000000000000000000000000000000000..5b0b0f7e7b5371bd4651f9bf7adb4b83881a191b
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrexc.h
@@ -0,0 +1,12 @@
+extern int v3p_netlib_ztrexc_(
+ char *compq,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *t,
+ v3p_netlib_integer *ldt,
+ v3p_netlib_doublecomplex *q,
+ v3p_netlib_integer *ldq,
+ v3p_netlib_integer *ifst,
+ v3p_netlib_integer *ilst,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen compq_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.P
new file mode 100644
index 0000000000000000000000000000000000000000..9160fc3228b8bdd96b332c90cffadf575a8b5123
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.P
@@ -0,0 +1,8 @@
+extern int ztrsen_(char *job, char *compq, logical *select, integer *n, doublecomplex *t, integer *ldt, doublecomplex *q, integer *ldq, doublecomplex *w, integer *m, doublereal *s, doublereal *sep, doublecomplex *work, integer *lwork, integer *info, ftnlen job_len, ftnlen compq_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zlange_ 7 7 13 4 4 9 4 7 124 */
+/*:ref: ztrexc_ 14 10 13 4 9 4 9 4 4 4 4 124 */
+/*:ref: zlacpy_ 14 8 13 4 4 9 4 9 4 124 */
+/*:ref: ztrsyl_ 14 15 13 13 4 4 4 9 4 9 4 9 4 7 4 124 124 */
+/*:ref: zlacn2_ 14 6 4 9 9 7 4 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.c
new file mode 100644
index 0000000000000000000000000000000000000000..338d3ab8ab755632eb397cccdc2ef5dd3d9583fc
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.c
@@ -0,0 +1,538 @@
+/* lapack/complex16/ztrsen.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c_n1 = -1;
+
+/*< >*/
+/* Subroutine */ int ztrsen_(char *job, char *compq, logical *select, integer
+ *n, doublecomplex *t, integer *ldt, doublecomplex *q, integer *ldq,
+ doublecomplex *w, integer *m, doublereal *s, doublereal *sep,
+ doublecomplex *work, integer *lwork, integer *info, ftnlen job_len,
+ ftnlen compq_len)
+{
+ /* System generated locals */
+ integer q_dim1, q_offset, t_dim1, t_offset, i__1, i__2, i__3;
+
+ /* Builtin functions */
+ double sqrt(doublereal);
+
+ /* Local variables */
+ integer k, n1, n2, nn, ks;
+ doublereal est;
+ integer kase, ierr;
+ doublereal scale;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ integer isave[3], lwmin;
+ logical wantq, wants;
+ doublereal rnorm, rwork[1];
+ extern /* Subroutine */ int zlacn2_(integer *, doublecomplex *,
+ doublecomplex *, doublereal *, integer *, integer *), xerbla_(
+ char *, integer *, ftnlen);
+ extern doublereal zlange_(char *, integer *, integer *, doublecomplex *,
+ integer *, doublereal *, ftnlen);
+ logical wantbh;
+ extern /* Subroutine */ int zlacpy_(char *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *, ftnlen);
+ logical wantsp;
+ extern /* Subroutine */ int ztrexc_(char *, integer *, doublecomplex *,
+ integer *, doublecomplex *, integer *, integer *, integer *,
+ integer *, ftnlen);
+ logical lquery;
+ extern /* Subroutine */ int ztrsyl_(char *, char *, integer *, integer *,
+ integer *, doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublereal *, integer *, ftnlen,
+ ftnlen);
+ (void)job_len;
+ (void)compq_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* Modified to call ZLACN2 in place of ZLACON, 10 Feb 03, SJH. */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER COMPQ, JOB >*/
+/*< INTEGER INFO, LDQ, LDT, LWORK, M, N >*/
+/*< DOUBLE PRECISION S, SEP >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< LOGICAL SELECT( * ) >*/
+/*< COMPLEX*16 Q( LDQ, * ), T( LDT, * ), W( * ), WORK( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZTRSEN reorders the Schur factorization of a complex matrix */
+/* A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in */
+/* the leading positions on the diagonal of the upper triangular matrix */
+/* T, and the leading columns of Q form an orthonormal basis of the */
+/* corresponding right invariant subspace. */
+
+/* Optionally the routine computes the reciprocal condition numbers of */
+/* the cluster of eigenvalues and/or the invariant subspace. */
+
+/* Arguments */
+/* ========= */
+
+/* JOB (input) CHARACTER*1 */
+/* Specifies whether condition numbers are required for the */
+/* cluster of eigenvalues (S) or the invariant subspace (SEP): */
+/* = 'N': none; */
+/* = 'E': for eigenvalues only (S); */
+/* = 'V': for invariant subspace only (SEP); */
+/* = 'B': for both eigenvalues and invariant subspace (S and */
+/* SEP). */
+
+/* COMPQ (input) CHARACTER*1 */
+/* = 'V': update the matrix Q of Schur vectors; */
+/* = 'N': do not update Q. */
+
+/* SELECT (input) LOGICAL array, dimension (N) */
+/* SELECT specifies the eigenvalues in the selected cluster. To */
+/* select the j-th eigenvalue, SELECT(j) must be set to .TRUE.. */
+
+/* N (input) INTEGER */
+/* The order of the matrix T. N >= 0. */
+
+/* T (input/output) COMPLEX*16 array, dimension (LDT,N) */
+/* On entry, the upper triangular matrix T. */
+/* On exit, T is overwritten by the reordered matrix T, with the */
+/* selected eigenvalues as the leading diagonal elements. */
+
+/* LDT (input) INTEGER */
+/* The leading dimension of the array T. LDT >= max(1,N). */
+
+/* Q (input/output) COMPLEX*16 array, dimension (LDQ,N) */
+/* On entry, if COMPQ = 'V', the matrix Q of Schur vectors. */
+/* On exit, if COMPQ = 'V', Q has been postmultiplied by the */
+/* unitary transformation matrix which reorders T; the leading M */
+/* columns of Q form an orthonormal basis for the specified */
+/* invariant subspace. */
+/* If COMPQ = 'N', Q is not referenced. */
+
+/* LDQ (input) INTEGER */
+/* The leading dimension of the array Q. */
+/* LDQ >= 1; and if COMPQ = 'V', LDQ >= N. */
+
+/* W (output) COMPLEX*16 array, dimension (N) */
+/* The reordered eigenvalues of T, in the same order as they */
+/* appear on the diagonal of T. */
+
+/* M (output) INTEGER */
+/* The dimension of the specified invariant subspace. */
+/* 0 <= M <= N. */
+
+/* S (output) DOUBLE PRECISION */
+/* If JOB = 'E' or 'B', S is a lower bound on the reciprocal */
+/* condition number for the selected cluster of eigenvalues. */
+/* S cannot underestimate the true reciprocal condition number */
+/* by more than a factor of sqrt(N). If M = 0 or N, S = 1. */
+/* If JOB = 'N' or 'V', S is not referenced. */
+
+/* SEP (output) DOUBLE PRECISION */
+/* If JOB = 'V' or 'B', SEP is the estimated reciprocal */
+/* condition number of the specified invariant subspace. If */
+/* M = 0 or N, SEP = norm(T). */
+/* If JOB = 'N' or 'E', SEP is not referenced. */
+
+/* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK)) */
+/* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
+
+/* LWORK (input) INTEGER */
+/* The dimension of the array WORK. */
+/* If JOB = 'N', LWORK >= 1; */
+/* if JOB = 'E', LWORK = max(1,M*(N-M)); */
+/* if JOB = 'V' or 'B', LWORK >= max(1,2*M*(N-M)). */
+
+/* If LWORK = -1, then a workspace query is assumed; the routine */
+/* only calculates the optimal size of the WORK array, returns */
+/* this value as the first entry of the WORK array, and no error */
+/* message related to LWORK is issued by XERBLA. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+
+/* Further Details */
+/* =============== */
+
+/* ZTRSEN first collects the selected eigenvalues by computing a unitary */
+/* transformation Z to move them to the top left corner of T. In other */
+/* words, the selected eigenvalues are the eigenvalues of T11 in: */
+
+/* Z'*T*Z = ( T11 T12 ) n1 */
+/* ( 0 T22 ) n2 */
+/* n1 n2 */
+
+/* where N = n1+n2 and Z' means the conjugate transpose of Z. The first */
+/* n1 columns of Z span the specified invariant subspace of T. */
+
+/* If T has been obtained from the Schur factorization of a matrix */
+/* A = Q*T*Q', then the reordered Schur factorization of A is given by */
+/* A = (Q*Z)*(Z'*T*Z)*(Q*Z)', and the first n1 columns of Q*Z span the */
+/* corresponding invariant subspace of A. */
+
+/* The reciprocal condition number of the average of the eigenvalues of */
+/* T11 may be returned in S. S lies between 0 (very badly conditioned) */
+/* and 1 (very well conditioned). It is computed as follows. First we */
+/* compute R so that */
+
+/* P = ( I R ) n1 */
+/* ( 0 0 ) n2 */
+/* n1 n2 */
+
+/* is the projector on the invariant subspace associated with T11. */
+/* R is the solution of the Sylvester equation: */
+
+/* T11*R - R*T22 = T12. */
+
+/* Let F-norm(M) denote the Frobenius-norm of M and 2-norm(M) denote */
+/* the two-norm of M. Then S is computed as the lower bound */
+
+/* (1 + F-norm(R)**2)**(-1/2) */
+
+/* on the reciprocal of 2-norm(P), the true reciprocal condition number. */
+/* S cannot underestimate 1 / 2-norm(P) by more than a factor of */
+/* sqrt(N). */
+
+/* An approximate error bound for the computed average of the */
+/* eigenvalues of T11 is */
+
+/* EPS * norm(T) / S */
+
+/* where EPS is the machine precision. */
+
+/* The reciprocal condition number of the right invariant subspace */
+/* spanned by the first n1 columns of Z (or of Q*Z) is returned in SEP. */
+/* SEP is defined as the separation of T11 and T22: */
+
+/* sep( T11, T22 ) = sigma-min( C ) */
+
+/* where sigma-min(C) is the smallest singular value of the */
+/* n1*n2-by-n1*n2 matrix */
+
+/* C = kprod( I(n2), T11 ) - kprod( transpose(T22), I(n1) ) */
+
+/* I(m) is an m by m identity matrix, and kprod denotes the Kronecker */
+/* product. We estimate sigma-min(C) by the reciprocal of an estimate of */
+/* the 1-norm of inverse(C). The true reciprocal 1-norm of inverse(C) */
+/* cannot differ from sigma-min(C) by more than a factor of sqrt(n1*n2). */
+
+/* When SEP is small, small changes in T can cause large changes in */
+/* the invariant subspace. An approximate bound on the maximum angular */
+/* error in the computed right invariant subspace is */
+
+/* EPS * norm(T) / SEP */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ZERO, ONE >*/
+/*< PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL LQUERY, WANTBH, WANTQ, WANTS, WANTSP >*/
+/*< INTEGER IERR, K, KASE, KS, LWMIN, N1, N2, NN >*/
+/*< DOUBLE PRECISION EST, RNORM, SCALE >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< INTEGER ISAVE( 3 ) >*/
+/*< DOUBLE PRECISION RWORK( 1 ) >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< DOUBLE PRECISION ZLANGE >*/
+/*< EXTERNAL LSAME, ZLANGE >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZLACN2, ZLACPY, ZTREXC, ZTRSYL >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC MAX, SQRT >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Decode and test the input parameters. */
+
+/*< WANTBH = LSAME( JOB, 'B' ) >*/
+ /* Parameter adjustments */
+ --select;
+ t_dim1 = *ldt;
+ t_offset = 1 + t_dim1;
+ t -= t_offset;
+ q_dim1 = *ldq;
+ q_offset = 1 + q_dim1;
+ q -= q_offset;
+ --w;
+ --work;
+
+ /* Function Body */
+ wantbh = lsame_(job, "B", (ftnlen)1, (ftnlen)1);
+/*< WANTS = LSAME( JOB, 'E' ) .OR. WANTBH >*/
+ wants = lsame_(job, "E", (ftnlen)1, (ftnlen)1) || wantbh;
+/*< WANTSP = LSAME( JOB, 'V' ) .OR. WANTBH >*/
+ wantsp = lsame_(job, "V", (ftnlen)1, (ftnlen)1) || wantbh;
+/*< WANTQ = LSAME( COMPQ, 'V' ) >*/
+ wantq = lsame_(compq, "V", (ftnlen)1, (ftnlen)1);
+
+/* Set M to the number of selected eigenvalues. */
+
+/*< M = 0 >*/
+ *m = 0;
+/*< DO 10 K = 1, N >*/
+ i__1 = *n;
+ for (k = 1; k <= i__1; ++k) {
+/*< >*/
+ if (select[k]) {
+ ++(*m);
+ }
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+
+/*< N1 = M >*/
+ n1 = *m;
+/*< N2 = N - M >*/
+ n2 = *n - *m;
+/*< NN = N1*N2 >*/
+ nn = n1 * n2;
+
+/*< INFO = 0 >*/
+ *info = 0;
+/*< LQUERY = ( LWORK.EQ.-1 ) >*/
+ lquery = *lwork == -1;
+
+/*< IF( WANTSP ) THEN >*/
+ if (wantsp) {
+/*< LWMIN = MAX( 1, 2*NN ) >*/
+/* Computing MAX */
+ i__1 = 1, i__2 = nn << 1;
+ lwmin = max(i__1,i__2);
+/*< ELSE IF( LSAME( JOB, 'N' ) ) THEN >*/
+ } else if (lsame_(job, "N", (ftnlen)1, (ftnlen)1)) {
+/*< LWMIN = 1 >*/
+ lwmin = 1;
+/*< ELSE IF( LSAME( JOB, 'E' ) ) THEN >*/
+ } else if (lsame_(job, "E", (ftnlen)1, (ftnlen)1)) {
+/*< LWMIN = MAX( 1, NN ) >*/
+ lwmin = max(1,nn);
+/*< END IF >*/
+ }
+
+/*< >*/
+ if (! lsame_(job, "N", (ftnlen)1, (ftnlen)1) && ! wants && ! wantsp) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( .NOT.LSAME( COMPQ, 'N' ) .AND. .NOT.WANTQ ) THEN >*/
+ } else if (! lsame_(compq, "N", (ftnlen)1, (ftnlen)1) && ! wantq) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( LDT.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldt < max(1,*n)) {
+/*< INFO = -6 >*/
+ *info = -6;
+/*< ELSE IF( LDQ.LT.1 .OR. ( WANTQ .AND. LDQ.LT.N ) ) THEN >*/
+ } else if (*ldq < 1 || (wantq && *ldq) < *n) {
+/*< INFO = -8 >*/
+ *info = -8;
+/*< ELSE IF( LWORK.LT.LWMIN .AND. .NOT.LQUERY ) THEN >*/
+ } else if (*lwork < lwmin && ! lquery) {
+/*< INFO = -14 >*/
+ *info = -14;
+/*< END IF >*/
+ }
+
+/*< IF( INFO.EQ.0 ) THEN >*/
+ if (*info == 0) {
+/*< WORK( 1 ) = LWMIN >*/
+ work[1].r = (doublereal) lwmin, work[1].i = 0.;
+/*< END IF >*/
+ }
+
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZTRSEN', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZTRSEN", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< ELSE IF( LQUERY ) THEN >*/
+ } else if (lquery) {
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< IF( M.EQ.N .OR. M.EQ.0 ) THEN >*/
+ if (*m == *n || *m == 0) {
+/*< >*/
+ if (wants) {
+ *s = 1.;
+ }
+/*< >*/
+ if (wantsp) {
+ *sep = zlange_("1", n, n, &t[t_offset], ldt, rwork, (ftnlen)1);
+ }
+/*< GO TO 40 >*/
+ goto L40;
+/*< END IF >*/
+ }
+
+/* Collect the selected eigenvalues at the top left corner of T. */
+
+/*< KS = 0 >*/
+ ks = 0;
+/*< DO 20 K = 1, N >*/
+ i__1 = *n;
+ for (k = 1; k <= i__1; ++k) {
+/*< IF( SELECT( K ) ) THEN >*/
+ if (select[k]) {
+/*< KS = KS + 1 >*/
+ ++ks;
+
+/* Swap the K-th eigenvalue to position KS. */
+
+/*< >*/
+ if (k != ks) {
+ ztrexc_(compq, n, &t[t_offset], ldt, &q[q_offset], ldq, &k, &
+ ks, &ierr, (ftnlen)1);
+ }
+/*< END IF >*/
+ }
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+
+/*< IF( WANTS ) THEN >*/
+ if (wants) {
+
+/* Solve the Sylvester equation for R: */
+
+/* T11*R - R*T22 = scale*T12 */
+
+/*< CALL ZLACPY( 'F', N1, N2, T( 1, N1+1 ), LDT, WORK, N1 ) >*/
+ zlacpy_("F", &n1, &n2, &t[(n1 + 1) * t_dim1 + 1], ldt, &work[1], &n1,
+ (ftnlen)1);
+/*< >*/
+ ztrsyl_("N", "N", &c_n1, &n1, &n2, &t[t_offset], ldt, &t[n1 + 1 + (n1
+ + 1) * t_dim1], ldt, &work[1], &n1, &scale, &ierr, (ftnlen)1,
+ (ftnlen)1);
+
+/* Estimate the reciprocal of the condition number of the cluster */
+/* of eigenvalues. */
+
+/*< RNORM = ZLANGE( 'F', N1, N2, WORK, N1, RWORK ) >*/
+ rnorm = zlange_("F", &n1, &n2, &work[1], &n1, rwork, (ftnlen)1);
+/*< IF( RNORM.EQ.ZERO ) THEN >*/
+ if (rnorm == 0.) {
+/*< S = ONE >*/
+ *s = 1.;
+/*< ELSE >*/
+ } else {
+/*< >*/
+ *s = scale / (sqrt(scale * scale / rnorm + rnorm) * sqrt(rnorm));
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/*< IF( WANTSP ) THEN >*/
+ if (wantsp) {
+
+/* Estimate sep(T11,T22). */
+
+/*< EST = ZERO >*/
+ est = 0.;
+/*< KASE = 0 >*/
+ kase = 0;
+/*< 30 CONTINUE >*/
+L30:
+/*< CALL ZLACN2( NN, WORK( NN+1 ), WORK, EST, KASE, ISAVE ) >*/
+ zlacn2_(&nn, &work[nn + 1], &work[1], &est, &kase, isave);
+/*< IF( KASE.NE.0 ) THEN >*/
+ if (kase != 0) {
+/*< IF( KASE.EQ.1 ) THEN >*/
+ if (kase == 1) {
+
+/* Solve T11*R - R*T22 = scale*X. */
+
+/*< >*/
+ ztrsyl_("N", "N", &c_n1, &n1, &n2, &t[t_offset], ldt, &t[n1 +
+ 1 + (n1 + 1) * t_dim1], ldt, &work[1], &n1, &scale, &
+ ierr, (ftnlen)1, (ftnlen)1);
+/*< ELSE >*/
+ } else {
+
+/* Solve T11'*R - R*T22' = scale*X. */
+
+/*< >*/
+ ztrsyl_("C", "C", &c_n1, &n1, &n2, &t[t_offset], ldt, &t[n1 +
+ 1 + (n1 + 1) * t_dim1], ldt, &work[1], &n1, &scale, &
+ ierr, (ftnlen)1, (ftnlen)1);
+/*< END IF >*/
+ }
+/*< GO TO 30 >*/
+ goto L30;
+/*< END IF >*/
+ }
+
+/*< SEP = SCALE / EST >*/
+ *sep = scale / est;
+/*< END IF >*/
+ }
+
+/*< 40 CONTINUE >*/
+L40:
+
+/* Copy reordered eigenvalues to W. */
+
+/*< DO 50 K = 1, N >*/
+ i__1 = *n;
+ for (k = 1; k <= i__1; ++k) {
+/*< W( K ) = T( K, K ) >*/
+ i__2 = k;
+ i__3 = k + k * t_dim1;
+ w[i__2].r = t[i__3].r, w[i__2].i = t[i__3].i;
+/*< 50 CONTINUE >*/
+/* L50: */
+ }
+
+/*< WORK( 1 ) = LWMIN >*/
+ work[1].r = (doublereal) lwmin, work[1].i = 0.;
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZTRSEN */
+
+/*< END >*/
+} /* ztrsen_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.f
new file mode 100644
index 0000000000000000000000000000000000000000..7050cd2408fee8b80112fb8ab3137fb6459e840f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.f
@@ -0,0 +1,360 @@
+ SUBROUTINE ZTRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, W, M, S,
+ $ SEP, WORK, LWORK, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* Modified to call ZLACN2 in place of ZLACON, 10 Feb 03, SJH.
+*
+* .. Scalar Arguments ..
+ CHARACTER COMPQ, JOB
+ INTEGER INFO, LDQ, LDT, LWORK, M, N
+ DOUBLE PRECISION S, SEP
+* ..
+* .. Array Arguments ..
+ LOGICAL SELECT( * )
+ COMPLEX*16 Q( LDQ, * ), T( LDT, * ), W( * ), WORK( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZTRSEN reorders the Schur factorization of a complex matrix
+* A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in
+* the leading positions on the diagonal of the upper triangular matrix
+* T, and the leading columns of Q form an orthonormal basis of the
+* corresponding right invariant subspace.
+*
+* Optionally the routine computes the reciprocal condition numbers of
+* the cluster of eigenvalues and/or the invariant subspace.
+*
+* Arguments
+* =========
+*
+* JOB (input) CHARACTER*1
+* Specifies whether condition numbers are required for the
+* cluster of eigenvalues (S) or the invariant subspace (SEP):
+* = 'N': none;
+* = 'E': for eigenvalues only (S);
+* = 'V': for invariant subspace only (SEP);
+* = 'B': for both eigenvalues and invariant subspace (S and
+* SEP).
+*
+* COMPQ (input) CHARACTER*1
+* = 'V': update the matrix Q of Schur vectors;
+* = 'N': do not update Q.
+*
+* SELECT (input) LOGICAL array, dimension (N)
+* SELECT specifies the eigenvalues in the selected cluster. To
+* select the j-th eigenvalue, SELECT(j) must be set to .TRUE..
+*
+* N (input) INTEGER
+* The order of the matrix T. N >= 0.
+*
+* T (input/output) COMPLEX*16 array, dimension (LDT,N)
+* On entry, the upper triangular matrix T.
+* On exit, T is overwritten by the reordered matrix T, with the
+* selected eigenvalues as the leading diagonal elements.
+*
+* LDT (input) INTEGER
+* The leading dimension of the array T. LDT >= max(1,N).
+*
+* Q (input/output) COMPLEX*16 array, dimension (LDQ,N)
+* On entry, if COMPQ = 'V', the matrix Q of Schur vectors.
+* On exit, if COMPQ = 'V', Q has been postmultiplied by the
+* unitary transformation matrix which reorders T; the leading M
+* columns of Q form an orthonormal basis for the specified
+* invariant subspace.
+* If COMPQ = 'N', Q is not referenced.
+*
+* LDQ (input) INTEGER
+* The leading dimension of the array Q.
+* LDQ >= 1; and if COMPQ = 'V', LDQ >= N.
+*
+* W (output) COMPLEX*16 array, dimension (N)
+* The reordered eigenvalues of T, in the same order as they
+* appear on the diagonal of T.
+*
+* M (output) INTEGER
+* The dimension of the specified invariant subspace.
+* 0 <= M <= N.
+*
+* S (output) DOUBLE PRECISION
+* If JOB = 'E' or 'B', S is a lower bound on the reciprocal
+* condition number for the selected cluster of eigenvalues.
+* S cannot underestimate the true reciprocal condition number
+* by more than a factor of sqrt(N). If M = 0 or N, S = 1.
+* If JOB = 'N' or 'V', S is not referenced.
+*
+* SEP (output) DOUBLE PRECISION
+* If JOB = 'V' or 'B', SEP is the estimated reciprocal
+* condition number of the specified invariant subspace. If
+* M = 0 or N, SEP = norm(T).
+* If JOB = 'N' or 'E', SEP is not referenced.
+*
+* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))
+* On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
+*
+* LWORK (input) INTEGER
+* The dimension of the array WORK.
+* If JOB = 'N', LWORK >= 1;
+* if JOB = 'E', LWORK = max(1,M*(N-M));
+* if JOB = 'V' or 'B', LWORK >= max(1,2*M*(N-M)).
+*
+* If LWORK = -1, then a workspace query is assumed; the routine
+* only calculates the optimal size of the WORK array, returns
+* this value as the first entry of the WORK array, and no error
+* message related to LWORK is issued by XERBLA.
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+*
+* Further Details
+* ===============
+*
+* ZTRSEN first collects the selected eigenvalues by computing a unitary
+* transformation Z to move them to the top left corner of T. In other
+* words, the selected eigenvalues are the eigenvalues of T11 in:
+*
+* Z'*T*Z = ( T11 T12 ) n1
+* ( 0 T22 ) n2
+* n1 n2
+*
+* where N = n1+n2 and Z' means the conjugate transpose of Z. The first
+* n1 columns of Z span the specified invariant subspace of T.
+*
+* If T has been obtained from the Schur factorization of a matrix
+* A = Q*T*Q', then the reordered Schur factorization of A is given by
+* A = (Q*Z)*(Z'*T*Z)*(Q*Z)', and the first n1 columns of Q*Z span the
+* corresponding invariant subspace of A.
+*
+* The reciprocal condition number of the average of the eigenvalues of
+* T11 may be returned in S. S lies between 0 (very badly conditioned)
+* and 1 (very well conditioned). It is computed as follows. First we
+* compute R so that
+*
+* P = ( I R ) n1
+* ( 0 0 ) n2
+* n1 n2
+*
+* is the projector on the invariant subspace associated with T11.
+* R is the solution of the Sylvester equation:
+*
+* T11*R - R*T22 = T12.
+*
+* Let F-norm(M) denote the Frobenius-norm of M and 2-norm(M) denote
+* the two-norm of M. Then S is computed as the lower bound
+*
+* (1 + F-norm(R)**2)**(-1/2)
+*
+* on the reciprocal of 2-norm(P), the true reciprocal condition number.
+* S cannot underestimate 1 / 2-norm(P) by more than a factor of
+* sqrt(N).
+*
+* An approximate error bound for the computed average of the
+* eigenvalues of T11 is
+*
+* EPS * norm(T) / S
+*
+* where EPS is the machine precision.
+*
+* The reciprocal condition number of the right invariant subspace
+* spanned by the first n1 columns of Z (or of Q*Z) is returned in SEP.
+* SEP is defined as the separation of T11 and T22:
+*
+* sep( T11, T22 ) = sigma-min( C )
+*
+* where sigma-min(C) is the smallest singular value of the
+* n1*n2-by-n1*n2 matrix
+*
+* C = kprod( I(n2), T11 ) - kprod( transpose(T22), I(n1) )
+*
+* I(m) is an m by m identity matrix, and kprod denotes the Kronecker
+* product. We estimate sigma-min(C) by the reciprocal of an estimate of
+* the 1-norm of inverse(C). The true reciprocal 1-norm of inverse(C)
+* cannot differ from sigma-min(C) by more than a factor of sqrt(n1*n2).
+*
+* When SEP is small, small changes in T can cause large changes in
+* the invariant subspace. An approximate bound on the maximum angular
+* error in the computed right invariant subspace is
+*
+* EPS * norm(T) / SEP
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ZERO, ONE
+ PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 )
+* ..
+* .. Local Scalars ..
+ LOGICAL LQUERY, WANTBH, WANTQ, WANTS, WANTSP
+ INTEGER IERR, K, KASE, KS, LWMIN, N1, N2, NN
+ DOUBLE PRECISION EST, RNORM, SCALE
+* ..
+* .. Local Arrays ..
+ INTEGER ISAVE( 3 )
+ DOUBLE PRECISION RWORK( 1 )
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ DOUBLE PRECISION ZLANGE
+ EXTERNAL LSAME, ZLANGE
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZLACN2, ZLACPY, ZTREXC, ZTRSYL
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC MAX, SQRT
+* ..
+* .. Executable Statements ..
+*
+* Decode and test the input parameters.
+*
+ WANTBH = LSAME( JOB, 'B' )
+ WANTS = LSAME( JOB, 'E' ) .OR. WANTBH
+ WANTSP = LSAME( JOB, 'V' ) .OR. WANTBH
+ WANTQ = LSAME( COMPQ, 'V' )
+*
+* Set M to the number of selected eigenvalues.
+*
+ M = 0
+ DO 10 K = 1, N
+ IF( SELECT( K ) )
+ $ M = M + 1
+ 10 CONTINUE
+*
+ N1 = M
+ N2 = N - M
+ NN = N1*N2
+*
+ INFO = 0
+ LQUERY = ( LWORK.EQ.-1 )
+*
+ IF( WANTSP ) THEN
+ LWMIN = MAX( 1, 2*NN )
+ ELSE IF( LSAME( JOB, 'N' ) ) THEN
+ LWMIN = 1
+ ELSE IF( LSAME( JOB, 'E' ) ) THEN
+ LWMIN = MAX( 1, NN )
+ END IF
+*
+ IF( .NOT.LSAME( JOB, 'N' ) .AND. .NOT.WANTS .AND. .NOT.WANTSP )
+ $ THEN
+ INFO = -1
+ ELSE IF( .NOT.LSAME( COMPQ, 'N' ) .AND. .NOT.WANTQ ) THEN
+ INFO = -2
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -4
+ ELSE IF( LDT.LT.MAX( 1, N ) ) THEN
+ INFO = -6
+ ELSE IF( LDQ.LT.1 .OR. ( WANTQ .AND. LDQ.LT.N ) ) THEN
+ INFO = -8
+ ELSE IF( LWORK.LT.LWMIN .AND. .NOT.LQUERY ) THEN
+ INFO = -14
+ END IF
+*
+ IF( INFO.EQ.0 ) THEN
+ WORK( 1 ) = LWMIN
+ END IF
+*
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZTRSEN', -INFO )
+ RETURN
+ ELSE IF( LQUERY ) THEN
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( M.EQ.N .OR. M.EQ.0 ) THEN
+ IF( WANTS )
+ $ S = ONE
+ IF( WANTSP )
+ $ SEP = ZLANGE( '1', N, N, T, LDT, RWORK )
+ GO TO 40
+ END IF
+*
+* Collect the selected eigenvalues at the top left corner of T.
+*
+ KS = 0
+ DO 20 K = 1, N
+ IF( SELECT( K ) ) THEN
+ KS = KS + 1
+*
+* Swap the K-th eigenvalue to position KS.
+*
+ IF( K.NE.KS )
+ $ CALL ZTREXC( COMPQ, N, T, LDT, Q, LDQ, K, KS, IERR )
+ END IF
+ 20 CONTINUE
+*
+ IF( WANTS ) THEN
+*
+* Solve the Sylvester equation for R:
+*
+* T11*R - R*T22 = scale*T12
+*
+ CALL ZLACPY( 'F', N1, N2, T( 1, N1+1 ), LDT, WORK, N1 )
+ CALL ZTRSYL( 'N', 'N', -1, N1, N2, T, LDT, T( N1+1, N1+1 ),
+ $ LDT, WORK, N1, SCALE, IERR )
+*
+* Estimate the reciprocal of the condition number of the cluster
+* of eigenvalues.
+*
+ RNORM = ZLANGE( 'F', N1, N2, WORK, N1, RWORK )
+ IF( RNORM.EQ.ZERO ) THEN
+ S = ONE
+ ELSE
+ S = SCALE / ( SQRT( SCALE*SCALE / RNORM+RNORM )*
+ $ SQRT( RNORM ) )
+ END IF
+ END IF
+*
+ IF( WANTSP ) THEN
+*
+* Estimate sep(T11,T22).
+*
+ EST = ZERO
+ KASE = 0
+ 30 CONTINUE
+ CALL ZLACN2( NN, WORK( NN+1 ), WORK, EST, KASE, ISAVE )
+ IF( KASE.NE.0 ) THEN
+ IF( KASE.EQ.1 ) THEN
+*
+* Solve T11*R - R*T22 = scale*X.
+*
+ CALL ZTRSYL( 'N', 'N', -1, N1, N2, T, LDT,
+ $ T( N1+1, N1+1 ), LDT, WORK, N1, SCALE,
+ $ IERR )
+ ELSE
+*
+* Solve T11'*R - R*T22' = scale*X.
+*
+ CALL ZTRSYL( 'C', 'C', -1, N1, N2, T, LDT,
+ $ T( N1+1, N1+1 ), LDT, WORK, N1, SCALE,
+ $ IERR )
+ END IF
+ GO TO 30
+ END IF
+*
+ SEP = SCALE / EST
+ END IF
+*
+ 40 CONTINUE
+*
+* Copy reordered eigenvalues to W.
+*
+ DO 50 K = 1, N
+ W( K ) = T( K, K )
+ 50 CONTINUE
+*
+ WORK( 1 ) = LWMIN
+*
+ RETURN
+*
+* End of ZTRSEN
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.h
new file mode 100644
index 0000000000000000000000000000000000000000..cf41bd7fd0e74b1b1665a1e7f3137e0ad82781eb
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsen.h
@@ -0,0 +1,19 @@
+extern int v3p_netlib_ztrsen_(
+ char *job,
+ char *compq,
+ v3p_netlib_logical *select,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *t,
+ v3p_netlib_integer *ldt,
+ v3p_netlib_doublecomplex *q,
+ v3p_netlib_integer *ldq,
+ v3p_netlib_doublecomplex *w,
+ v3p_netlib_integer *m,
+ v3p_netlib_doublereal *s,
+ v3p_netlib_doublereal *sep,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_integer *lwork,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen job_len,
+ v3p_netlib_ftnlen compq_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.P
new file mode 100644
index 0000000000000000000000000000000000000000..92b01f07a9e89e4099b307768fff1c5c7e93ae9f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.P
@@ -0,0 +1,10 @@
+extern int ztrsyl_(char *trana, char *tranb, integer *isgn, integer *m, integer *n, doublecomplex *a, integer *lda, doublecomplex *b, integer *ldb, doublecomplex *c__, integer *ldc, doublereal *scale, integer *info, ftnlen trana_len, ftnlen tranb_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dlabad_ 14 2 7 7 */
+/*:ref: zlange_ 7 7 13 4 4 9 4 7 124 */
+/*:ref: zdotu_ 9 6 9 4 9 4 9 4 */
+/*:ref: zladiv_ 9 3 9 9 9 */
+/*:ref: zdscal_ 14 4 4 7 9 4 */
+/*:ref: zdotc_ 9 6 9 4 9 4 9 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.c
new file mode 100644
index 0000000000000000000000000000000000000000..cf881cc189dc6366e9c0b3a9015174287d6e502a
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.c
@@ -0,0 +1,722 @@
+/* lapack/complex16/ztrsyl.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+
+/*< >*/
+/* Subroutine */ int ztrsyl_(char *trana, char *tranb, integer *isgn, integer
+ *m, integer *n, doublecomplex *a, integer *lda, doublecomplex *b,
+ integer *ldb, doublecomplex *c__, integer *ldc, doublereal *scale,
+ integer *info, ftnlen trana_len, ftnlen tranb_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, b_dim1, b_offset, c_dim1, c_offset, i__1, i__2,
+ i__3, i__4;
+ doublereal d__1, d__2;
+ doublecomplex z__1, z__2, z__3, z__4;
+
+ /* Builtin functions */
+ double d_imag(doublecomplex *);
+ void d_cnjg(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ integer j, k, l;
+ doublecomplex a11;
+ doublereal db;
+ doublecomplex x11;
+ doublereal da11;
+ doublecomplex vec;
+ doublereal dum[1], eps, sgn, smin;
+ doublecomplex suml, sumr;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ extern /* Double Complex */ VOID zdotc_(doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *), zdotu_(
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *);
+ extern /* Subroutine */ int dlabad_(doublereal *, doublereal *);
+ extern doublereal dlamch_(char *, ftnlen);
+ doublereal scaloc;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+ extern doublereal zlange_(char *, integer *, integer *, doublecomplex *,
+ integer *, doublereal *, ftnlen);
+ doublereal bignum;
+ extern /* Subroutine */ int zdscal_(integer *, doublereal *,
+ doublecomplex *, integer *);
+ extern /* Double Complex */ VOID zladiv_(doublecomplex *, doublecomplex *,
+ doublecomplex *);
+ logical notrna, notrnb;
+ doublereal smlnum;
+ (void)trana_len;
+ (void)tranb_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER TRANA, TRANB >*/
+/*< INTEGER INFO, ISGN, LDA, LDB, LDC, M, N >*/
+/*< DOUBLE PRECISION SCALE >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< COMPLEX*16 A( LDA, * ), B( LDB, * ), C( LDC, * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZTRSYL solves the complex Sylvester matrix equation: */
+
+/* op(A)*X + X*op(B) = scale*C or */
+/* op(A)*X - X*op(B) = scale*C, */
+
+/* where op(A) = A or A**H, and A and B are both upper triangular. A is */
+/* M-by-M and B is N-by-N; the right hand side C and the solution X are */
+/* M-by-N; and scale is an output scale factor, set <= 1 to avoid */
+/* overflow in X. */
+
+/* Arguments */
+/* ========= */
+
+/* TRANA (input) CHARACTER*1 */
+/* Specifies the option op(A): */
+/* = 'N': op(A) = A (No transpose) */
+/* = 'C': op(A) = A**H (Conjugate transpose) */
+
+/* TRANB (input) CHARACTER*1 */
+/* Specifies the option op(B): */
+/* = 'N': op(B) = B (No transpose) */
+/* = 'C': op(B) = B**H (Conjugate transpose) */
+
+/* ISGN (input) INTEGER */
+/* Specifies the sign in the equation: */
+/* = +1: solve op(A)*X + X*op(B) = scale*C */
+/* = -1: solve op(A)*X - X*op(B) = scale*C */
+
+/* M (input) INTEGER */
+/* The order of the matrix A, and the number of rows in the */
+/* matrices X and C. M >= 0. */
+
+/* N (input) INTEGER */
+/* The order of the matrix B, and the number of columns in the */
+/* matrices X and C. N >= 0. */
+
+/* A (input) COMPLEX*16 array, dimension (LDA,M) */
+/* The upper triangular matrix A. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,M). */
+
+/* B (input) COMPLEX*16 array, dimension (LDB,N) */
+/* The upper triangular matrix B. */
+
+/* LDB (input) INTEGER */
+/* The leading dimension of the array B. LDB >= max(1,N). */
+
+/* C (input/output) COMPLEX*16 array, dimension (LDC,N) */
+/* On entry, the M-by-N right hand side matrix C. */
+/* On exit, C is overwritten by the solution matrix X. */
+
+/* LDC (input) INTEGER */
+/* The leading dimension of the array C. LDC >= max(1,M) */
+
+/* SCALE (output) DOUBLE PRECISION */
+/* The scale factor, scale, set <= 1 to avoid overflow in X. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+/* = 1: A and B have common or very close eigenvalues; perturbed */
+/* values were used to solve the equation (but the matrices */
+/* A and B are unchanged). */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ONE >*/
+/*< PARAMETER ( ONE = 1.0D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL NOTRNA, NOTRNB >*/
+/*< INTEGER J, K, L >*/
+/*< >*/
+/*< COMPLEX*16 A11, SUML, SUMR, VEC, X11 >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< DOUBLE PRECISION DUM( 1 ) >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< DOUBLE PRECISION DLAMCH, ZLANGE >*/
+/*< COMPLEX*16 ZDOTC, ZDOTU, ZLADIV >*/
+/*< EXTERNAL LSAME, DLAMCH, ZLANGE, ZDOTC, ZDOTU, ZLADIV >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL DLABAD, XERBLA, ZDSCAL >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, DBLE, DCMPLX, DCONJG, DIMAG, MAX, MIN >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Decode and Test input parameters */
+
+/*< NOTRNA = LSAME( TRANA, 'N' ) >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ b_dim1 = *ldb;
+ b_offset = 1 + b_dim1;
+ b -= b_offset;
+ c_dim1 = *ldc;
+ c_offset = 1 + c_dim1;
+ c__ -= c_offset;
+
+ /* Function Body */
+ notrna = lsame_(trana, "N", (ftnlen)1, (ftnlen)1);
+/*< NOTRNB = LSAME( TRANB, 'N' ) >*/
+ notrnb = lsame_(tranb, "N", (ftnlen)1, (ftnlen)1);
+
+/*< INFO = 0 >*/
+ *info = 0;
+/*< IF( .NOT.NOTRNA .AND. .NOT.LSAME( TRANA, 'C' ) ) THEN >*/
+ if (! notrna && ! lsame_(trana, "C", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( .NOT.NOTRNB .AND. .NOT.LSAME( TRANB, 'C' ) ) THEN >*/
+ } else if (! notrnb && ! lsame_(tranb, "C", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( ISGN.NE.1 .AND. ISGN.NE.-1 ) THEN >*/
+ } else if (*isgn != 1 && *isgn != -1) {
+/*< INFO = -3 >*/
+ *info = -3;
+/*< ELSE IF( M.LT.0 ) THEN >*/
+ } else if (*m < 0) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( LDA.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*lda < max(1,*m)) {
+/*< INFO = -7 >*/
+ *info = -7;
+/*< ELSE IF( LDB.LT.MAX( 1, N ) ) THEN >*/
+ } else if (*ldb < max(1,*n)) {
+/*< INFO = -9 >*/
+ *info = -9;
+/*< ELSE IF( LDC.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*ldc < max(1,*m)) {
+/*< INFO = -11 >*/
+ *info = -11;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZTRSYL', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZTRSYL", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< SCALE = ONE >*/
+ *scale = 1.;
+/*< >*/
+ if (*m == 0 || *n == 0) {
+ return 0;
+ }
+
+/* Set constants to control overflow */
+
+/*< EPS = DLAMCH( 'P' ) >*/
+ eps = dlamch_("P", (ftnlen)1);
+/*< SMLNUM = DLAMCH( 'S' ) >*/
+ smlnum = dlamch_("S", (ftnlen)1);
+/*< BIGNUM = ONE / SMLNUM >*/
+ bignum = 1. / smlnum;
+/*< CALL DLABAD( SMLNUM, BIGNUM ) >*/
+ dlabad_(&smlnum, &bignum);
+/*< SMLNUM = SMLNUM*DBLE( M*N ) / EPS >*/
+ smlnum = smlnum * (doublereal) (*m * *n) / eps;
+/*< BIGNUM = ONE / SMLNUM >*/
+ bignum = 1. / smlnum;
+/*< >*/
+/* Computing MAX */
+ d__1 = smlnum, d__2 = eps * zlange_("M", m, m, &a[a_offset], lda, dum, (
+ ftnlen)1), d__1 = max(d__1,d__2), d__2 = eps * zlange_("M", n, n,
+ &b[b_offset], ldb, dum, (ftnlen)1);
+ smin = max(d__1,d__2);
+/*< SGN = ISGN >*/
+ sgn = (doublereal) (*isgn);
+
+/*< IF( NOTRNA .AND. NOTRNB ) THEN >*/
+ if (notrna && notrnb) {
+
+/* Solve A*X + ISGN*X*B = scale*C. */
+
+/* The (K,L)th block of X is determined starting from */
+/* bottom-left corner column by column by */
+
+/* A(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L) */
+
+/* Where */
+/* M L-1 */
+/* R(K,L) = SUM [A(K,I)*X(I,L)] +ISGN*SUM [X(K,J)*B(J,L)]. */
+/* I=K+1 J=1 */
+
+/*< DO 30 L = 1, N >*/
+ i__1 = *n;
+ for (l = 1; l <= i__1; ++l) {
+/*< DO 20 K = M, 1, -1 >*/
+ for (k = *m; k >= 1; --k) {
+
+/*< >*/
+ i__2 = *m - k;
+/* Computing MIN */
+ i__3 = k + 1;
+/* Computing MIN */
+ i__4 = k + 1;
+ zdotu_(&z__1, &i__2, &a[k + min(i__3,*m) * a_dim1], lda, &c__[
+ min(i__4,*m) + l * c_dim1], &c__1);
+ suml.r = z__1.r, suml.i = z__1.i;
+/*< SUMR = ZDOTU( L-1, C( K, 1 ), LDC, B( 1, L ), 1 ) >*/
+ i__2 = l - 1;
+ zdotu_(&z__1, &i__2, &c__[k + c_dim1], ldc, &b[l * b_dim1 + 1]
+ , &c__1);
+ sumr.r = z__1.r, sumr.i = z__1.i;
+/*< VEC = C( K, L ) - ( SUML+SGN*SUMR ) >*/
+ i__2 = k + l * c_dim1;
+ z__3.r = sgn * sumr.r, z__3.i = sgn * sumr.i;
+ z__2.r = suml.r + z__3.r, z__2.i = suml.i + z__3.i;
+ z__1.r = c__[i__2].r - z__2.r, z__1.i = c__[i__2].i - z__2.i;
+ vec.r = z__1.r, vec.i = z__1.i;
+
+/*< SCALOC = ONE >*/
+ scaloc = 1.;
+/*< A11 = A( K, K ) + SGN*B( L, L ) >*/
+ i__2 = k + k * a_dim1;
+ i__3 = l + l * b_dim1;
+ z__2.r = sgn * b[i__3].r, z__2.i = sgn * b[i__3].i;
+ z__1.r = a[i__2].r + z__2.r, z__1.i = a[i__2].i + z__2.i;
+ a11.r = z__1.r, a11.i = z__1.i;
+/*< DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) ) >*/
+ da11 = (d__1 = a11.r, abs(d__1)) + (d__2 = d_imag(&a11), abs(
+ d__2));
+/*< IF( DA11.LE.SMIN ) THEN >*/
+ if (da11 <= smin) {
+/*< A11 = SMIN >*/
+ a11.r = smin, a11.i = 0.;
+/*< DA11 = SMIN >*/
+ da11 = smin;
+/*< INFO = 1 >*/
+ *info = 1;
+/*< END IF >*/
+ }
+/*< DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) ) >*/
+ db = (d__1 = vec.r, abs(d__1)) + (d__2 = d_imag(&vec), abs(
+ d__2));
+/*< IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN >*/
+ if (da11 < 1. && db > 1.) {
+/*< >*/
+ if (db > bignum * da11) {
+ scaloc = 1. / db;
+ }
+/*< END IF >*/
+ }
+/*< X11 = ZLADIV( VEC*DCMPLX( SCALOC ), A11 ) >*/
+ z__3.r = scaloc, z__3.i = 0.;
+ z__2.r = vec.r * z__3.r - vec.i * z__3.i, z__2.i = vec.r *
+ z__3.i + vec.i * z__3.r;
+ zladiv_(&z__1, &z__2, &a11);
+ x11.r = z__1.r, x11.i = z__1.i;
+
+/*< IF( SCALOC.NE.ONE ) THEN >*/
+ if (scaloc != 1.) {
+/*< DO 10 J = 1, N >*/
+ i__2 = *n;
+ for (j = 1; j <= i__2; ++j) {
+/*< CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 ) >*/
+ zdscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< SCALE = SCALE*SCALOC >*/
+ *scale *= scaloc;
+/*< END IF >*/
+ }
+/*< C( K, L ) = X11 >*/
+ i__2 = k + l * c_dim1;
+ c__[i__2].r = x11.r, c__[i__2].i = x11.i;
+
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+
+/*< ELSE IF( .NOT.NOTRNA .AND. NOTRNB ) THEN >*/
+ } else if (! notrna && notrnb) {
+
+/* Solve A' *X + ISGN*X*B = scale*C. */
+
+/* The (K,L)th block of X is determined starting from */
+/* upper-left corner column by column by */
+
+/* A'(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L) */
+
+/* Where */
+/* K-1 L-1 */
+/* R(K,L) = SUM [A'(I,K)*X(I,L)] + ISGN*SUM [X(K,J)*B(J,L)] */
+/* I=1 J=1 */
+
+/*< DO 60 L = 1, N >*/
+ i__1 = *n;
+ for (l = 1; l <= i__1; ++l) {
+/*< DO 50 K = 1, M >*/
+ i__2 = *m;
+ for (k = 1; k <= i__2; ++k) {
+
+/*< SUML = ZDOTC( K-1, A( 1, K ), 1, C( 1, L ), 1 ) >*/
+ i__3 = k - 1;
+ zdotc_(&z__1, &i__3, &a[k * a_dim1 + 1], &c__1, &c__[l *
+ c_dim1 + 1], &c__1);
+ suml.r = z__1.r, suml.i = z__1.i;
+/*< SUMR = ZDOTU( L-1, C( K, 1 ), LDC, B( 1, L ), 1 ) >*/
+ i__3 = l - 1;
+ zdotu_(&z__1, &i__3, &c__[k + c_dim1], ldc, &b[l * b_dim1 + 1]
+ , &c__1);
+ sumr.r = z__1.r, sumr.i = z__1.i;
+/*< VEC = C( K, L ) - ( SUML+SGN*SUMR ) >*/
+ i__3 = k + l * c_dim1;
+ z__3.r = sgn * sumr.r, z__3.i = sgn * sumr.i;
+ z__2.r = suml.r + z__3.r, z__2.i = suml.i + z__3.i;
+ z__1.r = c__[i__3].r - z__2.r, z__1.i = c__[i__3].i - z__2.i;
+ vec.r = z__1.r, vec.i = z__1.i;
+
+/*< SCALOC = ONE >*/
+ scaloc = 1.;
+/*< A11 = DCONJG( A( K, K ) ) + SGN*B( L, L ) >*/
+ d_cnjg(&z__2, &a[k + k * a_dim1]);
+ i__3 = l + l * b_dim1;
+ z__3.r = sgn * b[i__3].r, z__3.i = sgn * b[i__3].i;
+ z__1.r = z__2.r + z__3.r, z__1.i = z__2.i + z__3.i;
+ a11.r = z__1.r, a11.i = z__1.i;
+/*< DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) ) >*/
+ da11 = (d__1 = a11.r, abs(d__1)) + (d__2 = d_imag(&a11), abs(
+ d__2));
+/*< IF( DA11.LE.SMIN ) THEN >*/
+ if (da11 <= smin) {
+/*< A11 = SMIN >*/
+ a11.r = smin, a11.i = 0.;
+/*< DA11 = SMIN >*/
+ da11 = smin;
+/*< INFO = 1 >*/
+ *info = 1;
+/*< END IF >*/
+ }
+/*< DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) ) >*/
+ db = (d__1 = vec.r, abs(d__1)) + (d__2 = d_imag(&vec), abs(
+ d__2));
+/*< IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN >*/
+ if (da11 < 1. && db > 1.) {
+/*< >*/
+ if (db > bignum * da11) {
+ scaloc = 1. / db;
+ }
+/*< END IF >*/
+ }
+
+/*< X11 = ZLADIV( VEC*DCMPLX( SCALOC ), A11 ) >*/
+ z__3.r = scaloc, z__3.i = 0.;
+ z__2.r = vec.r * z__3.r - vec.i * z__3.i, z__2.i = vec.r *
+ z__3.i + vec.i * z__3.r;
+ zladiv_(&z__1, &z__2, &a11);
+ x11.r = z__1.r, x11.i = z__1.i;
+
+/*< IF( SCALOC.NE.ONE ) THEN >*/
+ if (scaloc != 1.) {
+/*< DO 40 J = 1, N >*/
+ i__3 = *n;
+ for (j = 1; j <= i__3; ++j) {
+/*< CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 ) >*/
+ zdscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+/*< SCALE = SCALE*SCALOC >*/
+ *scale *= scaloc;
+/*< END IF >*/
+ }
+/*< C( K, L ) = X11 >*/
+ i__3 = k + l * c_dim1;
+ c__[i__3].r = x11.r, c__[i__3].i = x11.i;
+
+/*< 50 CONTINUE >*/
+/* L50: */
+ }
+/*< 60 CONTINUE >*/
+/* L60: */
+ }
+
+/*< ELSE IF( .NOT.NOTRNA .AND. .NOT.NOTRNB ) THEN >*/
+ } else if (! notrna && ! notrnb) {
+
+/* Solve A'*X + ISGN*X*B' = C. */
+
+/* The (K,L)th block of X is determined starting from */
+/* upper-right corner column by column by */
+
+/* A'(K,K)*X(K,L) + ISGN*X(K,L)*B'(L,L) = C(K,L) - R(K,L) */
+
+/* Where */
+/* K-1 */
+/* R(K,L) = SUM [A'(I,K)*X(I,L)] + */
+/* I=1 */
+/* N */
+/* ISGN*SUM [X(K,J)*B'(L,J)]. */
+/* J=L+1 */
+
+/*< DO 90 L = N, 1, -1 >*/
+ for (l = *n; l >= 1; --l) {
+/*< DO 80 K = 1, M >*/
+ i__1 = *m;
+ for (k = 1; k <= i__1; ++k) {
+
+/*< SUML = ZDOTC( K-1, A( 1, K ), 1, C( 1, L ), 1 ) >*/
+ i__2 = k - 1;
+ zdotc_(&z__1, &i__2, &a[k * a_dim1 + 1], &c__1, &c__[l *
+ c_dim1 + 1], &c__1);
+ suml.r = z__1.r, suml.i = z__1.i;
+/*< >*/
+ i__2 = *n - l;
+/* Computing MIN */
+ i__3 = l + 1;
+/* Computing MIN */
+ i__4 = l + 1;
+ zdotc_(&z__1, &i__2, &c__[k + min(i__3,*n) * c_dim1], ldc, &b[
+ l + min(i__4,*n) * b_dim1], ldb);
+ sumr.r = z__1.r, sumr.i = z__1.i;
+/*< VEC = C( K, L ) - ( SUML+SGN*DCONJG( SUMR ) ) >*/
+ i__2 = k + l * c_dim1;
+ d_cnjg(&z__4, &sumr);
+ z__3.r = sgn * z__4.r, z__3.i = sgn * z__4.i;
+ z__2.r = suml.r + z__3.r, z__2.i = suml.i + z__3.i;
+ z__1.r = c__[i__2].r - z__2.r, z__1.i = c__[i__2].i - z__2.i;
+ vec.r = z__1.r, vec.i = z__1.i;
+
+/*< SCALOC = ONE >*/
+ scaloc = 1.;
+/*< A11 = DCONJG( A( K, K )+SGN*B( L, L ) ) >*/
+ i__2 = k + k * a_dim1;
+ i__3 = l + l * b_dim1;
+ z__3.r = sgn * b[i__3].r, z__3.i = sgn * b[i__3].i;
+ z__2.r = a[i__2].r + z__3.r, z__2.i = a[i__2].i + z__3.i;
+ d_cnjg(&z__1, &z__2);
+ a11.r = z__1.r, a11.i = z__1.i;
+/*< DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) ) >*/
+ da11 = (d__1 = a11.r, abs(d__1)) + (d__2 = d_imag(&a11), abs(
+ d__2));
+/*< IF( DA11.LE.SMIN ) THEN >*/
+ if (da11 <= smin) {
+/*< A11 = SMIN >*/
+ a11.r = smin, a11.i = 0.;
+/*< DA11 = SMIN >*/
+ da11 = smin;
+/*< INFO = 1 >*/
+ *info = 1;
+/*< END IF >*/
+ }
+/*< DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) ) >*/
+ db = (d__1 = vec.r, abs(d__1)) + (d__2 = d_imag(&vec), abs(
+ d__2));
+/*< IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN >*/
+ if (da11 < 1. && db > 1.) {
+/*< >*/
+ if (db > bignum * da11) {
+ scaloc = 1. / db;
+ }
+/*< END IF >*/
+ }
+
+/*< X11 = ZLADIV( VEC*DCMPLX( SCALOC ), A11 ) >*/
+ z__3.r = scaloc, z__3.i = 0.;
+ z__2.r = vec.r * z__3.r - vec.i * z__3.i, z__2.i = vec.r *
+ z__3.i + vec.i * z__3.r;
+ zladiv_(&z__1, &z__2, &a11);
+ x11.r = z__1.r, x11.i = z__1.i;
+
+/*< IF( SCALOC.NE.ONE ) THEN >*/
+ if (scaloc != 1.) {
+/*< DO 70 J = 1, N >*/
+ i__2 = *n;
+ for (j = 1; j <= i__2; ++j) {
+/*< CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 ) >*/
+ zdscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
+/*< 70 CONTINUE >*/
+/* L70: */
+ }
+/*< SCALE = SCALE*SCALOC >*/
+ *scale *= scaloc;
+/*< END IF >*/
+ }
+/*< C( K, L ) = X11 >*/
+ i__2 = k + l * c_dim1;
+ c__[i__2].r = x11.r, c__[i__2].i = x11.i;
+
+/*< 80 CONTINUE >*/
+/* L80: */
+ }
+/*< 90 CONTINUE >*/
+/* L90: */
+ }
+
+/*< ELSE IF( NOTRNA .AND. .NOT.NOTRNB ) THEN >*/
+ } else if (notrna && ! notrnb) {
+
+/* Solve A*X + ISGN*X*B' = C. */
+
+/* The (K,L)th block of X is determined starting from */
+/* bottom-left corner column by column by */
+
+/* A(K,K)*X(K,L) + ISGN*X(K,L)*B'(L,L) = C(K,L) - R(K,L) */
+
+/* Where */
+/* M N */
+/* R(K,L) = SUM [A(K,I)*X(I,L)] + ISGN*SUM [X(K,J)*B'(L,J)] */
+/* I=K+1 J=L+1 */
+
+/*< DO 120 L = N, 1, -1 >*/
+ for (l = *n; l >= 1; --l) {
+/*< DO 110 K = M, 1, -1 >*/
+ for (k = *m; k >= 1; --k) {
+
+/*< >*/
+ i__1 = *m - k;
+/* Computing MIN */
+ i__2 = k + 1;
+/* Computing MIN */
+ i__3 = k + 1;
+ zdotu_(&z__1, &i__1, &a[k + min(i__2,*m) * a_dim1], lda, &c__[
+ min(i__3,*m) + l * c_dim1], &c__1);
+ suml.r = z__1.r, suml.i = z__1.i;
+/*< >*/
+ i__1 = *n - l;
+/* Computing MIN */
+ i__2 = l + 1;
+/* Computing MIN */
+ i__3 = l + 1;
+ zdotc_(&z__1, &i__1, &c__[k + min(i__2,*n) * c_dim1], ldc, &b[
+ l + min(i__3,*n) * b_dim1], ldb);
+ sumr.r = z__1.r, sumr.i = z__1.i;
+/*< VEC = C( K, L ) - ( SUML+SGN*DCONJG( SUMR ) ) >*/
+ i__1 = k + l * c_dim1;
+ d_cnjg(&z__4, &sumr);
+ z__3.r = sgn * z__4.r, z__3.i = sgn * z__4.i;
+ z__2.r = suml.r + z__3.r, z__2.i = suml.i + z__3.i;
+ z__1.r = c__[i__1].r - z__2.r, z__1.i = c__[i__1].i - z__2.i;
+ vec.r = z__1.r, vec.i = z__1.i;
+
+/*< SCALOC = ONE >*/
+ scaloc = 1.;
+/*< A11 = A( K, K ) + SGN*DCONJG( B( L, L ) ) >*/
+ i__1 = k + k * a_dim1;
+ d_cnjg(&z__3, &b[l + l * b_dim1]);
+ z__2.r = sgn * z__3.r, z__2.i = sgn * z__3.i;
+ z__1.r = a[i__1].r + z__2.r, z__1.i = a[i__1].i + z__2.i;
+ a11.r = z__1.r, a11.i = z__1.i;
+/*< DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) ) >*/
+ da11 = (d__1 = a11.r, abs(d__1)) + (d__2 = d_imag(&a11), abs(
+ d__2));
+/*< IF( DA11.LE.SMIN ) THEN >*/
+ if (da11 <= smin) {
+/*< A11 = SMIN >*/
+ a11.r = smin, a11.i = 0.;
+/*< DA11 = SMIN >*/
+ da11 = smin;
+/*< INFO = 1 >*/
+ *info = 1;
+/*< END IF >*/
+ }
+/*< DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) ) >*/
+ db = (d__1 = vec.r, abs(d__1)) + (d__2 = d_imag(&vec), abs(
+ d__2));
+/*< IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN >*/
+ if (da11 < 1. && db > 1.) {
+/*< >*/
+ if (db > bignum * da11) {
+ scaloc = 1. / db;
+ }
+/*< END IF >*/
+ }
+
+/*< X11 = ZLADIV( VEC*DCMPLX( SCALOC ), A11 ) >*/
+ z__3.r = scaloc, z__3.i = 0.;
+ z__2.r = vec.r * z__3.r - vec.i * z__3.i, z__2.i = vec.r *
+ z__3.i + vec.i * z__3.r;
+ zladiv_(&z__1, &z__2, &a11);
+ x11.r = z__1.r, x11.i = z__1.i;
+
+/*< IF( SCALOC.NE.ONE ) THEN >*/
+ if (scaloc != 1.) {
+/*< DO 100 J = 1, N >*/
+ i__1 = *n;
+ for (j = 1; j <= i__1; ++j) {
+/*< CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 ) >*/
+ zdscal_(m, &scaloc, &c__[j * c_dim1 + 1], &c__1);
+/*< 100 CONTINUE >*/
+/* L100: */
+ }
+/*< SCALE = SCALE*SCALOC >*/
+ *scale *= scaloc;
+/*< END IF >*/
+ }
+/*< C( K, L ) = X11 >*/
+ i__1 = k + l * c_dim1;
+ c__[i__1].r = x11.r, c__[i__1].i = x11.i;
+
+/*< 110 CONTINUE >*/
+/* L110: */
+ }
+/*< 120 CONTINUE >*/
+/* L120: */
+ }
+
+/*< END IF >*/
+ }
+
+/*< RETURN >*/
+ return 0;
+
+/* End of ZTRSYL */
+
+/*< END >*/
+} /* ztrsyl_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.f
new file mode 100644
index 0000000000000000000000000000000000000000..baf619c087d0d48fe3303272164e37cdfec7af93
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.f
@@ -0,0 +1,366 @@
+ SUBROUTINE ZTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C,
+ $ LDC, SCALE, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER TRANA, TRANB
+ INTEGER INFO, ISGN, LDA, LDB, LDC, M, N
+ DOUBLE PRECISION SCALE
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 A( LDA, * ), B( LDB, * ), C( LDC, * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZTRSYL solves the complex Sylvester matrix equation:
+*
+* op(A)*X + X*op(B) = scale*C or
+* op(A)*X - X*op(B) = scale*C,
+*
+* where op(A) = A or A**H, and A and B are both upper triangular. A is
+* M-by-M and B is N-by-N; the right hand side C and the solution X are
+* M-by-N; and scale is an output scale factor, set <= 1 to avoid
+* overflow in X.
+*
+* Arguments
+* =========
+*
+* TRANA (input) CHARACTER*1
+* Specifies the option op(A):
+* = 'N': op(A) = A (No transpose)
+* = 'C': op(A) = A**H (Conjugate transpose)
+*
+* TRANB (input) CHARACTER*1
+* Specifies the option op(B):
+* = 'N': op(B) = B (No transpose)
+* = 'C': op(B) = B**H (Conjugate transpose)
+*
+* ISGN (input) INTEGER
+* Specifies the sign in the equation:
+* = +1: solve op(A)*X + X*op(B) = scale*C
+* = -1: solve op(A)*X - X*op(B) = scale*C
+*
+* M (input) INTEGER
+* The order of the matrix A, and the number of rows in the
+* matrices X and C. M >= 0.
+*
+* N (input) INTEGER
+* The order of the matrix B, and the number of columns in the
+* matrices X and C. N >= 0.
+*
+* A (input) COMPLEX*16 array, dimension (LDA,M)
+* The upper triangular matrix A.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,M).
+*
+* B (input) COMPLEX*16 array, dimension (LDB,N)
+* The upper triangular matrix B.
+*
+* LDB (input) INTEGER
+* The leading dimension of the array B. LDB >= max(1,N).
+*
+* C (input/output) COMPLEX*16 array, dimension (LDC,N)
+* On entry, the M-by-N right hand side matrix C.
+* On exit, C is overwritten by the solution matrix X.
+*
+* LDC (input) INTEGER
+* The leading dimension of the array C. LDC >= max(1,M)
+*
+* SCALE (output) DOUBLE PRECISION
+* The scale factor, scale, set <= 1 to avoid overflow in X.
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+* = 1: A and B have common or very close eigenvalues; perturbed
+* values were used to solve the equation (but the matrices
+* A and B are unchanged).
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ONE
+ PARAMETER ( ONE = 1.0D+0 )
+* ..
+* .. Local Scalars ..
+ LOGICAL NOTRNA, NOTRNB
+ INTEGER J, K, L
+ DOUBLE PRECISION BIGNUM, DA11, DB, EPS, SCALOC, SGN, SMIN,
+ $ SMLNUM
+ COMPLEX*16 A11, SUML, SUMR, VEC, X11
+* ..
+* .. Local Arrays ..
+ DOUBLE PRECISION DUM( 1 )
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ DOUBLE PRECISION DLAMCH, ZLANGE
+ COMPLEX*16 ZDOTC, ZDOTU, ZLADIV
+ EXTERNAL LSAME, DLAMCH, ZLANGE, ZDOTC, ZDOTU, ZLADIV
+* ..
+* .. External Subroutines ..
+ EXTERNAL DLABAD, XERBLA, ZDSCAL
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, DBLE, DCMPLX, DCONJG, DIMAG, MAX, MIN
+* ..
+* .. Executable Statements ..
+*
+* Decode and Test input parameters
+*
+ NOTRNA = LSAME( TRANA, 'N' )
+ NOTRNB = LSAME( TRANB, 'N' )
+*
+ INFO = 0
+ IF( .NOT.NOTRNA .AND. .NOT.LSAME( TRANA, 'C' ) ) THEN
+ INFO = -1
+ ELSE IF( .NOT.NOTRNB .AND. .NOT.LSAME( TRANB, 'C' ) ) THEN
+ INFO = -2
+ ELSE IF( ISGN.NE.1 .AND. ISGN.NE.-1 ) THEN
+ INFO = -3
+ ELSE IF( M.LT.0 ) THEN
+ INFO = -4
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -5
+ ELSE IF( LDA.LT.MAX( 1, M ) ) THEN
+ INFO = -7
+ ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
+ INFO = -9
+ ELSE IF( LDC.LT.MAX( 1, M ) ) THEN
+ INFO = -11
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZTRSYL', -INFO )
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ SCALE = ONE
+ IF( M.EQ.0 .OR. N.EQ.0 )
+ $ RETURN
+*
+* Set constants to control overflow
+*
+ EPS = DLAMCH( 'P' )
+ SMLNUM = DLAMCH( 'S' )
+ BIGNUM = ONE / SMLNUM
+ CALL DLABAD( SMLNUM, BIGNUM )
+ SMLNUM = SMLNUM*DBLE( M*N ) / EPS
+ BIGNUM = ONE / SMLNUM
+ SMIN = MAX( SMLNUM, EPS*ZLANGE( 'M', M, M, A, LDA, DUM ),
+ $ EPS*ZLANGE( 'M', N, N, B, LDB, DUM ) )
+ SGN = ISGN
+*
+ IF( NOTRNA .AND. NOTRNB ) THEN
+*
+* Solve A*X + ISGN*X*B = scale*C.
+*
+* The (K,L)th block of X is determined starting from
+* bottom-left corner column by column by
+*
+* A(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L)
+*
+* Where
+* M L-1
+* R(K,L) = SUM [A(K,I)*X(I,L)] +ISGN*SUM [X(K,J)*B(J,L)].
+* I=K+1 J=1
+*
+ DO 30 L = 1, N
+ DO 20 K = M, 1, -1
+*
+ SUML = ZDOTU( M-K, A( K, MIN( K+1, M ) ), LDA,
+ $ C( MIN( K+1, M ), L ), 1 )
+ SUMR = ZDOTU( L-1, C( K, 1 ), LDC, B( 1, L ), 1 )
+ VEC = C( K, L ) - ( SUML+SGN*SUMR )
+*
+ SCALOC = ONE
+ A11 = A( K, K ) + SGN*B( L, L )
+ DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) )
+ IF( DA11.LE.SMIN ) THEN
+ A11 = SMIN
+ DA11 = SMIN
+ INFO = 1
+ END IF
+ DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) )
+ IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN
+ IF( DB.GT.BIGNUM*DA11 )
+ $ SCALOC = ONE / DB
+ END IF
+ X11 = ZLADIV( VEC*DCMPLX( SCALOC ), A11 )
+*
+ IF( SCALOC.NE.ONE ) THEN
+ DO 10 J = 1, N
+ CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 )
+ 10 CONTINUE
+ SCALE = SCALE*SCALOC
+ END IF
+ C( K, L ) = X11
+*
+ 20 CONTINUE
+ 30 CONTINUE
+*
+ ELSE IF( .NOT.NOTRNA .AND. NOTRNB ) THEN
+*
+* Solve A' *X + ISGN*X*B = scale*C.
+*
+* The (K,L)th block of X is determined starting from
+* upper-left corner column by column by
+*
+* A'(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L)
+*
+* Where
+* K-1 L-1
+* R(K,L) = SUM [A'(I,K)*X(I,L)] + ISGN*SUM [X(K,J)*B(J,L)]
+* I=1 J=1
+*
+ DO 60 L = 1, N
+ DO 50 K = 1, M
+*
+ SUML = ZDOTC( K-1, A( 1, K ), 1, C( 1, L ), 1 )
+ SUMR = ZDOTU( L-1, C( K, 1 ), LDC, B( 1, L ), 1 )
+ VEC = C( K, L ) - ( SUML+SGN*SUMR )
+*
+ SCALOC = ONE
+ A11 = DCONJG( A( K, K ) ) + SGN*B( L, L )
+ DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) )
+ IF( DA11.LE.SMIN ) THEN
+ A11 = SMIN
+ DA11 = SMIN
+ INFO = 1
+ END IF
+ DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) )
+ IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN
+ IF( DB.GT.BIGNUM*DA11 )
+ $ SCALOC = ONE / DB
+ END IF
+*
+ X11 = ZLADIV( VEC*DCMPLX( SCALOC ), A11 )
+*
+ IF( SCALOC.NE.ONE ) THEN
+ DO 40 J = 1, N
+ CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 )
+ 40 CONTINUE
+ SCALE = SCALE*SCALOC
+ END IF
+ C( K, L ) = X11
+*
+ 50 CONTINUE
+ 60 CONTINUE
+*
+ ELSE IF( .NOT.NOTRNA .AND. .NOT.NOTRNB ) THEN
+*
+* Solve A'*X + ISGN*X*B' = C.
+*
+* The (K,L)th block of X is determined starting from
+* upper-right corner column by column by
+*
+* A'(K,K)*X(K,L) + ISGN*X(K,L)*B'(L,L) = C(K,L) - R(K,L)
+*
+* Where
+* K-1
+* R(K,L) = SUM [A'(I,K)*X(I,L)] +
+* I=1
+* N
+* ISGN*SUM [X(K,J)*B'(L,J)].
+* J=L+1
+*
+ DO 90 L = N, 1, -1
+ DO 80 K = 1, M
+*
+ SUML = ZDOTC( K-1, A( 1, K ), 1, C( 1, L ), 1 )
+ SUMR = ZDOTC( N-L, C( K, MIN( L+1, N ) ), LDC,
+ $ B( L, MIN( L+1, N ) ), LDB )
+ VEC = C( K, L ) - ( SUML+SGN*DCONJG( SUMR ) )
+*
+ SCALOC = ONE
+ A11 = DCONJG( A( K, K )+SGN*B( L, L ) )
+ DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) )
+ IF( DA11.LE.SMIN ) THEN
+ A11 = SMIN
+ DA11 = SMIN
+ INFO = 1
+ END IF
+ DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) )
+ IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN
+ IF( DB.GT.BIGNUM*DA11 )
+ $ SCALOC = ONE / DB
+ END IF
+*
+ X11 = ZLADIV( VEC*DCMPLX( SCALOC ), A11 )
+*
+ IF( SCALOC.NE.ONE ) THEN
+ DO 70 J = 1, N
+ CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 )
+ 70 CONTINUE
+ SCALE = SCALE*SCALOC
+ END IF
+ C( K, L ) = X11
+*
+ 80 CONTINUE
+ 90 CONTINUE
+*
+ ELSE IF( NOTRNA .AND. .NOT.NOTRNB ) THEN
+*
+* Solve A*X + ISGN*X*B' = C.
+*
+* The (K,L)th block of X is determined starting from
+* bottom-left corner column by column by
+*
+* A(K,K)*X(K,L) + ISGN*X(K,L)*B'(L,L) = C(K,L) - R(K,L)
+*
+* Where
+* M N
+* R(K,L) = SUM [A(K,I)*X(I,L)] + ISGN*SUM [X(K,J)*B'(L,J)]
+* I=K+1 J=L+1
+*
+ DO 120 L = N, 1, -1
+ DO 110 K = M, 1, -1
+*
+ SUML = ZDOTU( M-K, A( K, MIN( K+1, M ) ), LDA,
+ $ C( MIN( K+1, M ), L ), 1 )
+ SUMR = ZDOTC( N-L, C( K, MIN( L+1, N ) ), LDC,
+ $ B( L, MIN( L+1, N ) ), LDB )
+ VEC = C( K, L ) - ( SUML+SGN*DCONJG( SUMR ) )
+*
+ SCALOC = ONE
+ A11 = A( K, K ) + SGN*DCONJG( B( L, L ) )
+ DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) )
+ IF( DA11.LE.SMIN ) THEN
+ A11 = SMIN
+ DA11 = SMIN
+ INFO = 1
+ END IF
+ DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) )
+ IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN
+ IF( DB.GT.BIGNUM*DA11 )
+ $ SCALOC = ONE / DB
+ END IF
+*
+ X11 = ZLADIV( VEC*DCMPLX( SCALOC ), A11 )
+*
+ IF( SCALOC.NE.ONE ) THEN
+ DO 100 J = 1, N
+ CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 )
+ 100 CONTINUE
+ SCALE = SCALE*SCALOC
+ END IF
+ C( K, L ) = X11
+*
+ 110 CONTINUE
+ 120 CONTINUE
+*
+ END IF
+*
+ RETURN
+*
+* End of ZTRSYL
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.h
new file mode 100644
index 0000000000000000000000000000000000000000..3655f4675190a2ba880e9e8d4fd9732613679080
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/ztrsyl.h
@@ -0,0 +1,17 @@
+extern int v3p_netlib_ztrsyl_(
+ char *trana,
+ char *tranb,
+ v3p_netlib_integer *isgn,
+ v3p_netlib_integer *m,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *b,
+ v3p_netlib_integer *ldb,
+ v3p_netlib_doublecomplex *c__,
+ v3p_netlib_integer *ldc,
+ v3p_netlib_doublereal *scale,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen trana_len,
+ v3p_netlib_ftnlen tranb_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.P
new file mode 100644
index 0000000000000000000000000000000000000000..bf6a8a0e73964e1a4c02c8c0d3bd66758b81ca16
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.P
@@ -0,0 +1,4 @@
+extern int zunm2r_(char *side, char *trans, integer *m, integer *n, integer *k, doublecomplex *a, integer *lda, doublecomplex *tau, doublecomplex *c__, integer *ldc, doublecomplex *work, integer *info, ftnlen side_len, ftnlen trans_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zlarf_ 14 10 13 4 4 9 4 9 9 4 9 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.c
new file mode 100644
index 0000000000000000000000000000000000000000..b5cbaa02011e1f4fae62e766586ceeb340c95b4c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.c
@@ -0,0 +1,336 @@
+/* lapack/complex16/zunm2r.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+
+/*< >*/
+/* Subroutine */ int zunm2r_(char *side, char *trans, integer *m, integer *n,
+ integer *k, doublecomplex *a, integer *lda, doublecomplex *tau,
+ doublecomplex *c__, integer *ldc, doublecomplex *work, integer *info,
+ ftnlen side_len, ftnlen trans_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, c_dim1, c_offset, i__1, i__2, i__3;
+ doublecomplex z__1;
+
+ /* Builtin functions */
+ void d_cnjg(doublecomplex *, doublecomplex *);
+
+ /* Local variables */
+ integer i__, i1, i2, i3, ic, jc, mi, ni, nq;
+ doublecomplex aii;
+ logical left;
+ doublecomplex taui;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ extern /* Subroutine */ int zlarf_(char *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, doublecomplex *,
+ integer *, doublecomplex *, ftnlen), xerbla_(char *, integer *,
+ ftnlen);
+ logical notran;
+ (void)side_len;
+ (void)trans_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER SIDE, TRANS >*/
+/*< INTEGER INFO, K, LDA, LDC, M, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZUNM2R overwrites the general complex m-by-n matrix C with */
+
+/* Q * C if SIDE = 'L' and TRANS = 'N', or */
+
+/* Q'* C if SIDE = 'L' and TRANS = 'C', or */
+
+/* C * Q if SIDE = 'R' and TRANS = 'N', or */
+
+/* C * Q' if SIDE = 'R' and TRANS = 'C', */
+
+/* where Q is a complex unitary matrix defined as the product of k */
+/* elementary reflectors */
+
+/* Q = H(1) H(2) . . . H(k) */
+
+/* as returned by ZGEQRF. Q is of order m if SIDE = 'L' and of order n */
+/* if SIDE = 'R'. */
+
+/* Arguments */
+/* ========= */
+
+/* SIDE (input) CHARACTER*1 */
+/* = 'L': apply Q or Q' from the Left */
+/* = 'R': apply Q or Q' from the Right */
+
+/* TRANS (input) CHARACTER*1 */
+/* = 'N': apply Q (No transpose) */
+/* = 'C': apply Q' (Conjugate transpose) */
+
+/* M (input) INTEGER */
+/* The number of rows of the matrix C. M >= 0. */
+
+/* N (input) INTEGER */
+/* The number of columns of the matrix C. N >= 0. */
+
+/* K (input) INTEGER */
+/* The number of elementary reflectors whose product defines */
+/* the matrix Q. */
+/* If SIDE = 'L', M >= K >= 0; */
+/* if SIDE = 'R', N >= K >= 0. */
+
+/* A (input) COMPLEX*16 array, dimension (LDA,K) */
+/* The i-th column must contain the vector which defines the */
+/* elementary reflector H(i), for i = 1,2,...,k, as returned by */
+/* ZGEQRF in the first k columns of its array argument A. */
+/* A is modified by the routine but restored on exit. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. */
+/* If SIDE = 'L', LDA >= max(1,M); */
+/* if SIDE = 'R', LDA >= max(1,N). */
+
+/* TAU (input) COMPLEX*16 array, dimension (K) */
+/* TAU(i) must contain the scalar factor of the elementary */
+/* reflector H(i), as returned by ZGEQRF. */
+
+/* C (input/output) COMPLEX*16 array, dimension (LDC,N) */
+/* On entry, the m-by-n matrix C. */
+/* On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q. */
+
+/* LDC (input) INTEGER */
+/* The leading dimension of the array C. LDC >= max(1,M). */
+
+/* WORK (workspace) COMPLEX*16 array, dimension */
+/* (N) if SIDE = 'L', */
+/* (M) if SIDE = 'R' */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< COMPLEX*16 ONE >*/
+/*< PARAMETER ( ONE = ( 1.0D+0, 0.0D+0 ) ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL LEFT, NOTRAN >*/
+/*< INTEGER I, I1, I2, I3, IC, JC, MI, NI, NQ >*/
+/*< COMPLEX*16 AII, TAUI >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< EXTERNAL LSAME >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZLARF >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC DCONJG, MAX >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input arguments */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ --tau;
+ c_dim1 = *ldc;
+ c_offset = 1 + c_dim1;
+ c__ -= c_offset;
+ --work;
+
+ /* Function Body */
+ *info = 0;
+/*< LEFT = LSAME( SIDE, 'L' ) >*/
+ left = lsame_(side, "L", (ftnlen)1, (ftnlen)1);
+/*< NOTRAN = LSAME( TRANS, 'N' ) >*/
+ notran = lsame_(trans, "N", (ftnlen)1, (ftnlen)1);
+
+/* NQ is the order of Q */
+
+/*< IF( LEFT ) THEN >*/
+ if (left) {
+/*< NQ = M >*/
+ nq = *m;
+/*< ELSE >*/
+ } else {
+/*< NQ = N >*/
+ nq = *n;
+/*< END IF >*/
+ }
+/*< IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN >*/
+ if (! left && ! lsame_(side, "R", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN >*/
+ } else if (! notran && ! lsame_(trans, "C", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( M.LT.0 ) THEN >*/
+ } else if (*m < 0) {
+/*< INFO = -3 >*/
+ *info = -3;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN >*/
+ } else if (*k < 0 || *k > nq) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( LDA.LT.MAX( 1, NQ ) ) THEN >*/
+ } else if (*lda < max(1,nq)) {
+/*< INFO = -7 >*/
+ *info = -7;
+/*< ELSE IF( LDC.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*ldc < max(1,*m)) {
+/*< INFO = -10 >*/
+ *info = -10;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZUNM2R', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZUNM2R", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< >*/
+ if (*m == 0 || *n == 0 || *k == 0) {
+ return 0;
+ }
+
+/*< IF( ( LEFT .AND. .NOT.NOTRAN .OR. .NOT.LEFT .AND. NOTRAN ) ) THEN >*/
+ if ((left && ! notran) || (! left && notran)) {
+/*< I1 = 1 >*/
+ i1 = 1;
+/*< I2 = K >*/
+ i2 = *k;
+/*< I3 = 1 >*/
+ i3 = 1;
+/*< ELSE >*/
+ } else {
+/*< I1 = K >*/
+ i1 = *k;
+/*< I2 = 1 >*/
+ i2 = 1;
+/*< I3 = -1 >*/
+ i3 = -1;
+/*< END IF >*/
+ }
+
+/*< IF( LEFT ) THEN >*/
+ if (left) {
+/*< NI = N >*/
+ ni = *n;
+/*< JC = 1 >*/
+ jc = 1;
+/*< ELSE >*/
+ } else {
+/*< MI = M >*/
+ mi = *m;
+/*< IC = 1 >*/
+ ic = 1;
+/*< END IF >*/
+ }
+
+/*< DO 10 I = I1, I2, I3 >*/
+ i__1 = i2;
+ i__2 = i3;
+ for (i__ = i1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
+/*< IF( LEFT ) THEN >*/
+ if (left) {
+
+/* H(i) or H(i)' is applied to C(i:m,1:n) */
+
+/*< MI = M - I + 1 >*/
+ mi = *m - i__ + 1;
+/*< IC = I >*/
+ ic = i__;
+/*< ELSE >*/
+ } else {
+
+/* H(i) or H(i)' is applied to C(1:m,i:n) */
+
+/*< NI = N - I + 1 >*/
+ ni = *n - i__ + 1;
+/*< JC = I >*/
+ jc = i__;
+/*< END IF >*/
+ }
+
+/* Apply H(i) or H(i)' */
+
+/*< IF( NOTRAN ) THEN >*/
+ if (notran) {
+/*< TAUI = TAU( I ) >*/
+ i__3 = i__;
+ taui.r = tau[i__3].r, taui.i = tau[i__3].i;
+/*< ELSE >*/
+ } else {
+/*< TAUI = DCONJG( TAU( I ) ) >*/
+ d_cnjg(&z__1, &tau[i__]);
+ taui.r = z__1.r, taui.i = z__1.i;
+/*< END IF >*/
+ }
+/*< AII = A( I, I ) >*/
+ i__3 = i__ + i__ * a_dim1;
+ aii.r = a[i__3].r, aii.i = a[i__3].i;
+/*< A( I, I ) = ONE >*/
+ i__3 = i__ + i__ * a_dim1;
+ a[i__3].r = 1., a[i__3].i = 0.;
+/*< >*/
+ zlarf_(side, &mi, &ni, &a[i__ + i__ * a_dim1], &c__1, &taui, &c__[ic
+ + jc * c_dim1], ldc, &work[1], (ftnlen)1);
+/*< A( I, I ) = AII >*/
+ i__3 = i__ + i__ * a_dim1;
+ a[i__3].r = aii.r, a[i__3].i = aii.i;
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< RETURN >*/
+ return 0;
+
+/* End of ZUNM2R */
+
+/*< END >*/
+} /* zunm2r_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.f
new file mode 100644
index 0000000000000000000000000000000000000000..6cf5779d8f809898bdce94d2eb1c68f3f0fe10da
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.f
@@ -0,0 +1,202 @@
+ SUBROUTINE ZUNM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
+ $ WORK, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER SIDE, TRANS
+ INTEGER INFO, K, LDA, LDC, M, N
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZUNM2R overwrites the general complex m-by-n matrix C with
+*
+* Q * C if SIDE = 'L' and TRANS = 'N', or
+*
+* Q'* C if SIDE = 'L' and TRANS = 'C', or
+*
+* C * Q if SIDE = 'R' and TRANS = 'N', or
+*
+* C * Q' if SIDE = 'R' and TRANS = 'C',
+*
+* where Q is a complex unitary matrix defined as the product of k
+* elementary reflectors
+*
+* Q = H(1) H(2) . . . H(k)
+*
+* as returned by ZGEQRF. Q is of order m if SIDE = 'L' and of order n
+* if SIDE = 'R'.
+*
+* Arguments
+* =========
+*
+* SIDE (input) CHARACTER*1
+* = 'L': apply Q or Q' from the Left
+* = 'R': apply Q or Q' from the Right
+*
+* TRANS (input) CHARACTER*1
+* = 'N': apply Q (No transpose)
+* = 'C': apply Q' (Conjugate transpose)
+*
+* M (input) INTEGER
+* The number of rows of the matrix C. M >= 0.
+*
+* N (input) INTEGER
+* The number of columns of the matrix C. N >= 0.
+*
+* K (input) INTEGER
+* The number of elementary reflectors whose product defines
+* the matrix Q.
+* If SIDE = 'L', M >= K >= 0;
+* if SIDE = 'R', N >= K >= 0.
+*
+* A (input) COMPLEX*16 array, dimension (LDA,K)
+* The i-th column must contain the vector which defines the
+* elementary reflector H(i), for i = 1,2,...,k, as returned by
+* ZGEQRF in the first k columns of its array argument A.
+* A is modified by the routine but restored on exit.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A.
+* If SIDE = 'L', LDA >= max(1,M);
+* if SIDE = 'R', LDA >= max(1,N).
+*
+* TAU (input) COMPLEX*16 array, dimension (K)
+* TAU(i) must contain the scalar factor of the elementary
+* reflector H(i), as returned by ZGEQRF.
+*
+* C (input/output) COMPLEX*16 array, dimension (LDC,N)
+* On entry, the m-by-n matrix C.
+* On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q.
+*
+* LDC (input) INTEGER
+* The leading dimension of the array C. LDC >= max(1,M).
+*
+* WORK (workspace) COMPLEX*16 array, dimension
+* (N) if SIDE = 'L',
+* (M) if SIDE = 'R'
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+*
+* =====================================================================
+*
+* .. Parameters ..
+ COMPLEX*16 ONE
+ PARAMETER ( ONE = ( 1.0D+0, 0.0D+0 ) )
+* ..
+* .. Local Scalars ..
+ LOGICAL LEFT, NOTRAN
+ INTEGER I, I1, I2, I3, IC, JC, MI, NI, NQ
+ COMPLEX*16 AII, TAUI
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ EXTERNAL LSAME
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZLARF
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC DCONJG, MAX
+* ..
+* .. Executable Statements ..
+*
+* Test the input arguments
+*
+ INFO = 0
+ LEFT = LSAME( SIDE, 'L' )
+ NOTRAN = LSAME( TRANS, 'N' )
+*
+* NQ is the order of Q
+*
+ IF( LEFT ) THEN
+ NQ = M
+ ELSE
+ NQ = N
+ END IF
+ IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN
+ INFO = -1
+ ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN
+ INFO = -2
+ ELSE IF( M.LT.0 ) THEN
+ INFO = -3
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -4
+ ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN
+ INFO = -5
+ ELSE IF( LDA.LT.MAX( 1, NQ ) ) THEN
+ INFO = -7
+ ELSE IF( LDC.LT.MAX( 1, M ) ) THEN
+ INFO = -10
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZUNM2R', -INFO )
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 )
+ $ RETURN
+*
+ IF( ( LEFT .AND. .NOT.NOTRAN .OR. .NOT.LEFT .AND. NOTRAN ) ) THEN
+ I1 = 1
+ I2 = K
+ I3 = 1
+ ELSE
+ I1 = K
+ I2 = 1
+ I3 = -1
+ END IF
+*
+ IF( LEFT ) THEN
+ NI = N
+ JC = 1
+ ELSE
+ MI = M
+ IC = 1
+ END IF
+*
+ DO 10 I = I1, I2, I3
+ IF( LEFT ) THEN
+*
+* H(i) or H(i)' is applied to C(i:m,1:n)
+*
+ MI = M - I + 1
+ IC = I
+ ELSE
+*
+* H(i) or H(i)' is applied to C(1:m,i:n)
+*
+ NI = N - I + 1
+ JC = I
+ END IF
+*
+* Apply H(i) or H(i)'
+*
+ IF( NOTRAN ) THEN
+ TAUI = TAU( I )
+ ELSE
+ TAUI = DCONJG( TAU( I ) )
+ END IF
+ AII = A( I, I )
+ A( I, I ) = ONE
+ CALL ZLARF( SIDE, MI, NI, A( I, I ), 1, TAUI, C( IC, JC ), LDC,
+ $ WORK )
+ A( I, I ) = AII
+ 10 CONTINUE
+ RETURN
+*
+* End of ZUNM2R
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.h
new file mode 100644
index 0000000000000000000000000000000000000000..d809f584cfba02647b7c38ba6f4a5e1359c1544d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunm2r.h
@@ -0,0 +1,16 @@
+extern int v3p_netlib_zunm2r_(
+ char *side,
+ char *trans,
+ v3p_netlib_integer *m,
+ v3p_netlib_integer *n,
+ v3p_netlib_integer *k,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *tau,
+ v3p_netlib_doublecomplex *c__,
+ v3p_netlib_integer *ldc,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen side_len,
+ v3p_netlib_ftnlen trans_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.P
new file mode 100644
index 0000000000000000000000000000000000000000..10ccdadf66ab00738f72110e454f6064806da55a
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.P
@@ -0,0 +1,7 @@
+extern int zunmqr_(char *side, char *trans, integer *m, integer *n, integer *k, doublecomplex *a, integer *lda, doublecomplex *tau, doublecomplex *c__, integer *ldc, doublecomplex *work, integer *lwork, integer *info, ftnlen side_len, ftnlen trans_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: ilaenv_ 4 9 4 13 13 4 4 4 4 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: zunm2r_ 14 14 13 13 4 4 4 9 4 9 9 4 9 4 124 124 */
+/*:ref: zlarft_ 14 11 13 13 4 4 9 4 9 9 4 124 124 */
+/*:ref: zlarfb_ 14 19 13 13 13 13 4 4 4 9 4 9 4 9 4 9 4 124 124 124 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.c
new file mode 100644
index 0000000000000000000000000000000000000000..f8dbd31a13df68c326978295248ca7c7f8896591
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.c
@@ -0,0 +1,447 @@
+/* lapack/complex16/zunmqr.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+static integer c_n1 = -1;
+static integer c__2 = 2;
+static integer c__65 = 65;
+
+/*< >*/
+/* Subroutine */ int zunmqr_(char *side, char *trans, integer *m, integer *n,
+ integer *k, doublecomplex *a, integer *lda, doublecomplex *tau,
+ doublecomplex *c__, integer *ldc, doublecomplex *work, integer *lwork,
+ integer *info, ftnlen side_len, ftnlen trans_len)
+{
+ /* System generated locals */
+ address a__1[2];
+ integer a_dim1, a_offset, c_dim1, c_offset, i__1, i__2, i__3[2], i__4,
+ i__5;
+ char ch__1[2];
+
+ /* Builtin functions */
+ /* Subroutine */ int s_cat(char *, char **, integer *, integer *, ftnlen);
+
+ /* Local variables */
+ integer i__;
+ doublecomplex t[4160] /* was [65][64] */;
+ integer i1, i2, i3, ib, ic, jc, nb, mi, ni, nq, nw, iws;
+ logical left;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ integer nbmin, iinfo;
+ extern /* Subroutine */ int zunm2r_(char *, char *, integer *, integer *,
+ integer *, doublecomplex *, integer *, doublecomplex *,
+ doublecomplex *, integer *, doublecomplex *, integer *, ftnlen,
+ ftnlen), xerbla_(char *, integer *, ftnlen);
+ extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
+ integer *, integer *, ftnlen, ftnlen);
+ extern /* Subroutine */ int zlarfb_(char *, char *, char *, char *,
+ integer *, integer *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, doublecomplex *, integer *,
+ doublecomplex *, integer *, ftnlen, ftnlen, ftnlen, ftnlen);
+ logical notran;
+ integer ldwork;
+ extern /* Subroutine */ int zlarft_(char *, char *, integer *, integer *,
+ doublecomplex *, integer *, doublecomplex *, doublecomplex *,
+ integer *, ftnlen, ftnlen);
+ integer lwkopt;
+ logical lquery;
+ (void)side_len;
+ (void)trans_len;
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER SIDE, TRANS >*/
+/*< INTEGER INFO, K, LDA, LDC, LWORK, M, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* ZUNMQR overwrites the general complex M-by-N matrix C with */
+
+/* SIDE = 'L' SIDE = 'R' */
+/* TRANS = 'N': Q * C C * Q */
+/* TRANS = 'C': Q**H * C C * Q**H */
+
+/* where Q is a complex unitary matrix defined as the product of k */
+/* elementary reflectors */
+
+/* Q = H(1) H(2) . . . H(k) */
+
+/* as returned by ZGEQRF. Q is of order M if SIDE = 'L' and of order N */
+/* if SIDE = 'R'. */
+
+/* Arguments */
+/* ========= */
+
+/* SIDE (input) CHARACTER*1 */
+/* = 'L': apply Q or Q**H from the Left; */
+/* = 'R': apply Q or Q**H from the Right. */
+
+/* TRANS (input) CHARACTER*1 */
+/* = 'N': No transpose, apply Q; */
+/* = 'C': Conjugate transpose, apply Q**H. */
+
+/* M (input) INTEGER */
+/* The number of rows of the matrix C. M >= 0. */
+
+/* N (input) INTEGER */
+/* The number of columns of the matrix C. N >= 0. */
+
+/* K (input) INTEGER */
+/* The number of elementary reflectors whose product defines */
+/* the matrix Q. */
+/* If SIDE = 'L', M >= K >= 0; */
+/* if SIDE = 'R', N >= K >= 0. */
+
+/* A (input) COMPLEX*16 array, dimension (LDA,K) */
+/* The i-th column must contain the vector which defines the */
+/* elementary reflector H(i), for i = 1,2,...,k, as returned by */
+/* ZGEQRF in the first k columns of its array argument A. */
+/* A is modified by the routine but restored on exit. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. */
+/* If SIDE = 'L', LDA >= max(1,M); */
+/* if SIDE = 'R', LDA >= max(1,N). */
+
+/* TAU (input) COMPLEX*16 array, dimension (K) */
+/* TAU(i) must contain the scalar factor of the elementary */
+/* reflector H(i), as returned by ZGEQRF. */
+
+/* C (input/output) COMPLEX*16 array, dimension (LDC,N) */
+/* On entry, the M-by-N matrix C. */
+/* On exit, C is overwritten by Q*C or Q**H*C or C*Q**H or C*Q. */
+
+/* LDC (input) INTEGER */
+/* The leading dimension of the array C. LDC >= max(1,M). */
+
+/* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK)) */
+/* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
+
+/* LWORK (input) INTEGER */
+/* The dimension of the array WORK. */
+/* If SIDE = 'L', LWORK >= max(1,N); */
+/* if SIDE = 'R', LWORK >= max(1,M). */
+/* For optimum performance LWORK >= N*NB if SIDE = 'L', and */
+/* LWORK >= M*NB if SIDE = 'R', where NB is the optimal */
+/* blocksize. */
+
+/* If LWORK = -1, then a workspace query is assumed; the routine */
+/* only calculates the optimal size of the WORK array, returns */
+/* this value as the first entry of the WORK array, and no error */
+/* message related to LWORK is issued by XERBLA. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< INTEGER NBMAX, LDT >*/
+/*< PARAMETER ( NBMAX = 64, LDT = NBMAX+1 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< LOGICAL LEFT, LQUERY, NOTRAN >*/
+/*< >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< COMPLEX*16 T( LDT, NBMAX ) >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< INTEGER ILAENV >*/
+/*< EXTERNAL LSAME, ILAENV >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA, ZLARFB, ZLARFT, ZUNM2R >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC MAX, MIN >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input arguments */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+ --tau;
+ c_dim1 = *ldc;
+ c_offset = 1 + c_dim1;
+ c__ -= c_offset;
+ --work;
+
+ /* Function Body */
+ *info = 0;
+/*< LEFT = LSAME( SIDE, 'L' ) >*/
+ left = lsame_(side, "L", (ftnlen)1, (ftnlen)1);
+/*< NOTRAN = LSAME( TRANS, 'N' ) >*/
+ notran = lsame_(trans, "N", (ftnlen)1, (ftnlen)1);
+/*< LQUERY = ( LWORK.EQ.-1 ) >*/
+ lquery = *lwork == -1;
+
+/* NQ is the order of Q and NW is the minimum dimension of WORK */
+
+/*< IF( LEFT ) THEN >*/
+ if (left) {
+/*< NQ = M >*/
+ nq = *m;
+/*< NW = N >*/
+ nw = *n;
+/*< ELSE >*/
+ } else {
+/*< NQ = N >*/
+ nq = *n;
+/*< NW = M >*/
+ nw = *m;
+/*< END IF >*/
+ }
+/*< IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN >*/
+ if (! left && ! lsame_(side, "R", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN >*/
+ } else if (! notran && ! lsame_(trans, "C", (ftnlen)1, (ftnlen)1)) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< ELSE IF( M.LT.0 ) THEN >*/
+ } else if (*m < 0) {
+/*< INFO = -3 >*/
+ *info = -3;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -4 >*/
+ *info = -4;
+/*< ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN >*/
+ } else if (*k < 0 || *k > nq) {
+/*< INFO = -5 >*/
+ *info = -5;
+/*< ELSE IF( LDA.LT.MAX( 1, NQ ) ) THEN >*/
+ } else if (*lda < max(1,nq)) {
+/*< INFO = -7 >*/
+ *info = -7;
+/*< ELSE IF( LDC.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*ldc < max(1,*m)) {
+/*< INFO = -10 >*/
+ *info = -10;
+/*< ELSE IF( LWORK.LT.MAX( 1, NW ) .AND. .NOT.LQUERY ) THEN >*/
+ } else if (*lwork < max(1,nw) && ! lquery) {
+/*< INFO = -12 >*/
+ *info = -12;
+/*< END IF >*/
+ }
+
+/*< IF( INFO.EQ.0 ) THEN >*/
+ if (*info == 0) {
+
+/* Determine the block size. NB may be at most NBMAX, where NBMAX */
+/* is used to define the local array T. */
+
+/*< >*/
+/* Computing MIN */
+/* Writing concatenation */
+ i__3[0] = 1, a__1[0] = side;
+ i__3[1] = 1, a__1[1] = trans;
+ s_cat(ch__1, a__1, i__3, &c__2, (ftnlen)2);
+ i__1 = 64, i__2 = ilaenv_(&c__1, "ZUNMQR", ch__1, m, n, k, &c_n1, (
+ ftnlen)6, (ftnlen)2);
+ nb = min(i__1,i__2);
+/*< LWKOPT = MAX( 1, NW )*NB >*/
+ lwkopt = max(1,nw) * nb;
+/*< WORK( 1 ) = LWKOPT >*/
+ work[1].r = (doublereal) lwkopt, work[1].i = 0.;
+/*< END IF >*/
+ }
+
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'ZUNMQR', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("ZUNMQR", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< ELSE IF( LQUERY ) THEN >*/
+ } else if (lquery) {
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 ) THEN >*/
+ if (*m == 0 || *n == 0 || *k == 0) {
+/*< WORK( 1 ) = 1 >*/
+ work[1].r = 1., work[1].i = 0.;
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/*< NBMIN = 2 >*/
+ nbmin = 2;
+/*< LDWORK = NW >*/
+ ldwork = nw;
+/*< IF( NB.GT.1 .AND. NB.LT.K ) THEN >*/
+ if (nb > 1 && nb < *k) {
+/*< IWS = NW*NB >*/
+ iws = nw * nb;
+/*< IF( LWORK.LT.IWS ) THEN >*/
+ if (*lwork < iws) {
+/*< NB = LWORK / LDWORK >*/
+ nb = *lwork / ldwork;
+/*< >*/
+/* Computing MAX */
+/* Writing concatenation */
+ i__3[0] = 1, a__1[0] = side;
+ i__3[1] = 1, a__1[1] = trans;
+ s_cat(ch__1, a__1, i__3, &c__2, (ftnlen)2);
+ i__1 = 2, i__2 = ilaenv_(&c__2, "ZUNMQR", ch__1, m, n, k, &c_n1, (
+ ftnlen)6, (ftnlen)2);
+ nbmin = max(i__1,i__2);
+/*< END IF >*/
+ }
+/*< ELSE >*/
+ } else {
+/*< IWS = NW >*/
+ iws = nw;
+/*< END IF >*/
+ }
+
+/*< IF( NB.LT.NBMIN .OR. NB.GE.K ) THEN >*/
+ if (nb < nbmin || nb >= *k) {
+
+/* Use unblocked code */
+
+/*< >*/
+ zunm2r_(side, trans, m, n, k, &a[a_offset], lda, &tau[1], &c__[
+ c_offset], ldc, &work[1], &iinfo, (ftnlen)1, (ftnlen)1);
+/*< ELSE >*/
+ } else {
+
+/* Use blocked code */
+
+/*< >*/
+ if ((left && ! notran) || (! left && notran)) {
+/*< I1 = 1 >*/
+ i1 = 1;
+/*< I2 = K >*/
+ i2 = *k;
+/*< I3 = NB >*/
+ i3 = nb;
+/*< ELSE >*/
+ } else {
+/*< I1 = ( ( K-1 ) / NB )*NB + 1 >*/
+ i1 = (*k - 1) / nb * nb + 1;
+/*< I2 = 1 >*/
+ i2 = 1;
+/*< I3 = -NB >*/
+ i3 = -nb;
+/*< END IF >*/
+ }
+
+/*< IF( LEFT ) THEN >*/
+ if (left) {
+/*< NI = N >*/
+ ni = *n;
+/*< JC = 1 >*/
+ jc = 1;
+/*< ELSE >*/
+ } else {
+/*< MI = M >*/
+ mi = *m;
+/*< IC = 1 >*/
+ ic = 1;
+/*< END IF >*/
+ }
+
+/*< DO 10 I = I1, I2, I3 >*/
+ i__1 = i2;
+ i__2 = i3;
+ for (i__ = i1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
+/*< IB = MIN( NB, K-I+1 ) >*/
+/* Computing MIN */
+ i__4 = nb, i__5 = *k - i__ + 1;
+ ib = min(i__4,i__5);
+
+/* Form the triangular factor of the block reflector */
+/* H = H(i) H(i+1) . . . H(i+ib-1) */
+
+/*< >*/
+ i__4 = nq - i__ + 1;
+ zlarft_("Forward", "Columnwise", &i__4, &ib, &a[i__ + i__ *
+ a_dim1], lda, &tau[i__], t, &c__65, (ftnlen)7, (ftnlen)10)
+ ;
+/*< IF( LEFT ) THEN >*/
+ if (left) {
+
+/* H or H' is applied to C(i:m,1:n) */
+
+/*< MI = M - I + 1 >*/
+ mi = *m - i__ + 1;
+/*< IC = I >*/
+ ic = i__;
+/*< ELSE >*/
+ } else {
+
+/* H or H' is applied to C(1:m,i:n) */
+
+/*< NI = N - I + 1 >*/
+ ni = *n - i__ + 1;
+/*< JC = I >*/
+ jc = i__;
+/*< END IF >*/
+ }
+
+/* Apply H or H' */
+
+/*< >*/
+ zlarfb_(side, trans, "Forward", "Columnwise", &mi, &ni, &ib, &a[
+ i__ + i__ * a_dim1], lda, t, &c__65, &c__[ic + jc *
+ c_dim1], ldc, &work[1], &ldwork, (ftnlen)1, (ftnlen)1, (
+ ftnlen)7, (ftnlen)10);
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< END IF >*/
+ }
+/*< WORK( 1 ) = LWKOPT >*/
+ work[1].r = (doublereal) lwkopt, work[1].i = 0.;
+/*< RETURN >*/
+ return 0;
+
+/* End of ZUNMQR */
+
+/*< END >*/
+} /* zunmqr_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.f
new file mode 100644
index 0000000000000000000000000000000000000000..19d236aca9b661a4bc59c23af46dd9a23b9a65dc
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.f
@@ -0,0 +1,261 @@
+ SUBROUTINE ZUNMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
+ $ WORK, LWORK, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER SIDE, TRANS
+ INTEGER INFO, K, LDA, LDC, LWORK, M, N
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
+* ..
+*
+* Purpose
+* =======
+*
+* ZUNMQR overwrites the general complex M-by-N matrix C with
+*
+* SIDE = 'L' SIDE = 'R'
+* TRANS = 'N': Q * C C * Q
+* TRANS = 'C': Q**H * C C * Q**H
+*
+* where Q is a complex unitary matrix defined as the product of k
+* elementary reflectors
+*
+* Q = H(1) H(2) . . . H(k)
+*
+* as returned by ZGEQRF. Q is of order M if SIDE = 'L' and of order N
+* if SIDE = 'R'.
+*
+* Arguments
+* =========
+*
+* SIDE (input) CHARACTER*1
+* = 'L': apply Q or Q**H from the Left;
+* = 'R': apply Q or Q**H from the Right.
+*
+* TRANS (input) CHARACTER*1
+* = 'N': No transpose, apply Q;
+* = 'C': Conjugate transpose, apply Q**H.
+*
+* M (input) INTEGER
+* The number of rows of the matrix C. M >= 0.
+*
+* N (input) INTEGER
+* The number of columns of the matrix C. N >= 0.
+*
+* K (input) INTEGER
+* The number of elementary reflectors whose product defines
+* the matrix Q.
+* If SIDE = 'L', M >= K >= 0;
+* if SIDE = 'R', N >= K >= 0.
+*
+* A (input) COMPLEX*16 array, dimension (LDA,K)
+* The i-th column must contain the vector which defines the
+* elementary reflector H(i), for i = 1,2,...,k, as returned by
+* ZGEQRF in the first k columns of its array argument A.
+* A is modified by the routine but restored on exit.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A.
+* If SIDE = 'L', LDA >= max(1,M);
+* if SIDE = 'R', LDA >= max(1,N).
+*
+* TAU (input) COMPLEX*16 array, dimension (K)
+* TAU(i) must contain the scalar factor of the elementary
+* reflector H(i), as returned by ZGEQRF.
+*
+* C (input/output) COMPLEX*16 array, dimension (LDC,N)
+* On entry, the M-by-N matrix C.
+* On exit, C is overwritten by Q*C or Q**H*C or C*Q**H or C*Q.
+*
+* LDC (input) INTEGER
+* The leading dimension of the array C. LDC >= max(1,M).
+*
+* WORK (workspace/output) COMPLEX*16 array, dimension (MAX(1,LWORK))
+* On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
+*
+* LWORK (input) INTEGER
+* The dimension of the array WORK.
+* If SIDE = 'L', LWORK >= max(1,N);
+* if SIDE = 'R', LWORK >= max(1,M).
+* For optimum performance LWORK >= N*NB if SIDE = 'L', and
+* LWORK >= M*NB if SIDE = 'R', where NB is the optimal
+* blocksize.
+*
+* If LWORK = -1, then a workspace query is assumed; the routine
+* only calculates the optimal size of the WORK array, returns
+* this value as the first entry of the WORK array, and no error
+* message related to LWORK is issued by XERBLA.
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+*
+* =====================================================================
+*
+* .. Parameters ..
+ INTEGER NBMAX, LDT
+ PARAMETER ( NBMAX = 64, LDT = NBMAX+1 )
+* ..
+* .. Local Scalars ..
+ LOGICAL LEFT, LQUERY, NOTRAN
+ INTEGER I, I1, I2, I3, IB, IC, IINFO, IWS, JC, LDWORK,
+ $ LWKOPT, MI, NB, NBMIN, NI, NQ, NW
+* ..
+* .. Local Arrays ..
+ COMPLEX*16 T( LDT, NBMAX )
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ INTEGER ILAENV
+ EXTERNAL LSAME, ILAENV
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA, ZLARFB, ZLARFT, ZUNM2R
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC MAX, MIN
+* ..
+* .. Executable Statements ..
+*
+* Test the input arguments
+*
+ INFO = 0
+ LEFT = LSAME( SIDE, 'L' )
+ NOTRAN = LSAME( TRANS, 'N' )
+ LQUERY = ( LWORK.EQ.-1 )
+*
+* NQ is the order of Q and NW is the minimum dimension of WORK
+*
+ IF( LEFT ) THEN
+ NQ = M
+ NW = N
+ ELSE
+ NQ = N
+ NW = M
+ END IF
+ IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN
+ INFO = -1
+ ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN
+ INFO = -2
+ ELSE IF( M.LT.0 ) THEN
+ INFO = -3
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -4
+ ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN
+ INFO = -5
+ ELSE IF( LDA.LT.MAX( 1, NQ ) ) THEN
+ INFO = -7
+ ELSE IF( LDC.LT.MAX( 1, M ) ) THEN
+ INFO = -10
+ ELSE IF( LWORK.LT.MAX( 1, NW ) .AND. .NOT.LQUERY ) THEN
+ INFO = -12
+ END IF
+*
+ IF( INFO.EQ.0 ) THEN
+*
+* Determine the block size. NB may be at most NBMAX, where NBMAX
+* is used to define the local array T.
+*
+ NB = MIN( NBMAX, ILAENV( 1, 'ZUNMQR', SIDE // TRANS, M, N, K,
+ $ -1 ) )
+ LWKOPT = MAX( 1, NW )*NB
+ WORK( 1 ) = LWKOPT
+ END IF
+*
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'ZUNMQR', -INFO )
+ RETURN
+ ELSE IF( LQUERY ) THEN
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 ) THEN
+ WORK( 1 ) = 1
+ RETURN
+ END IF
+*
+ NBMIN = 2
+ LDWORK = NW
+ IF( NB.GT.1 .AND. NB.LT.K ) THEN
+ IWS = NW*NB
+ IF( LWORK.LT.IWS ) THEN
+ NB = LWORK / LDWORK
+ NBMIN = MAX( 2, ILAENV( 2, 'ZUNMQR', SIDE // TRANS, M, N, K,
+ $ -1 ) )
+ END IF
+ ELSE
+ IWS = NW
+ END IF
+*
+ IF( NB.LT.NBMIN .OR. NB.GE.K ) THEN
+*
+* Use unblocked code
+*
+ CALL ZUNM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, WORK,
+ $ IINFO )
+ ELSE
+*
+* Use blocked code
+*
+ IF( ( LEFT .AND. .NOT.NOTRAN ) .OR.
+ $ ( .NOT.LEFT .AND. NOTRAN ) ) THEN
+ I1 = 1
+ I2 = K
+ I3 = NB
+ ELSE
+ I1 = ( ( K-1 ) / NB )*NB + 1
+ I2 = 1
+ I3 = -NB
+ END IF
+*
+ IF( LEFT ) THEN
+ NI = N
+ JC = 1
+ ELSE
+ MI = M
+ IC = 1
+ END IF
+*
+ DO 10 I = I1, I2, I3
+ IB = MIN( NB, K-I+1 )
+*
+* Form the triangular factor of the block reflector
+* H = H(i) H(i+1) . . . H(i+ib-1)
+*
+ CALL ZLARFT( 'Forward', 'Columnwise', NQ-I+1, IB, A( I, I ),
+ $ LDA, TAU( I ), T, LDT )
+ IF( LEFT ) THEN
+*
+* H or H' is applied to C(i:m,1:n)
+*
+ MI = M - I + 1
+ IC = I
+ ELSE
+*
+* H or H' is applied to C(1:m,i:n)
+*
+ NI = N - I + 1
+ JC = I
+ END IF
+*
+* Apply H or H'
+*
+ CALL ZLARFB( SIDE, TRANS, 'Forward', 'Columnwise', MI, NI,
+ $ IB, A( I, I ), LDA, T, LDT, C( IC, JC ), LDC,
+ $ WORK, LDWORK )
+ 10 CONTINUE
+ END IF
+ WORK( 1 ) = LWKOPT
+ RETURN
+*
+* End of ZUNMQR
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.h
new file mode 100644
index 0000000000000000000000000000000000000000..9b50ddc940201b3280bb77f3a4b36a56c240a432
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/complex16/zunmqr.h
@@ -0,0 +1,17 @@
+extern int v3p_netlib_zunmqr_(
+ char *side,
+ char *trans,
+ v3p_netlib_integer *m,
+ v3p_netlib_integer *n,
+ v3p_netlib_integer *k,
+ v3p_netlib_doublecomplex *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_doublecomplex *tau,
+ v3p_netlib_doublecomplex *c__,
+ v3p_netlib_integer *ldc,
+ v3p_netlib_doublecomplex *work,
+ v3p_netlib_integer *lwork,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen side_len,
+ v3p_netlib_ftnlen trans_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgecon.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgecon.c
index cf9bb0ea2534c871f9a8c3c48ee4132d6fc6cff8..05ce7b209067205fc6c21bd2af9cdf859877e490 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgecon.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgecon.c
@@ -34,7 +34,7 @@ static integer c__1 = 1;
doublereal su;
integer kase, kase1;
doublereal scale;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int drscl_(integer *, doublereal *, doublereal *,
integer *);
extern doublereal dlamch_(char *, ftnlen);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dggbak.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dggbak.c
index c1844b87f61a11d16b7dd262ad5742474669b738..3a63ad3719ed503d3853191473ff99ede7c14e17 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dggbak.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dggbak.c
@@ -28,7 +28,7 @@ extern "C" {
integer i__, k;
extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
integer *);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int dswap_(integer *, doublereal *, integer *,
doublereal *, integer *);
logical leftv;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dggbal.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dggbal.c
index 241f2fe8683a5136ed776121c62ee35a7fab87c9..d7737f863599219ed75ae1a152c43067741dd50e 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dggbal.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dggbal.c
@@ -53,7 +53,7 @@ static doublereal c_b70 = .5;
doublereal coef2, coef5, gamma, alpha;
extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
integer *);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
doublereal sfmin, sfmax;
extern /* Subroutine */ int dswap_(integer *, doublereal *, integer *,
doublereal *, integer *);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgges.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgges.c
index 27ff11fc796f2a3fc3d11005c0f9662389557f23..63fe9f2faf446ee5375285420bec654cbeee3046 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgges.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgges.c
@@ -47,7 +47,7 @@ static doublereal c_b34 = 1.;
doublereal eps, anrm, bnrm;
integer idum[1], ierr, itau, iwrk;
doublereal pvsl, pvsr;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
integer ileft, icols;
logical cursl, ilvsl, ilvsr;
integer irows;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgghrd.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgghrd.c
index f041324ffaaede81973ef922504b66aa4a13c26c..151784b7326ae44da6f3e07e5707478ae4e094d9 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgghrd.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dgghrd.c
@@ -39,7 +39,7 @@ static integer c__1 = 1;
extern /* Subroutine */ int drot_(integer *, doublereal *, integer *,
doublereal *, integer *, doublereal *, doublereal *);
integer jrow;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int dlaset_(char *, integer *, integer *,
doublereal *, doublereal *, doublereal *, integer *, ftnlen),
dlartg_(doublereal *, doublereal *, doublereal *, doublereal *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dhgeqz.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dhgeqz.c
index 52dcc4dc3d17d19c93b16943dba4051f8fe2b8ec..ff9d84154ef2ea1eef6316a0f155025f0c4a26c4 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dhgeqz.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dhgeqz.c
@@ -63,7 +63,7 @@ static integer c__3 = 3;
doublereal *, doublereal *, doublereal *, doublereal *,
doublereal *);
doublereal temp2, s1inv, scale;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
integer iiter, ilast, jiter;
doublereal anorm, bnorm;
integer maxit;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlacpy.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlacpy.c
index 8d68e7635d99b3b86df5914a712cd2b1c31392fe..d817d456a43cb00f5075530d3238d3e481ab518d 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlacpy.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlacpy.c
@@ -24,7 +24,7 @@ extern "C" {
/* Local variables */
integer i__, j;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
(void)uplo_len;
/* -- LAPACK auxiliary routine (version 3.0) -- */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.P
new file mode 100644
index 0000000000000000000000000000000000000000..6023b2d811079251a95ba09b6c0b28ce591b2909
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.P
@@ -0,0 +1 @@
+extern int dlae2_(doublereal *a, doublereal *b, doublereal *c__, doublereal *rt1, doublereal *rt2);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.c
new file mode 100644
index 0000000000000000000000000000000000000000..b0fa157bcafb7329fff5fd4e09c436cf5eac7893
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.c
@@ -0,0 +1,192 @@
+/* lapack/double/dlae2.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< SUBROUTINE DLAE2( A, B, C, RT1, RT2 ) >*/
+/* Subroutine */ int dlae2_(doublereal *a, doublereal *b, doublereal *c__,
+ doublereal *rt1, doublereal *rt2)
+{
+ /* System generated locals */
+ doublereal d__1;
+
+ /* Builtin functions */
+ double sqrt(doublereal);
+
+ /* Local variables */
+ doublereal ab, df, tb, sm, rt, adf, acmn, acmx;
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< DOUBLE PRECISION A, B, C, RT1, RT2 >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* DLAE2 computes the eigenvalues of a 2-by-2 symmetric matrix */
+/* [ A B ] */
+/* [ B C ]. */
+/* On return, RT1 is the eigenvalue of larger absolute value, and RT2 */
+/* is the eigenvalue of smaller absolute value. */
+
+/* Arguments */
+/* ========= */
+
+/* A (input) DOUBLE PRECISION */
+/* The (1,1) element of the 2-by-2 matrix. */
+
+/* B (input) DOUBLE PRECISION */
+/* The (1,2) and (2,1) elements of the 2-by-2 matrix. */
+
+/* C (input) DOUBLE PRECISION */
+/* The (2,2) element of the 2-by-2 matrix. */
+
+/* RT1 (output) DOUBLE PRECISION */
+/* The eigenvalue of larger absolute value. */
+
+/* RT2 (output) DOUBLE PRECISION */
+/* The eigenvalue of smaller absolute value. */
+
+/* Further Details */
+/* =============== */
+
+/* RT1 is accurate to a few ulps barring over/underflow. */
+
+/* RT2 may be inaccurate if there is massive cancellation in the */
+/* determinant A*C-B*B; higher precision or correctly rounded or */
+/* correctly truncated arithmetic would be needed to compute RT2 */
+/* accurately in all cases. */
+
+/* Overflow is possible only if RT1 is within a factor of 5 of overflow. */
+/* Underflow is harmless if the input data is 0 or exceeds */
+/* underflow_threshold / macheps. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ONE >*/
+/*< PARAMETER ( ONE = 1.0D0 ) >*/
+/*< DOUBLE PRECISION TWO >*/
+/*< PARAMETER ( TWO = 2.0D0 ) >*/
+/*< DOUBLE PRECISION ZERO >*/
+/*< PARAMETER ( ZERO = 0.0D0 ) >*/
+/*< DOUBLE PRECISION HALF >*/
+/*< PARAMETER ( HALF = 0.5D0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< DOUBLE PRECISION AB, ACMN, ACMX, ADF, DF, RT, SM, TB >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, SQRT >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Compute the eigenvalues */
+
+/*< SM = A + C >*/
+ sm = *a + *c__;
+/*< DF = A - C >*/
+ df = *a - *c__;
+/*< ADF = ABS( DF ) >*/
+ adf = abs(df);
+/*< TB = B + B >*/
+ tb = *b + *b;
+/*< AB = ABS( TB ) >*/
+ ab = abs(tb);
+/*< IF( ABS( A ).GT.ABS( C ) ) THEN >*/
+ if (abs(*a) > abs(*c__)) {
+/*< ACMX = A >*/
+ acmx = *a;
+/*< ACMN = C >*/
+ acmn = *c__;
+/*< ELSE >*/
+ } else {
+/*< ACMX = C >*/
+ acmx = *c__;
+/*< ACMN = A >*/
+ acmn = *a;
+/*< END IF >*/
+ }
+/*< IF( ADF.GT.AB ) THEN >*/
+ if (adf > ab) {
+/*< RT = ADF*SQRT( ONE+( AB / ADF )**2 ) >*/
+/* Computing 2nd power */
+ d__1 = ab / adf;
+ rt = adf * sqrt(d__1 * d__1 + 1.);
+/*< ELSE IF( ADF.LT.AB ) THEN >*/
+ } else if (adf < ab) {
+/*< RT = AB*SQRT( ONE+( ADF / AB )**2 ) >*/
+/* Computing 2nd power */
+ d__1 = adf / ab;
+ rt = ab * sqrt(d__1 * d__1 + 1.);
+/*< ELSE >*/
+ } else {
+
+/* Includes case AB=ADF=0 */
+
+/*< RT = AB*SQRT( TWO ) >*/
+ rt = ab * sqrt(2.);
+/*< END IF >*/
+ }
+/*< IF( SM.LT.ZERO ) THEN >*/
+ if (sm < 0.) {
+/*< RT1 = HALF*( SM-RT ) >*/
+ *rt1 = (sm - rt) * .5;
+
+/* Order of execution important. */
+/* To get fully accurate smaller eigenvalue, */
+/* next line needs to be executed in higher precision. */
+
+/*< RT2 = ( ACMX / RT1 )*ACMN - ( B / RT1 )*B >*/
+ *rt2 = acmx / *rt1 * acmn - *b / *rt1 * *b;
+/*< ELSE IF( SM.GT.ZERO ) THEN >*/
+ } else if (sm > 0.) {
+/*< RT1 = HALF*( SM+RT ) >*/
+ *rt1 = (sm + rt) * .5;
+
+/* Order of execution important. */
+/* To get fully accurate smaller eigenvalue, */
+/* next line needs to be executed in higher precision. */
+
+/*< RT2 = ( ACMX / RT1 )*ACMN - ( B / RT1 )*B >*/
+ *rt2 = acmx / *rt1 * acmn - *b / *rt1 * *b;
+/*< ELSE >*/
+ } else {
+
+/* Includes case RT1 = RT2 = 0 */
+
+/*< RT1 = HALF*RT >*/
+ *rt1 = rt * .5;
+/*< RT2 = -HALF*RT >*/
+ *rt2 = rt * -.5;
+/*< END IF >*/
+ }
+/*< RETURN >*/
+ return 0;
+
+/* End of DLAE2 */
+
+/*< END >*/
+} /* dlae2_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.f
new file mode 100644
index 0000000000000000000000000000000000000000..a1e475191ea5f2723c2328801a366aded944eccf
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.f
@@ -0,0 +1,124 @@
+ SUBROUTINE DLAE2( A, B, C, RT1, RT2 )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ DOUBLE PRECISION A, B, C, RT1, RT2
+* ..
+*
+* Purpose
+* =======
+*
+* DLAE2 computes the eigenvalues of a 2-by-2 symmetric matrix
+* [ A B ]
+* [ B C ].
+* On return, RT1 is the eigenvalue of larger absolute value, and RT2
+* is the eigenvalue of smaller absolute value.
+*
+* Arguments
+* =========
+*
+* A (input) DOUBLE PRECISION
+* The (1,1) element of the 2-by-2 matrix.
+*
+* B (input) DOUBLE PRECISION
+* The (1,2) and (2,1) elements of the 2-by-2 matrix.
+*
+* C (input) DOUBLE PRECISION
+* The (2,2) element of the 2-by-2 matrix.
+*
+* RT1 (output) DOUBLE PRECISION
+* The eigenvalue of larger absolute value.
+*
+* RT2 (output) DOUBLE PRECISION
+* The eigenvalue of smaller absolute value.
+*
+* Further Details
+* ===============
+*
+* RT1 is accurate to a few ulps barring over/underflow.
+*
+* RT2 may be inaccurate if there is massive cancellation in the
+* determinant A*C-B*B; higher precision or correctly rounded or
+* correctly truncated arithmetic would be needed to compute RT2
+* accurately in all cases.
+*
+* Overflow is possible only if RT1 is within a factor of 5 of overflow.
+* Underflow is harmless if the input data is 0 or exceeds
+* underflow_threshold / macheps.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ONE
+ PARAMETER ( ONE = 1.0D0 )
+ DOUBLE PRECISION TWO
+ PARAMETER ( TWO = 2.0D0 )
+ DOUBLE PRECISION ZERO
+ PARAMETER ( ZERO = 0.0D0 )
+ DOUBLE PRECISION HALF
+ PARAMETER ( HALF = 0.5D0 )
+* ..
+* .. Local Scalars ..
+ DOUBLE PRECISION AB, ACMN, ACMX, ADF, DF, RT, SM, TB
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, SQRT
+* ..
+* .. Executable Statements ..
+*
+* Compute the eigenvalues
+*
+ SM = A + C
+ DF = A - C
+ ADF = ABS( DF )
+ TB = B + B
+ AB = ABS( TB )
+ IF( ABS( A ).GT.ABS( C ) ) THEN
+ ACMX = A
+ ACMN = C
+ ELSE
+ ACMX = C
+ ACMN = A
+ END IF
+ IF( ADF.GT.AB ) THEN
+ RT = ADF*SQRT( ONE+( AB / ADF )**2 )
+ ELSE IF( ADF.LT.AB ) THEN
+ RT = AB*SQRT( ONE+( ADF / AB )**2 )
+ ELSE
+*
+* Includes case AB=ADF=0
+*
+ RT = AB*SQRT( TWO )
+ END IF
+ IF( SM.LT.ZERO ) THEN
+ RT1 = HALF*( SM-RT )
+*
+* Order of execution important.
+* To get fully accurate smaller eigenvalue,
+* next line needs to be executed in higher precision.
+*
+ RT2 = ( ACMX / RT1 )*ACMN - ( B / RT1 )*B
+ ELSE IF( SM.GT.ZERO ) THEN
+ RT1 = HALF*( SM+RT )
+*
+* Order of execution important.
+* To get fully accurate smaller eigenvalue,
+* next line needs to be executed in higher precision.
+*
+ RT2 = ( ACMX / RT1 )*ACMN - ( B / RT1 )*B
+ ELSE
+*
+* Includes case RT1 = RT2 = 0
+*
+ RT1 = HALF*RT
+ RT2 = -HALF*RT
+ END IF
+ RETURN
+*
+* End of DLAE2
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.h
new file mode 100644
index 0000000000000000000000000000000000000000..369216493a495cb703f7cc1b1d67531a68dd612d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlae2.h
@@ -0,0 +1,7 @@
+extern int v3p_netlib_dlae2_(
+ v3p_netlib_doublereal *a,
+ v3p_netlib_doublereal *b,
+ v3p_netlib_doublereal *c__,
+ v3p_netlib_doublereal *rt1,
+ v3p_netlib_doublereal *rt2
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlange.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlange.c
index ba60220f25af1414be1f8b82a593b07e5cdcf5ef..ace10fb7369097d65b4e988a86c465099213c224 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlange.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlange.c
@@ -33,7 +33,7 @@ doublereal dlange_(char *norm, integer *m, integer *n, doublereal *a, integer
/* Local variables */
integer i__, j;
doublereal sum, scale;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
doublereal value=0;
extern /* Subroutine */ int dlassq_(integer *, doublereal *, integer *,
doublereal *, doublereal *);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanhs.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanhs.c
index e3c669999258c440aeae3bdd6079e51417a75422..ad9d8422b1565f54b49ed7b697f1f14cb6ca854f 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanhs.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanhs.c
@@ -33,7 +33,7 @@ doublereal dlanhs_(char *norm, integer *n, doublereal *a, integer *lda,
/* Local variables */
integer i__, j;
doublereal sum, scale;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
doublereal value=0;
extern /* Subroutine */ int dlassq_(integer *, doublereal *, integer *,
doublereal *, doublereal *);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.P
new file mode 100644
index 0000000000000000000000000000000000000000..3cb5b04c1a293e7cc4c0464da3dae09820f25ada
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.P
@@ -0,0 +1,3 @@
+extern doublereal dlanst_(char *norm, integer *n, doublereal *d__, doublereal *e, ftnlen norm_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: dlassq_ 14 5 4 7 4 7 7 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.c
new file mode 100644
index 0000000000000000000000000000000000000000..81f2679e7594d90cd9f3b947eec68d624d52a8d3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.c
@@ -0,0 +1,217 @@
+/* lapack/double/dlanst.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static integer c__1 = 1;
+
+/*< DOUBLE PRECISION FUNCTION DLANST( NORM, N, D, E ) >*/
+doublereal dlanst_(char *norm, integer *n, doublereal *d__, doublereal *e,
+ ftnlen norm_len)
+{
+ /* System generated locals */
+ integer i__1;
+ doublereal ret_val, d__1, d__2, d__3, d__4, d__5;
+
+ /* Builtin functions */
+ double sqrt(doublereal);
+
+ /* Local variables */
+ integer i__;
+ doublereal sum, scale;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ doublereal anorm;
+ extern /* Subroutine */ int dlassq_(integer *, doublereal *, integer *,
+ doublereal *, doublereal *);
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER NORM >*/
+/*< INTEGER N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< DOUBLE PRECISION D( * ), E( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* DLANST returns the value of the one norm, or the Frobenius norm, or */
+/* the infinity norm, or the element of largest absolute value of a */
+/* real symmetric tridiagonal matrix A. */
+
+/* Description */
+/* =========== */
+
+/* DLANST returns the value */
+
+/* DLANST = ( max(abs(A(i,j))), NORM = 'M' or 'm' */
+/* ( */
+/* ( norm1(A), NORM = '1', 'O' or 'o' */
+/* ( */
+/* ( normI(A), NORM = 'I' or 'i' */
+/* ( */
+/* ( normF(A), NORM = 'F', 'f', 'E' or 'e' */
+
+/* where norm1 denotes the one norm of a matrix (maximum column sum), */
+/* normI denotes the infinity norm of a matrix (maximum row sum) and */
+/* normF denotes the Frobenius norm of a matrix (square root of sum of */
+/* squares). Note that max(abs(A(i,j))) is not a consistent matrix norm. */
+
+/* Arguments */
+/* ========= */
+
+/* NORM (input) CHARACTER*1 */
+/* Specifies the value to be returned in DLANST as described */
+/* above. */
+
+/* N (input) INTEGER */
+/* The order of the matrix A. N >= 0. When N = 0, DLANST is */
+/* set to zero. */
+
+/* D (input) DOUBLE PRECISION array, dimension (N) */
+/* The diagonal elements of A. */
+
+/* E (input) DOUBLE PRECISION array, dimension (N-1) */
+/* The (n-1) sub-diagonal or super-diagonal elements of A. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ONE, ZERO >*/
+/*< PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< INTEGER I >*/
+/*< DOUBLE PRECISION ANORM, SCALE, SUM >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< EXTERNAL LSAME >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL DLASSQ >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, MAX, SQRT >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/*< IF( N.LE.0 ) THEN >*/
+ /* Parameter adjustments */
+ --e;
+ --d__;
+
+ /* Function Body */
+ if (*n <= 0) {
+/*< ANORM = ZERO >*/
+ anorm = 0.;
+/*< ELSE IF( LSAME( NORM, 'M' ) ) THEN >*/
+ } else if (lsame_(norm, "M", (ftnlen)1, (ftnlen)1)) {
+
+/* Find max(abs(A(i,j))). */
+
+/*< ANORM = ABS( D( N ) ) >*/
+ anorm = (d__1 = d__[*n], abs(d__1));
+/*< DO 10 I = 1, N - 1 >*/
+ i__1 = *n - 1;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< ANORM = MAX( ANORM, ABS( D( I ) ) ) >*/
+/* Computing MAX */
+ d__2 = anorm, d__3 = (d__1 = d__[i__], abs(d__1));
+ anorm = max(d__2,d__3);
+/*< ANORM = MAX( ANORM, ABS( E( I ) ) ) >*/
+/* Computing MAX */
+ d__2 = anorm, d__3 = (d__1 = e[i__], abs(d__1));
+ anorm = max(d__2,d__3);
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< >*/
+ } else if (lsame_(norm, "O", (ftnlen)1, (ftnlen)1) || *(unsigned char *)
+ norm == '1' || lsame_(norm, "I", (ftnlen)1, (ftnlen)1)) {
+
+/* Find norm1(A). */
+
+/*< IF( N.EQ.1 ) THEN >*/
+ if (*n == 1) {
+/*< ANORM = ABS( D( 1 ) ) >*/
+ anorm = abs(d__[1]);
+/*< ELSE >*/
+ } else {
+/*< >*/
+/* Computing MAX */
+ d__3 = abs(d__[1]) + abs(e[1]), d__4 = (d__1 = e[*n - 1], abs(
+ d__1)) + (d__2 = d__[*n], abs(d__2));
+ anorm = max(d__3,d__4);
+/*< DO 20 I = 2, N - 1 >*/
+ i__1 = *n - 1;
+ for (i__ = 2; i__ <= i__1; ++i__) {
+/*< >*/
+/* Computing MAX */
+ d__4 = anorm, d__5 = (d__1 = d__[i__], abs(d__1)) + (d__2 = e[
+ i__], abs(d__2)) + (d__3 = e[i__ - 1], abs(d__3));
+ anorm = max(d__4,d__5);
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< END IF >*/
+ }
+/*< ELSE IF( ( LSAME( NORM, 'F' ) ) .OR. ( LSAME( NORM, 'E' ) ) ) THEN >*/
+ } else if (lsame_(norm, "F", (ftnlen)1, (ftnlen)1) || lsame_(norm, "E", (
+ ftnlen)1, (ftnlen)1)) {
+
+/* Find normF(A). */
+
+/*< SCALE = ZERO >*/
+ scale = 0.;
+/*< SUM = ONE >*/
+ sum = 1.;
+/*< IF( N.GT.1 ) THEN >*/
+ if (*n > 1) {
+/*< CALL DLASSQ( N-1, E, 1, SCALE, SUM ) >*/
+ i__1 = *n - 1;
+ dlassq_(&i__1, &e[1], &c__1, &scale, &sum);
+/*< SUM = 2*SUM >*/
+ sum *= 2;
+/*< END IF >*/
+ }
+/*< CALL DLASSQ( N, D, 1, SCALE, SUM ) >*/
+ dlassq_(n, &d__[1], &c__1, &scale, &sum);
+/*< ANORM = SCALE*SQRT( SUM ) >*/
+ anorm = scale * sqrt(sum);
+/*< END IF >*/
+ }
+
+/*< DLANST = ANORM >*/
+ ret_val = anorm;
+/*< RETURN >*/
+ return ret_val;
+
+/* End of DLANST */
+
+/*< END >*/
+} /* dlanst_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.f
new file mode 100644
index 0000000000000000000000000000000000000000..b5acf1dae791f26fda6decfd88202741cc0cfb03
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.f
@@ -0,0 +1,125 @@
+ DOUBLE PRECISION FUNCTION DLANST( NORM, N, D, E )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER NORM
+ INTEGER N
+* ..
+* .. Array Arguments ..
+ DOUBLE PRECISION D( * ), E( * )
+* ..
+*
+* Purpose
+* =======
+*
+* DLANST returns the value of the one norm, or the Frobenius norm, or
+* the infinity norm, or the element of largest absolute value of a
+* real symmetric tridiagonal matrix A.
+*
+* Description
+* ===========
+*
+* DLANST returns the value
+*
+* DLANST = ( max(abs(A(i,j))), NORM = 'M' or 'm'
+* (
+* ( norm1(A), NORM = '1', 'O' or 'o'
+* (
+* ( normI(A), NORM = 'I' or 'i'
+* (
+* ( normF(A), NORM = 'F', 'f', 'E' or 'e'
+*
+* where norm1 denotes the one norm of a matrix (maximum column sum),
+* normI denotes the infinity norm of a matrix (maximum row sum) and
+* normF denotes the Frobenius norm of a matrix (square root of sum of
+* squares). Note that max(abs(A(i,j))) is not a consistent matrix norm.
+*
+* Arguments
+* =========
+*
+* NORM (input) CHARACTER*1
+* Specifies the value to be returned in DLANST as described
+* above.
+*
+* N (input) INTEGER
+* The order of the matrix A. N >= 0. When N = 0, DLANST is
+* set to zero.
+*
+* D (input) DOUBLE PRECISION array, dimension (N)
+* The diagonal elements of A.
+*
+* E (input) DOUBLE PRECISION array, dimension (N-1)
+* The (n-1) sub-diagonal or super-diagonal elements of A.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ONE, ZERO
+ PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 )
+* ..
+* .. Local Scalars ..
+ INTEGER I
+ DOUBLE PRECISION ANORM, SCALE, SUM
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ EXTERNAL LSAME
+* ..
+* .. External Subroutines ..
+ EXTERNAL DLASSQ
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, MAX, SQRT
+* ..
+* .. Executable Statements ..
+*
+ IF( N.LE.0 ) THEN
+ ANORM = ZERO
+ ELSE IF( LSAME( NORM, 'M' ) ) THEN
+*
+* Find max(abs(A(i,j))).
+*
+ ANORM = ABS( D( N ) )
+ DO 10 I = 1, N - 1
+ ANORM = MAX( ANORM, ABS( D( I ) ) )
+ ANORM = MAX( ANORM, ABS( E( I ) ) )
+ 10 CONTINUE
+ ELSE IF( LSAME( NORM, 'O' ) .OR. NORM.EQ.'1' .OR.
+ $ LSAME( NORM, 'I' ) ) THEN
+*
+* Find norm1(A).
+*
+ IF( N.EQ.1 ) THEN
+ ANORM = ABS( D( 1 ) )
+ ELSE
+ ANORM = MAX( ABS( D( 1 ) )+ABS( E( 1 ) ),
+ $ ABS( E( N-1 ) )+ABS( D( N ) ) )
+ DO 20 I = 2, N - 1
+ ANORM = MAX( ANORM, ABS( D( I ) )+ABS( E( I ) )+
+ $ ABS( E( I-1 ) ) )
+ 20 CONTINUE
+ END IF
+ ELSE IF( ( LSAME( NORM, 'F' ) ) .OR. ( LSAME( NORM, 'E' ) ) ) THEN
+*
+* Find normF(A).
+*
+ SCALE = ZERO
+ SUM = ONE
+ IF( N.GT.1 ) THEN
+ CALL DLASSQ( N-1, E, 1, SCALE, SUM )
+ SUM = 2*SUM
+ END IF
+ CALL DLASSQ( N, D, 1, SCALE, SUM )
+ ANORM = SCALE*SQRT( SUM )
+ END IF
+*
+ DLANST = ANORM
+ RETURN
+*
+* End of DLANST
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.h
new file mode 100644
index 0000000000000000000000000000000000000000..adc75bdc03ae311e92f5fb339e3533427b0517d2
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlanst.h
@@ -0,0 +1,7 @@
+extern v3p_netlib_doublereal v3p_netlib_dlanst_(
+ char *norm,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *d__,
+ v3p_netlib_doublereal *e,
+ v3p_netlib_ftnlen norm_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarf.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarf.c
index 9ab79ad5fa2e998c990a05e0ac59773f41f951f9..7300e8a8a89c122568b429c82acf968c03e7f267 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarf.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarf.c
@@ -34,7 +34,7 @@ static integer c__1 = 1;
extern /* Subroutine */ int dger_(integer *, integer *, doublereal *,
doublereal *, integer *, doublereal *, integer *, doublereal *,
integer *);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int dgemv_(char *, integer *, integer *,
doublereal *, doublereal *, integer *, doublereal *, integer *,
doublereal *, doublereal *, integer *, ftnlen);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarfb.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarfb.c
index 5e915013d7313bff8c731f26f7186bd5b38c0c7a..a1529a75e63b5ba2f76dfe0052462b0a97d165c2 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarfb.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarfb.c
@@ -37,7 +37,7 @@ static doublereal c_b25 = -1.;
extern /* Subroutine */ int dgemm_(char *, char *, integer *, integer *,
integer *, doublereal *, doublereal *, integer *, doublereal *,
integer *, doublereal *, doublereal *, integer *, ftnlen, ftnlen);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
doublereal *, integer *), dtrmm_(char *, char *, char *, char *,
integer *, integer *, doublereal *, doublereal *, integer *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarft.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarft.c
index 247d6b1945f419b5b686b77b7e99ce167c822099..a767ed47566b3d8f723283a445f173b698f21b34 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarft.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarft.c
@@ -32,7 +32,7 @@ static doublereal c_b8 = 0.;
/* Local variables */
integer i__, j;
doublereal vii;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int dgemv_(char *, integer *, integer *,
doublereal *, doublereal *, integer *, doublereal *, integer *,
doublereal *, doublereal *, integer *, ftnlen), dtrmv_(char *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.P
new file mode 100644
index 0000000000000000000000000000000000000000..54f29e3711afa411bac9a5839da541c656f35f6d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.P
@@ -0,0 +1,2 @@
+extern int dlarnv_(integer *idist, integer *iseed, integer *n, doublereal *x);
+/*:ref: dlaruv_ 14 3 4 4 7 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.c
new file mode 100644
index 0000000000000000000000000000000000000000..b611383243b4d7e29351105271dc0e79679b364d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.c
@@ -0,0 +1,191 @@
+/* lapack/double/dlarnv.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< SUBROUTINE DLARNV( IDIST, ISEED, N, X ) >*/
+/* Subroutine */ int dlarnv_(integer *idist, integer *iseed, integer *n,
+ doublereal *x)
+{
+ /* System generated locals */
+ integer i__1, i__2, i__3;
+
+ /* Builtin functions */
+ double log(doublereal), sqrt(doublereal), cos(doublereal);
+
+ /* Local variables */
+ integer i__;
+ doublereal u[128];
+ integer il, iv, il2;
+ extern /* Subroutine */ int dlaruv_(integer *, integer *, doublereal *);
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER IDIST, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< INTEGER ISEED( 4 ) >*/
+/*< DOUBLE PRECISION X( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* DLARNV returns a vector of n random real numbers from a uniform or */
+/* normal distribution. */
+
+/* Arguments */
+/* ========= */
+
+/* IDIST (input) INTEGER */
+/* Specifies the distribution of the random numbers: */
+/* = 1: uniform (0,1) */
+/* = 2: uniform (-1,1) */
+/* = 3: normal (0,1) */
+
+/* ISEED (input/output) INTEGER array, dimension (4) */
+/* On entry, the seed of the random number generator; the array */
+/* elements must be between 0 and 4095, and ISEED(4) must be */
+/* odd. */
+/* On exit, the seed is updated. */
+
+/* N (input) INTEGER */
+/* The number of random numbers to be generated. */
+
+/* X (output) DOUBLE PRECISION array, dimension (N) */
+/* The generated random numbers. */
+
+/* Further Details */
+/* =============== */
+
+/* This routine calls the auxiliary routine DLARUV to generate random */
+/* real numbers from a uniform (0,1) distribution, in batches of up to */
+/* 128 using vectorisable code. The Box-Muller method is used to */
+/* transform numbers from a uniform to a normal distribution. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ONE, TWO >*/
+/*< PARAMETER ( ONE = 1.0D+0, TWO = 2.0D+0 ) >*/
+/*< INTEGER LV >*/
+/*< PARAMETER ( LV = 128 ) >*/
+/*< DOUBLE PRECISION TWOPI >*/
+/*< PARAMETER ( TWOPI = 6.2831853071795864769252867663D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< INTEGER I, IL, IL2, IV >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< DOUBLE PRECISION U( LV ) >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC COS, LOG, MIN, SQRT >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL DLARUV >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/*< DO 40 IV = 1, N, LV / 2 >*/
+ /* Parameter adjustments */
+ --x;
+ --iseed;
+
+ /* Function Body */
+ i__1 = *n;
+ for (iv = 1; iv <= i__1; iv += 64) {
+/*< IL = MIN( LV / 2, N-IV+1 ) >*/
+/* Computing MIN */
+ i__2 = 64, i__3 = *n - iv + 1;
+ il = min(i__2,i__3);
+/*< IF( IDIST.EQ.3 ) THEN >*/
+ if (*idist == 3) {
+/*< IL2 = 2*IL >*/
+ il2 = il << 1;
+/*< ELSE >*/
+ } else {
+/*< IL2 = IL >*/
+ il2 = il;
+/*< END IF >*/
+ }
+
+/* Call DLARUV to generate IL2 numbers from a uniform (0,1) */
+/* distribution (IL2 <= LV) */
+
+/*< CALL DLARUV( ISEED, IL2, U ) >*/
+ dlaruv_(&iseed[1], &il2, u);
+
+/*< IF( IDIST.EQ.1 ) THEN >*/
+ if (*idist == 1) {
+
+/* Copy generated numbers */
+
+/*< DO 10 I = 1, IL >*/
+ i__2 = il;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< X( IV+I-1 ) = U( I ) >*/
+ x[iv + i__ - 1] = u[i__ - 1];
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< ELSE IF( IDIST.EQ.2 ) THEN >*/
+ } else if (*idist == 2) {
+
+/* Convert generated numbers to uniform (-1,1) distribution */
+
+/*< DO 20 I = 1, IL >*/
+ i__2 = il;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< X( IV+I-1 ) = TWO*U( I ) - ONE >*/
+ x[iv + i__ - 1] = u[i__ - 1] * 2. - 1.;
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< ELSE IF( IDIST.EQ.3 ) THEN >*/
+ } else if (*idist == 3) {
+
+/* Convert generated numbers to normal (0,1) distribution */
+
+/*< DO 30 I = 1, IL >*/
+ i__2 = il;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< >*/
+ x[iv + i__ - 1] = sqrt(log(u[(i__ << 1) - 2]) * -2.) * cos(u[(
+ i__ << 1) - 1] * 6.2831853071795864769252867663);
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< END IF >*/
+ }
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+/*< RETURN >*/
+ return 0;
+
+/* End of DLARNV */
+
+/*< END >*/
+} /* dlarnv_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.f
new file mode 100644
index 0000000000000000000000000000000000000000..c8b421c22956608e92098074d5b712ae2bf19b8f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.f
@@ -0,0 +1,116 @@
+ SUBROUTINE DLARNV( IDIST, ISEED, N, X )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER IDIST, N
+* ..
+* .. Array Arguments ..
+ INTEGER ISEED( 4 )
+ DOUBLE PRECISION X( * )
+* ..
+*
+* Purpose
+* =======
+*
+* DLARNV returns a vector of n random real numbers from a uniform or
+* normal distribution.
+*
+* Arguments
+* =========
+*
+* IDIST (input) INTEGER
+* Specifies the distribution of the random numbers:
+* = 1: uniform (0,1)
+* = 2: uniform (-1,1)
+* = 3: normal (0,1)
+*
+* ISEED (input/output) INTEGER array, dimension (4)
+* On entry, the seed of the random number generator; the array
+* elements must be between 0 and 4095, and ISEED(4) must be
+* odd.
+* On exit, the seed is updated.
+*
+* N (input) INTEGER
+* The number of random numbers to be generated.
+*
+* X (output) DOUBLE PRECISION array, dimension (N)
+* The generated random numbers.
+*
+* Further Details
+* ===============
+*
+* This routine calls the auxiliary routine DLARUV to generate random
+* real numbers from a uniform (0,1) distribution, in batches of up to
+* 128 using vectorisable code. The Box-Muller method is used to
+* transform numbers from a uniform to a normal distribution.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ONE, TWO
+ PARAMETER ( ONE = 1.0D+0, TWO = 2.0D+0 )
+ INTEGER LV
+ PARAMETER ( LV = 128 )
+ DOUBLE PRECISION TWOPI
+ PARAMETER ( TWOPI = 6.2831853071795864769252867663D+0 )
+* ..
+* .. Local Scalars ..
+ INTEGER I, IL, IL2, IV
+* ..
+* .. Local Arrays ..
+ DOUBLE PRECISION U( LV )
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC COS, LOG, MIN, SQRT
+* ..
+* .. External Subroutines ..
+ EXTERNAL DLARUV
+* ..
+* .. Executable Statements ..
+*
+ DO 40 IV = 1, N, LV / 2
+ IL = MIN( LV / 2, N-IV+1 )
+ IF( IDIST.EQ.3 ) THEN
+ IL2 = 2*IL
+ ELSE
+ IL2 = IL
+ END IF
+*
+* Call DLARUV to generate IL2 numbers from a uniform (0,1)
+* distribution (IL2 <= LV)
+*
+ CALL DLARUV( ISEED, IL2, U )
+*
+ IF( IDIST.EQ.1 ) THEN
+*
+* Copy generated numbers
+*
+ DO 10 I = 1, IL
+ X( IV+I-1 ) = U( I )
+ 10 CONTINUE
+ ELSE IF( IDIST.EQ.2 ) THEN
+*
+* Convert generated numbers to uniform (-1,1) distribution
+*
+ DO 20 I = 1, IL
+ X( IV+I-1 ) = TWO*U( I ) - ONE
+ 20 CONTINUE
+ ELSE IF( IDIST.EQ.3 ) THEN
+*
+* Convert generated numbers to normal (0,1) distribution
+*
+ DO 30 I = 1, IL
+ X( IV+I-1 ) = SQRT( -TWO*LOG( U( 2*I-1 ) ) )*
+ $ COS( TWOPI*U( 2*I ) )
+ 30 CONTINUE
+ END IF
+ 40 CONTINUE
+ RETURN
+*
+* End of DLARNV
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.h
new file mode 100644
index 0000000000000000000000000000000000000000..a615bb9d7e38e309bf51b841974ff82a0533e120
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlarnv.h
@@ -0,0 +1,6 @@
+extern int v3p_netlib_dlarnv_(
+ v3p_netlib_integer *idist,
+ v3p_netlib_integer *iseed,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *x
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.P
new file mode 100644
index 0000000000000000000000000000000000000000..252b25e91f5058fb0d2101fdfc0c2e0e8b540808
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.P
@@ -0,0 +1 @@
+extern int dlaruv_(integer *iseed, integer *n, doublereal *x);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.c
new file mode 100644
index 0000000000000000000000000000000000000000..19fa88ec6207b901b177bd3f1a1619ccc10f156e
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.c
@@ -0,0 +1,371 @@
+/* lapack/double/dlaruv.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< SUBROUTINE DLARUV( ISEED, N, X ) >*/
+/* Subroutine */ int dlaruv_(integer *iseed, integer *n, doublereal *x)
+{
+ /* Initialized data */
+
+ static integer mm[512] /* was [128][4] */ = { 494,2637,255,2008,1253,
+ 3344,4084,1739,3143,3468,688,1657,1238,3166,1292,3422,1270,2016,
+ 154,2862,697,1706,491,931,1444,444,3577,3944,2184,1661,3482,657,
+ 3023,3618,1267,1828,164,3798,3087,2400,2870,3876,1905,1593,1797,
+ 1234,3460,328,2861,1950,617,2070,3331,769,1558,2412,2800,189,287,
+ 2045,1227,2838,209,2770,3654,3993,192,2253,3491,2889,2857,2094,
+ 1818,688,1407,634,3231,815,3524,1914,516,164,303,2144,3480,119,
+ 3357,837,2826,2332,2089,3780,1700,3712,150,2000,3375,1621,3090,
+ 3765,1149,3146,33,3082,2741,359,3316,1749,185,2784,2202,2199,1364,
+ 1244,2020,3160,2785,2772,1217,1822,1245,2252,3904,2774,997,2573,
+ 1148,545,322,789,1440,752,2859,123,1848,643,2405,2638,2344,46,
+ 3814,913,3649,339,3808,822,2832,3078,3633,2970,637,2249,2081,4019,
+ 1478,242,481,2075,4058,622,3376,812,234,641,4005,1122,3135,2640,
+ 2302,40,1832,2247,2034,2637,1287,1691,496,1597,2394,2584,1843,336,
+ 1472,2407,433,2096,1761,2810,566,442,41,1238,1086,603,840,3168,
+ 1499,1084,3438,2408,1589,2391,288,26,512,1456,171,1677,2657,2270,
+ 2587,2961,1970,1817,676,1410,3723,2803,3185,184,663,499,3784,1631,
+ 1925,3912,1398,1349,1441,2224,2411,1907,3192,2786,382,37,759,2948,
+ 1862,3802,2423,2051,2295,1332,1832,2405,3638,3661,327,3660,716,
+ 1842,3987,1368,1848,2366,2508,3754,1766,3572,2893,307,1297,3966,
+ 758,2598,3406,2922,1038,2934,2091,2451,1580,1958,2055,1507,1078,
+ 3273,17,854,2916,3971,2889,3831,2621,1541,893,736,3992,787,2125,
+ 2364,2460,257,1574,3912,1216,3248,3401,2124,2762,149,2245,166,466,
+ 4018,1399,190,2879,153,2320,18,712,2159,2318,2091,3443,1510,449,
+ 1956,2201,3137,3399,1321,2271,3667,2703,629,2365,2431,1113,3922,
+ 2554,184,2099,3228,4012,1921,3452,3901,572,3309,3171,817,3039,
+ 1696,1256,3715,2077,3019,1497,1101,717,51,981,1978,1813,3881,76,
+ 3846,3694,1682,124,1660,3997,479,1141,886,3514,1301,3604,1888,
+ 1836,1990,2058,692,1194,20,3285,2046,2107,3508,3525,3801,2549,
+ 1145,2253,305,3301,1065,3133,2913,3285,1241,1197,3729,2501,1673,
+ 541,2753,949,2361,1165,4081,2725,3305,3069,3617,3733,409,2157,
+ 1361,3973,1865,2525,1409,3445,3577,77,3761,2149,1449,3005,225,85,
+ 3673,3117,3089,1349,2057,413,65,1845,697,3085,3441,1573,3689,2941,
+ 929,533,2841,4077,721,2821,2249,2397,2817,245,1913,1997,3121,997,
+ 1833,2877,1633,981,2009,941,2449,197,2441,285,1473,2741,3129,909,
+ 2801,421,4073,2813,2337,1429,1177,1901,81,1669,2633,2269,129,1141,
+ 249,3917,2481,3941,2217,2749,3041,1877,345,2861,1809,3141,2825,
+ 157,2881,3637,1465,2829,2161,3365,361,2685,3745,2325,3609,3821,
+ 3537,517,3017,2141,1537 };
+
+ /* System generated locals */
+ integer i__1;
+
+ /* Local variables */
+ integer i__, i1, i2, i3, i4, it1, it2, it3, it4;
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< INTEGER ISEED( 4 ) >*/
+/*< DOUBLE PRECISION X( N ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* DLARUV returns a vector of n random real numbers from a uniform (0,1) */
+/* distribution (n <= 128). */
+
+/* This is an auxiliary routine called by DLARNV and ZLARNV. */
+
+/* Arguments */
+/* ========= */
+
+/* ISEED (input/output) INTEGER array, dimension (4) */
+/* On entry, the seed of the random number generator; the array */
+/* elements must be between 0 and 4095, and ISEED(4) must be */
+/* odd. */
+/* On exit, the seed is updated. */
+
+/* N (input) INTEGER */
+/* The number of random numbers to be generated. N <= 128. */
+
+/* X (output) DOUBLE PRECISION array, dimension (N) */
+/* The generated random numbers. */
+
+/* Further Details */
+/* =============== */
+
+/* This routine uses a multiplicative congruential method with modulus */
+/* 2**48 and multiplier 33952834046453 (see G.S.Fishman, */
+/* 'Multiplicative congruential random number generators with modulus */
+/* 2**b: an exhaustive analysis for b = 32 and a partial analysis for */
+/* b = 48', Math. Comp. 189, pp 331-344, 1990). */
+
+/* 48-bit integers are stored in 4 integer array elements with 12 bits */
+/* per element. Hence the routine is portable across machines with */
+/* integers of 32 bits or more. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ONE >*/
+/*< PARAMETER ( ONE = 1.0D0 ) >*/
+/*< INTEGER LV, IPW2 >*/
+/*< DOUBLE PRECISION R >*/
+/*< PARAMETER ( LV = 128, IPW2 = 4096, R = ONE / IPW2 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< INTEGER I, I1, I2, I3, I4, IT1, IT2, IT3, IT4, J >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< INTEGER MM( LV, 4 ) >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC DBLE, MIN, MOD >*/
+/* .. */
+/* .. Data statements .. */
+/*< >*/
+ /* Parameter adjustments */
+ --iseed;
+ --x;
+
+ /* Function Body */
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/*< >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/*< I1 = ISEED( 1 ) >*/
+ i1 = iseed[1];
+/*< I2 = ISEED( 2 ) >*/
+ i2 = iseed[2];
+/*< I3 = ISEED( 3 ) >*/
+ i3 = iseed[3];
+/*< I4 = ISEED( 4 ) >*/
+ i4 = iseed[4];
+
+/*< DO 10 I = 1, MIN( N, LV ) >*/
+ i__1 = min(*n,128);
+ for (i__ = 1; i__ <= i__1; ++i__) {
+
+/*< 20 CONTINUE >*/
+L20:
+
+/* Multiply the seed by i-th power of the multiplier modulo 2**48 */
+
+/*< IT4 = I4*MM( I, 4 ) >*/
+ it4 = i4 * mm[i__ + 383];
+/*< IT3 = IT4 / IPW2 >*/
+ it3 = it4 / 4096;
+/*< IT4 = IT4 - IPW2*IT3 >*/
+ it4 -= it3 << 12;
+/*< IT3 = IT3 + I3*MM( I, 4 ) + I4*MM( I, 3 ) >*/
+ it3 = it3 + i3 * mm[i__ + 383] + i4 * mm[i__ + 255];
+/*< IT2 = IT3 / IPW2 >*/
+ it2 = it3 / 4096;
+/*< IT3 = IT3 - IPW2*IT2 >*/
+ it3 -= it2 << 12;
+/*< IT2 = IT2 + I2*MM( I, 4 ) + I3*MM( I, 3 ) + I4*MM( I, 2 ) >*/
+ it2 = it2 + i2 * mm[i__ + 383] + i3 * mm[i__ + 255] + i4 * mm[i__ +
+ 127];
+/*< IT1 = IT2 / IPW2 >*/
+ it1 = it2 / 4096;
+/*< IT2 = IT2 - IPW2*IT1 >*/
+ it2 -= it1 << 12;
+/*< >*/
+ it1 = it1 + i1 * mm[i__ + 383] + i2 * mm[i__ + 255] + i3 * mm[i__ +
+ 127] + i4 * mm[i__ - 1];
+/*< IT1 = MOD( IT1, IPW2 ) >*/
+ it1 %= 4096;
+
+/* Convert 48-bit integer to a real number in the interval (0,1) */
+
+/*< >*/
+ x[i__] = ((doublereal) it1 + ((doublereal) it2 + ((doublereal) it3 + (
+ doublereal) it4 * 2.44140625e-4) * 2.44140625e-4) *
+ 2.44140625e-4) * 2.44140625e-4;
+
+/*< IF (X( I ).EQ.1.0D0) THEN >*/
+ if (x[i__] == 1.) {
+/* If a real number has n bits of precision, and the first */
+/* n bits of the 48-bit integer above happen to be all 1 (which */
+/* will occur about once every 2**n calls), then X( I ) will */
+/* be rounded to exactly 1.0. */
+/* Since X( I ) is not supposed to return exactly 0.0 or 1.0, */
+/* the statistically correct thing to do in this situation is */
+/* simply to iterate again. */
+/* N.B. the case X( I ) = 0.0 should not be possible. */
+/*< I1 = I1 + 2 >*/
+ i1 += 2;
+/*< I2 = I2 + 2 >*/
+ i2 += 2;
+/*< I3 = I3 + 2 >*/
+ i3 += 2;
+/*< I4 = I4 + 2 >*/
+ i4 += 2;
+/*< GOTO 20 >*/
+ goto L20;
+/*< END IF >*/
+ }
+
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+
+/* Return final value of seed */
+
+/*< ISEED( 1 ) = IT1 >*/
+ iseed[1] = it1;
+/*< ISEED( 2 ) = IT2 >*/
+ iseed[2] = it2;
+/*< ISEED( 3 ) = IT3 >*/
+ iseed[3] = it3;
+/*< ISEED( 4 ) = IT4 >*/
+ iseed[4] = it4;
+/*< RETURN >*/
+ return 0;
+
+/* End of DLARUV */
+
+/*< END >*/
+} /* dlaruv_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.f
new file mode 100644
index 0000000000000000000000000000000000000000..65caf9ad90536a29e6dbdb00bb0bcb2012091682
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.f
@@ -0,0 +1,387 @@
+ SUBROUTINE DLARUV( ISEED, N, X )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER N
+* ..
+* .. Array Arguments ..
+ INTEGER ISEED( 4 )
+ DOUBLE PRECISION X( N )
+* ..
+*
+* Purpose
+* =======
+*
+* DLARUV returns a vector of n random real numbers from a uniform (0,1)
+* distribution (n <= 128).
+*
+* This is an auxiliary routine called by DLARNV and ZLARNV.
+*
+* Arguments
+* =========
+*
+* ISEED (input/output) INTEGER array, dimension (4)
+* On entry, the seed of the random number generator; the array
+* elements must be between 0 and 4095, and ISEED(4) must be
+* odd.
+* On exit, the seed is updated.
+*
+* N (input) INTEGER
+* The number of random numbers to be generated. N <= 128.
+*
+* X (output) DOUBLE PRECISION array, dimension (N)
+* The generated random numbers.
+*
+* Further Details
+* ===============
+*
+* This routine uses a multiplicative congruential method with modulus
+* 2**48 and multiplier 33952834046453 (see G.S.Fishman,
+* 'Multiplicative congruential random number generators with modulus
+* 2**b: an exhaustive analysis for b = 32 and a partial analysis for
+* b = 48', Math. Comp. 189, pp 331-344, 1990).
+*
+* 48-bit integers are stored in 4 integer array elements with 12 bits
+* per element. Hence the routine is portable across machines with
+* integers of 32 bits or more.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ONE
+ PARAMETER ( ONE = 1.0D0 )
+ INTEGER LV, IPW2
+ DOUBLE PRECISION R
+ PARAMETER ( LV = 128, IPW2 = 4096, R = ONE / IPW2 )
+* ..
+* .. Local Scalars ..
+ INTEGER I, I1, I2, I3, I4, IT1, IT2, IT3, IT4, J
+* ..
+* .. Local Arrays ..
+ INTEGER MM( LV, 4 )
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC DBLE, MIN, MOD
+* ..
+* .. Data statements ..
+ DATA ( MM( 1, J ), J = 1, 4 ) / 494, 322, 2508,
+ $ 2549 /
+ DATA ( MM( 2, J ), J = 1, 4 ) / 2637, 789, 3754,
+ $ 1145 /
+ DATA ( MM( 3, J ), J = 1, 4 ) / 255, 1440, 1766,
+ $ 2253 /
+ DATA ( MM( 4, J ), J = 1, 4 ) / 2008, 752, 3572,
+ $ 305 /
+ DATA ( MM( 5, J ), J = 1, 4 ) / 1253, 2859, 2893,
+ $ 3301 /
+ DATA ( MM( 6, J ), J = 1, 4 ) / 3344, 123, 307,
+ $ 1065 /
+ DATA ( MM( 7, J ), J = 1, 4 ) / 4084, 1848, 1297,
+ $ 3133 /
+ DATA ( MM( 8, J ), J = 1, 4 ) / 1739, 643, 3966,
+ $ 2913 /
+ DATA ( MM( 9, J ), J = 1, 4 ) / 3143, 2405, 758,
+ $ 3285 /
+ DATA ( MM( 10, J ), J = 1, 4 ) / 3468, 2638, 2598,
+ $ 1241 /
+ DATA ( MM( 11, J ), J = 1, 4 ) / 688, 2344, 3406,
+ $ 1197 /
+ DATA ( MM( 12, J ), J = 1, 4 ) / 1657, 46, 2922,
+ $ 3729 /
+ DATA ( MM( 13, J ), J = 1, 4 ) / 1238, 3814, 1038,
+ $ 2501 /
+ DATA ( MM( 14, J ), J = 1, 4 ) / 3166, 913, 2934,
+ $ 1673 /
+ DATA ( MM( 15, J ), J = 1, 4 ) / 1292, 3649, 2091,
+ $ 541 /
+ DATA ( MM( 16, J ), J = 1, 4 ) / 3422, 339, 2451,
+ $ 2753 /
+ DATA ( MM( 17, J ), J = 1, 4 ) / 1270, 3808, 1580,
+ $ 949 /
+ DATA ( MM( 18, J ), J = 1, 4 ) / 2016, 822, 1958,
+ $ 2361 /
+ DATA ( MM( 19, J ), J = 1, 4 ) / 154, 2832, 2055,
+ $ 1165 /
+ DATA ( MM( 20, J ), J = 1, 4 ) / 2862, 3078, 1507,
+ $ 4081 /
+ DATA ( MM( 21, J ), J = 1, 4 ) / 697, 3633, 1078,
+ $ 2725 /
+ DATA ( MM( 22, J ), J = 1, 4 ) / 1706, 2970, 3273,
+ $ 3305 /
+ DATA ( MM( 23, J ), J = 1, 4 ) / 491, 637, 17,
+ $ 3069 /
+ DATA ( MM( 24, J ), J = 1, 4 ) / 931, 2249, 854,
+ $ 3617 /
+ DATA ( MM( 25, J ), J = 1, 4 ) / 1444, 2081, 2916,
+ $ 3733 /
+ DATA ( MM( 26, J ), J = 1, 4 ) / 444, 4019, 3971,
+ $ 409 /
+ DATA ( MM( 27, J ), J = 1, 4 ) / 3577, 1478, 2889,
+ $ 2157 /
+ DATA ( MM( 28, J ), J = 1, 4 ) / 3944, 242, 3831,
+ $ 1361 /
+ DATA ( MM( 29, J ), J = 1, 4 ) / 2184, 481, 2621,
+ $ 3973 /
+ DATA ( MM( 30, J ), J = 1, 4 ) / 1661, 2075, 1541,
+ $ 1865 /
+ DATA ( MM( 31, J ), J = 1, 4 ) / 3482, 4058, 893,
+ $ 2525 /
+ DATA ( MM( 32, J ), J = 1, 4 ) / 657, 622, 736,
+ $ 1409 /
+ DATA ( MM( 33, J ), J = 1, 4 ) / 3023, 3376, 3992,
+ $ 3445 /
+ DATA ( MM( 34, J ), J = 1, 4 ) / 3618, 812, 787,
+ $ 3577 /
+ DATA ( MM( 35, J ), J = 1, 4 ) / 1267, 234, 2125,
+ $ 77 /
+ DATA ( MM( 36, J ), J = 1, 4 ) / 1828, 641, 2364,
+ $ 3761 /
+ DATA ( MM( 37, J ), J = 1, 4 ) / 164, 4005, 2460,
+ $ 2149 /
+ DATA ( MM( 38, J ), J = 1, 4 ) / 3798, 1122, 257,
+ $ 1449 /
+ DATA ( MM( 39, J ), J = 1, 4 ) / 3087, 3135, 1574,
+ $ 3005 /
+ DATA ( MM( 40, J ), J = 1, 4 ) / 2400, 2640, 3912,
+ $ 225 /
+ DATA ( MM( 41, J ), J = 1, 4 ) / 2870, 2302, 1216,
+ $ 85 /
+ DATA ( MM( 42, J ), J = 1, 4 ) / 3876, 40, 3248,
+ $ 3673 /
+ DATA ( MM( 43, J ), J = 1, 4 ) / 1905, 1832, 3401,
+ $ 3117 /
+ DATA ( MM( 44, J ), J = 1, 4 ) / 1593, 2247, 2124,
+ $ 3089 /
+ DATA ( MM( 45, J ), J = 1, 4 ) / 1797, 2034, 2762,
+ $ 1349 /
+ DATA ( MM( 46, J ), J = 1, 4 ) / 1234, 2637, 149,
+ $ 2057 /
+ DATA ( MM( 47, J ), J = 1, 4 ) / 3460, 1287, 2245,
+ $ 413 /
+ DATA ( MM( 48, J ), J = 1, 4 ) / 328, 1691, 166,
+ $ 65 /
+ DATA ( MM( 49, J ), J = 1, 4 ) / 2861, 496, 466,
+ $ 1845 /
+ DATA ( MM( 50, J ), J = 1, 4 ) / 1950, 1597, 4018,
+ $ 697 /
+ DATA ( MM( 51, J ), J = 1, 4 ) / 617, 2394, 1399,
+ $ 3085 /
+ DATA ( MM( 52, J ), J = 1, 4 ) / 2070, 2584, 190,
+ $ 3441 /
+ DATA ( MM( 53, J ), J = 1, 4 ) / 3331, 1843, 2879,
+ $ 1573 /
+ DATA ( MM( 54, J ), J = 1, 4 ) / 769, 336, 153,
+ $ 3689 /
+ DATA ( MM( 55, J ), J = 1, 4 ) / 1558, 1472, 2320,
+ $ 2941 /
+ DATA ( MM( 56, J ), J = 1, 4 ) / 2412, 2407, 18,
+ $ 929 /
+ DATA ( MM( 57, J ), J = 1, 4 ) / 2800, 433, 712,
+ $ 533 /
+ DATA ( MM( 58, J ), J = 1, 4 ) / 189, 2096, 2159,
+ $ 2841 /
+ DATA ( MM( 59, J ), J = 1, 4 ) / 287, 1761, 2318,
+ $ 4077 /
+ DATA ( MM( 60, J ), J = 1, 4 ) / 2045, 2810, 2091,
+ $ 721 /
+ DATA ( MM( 61, J ), J = 1, 4 ) / 1227, 566, 3443,
+ $ 2821 /
+ DATA ( MM( 62, J ), J = 1, 4 ) / 2838, 442, 1510,
+ $ 2249 /
+ DATA ( MM( 63, J ), J = 1, 4 ) / 209, 41, 449,
+ $ 2397 /
+ DATA ( MM( 64, J ), J = 1, 4 ) / 2770, 1238, 1956,
+ $ 2817 /
+ DATA ( MM( 65, J ), J = 1, 4 ) / 3654, 1086, 2201,
+ $ 245 /
+ DATA ( MM( 66, J ), J = 1, 4 ) / 3993, 603, 3137,
+ $ 1913 /
+ DATA ( MM( 67, J ), J = 1, 4 ) / 192, 840, 3399,
+ $ 1997 /
+ DATA ( MM( 68, J ), J = 1, 4 ) / 2253, 3168, 1321,
+ $ 3121 /
+ DATA ( MM( 69, J ), J = 1, 4 ) / 3491, 1499, 2271,
+ $ 997 /
+ DATA ( MM( 70, J ), J = 1, 4 ) / 2889, 1084, 3667,
+ $ 1833 /
+ DATA ( MM( 71, J ), J = 1, 4 ) / 2857, 3438, 2703,
+ $ 2877 /
+ DATA ( MM( 72, J ), J = 1, 4 ) / 2094, 2408, 629,
+ $ 1633 /
+ DATA ( MM( 73, J ), J = 1, 4 ) / 1818, 1589, 2365,
+ $ 981 /
+ DATA ( MM( 74, J ), J = 1, 4 ) / 688, 2391, 2431,
+ $ 2009 /
+ DATA ( MM( 75, J ), J = 1, 4 ) / 1407, 288, 1113,
+ $ 941 /
+ DATA ( MM( 76, J ), J = 1, 4 ) / 634, 26, 3922,
+ $ 2449 /
+ DATA ( MM( 77, J ), J = 1, 4 ) / 3231, 512, 2554,
+ $ 197 /
+ DATA ( MM( 78, J ), J = 1, 4 ) / 815, 1456, 184,
+ $ 2441 /
+ DATA ( MM( 79, J ), J = 1, 4 ) / 3524, 171, 2099,
+ $ 285 /
+ DATA ( MM( 80, J ), J = 1, 4 ) / 1914, 1677, 3228,
+ $ 1473 /
+ DATA ( MM( 81, J ), J = 1, 4 ) / 516, 2657, 4012,
+ $ 2741 /
+ DATA ( MM( 82, J ), J = 1, 4 ) / 164, 2270, 1921,
+ $ 3129 /
+ DATA ( MM( 83, J ), J = 1, 4 ) / 303, 2587, 3452,
+ $ 909 /
+ DATA ( MM( 84, J ), J = 1, 4 ) / 2144, 2961, 3901,
+ $ 2801 /
+ DATA ( MM( 85, J ), J = 1, 4 ) / 3480, 1970, 572,
+ $ 421 /
+ DATA ( MM( 86, J ), J = 1, 4 ) / 119, 1817, 3309,
+ $ 4073 /
+ DATA ( MM( 87, J ), J = 1, 4 ) / 3357, 676, 3171,
+ $ 2813 /
+ DATA ( MM( 88, J ), J = 1, 4 ) / 837, 1410, 817,
+ $ 2337 /
+ DATA ( MM( 89, J ), J = 1, 4 ) / 2826, 3723, 3039,
+ $ 1429 /
+ DATA ( MM( 90, J ), J = 1, 4 ) / 2332, 2803, 1696,
+ $ 1177 /
+ DATA ( MM( 91, J ), J = 1, 4 ) / 2089, 3185, 1256,
+ $ 1901 /
+ DATA ( MM( 92, J ), J = 1, 4 ) / 3780, 184, 3715,
+ $ 81 /
+ DATA ( MM( 93, J ), J = 1, 4 ) / 1700, 663, 2077,
+ $ 1669 /
+ DATA ( MM( 94, J ), J = 1, 4 ) / 3712, 499, 3019,
+ $ 2633 /
+ DATA ( MM( 95, J ), J = 1, 4 ) / 150, 3784, 1497,
+ $ 2269 /
+ DATA ( MM( 96, J ), J = 1, 4 ) / 2000, 1631, 1101,
+ $ 129 /
+ DATA ( MM( 97, J ), J = 1, 4 ) / 3375, 1925, 717,
+ $ 1141 /
+ DATA ( MM( 98, J ), J = 1, 4 ) / 1621, 3912, 51,
+ $ 249 /
+ DATA ( MM( 99, J ), J = 1, 4 ) / 3090, 1398, 981,
+ $ 3917 /
+ DATA ( MM( 100, J ), J = 1, 4 ) / 3765, 1349, 1978,
+ $ 2481 /
+ DATA ( MM( 101, J ), J = 1, 4 ) / 1149, 1441, 1813,
+ $ 3941 /
+ DATA ( MM( 102, J ), J = 1, 4 ) / 3146, 2224, 3881,
+ $ 2217 /
+ DATA ( MM( 103, J ), J = 1, 4 ) / 33, 2411, 76,
+ $ 2749 /
+ DATA ( MM( 104, J ), J = 1, 4 ) / 3082, 1907, 3846,
+ $ 3041 /
+ DATA ( MM( 105, J ), J = 1, 4 ) / 2741, 3192, 3694,
+ $ 1877 /
+ DATA ( MM( 106, J ), J = 1, 4 ) / 359, 2786, 1682,
+ $ 345 /
+ DATA ( MM( 107, J ), J = 1, 4 ) / 3316, 382, 124,
+ $ 2861 /
+ DATA ( MM( 108, J ), J = 1, 4 ) / 1749, 37, 1660,
+ $ 1809 /
+ DATA ( MM( 109, J ), J = 1, 4 ) / 185, 759, 3997,
+ $ 3141 /
+ DATA ( MM( 110, J ), J = 1, 4 ) / 2784, 2948, 479,
+ $ 2825 /
+ DATA ( MM( 111, J ), J = 1, 4 ) / 2202, 1862, 1141,
+ $ 157 /
+ DATA ( MM( 112, J ), J = 1, 4 ) / 2199, 3802, 886,
+ $ 2881 /
+ DATA ( MM( 113, J ), J = 1, 4 ) / 1364, 2423, 3514,
+ $ 3637 /
+ DATA ( MM( 114, J ), J = 1, 4 ) / 1244, 2051, 1301,
+ $ 1465 /
+ DATA ( MM( 115, J ), J = 1, 4 ) / 2020, 2295, 3604,
+ $ 2829 /
+ DATA ( MM( 116, J ), J = 1, 4 ) / 3160, 1332, 1888,
+ $ 2161 /
+ DATA ( MM( 117, J ), J = 1, 4 ) / 2785, 1832, 1836,
+ $ 3365 /
+ DATA ( MM( 118, J ), J = 1, 4 ) / 2772, 2405, 1990,
+ $ 361 /
+ DATA ( MM( 119, J ), J = 1, 4 ) / 1217, 3638, 2058,
+ $ 2685 /
+ DATA ( MM( 120, J ), J = 1, 4 ) / 1822, 3661, 692,
+ $ 3745 /
+ DATA ( MM( 121, J ), J = 1, 4 ) / 1245, 327, 1194,
+ $ 2325 /
+ DATA ( MM( 122, J ), J = 1, 4 ) / 2252, 3660, 20,
+ $ 3609 /
+ DATA ( MM( 123, J ), J = 1, 4 ) / 3904, 716, 3285,
+ $ 3821 /
+ DATA ( MM( 124, J ), J = 1, 4 ) / 2774, 1842, 2046,
+ $ 3537 /
+ DATA ( MM( 125, J ), J = 1, 4 ) / 997, 3987, 2107,
+ $ 517 /
+ DATA ( MM( 126, J ), J = 1, 4 ) / 2573, 1368, 3508,
+ $ 3017 /
+ DATA ( MM( 127, J ), J = 1, 4 ) / 1148, 1848, 3525,
+ $ 2141 /
+ DATA ( MM( 128, J ), J = 1, 4 ) / 545, 2366, 3801,
+ $ 1537 /
+* ..
+* .. Executable Statements ..
+*
+ I1 = ISEED( 1 )
+ I2 = ISEED( 2 )
+ I3 = ISEED( 3 )
+ I4 = ISEED( 4 )
+*
+ DO 10 I = 1, MIN( N, LV )
+*
+ 20 CONTINUE
+*
+* Multiply the seed by i-th power of the multiplier modulo 2**48
+*
+ IT4 = I4*MM( I, 4 )
+ IT3 = IT4 / IPW2
+ IT4 = IT4 - IPW2*IT3
+ IT3 = IT3 + I3*MM( I, 4 ) + I4*MM( I, 3 )
+ IT2 = IT3 / IPW2
+ IT3 = IT3 - IPW2*IT2
+ IT2 = IT2 + I2*MM( I, 4 ) + I3*MM( I, 3 ) + I4*MM( I, 2 )
+ IT1 = IT2 / IPW2
+ IT2 = IT2 - IPW2*IT1
+ IT1 = IT1 + I1*MM( I, 4 ) + I2*MM( I, 3 ) + I3*MM( I, 2 ) +
+ $ I4*MM( I, 1 )
+ IT1 = MOD( IT1, IPW2 )
+*
+* Convert 48-bit integer to a real number in the interval (0,1)
+*
+ X( I ) = R*( DBLE( IT1 )+R*( DBLE( IT2 )+R*( DBLE( IT3 )+R*
+ $ DBLE( IT4 ) ) ) )
+*
+ IF (X( I ).EQ.1.0D0) THEN
+* If a real number has n bits of precision, and the first
+* n bits of the 48-bit integer above happen to be all 1 (which
+* will occur about once every 2**n calls), then X( I ) will
+* be rounded to exactly 1.0.
+* Since X( I ) is not supposed to return exactly 0.0 or 1.0,
+* the statistically correct thing to do in this situation is
+* simply to iterate again.
+* N.B. the case X( I ) = 0.0 should not be possible.
+ I1 = I1 + 2
+ I2 = I2 + 2
+ I3 = I3 + 2
+ I4 = I4 + 2
+ GOTO 20
+ END IF
+*
+ 10 CONTINUE
+*
+* Return final value of seed
+*
+ ISEED( 1 ) = IT1
+ ISEED( 2 ) = IT2
+ ISEED( 3 ) = IT3
+ ISEED( 4 ) = IT4
+ RETURN
+*
+* End of DLARUV
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.h
new file mode 100644
index 0000000000000000000000000000000000000000..34739110268ba4ebf480bb6e7c950b2c11920e92
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaruv.h
@@ -0,0 +1,5 @@
+extern int v3p_netlib_dlaruv_(
+ v3p_netlib_integer *iseed,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *x
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlascl.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlascl.c
index 15b1cae30804ea885071a4a63e6835e29efa679b..1790ffc7c06a6bc01d5376517f175bc19e12f939 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlascl.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlascl.c
@@ -28,7 +28,7 @@ extern "C" {
doublereal mul, cto1;
logical done;
doublereal ctoc;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
integer itype;
doublereal cfrom1;
extern doublereal dlamch_(char *, ftnlen);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaset.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaset.c
index af3323b47c9426e32a2445e6910876f2d05f2040..f4e788cac469bb07883a603adb248095b5a37152 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaset.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlaset.c
@@ -24,7 +24,7 @@ extern "C" {
/* Local variables */
integer i__, j;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
(void)uplo_len;
/* -- LAPACK auxiliary routine (version 3.0) -- */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.P
new file mode 100644
index 0000000000000000000000000000000000000000..96f6e1bb62822b1b388e18c32d46e95d864f4948
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.P
@@ -0,0 +1,3 @@
+extern int dlasr_(char *side, char *pivot, char *direct, integer *m, integer *n, doublereal *c__, doublereal *s, doublereal *a, integer *lda, ftnlen side_len, ftnlen pivot_len, ftnlen direct_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.c
new file mode 100644
index 0000000000000000000000000000000000000000..63bb7d2accb5d6fdba7c1f7a4ba38eaa2c038f97
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.c
@@ -0,0 +1,656 @@
+/* lapack/double/dlasr.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< SUBROUTINE DLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA ) >*/
+/* Subroutine */ int dlasr_(char *side, char *pivot, char *direct, integer *m,
+ integer *n, doublereal *c__, doublereal *s, doublereal *a, integer *
+ lda, ftnlen side_len, ftnlen pivot_len, ftnlen direct_len)
+{
+ /* System generated locals */
+ integer a_dim1, a_offset, i__1, i__2;
+
+ /* Local variables */
+ integer i__, j, info;
+ doublereal temp;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ doublereal ctemp, stemp;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER DIRECT, PIVOT, SIDE >*/
+/*< INTEGER LDA, M, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< DOUBLE PRECISION A( LDA, * ), C( * ), S( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* DLASR applies a sequence of plane rotations to a real matrix A, */
+/* from either the left or the right. */
+
+/* When SIDE = 'L', the transformation takes the form */
+
+/* A := P*A */
+
+/* and when SIDE = 'R', the transformation takes the form */
+
+/* A := A*P**T */
+
+/* where P is an orthogonal matrix consisting of a sequence of z plane */
+/* rotations, with z = M when SIDE = 'L' and z = N when SIDE = 'R', */
+/* and P**T is the transpose of P. */
+
+/* When DIRECT = 'F' (Forward sequence), then */
+
+/* P = P(z-1) * ... * P(2) * P(1) */
+
+/* and when DIRECT = 'B' (Backward sequence), then */
+
+/* P = P(1) * P(2) * ... * P(z-1) */
+
+/* where P(k) is a plane rotation matrix defined by the 2-by-2 rotation */
+
+/* R(k) = ( c(k) s(k) ) */
+/* = ( -s(k) c(k) ). */
+
+/* When PIVOT = 'V' (Variable pivot), the rotation is performed */
+/* for the plane (k,k+1), i.e., P(k) has the form */
+
+/* P(k) = ( 1 ) */
+/* ( ... ) */
+/* ( 1 ) */
+/* ( c(k) s(k) ) */
+/* ( -s(k) c(k) ) */
+/* ( 1 ) */
+/* ( ... ) */
+/* ( 1 ) */
+
+/* where R(k) appears as a rank-2 modification to the identity matrix in */
+/* rows and columns k and k+1. */
+
+/* When PIVOT = 'T' (Top pivot), the rotation is performed for the */
+/* plane (1,k+1), so P(k) has the form */
+
+/* P(k) = ( c(k) s(k) ) */
+/* ( 1 ) */
+/* ( ... ) */
+/* ( 1 ) */
+/* ( -s(k) c(k) ) */
+/* ( 1 ) */
+/* ( ... ) */
+/* ( 1 ) */
+
+/* where R(k) appears in rows and columns 1 and k+1. */
+
+/* Similarly, when PIVOT = 'B' (Bottom pivot), the rotation is */
+/* performed for the plane (k,z), giving P(k) the form */
+
+/* P(k) = ( 1 ) */
+/* ( ... ) */
+/* ( 1 ) */
+/* ( c(k) s(k) ) */
+/* ( 1 ) */
+/* ( ... ) */
+/* ( 1 ) */
+/* ( -s(k) c(k) ) */
+
+/* where R(k) appears in rows and columns k and z. The rotations are */
+/* performed without ever forming P(k) explicitly. */
+
+/* Arguments */
+/* ========= */
+
+/* SIDE (input) CHARACTER*1 */
+/* Specifies whether the plane rotation matrix P is applied to */
+/* A on the left or the right. */
+/* = 'L': Left, compute A := P*A */
+/* = 'R': Right, compute A:= A*P**T */
+
+/* PIVOT (input) CHARACTER*1 */
+/* Specifies the plane for which P(k) is a plane rotation */
+/* matrix. */
+/* = 'V': Variable pivot, the plane (k,k+1) */
+/* = 'T': Top pivot, the plane (1,k+1) */
+/* = 'B': Bottom pivot, the plane (k,z) */
+
+/* DIRECT (input) CHARACTER*1 */
+/* Specifies whether P is a forward or backward sequence of */
+/* plane rotations. */
+/* = 'F': Forward, P = P(z-1)*...*P(2)*P(1) */
+/* = 'B': Backward, P = P(1)*P(2)*...*P(z-1) */
+
+/* M (input) INTEGER */
+/* The number of rows of the matrix A. If m <= 1, an immediate */
+/* return is effected. */
+
+/* N (input) INTEGER */
+/* The number of columns of the matrix A. If n <= 1, an */
+/* immediate return is effected. */
+
+/* C (input) DOUBLE PRECISION array, dimension */
+/* (M-1) if SIDE = 'L' */
+/* (N-1) if SIDE = 'R' */
+/* The cosines c(k) of the plane rotations. */
+
+/* S (input) DOUBLE PRECISION array, dimension */
+/* (M-1) if SIDE = 'L' */
+/* (N-1) if SIDE = 'R' */
+/* The sines s(k) of the plane rotations. The 2-by-2 plane */
+/* rotation part of the matrix P(k), R(k), has the form */
+/* R(k) = ( c(k) s(k) ) */
+/* ( -s(k) c(k) ). */
+
+/* A (input/output) DOUBLE PRECISION array, dimension (LDA,N) */
+/* The M-by-N matrix A. On exit, A is overwritten by P*A if */
+/* SIDE = 'R' or by A*P**T if SIDE = 'L'. */
+
+/* LDA (input) INTEGER */
+/* The leading dimension of the array A. LDA >= max(1,M). */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ONE, ZERO >*/
+/*< PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< INTEGER I, INFO, J >*/
+/*< DOUBLE PRECISION CTEMP, STEMP, TEMP >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< EXTERNAL LSAME >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC MAX >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input parameters */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ --c__;
+ --s;
+ a_dim1 = *lda;
+ a_offset = 1 + a_dim1;
+ a -= a_offset;
+
+ /* Function Body */
+ info = 0;
+/*< IF( .NOT.( LSAME( SIDE, 'L' ) .OR. LSAME( SIDE, 'R' ) ) ) THEN >*/
+ if (! (lsame_(side, "L", (ftnlen)1, (ftnlen)1) || lsame_(side, "R", (
+ ftnlen)1, (ftnlen)1))) {
+/*< INFO = 1 >*/
+ info = 1;
+/*< >*/
+ } else if (! (lsame_(pivot, "V", (ftnlen)1, (ftnlen)1) || lsame_(pivot,
+ "T", (ftnlen)1, (ftnlen)1) || lsame_(pivot, "B", (ftnlen)1, (
+ ftnlen)1))) {
+/*< INFO = 2 >*/
+ info = 2;
+/*< >*/
+ } else if (! (lsame_(direct, "F", (ftnlen)1, (ftnlen)1) || lsame_(direct,
+ "B", (ftnlen)1, (ftnlen)1))) {
+/*< INFO = 3 >*/
+ info = 3;
+/*< ELSE IF( M.LT.0 ) THEN >*/
+ } else if (*m < 0) {
+/*< INFO = 4 >*/
+ info = 4;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = 5 >*/
+ info = 5;
+/*< ELSE IF( LDA.LT.MAX( 1, M ) ) THEN >*/
+ } else if (*lda < max(1,*m)) {
+/*< INFO = 9 >*/
+ info = 9;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (info != 0) {
+/*< CALL XERBLA( 'DLASR ', INFO ) >*/
+ xerbla_("DLASR ", &info, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< >*/
+ if (*m == 0 || *n == 0) {
+ return 0;
+ }
+/*< IF( LSAME( SIDE, 'L' ) ) THEN >*/
+ if (lsame_(side, "L", (ftnlen)1, (ftnlen)1)) {
+
+/* Form P * A */
+
+/*< IF( LSAME( PIVOT, 'V' ) ) THEN >*/
+ if (lsame_(pivot, "V", (ftnlen)1, (ftnlen)1)) {
+/*< IF( LSAME( DIRECT, 'F' ) ) THEN >*/
+ if (lsame_(direct, "F", (ftnlen)1, (ftnlen)1)) {
+/*< DO 20 J = 1, M - 1 >*/
+ i__1 = *m - 1;
+ for (j = 1; j <= i__1; ++j) {
+/*< CTEMP = C( J ) >*/
+ ctemp = c__[j];
+/*< STEMP = S( J ) >*/
+ stemp = s[j];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 10 I = 1, N >*/
+ i__2 = *n;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< TEMP = A( J+1, I ) >*/
+ temp = a[j + 1 + i__ * a_dim1];
+/*< A( J+1, I ) = CTEMP*TEMP - STEMP*A( J, I ) >*/
+ a[j + 1 + i__ * a_dim1] = ctemp * temp - stemp *
+ a[j + i__ * a_dim1];
+/*< A( J, I ) = STEMP*TEMP + CTEMP*A( J, I ) >*/
+ a[j + i__ * a_dim1] = stemp * temp + ctemp * a[j
+ + i__ * a_dim1];
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< END IF >*/
+ }
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< ELSE IF( LSAME( DIRECT, 'B' ) ) THEN >*/
+ } else if (lsame_(direct, "B", (ftnlen)1, (ftnlen)1)) {
+/*< DO 40 J = M - 1, 1, -1 >*/
+ for (j = *m - 1; j >= 1; --j) {
+/*< CTEMP = C( J ) >*/
+ ctemp = c__[j];
+/*< STEMP = S( J ) >*/
+ stemp = s[j];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 30 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< TEMP = A( J+1, I ) >*/
+ temp = a[j + 1 + i__ * a_dim1];
+/*< A( J+1, I ) = CTEMP*TEMP - STEMP*A( J, I ) >*/
+ a[j + 1 + i__ * a_dim1] = ctemp * temp - stemp *
+ a[j + i__ * a_dim1];
+/*< A( J, I ) = STEMP*TEMP + CTEMP*A( J, I ) >*/
+ a[j + i__ * a_dim1] = stemp * temp + ctemp * a[j
+ + i__ * a_dim1];
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< END IF >*/
+ }
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+/*< END IF >*/
+ }
+/*< ELSE IF( LSAME( PIVOT, 'T' ) ) THEN >*/
+ } else if (lsame_(pivot, "T", (ftnlen)1, (ftnlen)1)) {
+/*< IF( LSAME( DIRECT, 'F' ) ) THEN >*/
+ if (lsame_(direct, "F", (ftnlen)1, (ftnlen)1)) {
+/*< DO 60 J = 2, M >*/
+ i__1 = *m;
+ for (j = 2; j <= i__1; ++j) {
+/*< CTEMP = C( J-1 ) >*/
+ ctemp = c__[j - 1];
+/*< STEMP = S( J-1 ) >*/
+ stemp = s[j - 1];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 50 I = 1, N >*/
+ i__2 = *n;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< TEMP = A( J, I ) >*/
+ temp = a[j + i__ * a_dim1];
+/*< A( J, I ) = CTEMP*TEMP - STEMP*A( 1, I ) >*/
+ a[j + i__ * a_dim1] = ctemp * temp - stemp * a[
+ i__ * a_dim1 + 1];
+/*< A( 1, I ) = STEMP*TEMP + CTEMP*A( 1, I ) >*/
+ a[i__ * a_dim1 + 1] = stemp * temp + ctemp * a[
+ i__ * a_dim1 + 1];
+/*< 50 CONTINUE >*/
+/* L50: */
+ }
+/*< END IF >*/
+ }
+/*< 60 CONTINUE >*/
+/* L60: */
+ }
+/*< ELSE IF( LSAME( DIRECT, 'B' ) ) THEN >*/
+ } else if (lsame_(direct, "B", (ftnlen)1, (ftnlen)1)) {
+/*< DO 80 J = M, 2, -1 >*/
+ for (j = *m; j >= 2; --j) {
+/*< CTEMP = C( J-1 ) >*/
+ ctemp = c__[j - 1];
+/*< STEMP = S( J-1 ) >*/
+ stemp = s[j - 1];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 70 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< TEMP = A( J, I ) >*/
+ temp = a[j + i__ * a_dim1];
+/*< A( J, I ) = CTEMP*TEMP - STEMP*A( 1, I ) >*/
+ a[j + i__ * a_dim1] = ctemp * temp - stemp * a[
+ i__ * a_dim1 + 1];
+/*< A( 1, I ) = STEMP*TEMP + CTEMP*A( 1, I ) >*/
+ a[i__ * a_dim1 + 1] = stemp * temp + ctemp * a[
+ i__ * a_dim1 + 1];
+/*< 70 CONTINUE >*/
+/* L70: */
+ }
+/*< END IF >*/
+ }
+/*< 80 CONTINUE >*/
+/* L80: */
+ }
+/*< END IF >*/
+ }
+/*< ELSE IF( LSAME( PIVOT, 'B' ) ) THEN >*/
+ } else if (lsame_(pivot, "B", (ftnlen)1, (ftnlen)1)) {
+/*< IF( LSAME( DIRECT, 'F' ) ) THEN >*/
+ if (lsame_(direct, "F", (ftnlen)1, (ftnlen)1)) {
+/*< DO 100 J = 1, M - 1 >*/
+ i__1 = *m - 1;
+ for (j = 1; j <= i__1; ++j) {
+/*< CTEMP = C( J ) >*/
+ ctemp = c__[j];
+/*< STEMP = S( J ) >*/
+ stemp = s[j];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 90 I = 1, N >*/
+ i__2 = *n;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< TEMP = A( J, I ) >*/
+ temp = a[j + i__ * a_dim1];
+/*< A( J, I ) = STEMP*A( M, I ) + CTEMP*TEMP >*/
+ a[j + i__ * a_dim1] = stemp * a[*m + i__ * a_dim1]
+ + ctemp * temp;
+/*< A( M, I ) = CTEMP*A( M, I ) - STEMP*TEMP >*/
+ a[*m + i__ * a_dim1] = ctemp * a[*m + i__ *
+ a_dim1] - stemp * temp;
+/*< 90 CONTINUE >*/
+/* L90: */
+ }
+/*< END IF >*/
+ }
+/*< 100 CONTINUE >*/
+/* L100: */
+ }
+/*< ELSE IF( LSAME( DIRECT, 'B' ) ) THEN >*/
+ } else if (lsame_(direct, "B", (ftnlen)1, (ftnlen)1)) {
+/*< DO 120 J = M - 1, 1, -1 >*/
+ for (j = *m - 1; j >= 1; --j) {
+/*< CTEMP = C( J ) >*/
+ ctemp = c__[j];
+/*< STEMP = S( J ) >*/
+ stemp = s[j];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 110 I = 1, N >*/
+ i__1 = *n;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< TEMP = A( J, I ) >*/
+ temp = a[j + i__ * a_dim1];
+/*< A( J, I ) = STEMP*A( M, I ) + CTEMP*TEMP >*/
+ a[j + i__ * a_dim1] = stemp * a[*m + i__ * a_dim1]
+ + ctemp * temp;
+/*< A( M, I ) = CTEMP*A( M, I ) - STEMP*TEMP >*/
+ a[*m + i__ * a_dim1] = ctemp * a[*m + i__ *
+ a_dim1] - stemp * temp;
+/*< 110 CONTINUE >*/
+/* L110: */
+ }
+/*< END IF >*/
+ }
+/*< 120 CONTINUE >*/
+/* L120: */
+ }
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< ELSE IF( LSAME( SIDE, 'R' ) ) THEN >*/
+ } else if (lsame_(side, "R", (ftnlen)1, (ftnlen)1)) {
+
+/* Form A * P' */
+
+/*< IF( LSAME( PIVOT, 'V' ) ) THEN >*/
+ if (lsame_(pivot, "V", (ftnlen)1, (ftnlen)1)) {
+/*< IF( LSAME( DIRECT, 'F' ) ) THEN >*/
+ if (lsame_(direct, "F", (ftnlen)1, (ftnlen)1)) {
+/*< DO 140 J = 1, N - 1 >*/
+ i__1 = *n - 1;
+ for (j = 1; j <= i__1; ++j) {
+/*< CTEMP = C( J ) >*/
+ ctemp = c__[j];
+/*< STEMP = S( J ) >*/
+ stemp = s[j];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 130 I = 1, M >*/
+ i__2 = *m;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< TEMP = A( I, J+1 ) >*/
+ temp = a[i__ + (j + 1) * a_dim1];
+/*< A( I, J+1 ) = CTEMP*TEMP - STEMP*A( I, J ) >*/
+ a[i__ + (j + 1) * a_dim1] = ctemp * temp - stemp *
+ a[i__ + j * a_dim1];
+/*< A( I, J ) = STEMP*TEMP + CTEMP*A( I, J ) >*/
+ a[i__ + j * a_dim1] = stemp * temp + ctemp * a[
+ i__ + j * a_dim1];
+/*< 130 CONTINUE >*/
+/* L130: */
+ }
+/*< END IF >*/
+ }
+/*< 140 CONTINUE >*/
+/* L140: */
+ }
+/*< ELSE IF( LSAME( DIRECT, 'B' ) ) THEN >*/
+ } else if (lsame_(direct, "B", (ftnlen)1, (ftnlen)1)) {
+/*< DO 160 J = N - 1, 1, -1 >*/
+ for (j = *n - 1; j >= 1; --j) {
+/*< CTEMP = C( J ) >*/
+ ctemp = c__[j];
+/*< STEMP = S( J ) >*/
+ stemp = s[j];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 150 I = 1, M >*/
+ i__1 = *m;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< TEMP = A( I, J+1 ) >*/
+ temp = a[i__ + (j + 1) * a_dim1];
+/*< A( I, J+1 ) = CTEMP*TEMP - STEMP*A( I, J ) >*/
+ a[i__ + (j + 1) * a_dim1] = ctemp * temp - stemp *
+ a[i__ + j * a_dim1];
+/*< A( I, J ) = STEMP*TEMP + CTEMP*A( I, J ) >*/
+ a[i__ + j * a_dim1] = stemp * temp + ctemp * a[
+ i__ + j * a_dim1];
+/*< 150 CONTINUE >*/
+/* L150: */
+ }
+/*< END IF >*/
+ }
+/*< 160 CONTINUE >*/
+/* L160: */
+ }
+/*< END IF >*/
+ }
+/*< ELSE IF( LSAME( PIVOT, 'T' ) ) THEN >*/
+ } else if (lsame_(pivot, "T", (ftnlen)1, (ftnlen)1)) {
+/*< IF( LSAME( DIRECT, 'F' ) ) THEN >*/
+ if (lsame_(direct, "F", (ftnlen)1, (ftnlen)1)) {
+/*< DO 180 J = 2, N >*/
+ i__1 = *n;
+ for (j = 2; j <= i__1; ++j) {
+/*< CTEMP = C( J-1 ) >*/
+ ctemp = c__[j - 1];
+/*< STEMP = S( J-1 ) >*/
+ stemp = s[j - 1];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 170 I = 1, M >*/
+ i__2 = *m;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< TEMP = A( I, J ) >*/
+ temp = a[i__ + j * a_dim1];
+/*< A( I, J ) = CTEMP*TEMP - STEMP*A( I, 1 ) >*/
+ a[i__ + j * a_dim1] = ctemp * temp - stemp * a[
+ i__ + a_dim1];
+/*< A( I, 1 ) = STEMP*TEMP + CTEMP*A( I, 1 ) >*/
+ a[i__ + a_dim1] = stemp * temp + ctemp * a[i__ +
+ a_dim1];
+/*< 170 CONTINUE >*/
+/* L170: */
+ }
+/*< END IF >*/
+ }
+/*< 180 CONTINUE >*/
+/* L180: */
+ }
+/*< ELSE IF( LSAME( DIRECT, 'B' ) ) THEN >*/
+ } else if (lsame_(direct, "B", (ftnlen)1, (ftnlen)1)) {
+/*< DO 200 J = N, 2, -1 >*/
+ for (j = *n; j >= 2; --j) {
+/*< CTEMP = C( J-1 ) >*/
+ ctemp = c__[j - 1];
+/*< STEMP = S( J-1 ) >*/
+ stemp = s[j - 1];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 190 I = 1, M >*/
+ i__1 = *m;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< TEMP = A( I, J ) >*/
+ temp = a[i__ + j * a_dim1];
+/*< A( I, J ) = CTEMP*TEMP - STEMP*A( I, 1 ) >*/
+ a[i__ + j * a_dim1] = ctemp * temp - stemp * a[
+ i__ + a_dim1];
+/*< A( I, 1 ) = STEMP*TEMP + CTEMP*A( I, 1 ) >*/
+ a[i__ + a_dim1] = stemp * temp + ctemp * a[i__ +
+ a_dim1];
+/*< 190 CONTINUE >*/
+/* L190: */
+ }
+/*< END IF >*/
+ }
+/*< 200 CONTINUE >*/
+/* L200: */
+ }
+/*< END IF >*/
+ }
+/*< ELSE IF( LSAME( PIVOT, 'B' ) ) THEN >*/
+ } else if (lsame_(pivot, "B", (ftnlen)1, (ftnlen)1)) {
+/*< IF( LSAME( DIRECT, 'F' ) ) THEN >*/
+ if (lsame_(direct, "F", (ftnlen)1, (ftnlen)1)) {
+/*< DO 220 J = 1, N - 1 >*/
+ i__1 = *n - 1;
+ for (j = 1; j <= i__1; ++j) {
+/*< CTEMP = C( J ) >*/
+ ctemp = c__[j];
+/*< STEMP = S( J ) >*/
+ stemp = s[j];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 210 I = 1, M >*/
+ i__2 = *m;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+/*< TEMP = A( I, J ) >*/
+ temp = a[i__ + j * a_dim1];
+/*< A( I, J ) = STEMP*A( I, N ) + CTEMP*TEMP >*/
+ a[i__ + j * a_dim1] = stemp * a[i__ + *n * a_dim1]
+ + ctemp * temp;
+/*< A( I, N ) = CTEMP*A( I, N ) - STEMP*TEMP >*/
+ a[i__ + *n * a_dim1] = ctemp * a[i__ + *n *
+ a_dim1] - stemp * temp;
+/*< 210 CONTINUE >*/
+/* L210: */
+ }
+/*< END IF >*/
+ }
+/*< 220 CONTINUE >*/
+/* L220: */
+ }
+/*< ELSE IF( LSAME( DIRECT, 'B' ) ) THEN >*/
+ } else if (lsame_(direct, "B", (ftnlen)1, (ftnlen)1)) {
+/*< DO 240 J = N - 1, 1, -1 >*/
+ for (j = *n - 1; j >= 1; --j) {
+/*< CTEMP = C( J ) >*/
+ ctemp = c__[j];
+/*< STEMP = S( J ) >*/
+ stemp = s[j];
+/*< IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN >*/
+ if (ctemp != 1. || stemp != 0.) {
+/*< DO 230 I = 1, M >*/
+ i__1 = *m;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< TEMP = A( I, J ) >*/
+ temp = a[i__ + j * a_dim1];
+/*< A( I, J ) = STEMP*A( I, N ) + CTEMP*TEMP >*/
+ a[i__ + j * a_dim1] = stemp * a[i__ + *n * a_dim1]
+ + ctemp * temp;
+/*< A( I, N ) = CTEMP*A( I, N ) - STEMP*TEMP >*/
+ a[i__ + *n * a_dim1] = ctemp * a[i__ + *n *
+ a_dim1] - stemp * temp;
+/*< 230 CONTINUE >*/
+/* L230: */
+ }
+/*< END IF >*/
+ }
+/*< 240 CONTINUE >*/
+/* L240: */
+ }
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/*< RETURN >*/
+ return 0;
+
+/* End of DLASR */
+
+/*< END >*/
+} /* dlasr_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.f
new file mode 100644
index 0000000000000000000000000000000000000000..38c64dce86a33334dc6dcadc75d0814ae5625730
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.f
@@ -0,0 +1,362 @@
+ SUBROUTINE DLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER DIRECT, PIVOT, SIDE
+ INTEGER LDA, M, N
+* ..
+* .. Array Arguments ..
+ DOUBLE PRECISION A( LDA, * ), C( * ), S( * )
+* ..
+*
+* Purpose
+* =======
+*
+* DLASR applies a sequence of plane rotations to a real matrix A,
+* from either the left or the right.
+*
+* When SIDE = 'L', the transformation takes the form
+*
+* A := P*A
+*
+* and when SIDE = 'R', the transformation takes the form
+*
+* A := A*P**T
+*
+* where P is an orthogonal matrix consisting of a sequence of z plane
+* rotations, with z = M when SIDE = 'L' and z = N when SIDE = 'R',
+* and P**T is the transpose of P.
+*
+* When DIRECT = 'F' (Forward sequence), then
+*
+* P = P(z-1) * ... * P(2) * P(1)
+*
+* and when DIRECT = 'B' (Backward sequence), then
+*
+* P = P(1) * P(2) * ... * P(z-1)
+*
+* where P(k) is a plane rotation matrix defined by the 2-by-2 rotation
+*
+* R(k) = ( c(k) s(k) )
+* = ( -s(k) c(k) ).
+*
+* When PIVOT = 'V' (Variable pivot), the rotation is performed
+* for the plane (k,k+1), i.e., P(k) has the form
+*
+* P(k) = ( 1 )
+* ( ... )
+* ( 1 )
+* ( c(k) s(k) )
+* ( -s(k) c(k) )
+* ( 1 )
+* ( ... )
+* ( 1 )
+*
+* where R(k) appears as a rank-2 modification to the identity matrix in
+* rows and columns k and k+1.
+*
+* When PIVOT = 'T' (Top pivot), the rotation is performed for the
+* plane (1,k+1), so P(k) has the form
+*
+* P(k) = ( c(k) s(k) )
+* ( 1 )
+* ( ... )
+* ( 1 )
+* ( -s(k) c(k) )
+* ( 1 )
+* ( ... )
+* ( 1 )
+*
+* where R(k) appears in rows and columns 1 and k+1.
+*
+* Similarly, when PIVOT = 'B' (Bottom pivot), the rotation is
+* performed for the plane (k,z), giving P(k) the form
+*
+* P(k) = ( 1 )
+* ( ... )
+* ( 1 )
+* ( c(k) s(k) )
+* ( 1 )
+* ( ... )
+* ( 1 )
+* ( -s(k) c(k) )
+*
+* where R(k) appears in rows and columns k and z. The rotations are
+* performed without ever forming P(k) explicitly.
+*
+* Arguments
+* =========
+*
+* SIDE (input) CHARACTER*1
+* Specifies whether the plane rotation matrix P is applied to
+* A on the left or the right.
+* = 'L': Left, compute A := P*A
+* = 'R': Right, compute A:= A*P**T
+*
+* PIVOT (input) CHARACTER*1
+* Specifies the plane for which P(k) is a plane rotation
+* matrix.
+* = 'V': Variable pivot, the plane (k,k+1)
+* = 'T': Top pivot, the plane (1,k+1)
+* = 'B': Bottom pivot, the plane (k,z)
+*
+* DIRECT (input) CHARACTER*1
+* Specifies whether P is a forward or backward sequence of
+* plane rotations.
+* = 'F': Forward, P = P(z-1)*...*P(2)*P(1)
+* = 'B': Backward, P = P(1)*P(2)*...*P(z-1)
+*
+* M (input) INTEGER
+* The number of rows of the matrix A. If m <= 1, an immediate
+* return is effected.
+*
+* N (input) INTEGER
+* The number of columns of the matrix A. If n <= 1, an
+* immediate return is effected.
+*
+* C (input) DOUBLE PRECISION array, dimension
+* (M-1) if SIDE = 'L'
+* (N-1) if SIDE = 'R'
+* The cosines c(k) of the plane rotations.
+*
+* S (input) DOUBLE PRECISION array, dimension
+* (M-1) if SIDE = 'L'
+* (N-1) if SIDE = 'R'
+* The sines s(k) of the plane rotations. The 2-by-2 plane
+* rotation part of the matrix P(k), R(k), has the form
+* R(k) = ( c(k) s(k) )
+* ( -s(k) c(k) ).
+*
+* A (input/output) DOUBLE PRECISION array, dimension (LDA,N)
+* The M-by-N matrix A. On exit, A is overwritten by P*A if
+* SIDE = 'R' or by A*P**T if SIDE = 'L'.
+*
+* LDA (input) INTEGER
+* The leading dimension of the array A. LDA >= max(1,M).
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ONE, ZERO
+ PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 )
+* ..
+* .. Local Scalars ..
+ INTEGER I, INFO, J
+ DOUBLE PRECISION CTEMP, STEMP, TEMP
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ EXTERNAL LSAME
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC MAX
+* ..
+* .. Executable Statements ..
+*
+* Test the input parameters
+*
+ INFO = 0
+ IF( .NOT.( LSAME( SIDE, 'L' ) .OR. LSAME( SIDE, 'R' ) ) ) THEN
+ INFO = 1
+ ELSE IF( .NOT.( LSAME( PIVOT, 'V' ) .OR. LSAME( PIVOT,
+ $ 'T' ) .OR. LSAME( PIVOT, 'B' ) ) ) THEN
+ INFO = 2
+ ELSE IF( .NOT.( LSAME( DIRECT, 'F' ) .OR. LSAME( DIRECT, 'B' ) ) )
+ $ THEN
+ INFO = 3
+ ELSE IF( M.LT.0 ) THEN
+ INFO = 4
+ ELSE IF( N.LT.0 ) THEN
+ INFO = 5
+ ELSE IF( LDA.LT.MAX( 1, M ) ) THEN
+ INFO = 9
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'DLASR ', INFO )
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( ( M.EQ.0 ) .OR. ( N.EQ.0 ) )
+ $ RETURN
+ IF( LSAME( SIDE, 'L' ) ) THEN
+*
+* Form P * A
+*
+ IF( LSAME( PIVOT, 'V' ) ) THEN
+ IF( LSAME( DIRECT, 'F' ) ) THEN
+ DO 20 J = 1, M - 1
+ CTEMP = C( J )
+ STEMP = S( J )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 10 I = 1, N
+ TEMP = A( J+1, I )
+ A( J+1, I ) = CTEMP*TEMP - STEMP*A( J, I )
+ A( J, I ) = STEMP*TEMP + CTEMP*A( J, I )
+ 10 CONTINUE
+ END IF
+ 20 CONTINUE
+ ELSE IF( LSAME( DIRECT, 'B' ) ) THEN
+ DO 40 J = M - 1, 1, -1
+ CTEMP = C( J )
+ STEMP = S( J )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 30 I = 1, N
+ TEMP = A( J+1, I )
+ A( J+1, I ) = CTEMP*TEMP - STEMP*A( J, I )
+ A( J, I ) = STEMP*TEMP + CTEMP*A( J, I )
+ 30 CONTINUE
+ END IF
+ 40 CONTINUE
+ END IF
+ ELSE IF( LSAME( PIVOT, 'T' ) ) THEN
+ IF( LSAME( DIRECT, 'F' ) ) THEN
+ DO 60 J = 2, M
+ CTEMP = C( J-1 )
+ STEMP = S( J-1 )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 50 I = 1, N
+ TEMP = A( J, I )
+ A( J, I ) = CTEMP*TEMP - STEMP*A( 1, I )
+ A( 1, I ) = STEMP*TEMP + CTEMP*A( 1, I )
+ 50 CONTINUE
+ END IF
+ 60 CONTINUE
+ ELSE IF( LSAME( DIRECT, 'B' ) ) THEN
+ DO 80 J = M, 2, -1
+ CTEMP = C( J-1 )
+ STEMP = S( J-1 )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 70 I = 1, N
+ TEMP = A( J, I )
+ A( J, I ) = CTEMP*TEMP - STEMP*A( 1, I )
+ A( 1, I ) = STEMP*TEMP + CTEMP*A( 1, I )
+ 70 CONTINUE
+ END IF
+ 80 CONTINUE
+ END IF
+ ELSE IF( LSAME( PIVOT, 'B' ) ) THEN
+ IF( LSAME( DIRECT, 'F' ) ) THEN
+ DO 100 J = 1, M - 1
+ CTEMP = C( J )
+ STEMP = S( J )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 90 I = 1, N
+ TEMP = A( J, I )
+ A( J, I ) = STEMP*A( M, I ) + CTEMP*TEMP
+ A( M, I ) = CTEMP*A( M, I ) - STEMP*TEMP
+ 90 CONTINUE
+ END IF
+ 100 CONTINUE
+ ELSE IF( LSAME( DIRECT, 'B' ) ) THEN
+ DO 120 J = M - 1, 1, -1
+ CTEMP = C( J )
+ STEMP = S( J )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 110 I = 1, N
+ TEMP = A( J, I )
+ A( J, I ) = STEMP*A( M, I ) + CTEMP*TEMP
+ A( M, I ) = CTEMP*A( M, I ) - STEMP*TEMP
+ 110 CONTINUE
+ END IF
+ 120 CONTINUE
+ END IF
+ END IF
+ ELSE IF( LSAME( SIDE, 'R' ) ) THEN
+*
+* Form A * P'
+*
+ IF( LSAME( PIVOT, 'V' ) ) THEN
+ IF( LSAME( DIRECT, 'F' ) ) THEN
+ DO 140 J = 1, N - 1
+ CTEMP = C( J )
+ STEMP = S( J )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 130 I = 1, M
+ TEMP = A( I, J+1 )
+ A( I, J+1 ) = CTEMP*TEMP - STEMP*A( I, J )
+ A( I, J ) = STEMP*TEMP + CTEMP*A( I, J )
+ 130 CONTINUE
+ END IF
+ 140 CONTINUE
+ ELSE IF( LSAME( DIRECT, 'B' ) ) THEN
+ DO 160 J = N - 1, 1, -1
+ CTEMP = C( J )
+ STEMP = S( J )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 150 I = 1, M
+ TEMP = A( I, J+1 )
+ A( I, J+1 ) = CTEMP*TEMP - STEMP*A( I, J )
+ A( I, J ) = STEMP*TEMP + CTEMP*A( I, J )
+ 150 CONTINUE
+ END IF
+ 160 CONTINUE
+ END IF
+ ELSE IF( LSAME( PIVOT, 'T' ) ) THEN
+ IF( LSAME( DIRECT, 'F' ) ) THEN
+ DO 180 J = 2, N
+ CTEMP = C( J-1 )
+ STEMP = S( J-1 )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 170 I = 1, M
+ TEMP = A( I, J )
+ A( I, J ) = CTEMP*TEMP - STEMP*A( I, 1 )
+ A( I, 1 ) = STEMP*TEMP + CTEMP*A( I, 1 )
+ 170 CONTINUE
+ END IF
+ 180 CONTINUE
+ ELSE IF( LSAME( DIRECT, 'B' ) ) THEN
+ DO 200 J = N, 2, -1
+ CTEMP = C( J-1 )
+ STEMP = S( J-1 )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 190 I = 1, M
+ TEMP = A( I, J )
+ A( I, J ) = CTEMP*TEMP - STEMP*A( I, 1 )
+ A( I, 1 ) = STEMP*TEMP + CTEMP*A( I, 1 )
+ 190 CONTINUE
+ END IF
+ 200 CONTINUE
+ END IF
+ ELSE IF( LSAME( PIVOT, 'B' ) ) THEN
+ IF( LSAME( DIRECT, 'F' ) ) THEN
+ DO 220 J = 1, N - 1
+ CTEMP = C( J )
+ STEMP = S( J )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 210 I = 1, M
+ TEMP = A( I, J )
+ A( I, J ) = STEMP*A( I, N ) + CTEMP*TEMP
+ A( I, N ) = CTEMP*A( I, N ) - STEMP*TEMP
+ 210 CONTINUE
+ END IF
+ 220 CONTINUE
+ ELSE IF( LSAME( DIRECT, 'B' ) ) THEN
+ DO 240 J = N - 1, 1, -1
+ CTEMP = C( J )
+ STEMP = S( J )
+ IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN
+ DO 230 I = 1, M
+ TEMP = A( I, J )
+ A( I, J ) = STEMP*A( I, N ) + CTEMP*TEMP
+ A( I, N ) = CTEMP*A( I, N ) - STEMP*TEMP
+ 230 CONTINUE
+ END IF
+ 240 CONTINUE
+ END IF
+ END IF
+ END IF
+*
+ RETURN
+*
+* End of DLASR
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.h
new file mode 100644
index 0000000000000000000000000000000000000000..1b86eed7551415c4ce825ce0428dd8884bd8dc89
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasr.h
@@ -0,0 +1,14 @@
+extern int v3p_netlib_dlasr_(
+ char *side,
+ char *pivot,
+ char *direct,
+ v3p_netlib_integer *m,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *c__,
+ v3p_netlib_doublereal *s,
+ v3p_netlib_doublereal *a,
+ v3p_netlib_integer *lda,
+ v3p_netlib_ftnlen side_len,
+ v3p_netlib_ftnlen pivot_len,
+ v3p_netlib_ftnlen direct_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.P
new file mode 100644
index 0000000000000000000000000000000000000000..2eaa3cfdf15bf8cc3db5088fb1c52838f96a6b7b
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.P
@@ -0,0 +1,3 @@
+extern int dlasrt_(char *id, integer *n, doublereal *d__, integer *info, ftnlen id_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.c
new file mode 100644
index 0000000000000000000000000000000000000000..43da7e531e918464b6232c1eb0e1bc4e9fb2e37d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.c
@@ -0,0 +1,444 @@
+/* lapack/double/dlasrt.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< SUBROUTINE DLASRT( ID, N, D, INFO ) >*/
+/* Subroutine */ int dlasrt_(char *id, integer *n, doublereal *d__, integer *
+ info, ftnlen id_len)
+{
+ /* System generated locals */
+ integer i__1, i__2;
+
+ /* Local variables */
+ integer i__, j;
+ doublereal d1, d2, d3;
+ integer dir;
+ doublereal tmp;
+ integer endd;
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ integer stack[64] /* was [2][32] */;
+ doublereal dmnmx;
+ integer start;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+ integer stkpnt;
+
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER ID >*/
+/*< INTEGER INFO, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< DOUBLE PRECISION D( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* Sort the numbers in D in increasing order (if ID = 'I') or */
+/* in decreasing order (if ID = 'D' ). */
+
+/* Use Quick Sort, reverting to Insertion sort on arrays of */
+/* size <= 20. Dimension of STACK limits N to about 2**32. */
+
+/* Arguments */
+/* ========= */
+
+/* ID (input) CHARACTER*1 */
+/* = 'I': sort D in increasing order; */
+/* = 'D': sort D in decreasing order. */
+
+/* N (input) INTEGER */
+/* The length of the array D. */
+
+/* D (input/output) DOUBLE PRECISION array, dimension (N) */
+/* On entry, the array to be sorted. */
+/* On exit, D has been sorted into increasing order */
+/* (D(1) <= ... <= D(N) ) or into decreasing order */
+/* (D(1) >= ... >= D(N) ), depending on ID. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< INTEGER SELECT >*/
+/*< PARAMETER ( SELECT = 20 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< INTEGER DIR, ENDD, I, J, START, STKPNT >*/
+/*< DOUBLE PRECISION D1, D2, D3, DMNMX, TMP >*/
+/* .. */
+/* .. Local Arrays .. */
+/*< INTEGER STACK( 2, 32 ) >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< EXTERNAL LSAME >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< EXTERNAL XERBLA >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input parameters. */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ --d__;
+
+ /* Function Body */
+ *info = 0;
+/*< DIR = -1 >*/
+ dir = -1;
+/*< IF( LSAME( ID, 'D' ) ) THEN >*/
+ if (lsame_(id, "D", (ftnlen)1, (ftnlen)1)) {
+/*< DIR = 0 >*/
+ dir = 0;
+/*< ELSE IF( LSAME( ID, 'I' ) ) THEN >*/
+ } else if (lsame_(id, "I", (ftnlen)1, (ftnlen)1)) {
+/*< DIR = 1 >*/
+ dir = 1;
+/*< END IF >*/
+ }
+/*< IF( DIR.EQ.-1 ) THEN >*/
+ if (dir == -1) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'DLASRT', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("DLASRT", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< >*/
+ if (*n <= 1) {
+ return 0;
+ }
+
+/*< STKPNT = 1 >*/
+ stkpnt = 1;
+/*< STACK( 1, 1 ) = 1 >*/
+ stack[0] = 1;
+/*< STACK( 2, 1 ) = N >*/
+ stack[1] = *n;
+/*< 10 CONTINUE >*/
+L10:
+/*< START = STACK( 1, STKPNT ) >*/
+ start = stack[(stkpnt << 1) - 2];
+/*< ENDD = STACK( 2, STKPNT ) >*/
+ endd = stack[(stkpnt << 1) - 1];
+/*< STKPNT = STKPNT - 1 >*/
+ --stkpnt;
+/*< IF( ENDD-START.LE.SELECT .AND. ENDD-START.GT.0 ) THEN >*/
+ if (endd - start <= 20 && endd - start > 0) {
+
+/* Do Insertion sort on D( START:ENDD ) */
+
+/*< IF( DIR.EQ.0 ) THEN >*/
+ if (dir == 0) {
+
+/* Sort into decreasing order */
+
+/*< DO 30 I = START + 1, ENDD >*/
+ i__1 = endd;
+ for (i__ = start + 1; i__ <= i__1; ++i__) {
+/*< DO 20 J = I, START + 1, -1 >*/
+ i__2 = start + 1;
+ for (j = i__; j >= i__2; --j) {
+/*< IF( D( J ).GT.D( J-1 ) ) THEN >*/
+ if (d__[j] > d__[j - 1]) {
+/*< DMNMX = D( J ) >*/
+ dmnmx = d__[j];
+/*< D( J ) = D( J-1 ) >*/
+ d__[j] = d__[j - 1];
+/*< D( J-1 ) = DMNMX >*/
+ d__[j - 1] = dmnmx;
+/*< ELSE >*/
+ } else {
+/*< GO TO 30 >*/
+ goto L30;
+/*< END IF >*/
+ }
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< 30 CONTINUE >*/
+L30:
+ ;
+ }
+
+/*< ELSE >*/
+ } else {
+
+/* Sort into increasing order */
+
+/*< DO 50 I = START + 1, ENDD >*/
+ i__1 = endd;
+ for (i__ = start + 1; i__ <= i__1; ++i__) {
+/*< DO 40 J = I, START + 1, -1 >*/
+ i__2 = start + 1;
+ for (j = i__; j >= i__2; --j) {
+/*< IF( D( J ).LT.D( J-1 ) ) THEN >*/
+ if (d__[j] < d__[j - 1]) {
+/*< DMNMX = D( J ) >*/
+ dmnmx = d__[j];
+/*< D( J ) = D( J-1 ) >*/
+ d__[j] = d__[j - 1];
+/*< D( J-1 ) = DMNMX >*/
+ d__[j - 1] = dmnmx;
+/*< ELSE >*/
+ } else {
+/*< GO TO 50 >*/
+ goto L50;
+/*< END IF >*/
+ }
+/*< 40 CONTINUE >*/
+/* L40: */
+ }
+/*< 50 CONTINUE >*/
+L50:
+ ;
+ }
+
+/*< END IF >*/
+ }
+
+/*< ELSE IF( ENDD-START.GT.SELECT ) THEN >*/
+ } else if (endd - start > 20) {
+
+/* Partition D( START:ENDD ) and stack parts, largest one first */
+
+/* Choose partition entry as median of 3 */
+
+/*< D1 = D( START ) >*/
+ d1 = d__[start];
+/*< D2 = D( ENDD ) >*/
+ d2 = d__[endd];
+/*< I = ( START+ENDD ) / 2 >*/
+ i__ = (start + endd) / 2;
+/*< D3 = D( I ) >*/
+ d3 = d__[i__];
+/*< IF( D1.LT.D2 ) THEN >*/
+ if (d1 < d2) {
+/*< IF( D3.LT.D1 ) THEN >*/
+ if (d3 < d1) {
+/*< DMNMX = D1 >*/
+ dmnmx = d1;
+/*< ELSE IF( D3.LT.D2 ) THEN >*/
+ } else if (d3 < d2) {
+/*< DMNMX = D3 >*/
+ dmnmx = d3;
+/*< ELSE >*/
+ } else {
+/*< DMNMX = D2 >*/
+ dmnmx = d2;
+/*< END IF >*/
+ }
+/*< ELSE >*/
+ } else {
+/*< IF( D3.LT.D2 ) THEN >*/
+ if (d3 < d2) {
+/*< DMNMX = D2 >*/
+ dmnmx = d2;
+/*< ELSE IF( D3.LT.D1 ) THEN >*/
+ } else if (d3 < d1) {
+/*< DMNMX = D3 >*/
+ dmnmx = d3;
+/*< ELSE >*/
+ } else {
+/*< DMNMX = D1 >*/
+ dmnmx = d1;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+
+/*< IF( DIR.EQ.0 ) THEN >*/
+ if (dir == 0) {
+
+/* Sort into decreasing order */
+
+/*< I = START - 1 >*/
+ i__ = start - 1;
+/*< J = ENDD + 1 >*/
+ j = endd + 1;
+/*< 60 CONTINUE >*/
+L60:
+/*< 70 CONTINUE >*/
+L70:
+/*< J = J - 1 >*/
+ --j;
+/*< >*/
+ if (d__[j] < dmnmx) {
+ goto L70;
+ }
+/*< 80 CONTINUE >*/
+L80:
+/*< I = I + 1 >*/
+ ++i__;
+/*< >*/
+ if (d__[i__] > dmnmx) {
+ goto L80;
+ }
+/*< IF( I.LT.J ) THEN >*/
+ if (i__ < j) {
+/*< TMP = D( I ) >*/
+ tmp = d__[i__];
+/*< D( I ) = D( J ) >*/
+ d__[i__] = d__[j];
+/*< D( J ) = TMP >*/
+ d__[j] = tmp;
+/*< GO TO 60 >*/
+ goto L60;
+/*< END IF >*/
+ }
+/*< IF( J-START.GT.ENDD-J-1 ) THEN >*/
+ if (j - start > endd - j - 1) {
+/*< STKPNT = STKPNT + 1 >*/
+ ++stkpnt;
+/*< STACK( 1, STKPNT ) = START >*/
+ stack[(stkpnt << 1) - 2] = start;
+/*< STACK( 2, STKPNT ) = J >*/
+ stack[(stkpnt << 1) - 1] = j;
+/*< STKPNT = STKPNT + 1 >*/
+ ++stkpnt;
+/*< STACK( 1, STKPNT ) = J + 1 >*/
+ stack[(stkpnt << 1) - 2] = j + 1;
+/*< STACK( 2, STKPNT ) = ENDD >*/
+ stack[(stkpnt << 1) - 1] = endd;
+/*< ELSE >*/
+ } else {
+/*< STKPNT = STKPNT + 1 >*/
+ ++stkpnt;
+/*< STACK( 1, STKPNT ) = J + 1 >*/
+ stack[(stkpnt << 1) - 2] = j + 1;
+/*< STACK( 2, STKPNT ) = ENDD >*/
+ stack[(stkpnt << 1) - 1] = endd;
+/*< STKPNT = STKPNT + 1 >*/
+ ++stkpnt;
+/*< STACK( 1, STKPNT ) = START >*/
+ stack[(stkpnt << 1) - 2] = start;
+/*< STACK( 2, STKPNT ) = J >*/
+ stack[(stkpnt << 1) - 1] = j;
+/*< END IF >*/
+ }
+/*< ELSE >*/
+ } else {
+
+/* Sort into increasing order */
+
+/*< I = START - 1 >*/
+ i__ = start - 1;
+/*< J = ENDD + 1 >*/
+ j = endd + 1;
+/*< 90 CONTINUE >*/
+L90:
+/*< 100 CONTINUE >*/
+L100:
+/*< J = J - 1 >*/
+ --j;
+/*< >*/
+ if (d__[j] > dmnmx) {
+ goto L100;
+ }
+/*< 110 CONTINUE >*/
+L110:
+/*< I = I + 1 >*/
+ ++i__;
+/*< >*/
+ if (d__[i__] < dmnmx) {
+ goto L110;
+ }
+/*< IF( I.LT.J ) THEN >*/
+ if (i__ < j) {
+/*< TMP = D( I ) >*/
+ tmp = d__[i__];
+/*< D( I ) = D( J ) >*/
+ d__[i__] = d__[j];
+/*< D( J ) = TMP >*/
+ d__[j] = tmp;
+/*< GO TO 90 >*/
+ goto L90;
+/*< END IF >*/
+ }
+/*< IF( J-START.GT.ENDD-J-1 ) THEN >*/
+ if (j - start > endd - j - 1) {
+/*< STKPNT = STKPNT + 1 >*/
+ ++stkpnt;
+/*< STACK( 1, STKPNT ) = START >*/
+ stack[(stkpnt << 1) - 2] = start;
+/*< STACK( 2, STKPNT ) = J >*/
+ stack[(stkpnt << 1) - 1] = j;
+/*< STKPNT = STKPNT + 1 >*/
+ ++stkpnt;
+/*< STACK( 1, STKPNT ) = J + 1 >*/
+ stack[(stkpnt << 1) - 2] = j + 1;
+/*< STACK( 2, STKPNT ) = ENDD >*/
+ stack[(stkpnt << 1) - 1] = endd;
+/*< ELSE >*/
+ } else {
+/*< STKPNT = STKPNT + 1 >*/
+ ++stkpnt;
+/*< STACK( 1, STKPNT ) = J + 1 >*/
+ stack[(stkpnt << 1) - 2] = j + 1;
+/*< STACK( 2, STKPNT ) = ENDD >*/
+ stack[(stkpnt << 1) - 1] = endd;
+/*< STKPNT = STKPNT + 1 >*/
+ ++stkpnt;
+/*< STACK( 1, STKPNT ) = START >*/
+ stack[(stkpnt << 1) - 2] = start;
+/*< STACK( 2, STKPNT ) = J >*/
+ stack[(stkpnt << 1) - 1] = j;
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< END IF >*/
+ }
+/*< >*/
+ if (stkpnt > 0) {
+ goto L10;
+ }
+/*< RETURN >*/
+ return 0;
+
+/* End of DLASRT */
+
+/*< END >*/
+} /* dlasrt_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.f
new file mode 100644
index 0000000000000000000000000000000000000000..e17e1b93e84ea37f49e4fff8d5029820a0bf69a1
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.f
@@ -0,0 +1,244 @@
+ SUBROUTINE DLASRT( ID, N, D, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER ID
+ INTEGER INFO, N
+* ..
+* .. Array Arguments ..
+ DOUBLE PRECISION D( * )
+* ..
+*
+* Purpose
+* =======
+*
+* Sort the numbers in D in increasing order (if ID = 'I') or
+* in decreasing order (if ID = 'D' ).
+*
+* Use Quick Sort, reverting to Insertion sort on arrays of
+* size <= 20. Dimension of STACK limits N to about 2**32.
+*
+* Arguments
+* =========
+*
+* ID (input) CHARACTER*1
+* = 'I': sort D in increasing order;
+* = 'D': sort D in decreasing order.
+*
+* N (input) INTEGER
+* The length of the array D.
+*
+* D (input/output) DOUBLE PRECISION array, dimension (N)
+* On entry, the array to be sorted.
+* On exit, D has been sorted into increasing order
+* (D(1) <= ... <= D(N) ) or into decreasing order
+* (D(1) >= ... >= D(N) ), depending on ID.
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+*
+* =====================================================================
+*
+* .. Parameters ..
+ INTEGER SELECT
+ PARAMETER ( SELECT = 20 )
+* ..
+* .. Local Scalars ..
+ INTEGER DIR, ENDD, I, J, START, STKPNT
+ DOUBLE PRECISION D1, D2, D3, DMNMX, TMP
+* ..
+* .. Local Arrays ..
+ INTEGER STACK( 2, 32 )
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ EXTERNAL LSAME
+* ..
+* .. External Subroutines ..
+ EXTERNAL XERBLA
+* ..
+* .. Executable Statements ..
+*
+* Test the input parameters.
+*
+ INFO = 0
+ DIR = -1
+ IF( LSAME( ID, 'D' ) ) THEN
+ DIR = 0
+ ELSE IF( LSAME( ID, 'I' ) ) THEN
+ DIR = 1
+ END IF
+ IF( DIR.EQ.-1 ) THEN
+ INFO = -1
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -2
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'DLASRT', -INFO )
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( N.LE.1 )
+ $ RETURN
+*
+ STKPNT = 1
+ STACK( 1, 1 ) = 1
+ STACK( 2, 1 ) = N
+ 10 CONTINUE
+ START = STACK( 1, STKPNT )
+ ENDD = STACK( 2, STKPNT )
+ STKPNT = STKPNT - 1
+ IF( ENDD-START.LE.SELECT .AND. ENDD-START.GT.0 ) THEN
+*
+* Do Insertion sort on D( START:ENDD )
+*
+ IF( DIR.EQ.0 ) THEN
+*
+* Sort into decreasing order
+*
+ DO 30 I = START + 1, ENDD
+ DO 20 J = I, START + 1, -1
+ IF( D( J ).GT.D( J-1 ) ) THEN
+ DMNMX = D( J )
+ D( J ) = D( J-1 )
+ D( J-1 ) = DMNMX
+ ELSE
+ GO TO 30
+ END IF
+ 20 CONTINUE
+ 30 CONTINUE
+*
+ ELSE
+*
+* Sort into increasing order
+*
+ DO 50 I = START + 1, ENDD
+ DO 40 J = I, START + 1, -1
+ IF( D( J ).LT.D( J-1 ) ) THEN
+ DMNMX = D( J )
+ D( J ) = D( J-1 )
+ D( J-1 ) = DMNMX
+ ELSE
+ GO TO 50
+ END IF
+ 40 CONTINUE
+ 50 CONTINUE
+*
+ END IF
+*
+ ELSE IF( ENDD-START.GT.SELECT ) THEN
+*
+* Partition D( START:ENDD ) and stack parts, largest one first
+*
+* Choose partition entry as median of 3
+*
+ D1 = D( START )
+ D2 = D( ENDD )
+ I = ( START+ENDD ) / 2
+ D3 = D( I )
+ IF( D1.LT.D2 ) THEN
+ IF( D3.LT.D1 ) THEN
+ DMNMX = D1
+ ELSE IF( D3.LT.D2 ) THEN
+ DMNMX = D3
+ ELSE
+ DMNMX = D2
+ END IF
+ ELSE
+ IF( D3.LT.D2 ) THEN
+ DMNMX = D2
+ ELSE IF( D3.LT.D1 ) THEN
+ DMNMX = D3
+ ELSE
+ DMNMX = D1
+ END IF
+ END IF
+*
+ IF( DIR.EQ.0 ) THEN
+*
+* Sort into decreasing order
+*
+ I = START - 1
+ J = ENDD + 1
+ 60 CONTINUE
+ 70 CONTINUE
+ J = J - 1
+ IF( D( J ).LT.DMNMX )
+ $ GO TO 70
+ 80 CONTINUE
+ I = I + 1
+ IF( D( I ).GT.DMNMX )
+ $ GO TO 80
+ IF( I.LT.J ) THEN
+ TMP = D( I )
+ D( I ) = D( J )
+ D( J ) = TMP
+ GO TO 60
+ END IF
+ IF( J-START.GT.ENDD-J-1 ) THEN
+ STKPNT = STKPNT + 1
+ STACK( 1, STKPNT ) = START
+ STACK( 2, STKPNT ) = J
+ STKPNT = STKPNT + 1
+ STACK( 1, STKPNT ) = J + 1
+ STACK( 2, STKPNT ) = ENDD
+ ELSE
+ STKPNT = STKPNT + 1
+ STACK( 1, STKPNT ) = J + 1
+ STACK( 2, STKPNT ) = ENDD
+ STKPNT = STKPNT + 1
+ STACK( 1, STKPNT ) = START
+ STACK( 2, STKPNT ) = J
+ END IF
+ ELSE
+*
+* Sort into increasing order
+*
+ I = START - 1
+ J = ENDD + 1
+ 90 CONTINUE
+ 100 CONTINUE
+ J = J - 1
+ IF( D( J ).GT.DMNMX )
+ $ GO TO 100
+ 110 CONTINUE
+ I = I + 1
+ IF( D( I ).LT.DMNMX )
+ $ GO TO 110
+ IF( I.LT.J ) THEN
+ TMP = D( I )
+ D( I ) = D( J )
+ D( J ) = TMP
+ GO TO 90
+ END IF
+ IF( J-START.GT.ENDD-J-1 ) THEN
+ STKPNT = STKPNT + 1
+ STACK( 1, STKPNT ) = START
+ STACK( 2, STKPNT ) = J
+ STKPNT = STKPNT + 1
+ STACK( 1, STKPNT ) = J + 1
+ STACK( 2, STKPNT ) = ENDD
+ ELSE
+ STKPNT = STKPNT + 1
+ STACK( 1, STKPNT ) = J + 1
+ STACK( 2, STKPNT ) = ENDD
+ STKPNT = STKPNT + 1
+ STACK( 1, STKPNT ) = START
+ STACK( 2, STKPNT ) = J
+ END IF
+ END IF
+ END IF
+ IF( STKPNT.GT.0 )
+ $ GO TO 10
+ RETURN
+*
+* End of DLASRT
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.h
new file mode 100644
index 0000000000000000000000000000000000000000..1af0c486e7d75c9db742adc0748af8c3cf5378d7
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlasrt.h
@@ -0,0 +1,7 @@
+extern int v3p_netlib_dlasrt_(
+ char *id,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *d__,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen id_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlatrs.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlatrs.c
index 18d679c164160b4ef1bd0b350fd65fbd5f37d406..d5a12b9668a32a336d5332823e9e8d6bc672fba4 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlatrs.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dlatrs.c
@@ -41,7 +41,7 @@ static doublereal c_b36 = .5;
doublereal tmax, tjjs=0, xmax, grow, sumj;
extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
integer *);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
doublereal tscal, uscal;
extern doublereal dasum_(integer *, doublereal *, integer *);
integer jlast;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dorm2r.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dorm2r.c
index 43ccd3ea94fdcc0675c700f6ad52ffafa40e7a3c..1163b3e5f36594d2f01471cb38e8ec35c0ea0b60 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dorm2r.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dorm2r.c
@@ -35,7 +35,7 @@ static integer c__1 = 1;
extern /* Subroutine */ int dlarf_(char *, integer *, integer *,
doublereal *, integer *, doublereal *, doublereal *, integer *,
doublereal *, ftnlen);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
logical notran;
(void)side_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dormqr.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dormqr.c
index 958035e9599d1d2e067e7141e18c5c211489df53..00cf111d3023e286a6adac5e780ba5c18350039b 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dormqr.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dormqr.c
@@ -42,7 +42,7 @@ static integer c__65 = 65;
doublereal t[4160] /* was [65][64] */;
integer i1, i2, i3, ib, ic=0, jc=0, nb=0, mi, ni, nq, nw, iws;
logical left;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
integer nbmin, iinfo;
extern /* Subroutine */ int dorm2r_(char *, char *, integer *, integer *,
integer *, doublereal *, integer *, doublereal *, doublereal *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dormr2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dormr2.c
index 1e5aa8706deb989edba119a756421c6e1a03442e..56cd463207c1508f7a1729e79a66b410adee3dcf 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dormr2.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dormr2.c
@@ -31,7 +31,7 @@ extern "C" {
extern /* Subroutine */ int dlarf_(char *, integer *, integer *,
doublereal *, integer *, doublereal *, doublereal *, integer *,
doublereal *, ftnlen);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
logical notran;
(void)side_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dspr.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dspr.c
index 14e9fe93f41c3fdd8cb62b38181282ea00872dfc..05c3a6779b4472b904c1bd248903e47bf1de160f 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dspr.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dspr.c
@@ -25,7 +25,7 @@ extern "C" {
/* Local variables */
integer i__, j, k, kk, ix, jx, kx=0, info;
doublereal temp;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
(void)uplo_len;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsptrf.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsptrf.c
index abbc4fd7f0413ebb8fcefc4ca004769ad426d16a..ac058de731a2ed8cbfca5c995b1d3fae41b0ef87 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsptrf.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsptrf.c
@@ -42,7 +42,7 @@ integer *info, ftnlen uplo_len)
doublereal alpha;
extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
integer *);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int dswap_(integer *, doublereal *, integer *,
doublereal *, integer *);
integer kstep;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsptrs.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsptrs.c
index d55baaa0a59d32838662e233354021fb70ebe076..8bfd1dfeac481f1b068dd4eda40776520953d001 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsptrs.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsptrs.c
@@ -41,7 +41,7 @@ static doublereal c_b19 = 1.;
doublereal akm1k;
extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
integer *);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
doublereal denom;
extern /* Subroutine */ int dgemv_(char *, integer *, integer *,
doublereal *, doublereal *, integer *, doublereal *, integer *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.P
new file mode 100644
index 0000000000000000000000000000000000000000..2a423b7be21b3840b76d7619f20f44b77215bf5b
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.P
@@ -0,0 +1,14 @@
+extern int dsteqr_(char *compz, integer *n, doublereal *d__, doublereal *e, doublereal *z__, integer *ldz, doublereal *work, integer *info, ftnlen compz_len);
+/*:ref: lsame_ 12 4 13 13 124 124 */
+/*:ref: xerbla_ 14 3 13 4 124 */
+/*:ref: dlamch_ 7 2 13 124 */
+/*:ref: dlaset_ 14 8 13 4 4 7 7 7 4 124 */
+/*:ref: dlanst_ 7 5 13 4 7 7 124 */
+/*:ref: dlascl_ 14 11 13 4 4 7 7 4 4 7 4 4 124 */
+/*:ref: dlaev2_ 14 7 7 7 7 7 7 7 7 */
+/*:ref: dlasr_ 14 12 13 13 13 4 4 7 7 7 4 124 124 124 */
+/*:ref: dlae2_ 14 5 7 7 7 7 7 */
+/*:ref: dlapy2_ 7 2 7 7 */
+/*:ref: dlartg_ 14 5 7 7 7 7 7 */
+/*:ref: dlasrt_ 14 5 13 4 7 4 124 */
+/*:ref: dswap_ 14 5 4 7 4 7 4 */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.c
new file mode 100644
index 0000000000000000000000000000000000000000..e49d4e35398aed9b53f9c44a0c9c03890c5b4392
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.c
@@ -0,0 +1,892 @@
+/* lapack/double/dsteqr.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/* Table of constant values */
+
+static doublereal c_b9 = 0.;
+static doublereal c_b10 = 1.;
+static integer c__0 = 0;
+static integer c__1 = 1;
+static integer c__2 = 2;
+
+/*< SUBROUTINE DSTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO ) >*/
+/* Subroutine */ int dsteqr_(char *compz, integer *n, doublereal *d__,
+ doublereal *e, doublereal *z__, integer *ldz, doublereal *work,
+ integer *info, ftnlen compz_len)
+{
+ /* System generated locals */
+ integer z_dim1, z_offset, i__1, i__2;
+ doublereal d__1, d__2;
+
+ /* Builtin functions */
+ double sqrt(doublereal), d_sign(doublereal *, doublereal *);
+
+ /* Local variables */
+ doublereal b, c__, f, g;
+ integer i__, j, k, l, m;
+ doublereal p, r__, s;
+ integer l1, ii, mm, lm1, mm1, nm1;
+ doublereal rt1, rt2, eps;
+ integer lsv;
+ doublereal tst, eps2;
+ integer lend, jtot;
+ extern /* Subroutine */ int dlae2_(doublereal *, doublereal *, doublereal
+ *, doublereal *, doublereal *);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
+ extern /* Subroutine */ int dlasr_(char *, char *, char *, integer *,
+ integer *, doublereal *, doublereal *, doublereal *, integer *,
+ ftnlen, ftnlen, ftnlen);
+ doublereal anorm;
+ extern /* Subroutine */ int dswap_(integer *, doublereal *, integer *,
+ doublereal *, integer *), dlaev2_(doublereal *, doublereal *,
+ doublereal *, doublereal *, doublereal *, doublereal *,
+ doublereal *);
+ integer lendm1, lendp1;
+ extern doublereal dlapy2_(doublereal *, doublereal *), dlamch_(char *,
+ ftnlen);
+ integer iscale;
+ extern /* Subroutine */ int dlascl_(char *, integer *, integer *,
+ doublereal *, doublereal *, integer *, integer *, doublereal *,
+ integer *, integer *, ftnlen), dlaset_(char *, integer *, integer
+ *, doublereal *, doublereal *, doublereal *, integer *, ftnlen);
+ doublereal safmin;
+ extern /* Subroutine */ int dlartg_(doublereal *, doublereal *,
+ doublereal *, doublereal *, doublereal *);
+ doublereal safmax;
+ extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
+ extern doublereal dlanst_(char *, integer *, doublereal *, doublereal *,
+ ftnlen);
+ extern /* Subroutine */ int dlasrt_(char *, integer *, doublereal *,
+ integer *, ftnlen);
+ integer lendsv;
+ doublereal ssfmin;
+ integer nmaxit, icompz;
+ doublereal ssfmax;
+
+
+/* -- LAPACK routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< CHARACTER COMPZ >*/
+/*< INTEGER INFO, LDZ, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< DOUBLE PRECISION D( * ), E( * ), WORK( * ), Z( LDZ, * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* DSTEQR computes all eigenvalues and, optionally, eigenvectors of a */
+/* symmetric tridiagonal matrix using the implicit QL or QR method. */
+/* The eigenvectors of a full or band symmetric matrix can also be found */
+/* if DSYTRD or DSPTRD or DSBTRD has been used to reduce this matrix to */
+/* tridiagonal form. */
+
+/* Arguments */
+/* ========= */
+
+/* COMPZ (input) CHARACTER*1 */
+/* = 'N': Compute eigenvalues only. */
+/* = 'V': Compute eigenvalues and eigenvectors of the original */
+/* symmetric matrix. On entry, Z must contain the */
+/* orthogonal matrix used to reduce the original matrix */
+/* to tridiagonal form. */
+/* = 'I': Compute eigenvalues and eigenvectors of the */
+/* tridiagonal matrix. Z is initialized to the identity */
+/* matrix. */
+
+/* N (input) INTEGER */
+/* The order of the matrix. N >= 0. */
+
+/* D (input/output) DOUBLE PRECISION array, dimension (N) */
+/* On entry, the diagonal elements of the tridiagonal matrix. */
+/* On exit, if INFO = 0, the eigenvalues in ascending order. */
+
+/* E (input/output) DOUBLE PRECISION array, dimension (N-1) */
+/* On entry, the (n-1) subdiagonal elements of the tridiagonal */
+/* matrix. */
+/* On exit, E has been destroyed. */
+
+/* Z (input/output) DOUBLE PRECISION array, dimension (LDZ, N) */
+/* On entry, if COMPZ = 'V', then Z contains the orthogonal */
+/* matrix used in the reduction to tridiagonal form. */
+/* On exit, if INFO = 0, then if COMPZ = 'V', Z contains the */
+/* orthonormal eigenvectors of the original symmetric matrix, */
+/* and if COMPZ = 'I', Z contains the orthonormal eigenvectors */
+/* of the symmetric tridiagonal matrix. */
+/* If COMPZ = 'N', then Z is not referenced. */
+
+/* LDZ (input) INTEGER */
+/* The leading dimension of the array Z. LDZ >= 1, and if */
+/* eigenvectors are desired, then LDZ >= max(1,N). */
+
+/* WORK (workspace) DOUBLE PRECISION array, dimension (max(1,2*N-2)) */
+/* If COMPZ = 'N', then WORK is not referenced. */
+
+/* INFO (output) INTEGER */
+/* = 0: successful exit */
+/* < 0: if INFO = -i, the i-th argument had an illegal value */
+/* > 0: the algorithm has failed to find all the eigenvalues in */
+/* a total of 30*N iterations; if INFO = i, then i */
+/* elements of E have not converged to zero; on exit, D */
+/* and E contain the elements of a symmetric tridiagonal */
+/* matrix which is orthogonally similar to the original */
+/* matrix. */
+
+/* ===================================================================== */
+
+/* .. Parameters .. */
+/*< DOUBLE PRECISION ZERO, ONE, TWO, THREE >*/
+/*< >*/
+/*< INTEGER MAXIT >*/
+/*< PARAMETER ( MAXIT = 30 ) >*/
+/* .. */
+/* .. Local Scalars .. */
+/*< >*/
+/*< >*/
+/* .. */
+/* .. External Functions .. */
+/*< LOGICAL LSAME >*/
+/*< DOUBLE PRECISION DLAMCH, DLANST, DLAPY2 >*/
+/*< EXTERNAL LSAME, DLAMCH, DLANST, DLAPY2 >*/
+/* .. */
+/* .. External Subroutines .. */
+/*< >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS, MAX, SIGN, SQRT >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/* Test the input parameters. */
+
+/*< INFO = 0 >*/
+ /* Parameter adjustments */
+ --d__;
+ --e;
+ z_dim1 = *ldz;
+ z_offset = 1 + z_dim1;
+ z__ -= z_offset;
+ --work;
+
+ /* Function Body */
+ *info = 0;
+
+/*< IF( LSAME( COMPZ, 'N' ) ) THEN >*/
+ if (lsame_(compz, "N", (ftnlen)1, (ftnlen)1)) {
+/*< ICOMPZ = 0 >*/
+ icompz = 0;
+/*< ELSE IF( LSAME( COMPZ, 'V' ) ) THEN >*/
+ } else if (lsame_(compz, "V", (ftnlen)1, (ftnlen)1)) {
+/*< ICOMPZ = 1 >*/
+ icompz = 1;
+/*< ELSE IF( LSAME( COMPZ, 'I' ) ) THEN >*/
+ } else if (lsame_(compz, "I", (ftnlen)1, (ftnlen)1)) {
+/*< ICOMPZ = 2 >*/
+ icompz = 2;
+/*< ELSE >*/
+ } else {
+/*< ICOMPZ = -1 >*/
+ icompz = -1;
+/*< END IF >*/
+ }
+/*< IF( ICOMPZ.LT.0 ) THEN >*/
+ if (icompz < 0) {
+/*< INFO = -1 >*/
+ *info = -1;
+/*< ELSE IF( N.LT.0 ) THEN >*/
+ } else if (*n < 0) {
+/*< INFO = -2 >*/
+ *info = -2;
+/*< >*/
+ } else if (*ldz < 1 || (icompz > 0 && *ldz < max(1,*n))) {
+/*< INFO = -6 >*/
+ *info = -6;
+/*< END IF >*/
+ }
+/*< IF( INFO.NE.0 ) THEN >*/
+ if (*info != 0) {
+/*< CALL XERBLA( 'DSTEQR', -INFO ) >*/
+ i__1 = -(*info);
+ xerbla_("DSTEQR", &i__1, (ftnlen)6);
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Quick return if possible */
+
+/*< >*/
+ if (*n == 0) {
+ return 0;
+ }
+
+/*< IF( N.EQ.1 ) THEN >*/
+ if (*n == 1) {
+/*< >*/
+ if (icompz == 2) {
+ z__[z_dim1 + 1] = 1.;
+ }
+/*< RETURN >*/
+ return 0;
+/*< END IF >*/
+ }
+
+/* Determine the unit roundoff and over/underflow thresholds. */
+
+/*< EPS = DLAMCH( 'E' ) >*/
+ eps = dlamch_("E", (ftnlen)1);
+/*< EPS2 = EPS**2 >*/
+/* Computing 2nd power */
+ d__1 = eps;
+ eps2 = d__1 * d__1;
+/*< SAFMIN = DLAMCH( 'S' ) >*/
+ safmin = dlamch_("S", (ftnlen)1);
+/*< SAFMAX = ONE / SAFMIN >*/
+ safmax = 1. / safmin;
+/*< SSFMAX = SQRT( SAFMAX ) / THREE >*/
+ ssfmax = sqrt(safmax) / 3.;
+/*< SSFMIN = SQRT( SAFMIN ) / EPS2 >*/
+ ssfmin = sqrt(safmin) / eps2;
+
+/* Compute the eigenvalues and eigenvectors of the tridiagonal */
+/* matrix. */
+
+/*< >*/
+ if (icompz == 2) {
+ dlaset_("Full", n, n, &c_b9, &c_b10, &z__[z_offset], ldz, (ftnlen)4);
+ }
+
+/*< NMAXIT = N*MAXIT >*/
+ nmaxit = *n * 30;
+/*< JTOT = 0 >*/
+ jtot = 0;
+
+/* Determine where the matrix splits and choose QL or QR iteration */
+/* for each block, according to whether top or bottom diagonal */
+/* element is smaller. */
+
+/*< L1 = 1 >*/
+ l1 = 1;
+/*< NM1 = N - 1 >*/
+ nm1 = *n - 1;
+
+/*< 10 CONTINUE >*/
+L10:
+/*< >*/
+ if (l1 > *n) {
+ goto L160;
+ }
+/*< >*/
+ if (l1 > 1) {
+ e[l1 - 1] = 0.;
+ }
+/*< IF( L1.LE.NM1 ) THEN >*/
+ if (l1 <= nm1) {
+/*< DO 20 M = L1, NM1 >*/
+ i__1 = nm1;
+ for (m = l1; m <= i__1; ++m) {
+/*< TST = ABS( E( M ) ) >*/
+ tst = (d__1 = e[m], abs(d__1));
+/*< >*/
+ if (tst == 0.) {
+ goto L30;
+ }
+/*< >*/
+ if (tst <= sqrt((d__1 = d__[m], abs(d__1))) * sqrt((d__2 = d__[m
+ + 1], abs(d__2))) * eps) {
+/*< E( M ) = ZERO >*/
+ e[m] = 0.;
+/*< GO TO 30 >*/
+ goto L30;
+/*< END IF >*/
+ }
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< END IF >*/
+ }
+/*< M = N >*/
+ m = *n;
+
+/*< 30 CONTINUE >*/
+L30:
+/*< L = L1 >*/
+ l = l1;
+/*< LSV = L >*/
+ lsv = l;
+/*< LEND = M >*/
+ lend = m;
+/*< LENDSV = LEND >*/
+ lendsv = lend;
+/*< L1 = M + 1 >*/
+ l1 = m + 1;
+/*< >*/
+ if (lend == l) {
+ goto L10;
+ }
+
+/* Scale submatrix in rows and columns L to LEND */
+
+/*< ANORM = DLANST( 'I', LEND-L+1, D( L ), E( L ) ) >*/
+ i__1 = lend - l + 1;
+ anorm = dlanst_("I", &i__1, &d__[l], &e[l], (ftnlen)1);
+/*< ISCALE = 0 >*/
+ iscale = 0;
+/*< >*/
+ if (anorm == 0.) {
+ goto L10;
+ }
+/*< IF( ANORM.GT.SSFMAX ) THEN >*/
+ if (anorm > ssfmax) {
+/*< ISCALE = 1 >*/
+ iscale = 1;
+/*< >*/
+ i__1 = lend - l + 1;
+ dlascl_("G", &c__0, &c__0, &anorm, &ssfmax, &i__1, &c__1, &d__[l], n,
+ info, (ftnlen)1);
+/*< >*/
+ i__1 = lend - l;
+ dlascl_("G", &c__0, &c__0, &anorm, &ssfmax, &i__1, &c__1, &e[l], n,
+ info, (ftnlen)1);
+/*< ELSE IF( ANORM.LT.SSFMIN ) THEN >*/
+ } else if (anorm < ssfmin) {
+/*< ISCALE = 2 >*/
+ iscale = 2;
+/*< >*/
+ i__1 = lend - l + 1;
+ dlascl_("G", &c__0, &c__0, &anorm, &ssfmin, &i__1, &c__1, &d__[l], n,
+ info, (ftnlen)1);
+/*< >*/
+ i__1 = lend - l;
+ dlascl_("G", &c__0, &c__0, &anorm, &ssfmin, &i__1, &c__1, &e[l], n,
+ info, (ftnlen)1);
+/*< END IF >*/
+ }
+
+/* Choose between QL and QR iteration */
+
+/*< IF( ABS( D( LEND ) ).LT.ABS( D( L ) ) ) THEN >*/
+ if ((d__1 = d__[lend], abs(d__1)) < (d__2 = d__[l], abs(d__2))) {
+/*< LEND = LSV >*/
+ lend = lsv;
+/*< L = LENDSV >*/
+ l = lendsv;
+/*< END IF >*/
+ }
+
+/*< IF( LEND.GT.L ) THEN >*/
+ if (lend > l) {
+
+/* QL Iteration */
+
+/* Look for small subdiagonal element. */
+
+/*< 40 CONTINUE >*/
+L40:
+/*< IF( L.NE.LEND ) THEN >*/
+ if (l != lend) {
+/*< LENDM1 = LEND - 1 >*/
+ lendm1 = lend - 1;
+/*< DO 50 M = L, LENDM1 >*/
+ i__1 = lendm1;
+ for (m = l; m <= i__1; ++m) {
+/*< TST = ABS( E( M ) )**2 >*/
+/* Computing 2nd power */
+ d__2 = (d__1 = e[m], abs(d__1));
+ tst = d__2 * d__2;
+/*< >*/
+ if (tst <= eps2 * (d__1 = d__[m], abs(d__1)) * (d__2 = d__[m
+ + 1], abs(d__2)) + safmin) {
+ goto L60;
+ }
+/*< 50 CONTINUE >*/
+/* L50: */
+ }
+/*< END IF >*/
+ }
+
+/*< M = LEND >*/
+ m = lend;
+
+/*< 60 CONTINUE >*/
+L60:
+/*< >*/
+ if (m < lend) {
+ e[m] = 0.;
+ }
+/*< P = D( L ) >*/
+ p = d__[l];
+/*< >*/
+ if (m == l) {
+ goto L80;
+ }
+
+/* If remaining matrix is 2-by-2, use DLAE2 or SLAEV2 */
+/* to compute its eigensystem. */
+
+/*< IF( M.EQ.L+1 ) THEN >*/
+ if (m == l + 1) {
+/*< IF( ICOMPZ.GT.0 ) THEN >*/
+ if (icompz > 0) {
+/*< CALL DLAEV2( D( L ), E( L ), D( L+1 ), RT1, RT2, C, S ) >*/
+ dlaev2_(&d__[l], &e[l], &d__[l + 1], &rt1, &rt2, &c__, &s);
+/*< WORK( L ) = C >*/
+ work[l] = c__;
+/*< WORK( N-1+L ) = S >*/
+ work[*n - 1 + l] = s;
+/*< >*/
+ dlasr_("R", "V", "B", n, &c__2, &work[l], &work[*n - 1 + l], &
+ z__[l * z_dim1 + 1], ldz, (ftnlen)1, (ftnlen)1, (
+ ftnlen)1);
+/*< ELSE >*/
+ } else {
+/*< CALL DLAE2( D( L ), E( L ), D( L+1 ), RT1, RT2 ) >*/
+ dlae2_(&d__[l], &e[l], &d__[l + 1], &rt1, &rt2);
+/*< END IF >*/
+ }
+/*< D( L ) = RT1 >*/
+ d__[l] = rt1;
+/*< D( L+1 ) = RT2 >*/
+ d__[l + 1] = rt2;
+/*< E( L ) = ZERO >*/
+ e[l] = 0.;
+/*< L = L + 2 >*/
+ l += 2;
+/*< >*/
+ if (l <= lend) {
+ goto L40;
+ }
+/*< GO TO 140 >*/
+ goto L140;
+/*< END IF >*/
+ }
+
+/*< >*/
+ if (jtot == nmaxit) {
+ goto L140;
+ }
+/*< JTOT = JTOT + 1 >*/
+ ++jtot;
+
+/* Form shift. */
+
+/*< G = ( D( L+1 )-P ) / ( TWO*E( L ) ) >*/
+ g = (d__[l + 1] - p) / (e[l] * 2.);
+/*< R = DLAPY2( G, ONE ) >*/
+ r__ = dlapy2_(&g, &c_b10);
+/*< G = D( M ) - P + ( E( L ) / ( G+SIGN( R, G ) ) ) >*/
+ g = d__[m] - p + e[l] / (g + d_sign(&r__, &g));
+
+/*< S = ONE >*/
+ s = 1.;
+/*< C = ONE >*/
+ c__ = 1.;
+/*< P = ZERO >*/
+ p = 0.;
+
+/* Inner loop */
+
+/*< MM1 = M - 1 >*/
+ mm1 = m - 1;
+/*< DO 70 I = MM1, L, -1 >*/
+ i__1 = l;
+ for (i__ = mm1; i__ >= i__1; --i__) {
+/*< F = S*E( I ) >*/
+ f = s * e[i__];
+/*< B = C*E( I ) >*/
+ b = c__ * e[i__];
+/*< CALL DLARTG( G, F, C, S, R ) >*/
+ dlartg_(&g, &f, &c__, &s, &r__);
+/*< >*/
+ if (i__ != m - 1) {
+ e[i__ + 1] = r__;
+ }
+/*< G = D( I+1 ) - P >*/
+ g = d__[i__ + 1] - p;
+/*< R = ( D( I )-G )*S + TWO*C*B >*/
+ r__ = (d__[i__] - g) * s + c__ * 2. * b;
+/*< P = S*R >*/
+ p = s * r__;
+/*< D( I+1 ) = G + P >*/
+ d__[i__ + 1] = g + p;
+/*< G = C*R - B >*/
+ g = c__ * r__ - b;
+
+/* If eigenvectors are desired, then save rotations. */
+
+/*< IF( ICOMPZ.GT.0 ) THEN >*/
+ if (icompz > 0) {
+/*< WORK( I ) = C >*/
+ work[i__] = c__;
+/*< WORK( N-1+I ) = -S >*/
+ work[*n - 1 + i__] = -s;
+/*< END IF >*/
+ }
+
+/*< 70 CONTINUE >*/
+/* L70: */
+ }
+
+/* If eigenvectors are desired, then apply saved rotations. */
+
+/*< IF( ICOMPZ.GT.0 ) THEN >*/
+ if (icompz > 0) {
+/*< MM = M - L + 1 >*/
+ mm = m - l + 1;
+/*< >*/
+ dlasr_("R", "V", "B", n, &mm, &work[l], &work[*n - 1 + l], &z__[l
+ * z_dim1 + 1], ldz, (ftnlen)1, (ftnlen)1, (ftnlen)1);
+/*< END IF >*/
+ }
+
+/*< D( L ) = D( L ) - P >*/
+ d__[l] -= p;
+/*< E( L ) = G >*/
+ e[l] = g;
+/*< GO TO 40 >*/
+ goto L40;
+
+/* Eigenvalue found. */
+
+/*< 80 CONTINUE >*/
+L80:
+/*< D( L ) = P >*/
+ d__[l] = p;
+
+/*< L = L + 1 >*/
+ ++l;
+/*< >*/
+ if (l <= lend) {
+ goto L40;
+ }
+/*< GO TO 140 >*/
+ goto L140;
+
+/*< ELSE >*/
+ } else {
+
+/* QR Iteration */
+
+/* Look for small superdiagonal element. */
+
+/*< 90 CONTINUE >*/
+L90:
+/*< IF( L.NE.LEND ) THEN >*/
+ if (l != lend) {
+/*< LENDP1 = LEND + 1 >*/
+ lendp1 = lend + 1;
+/*< DO 100 M = L, LENDP1, -1 >*/
+ i__1 = lendp1;
+ for (m = l; m >= i__1; --m) {
+/*< TST = ABS( E( M-1 ) )**2 >*/
+/* Computing 2nd power */
+ d__2 = (d__1 = e[m - 1], abs(d__1));
+ tst = d__2 * d__2;
+/*< >*/
+ if (tst <= eps2 * (d__1 = d__[m], abs(d__1)) * (d__2 = d__[m
+ - 1], abs(d__2)) + safmin) {
+ goto L110;
+ }
+/*< 100 CONTINUE >*/
+/* L100: */
+ }
+/*< END IF >*/
+ }
+
+/*< M = LEND >*/
+ m = lend;
+
+/*< 110 CONTINUE >*/
+L110:
+/*< >*/
+ if (m > lend) {
+ e[m - 1] = 0.;
+ }
+/*< P = D( L ) >*/
+ p = d__[l];
+/*< >*/
+ if (m == l) {
+ goto L130;
+ }
+
+/* If remaining matrix is 2-by-2, use DLAE2 or SLAEV2 */
+/* to compute its eigensystem. */
+
+/*< IF( M.EQ.L-1 ) THEN >*/
+ if (m == l - 1) {
+/*< IF( ICOMPZ.GT.0 ) THEN >*/
+ if (icompz > 0) {
+/*< CALL DLAEV2( D( L-1 ), E( L-1 ), D( L ), RT1, RT2, C, S ) >*/
+ dlaev2_(&d__[l - 1], &e[l - 1], &d__[l], &rt1, &rt2, &c__, &s)
+ ;
+/*< WORK( M ) = C >*/
+ work[m] = c__;
+/*< WORK( N-1+M ) = S >*/
+ work[*n - 1 + m] = s;
+/*< >*/
+ dlasr_("R", "V", "F", n, &c__2, &work[m], &work[*n - 1 + m], &
+ z__[(l - 1) * z_dim1 + 1], ldz, (ftnlen)1, (ftnlen)1,
+ (ftnlen)1);
+/*< ELSE >*/
+ } else {
+/*< CALL DLAE2( D( L-1 ), E( L-1 ), D( L ), RT1, RT2 ) >*/
+ dlae2_(&d__[l - 1], &e[l - 1], &d__[l], &rt1, &rt2);
+/*< END IF >*/
+ }
+/*< D( L-1 ) = RT1 >*/
+ d__[l - 1] = rt1;
+/*< D( L ) = RT2 >*/
+ d__[l] = rt2;
+/*< E( L-1 ) = ZERO >*/
+ e[l - 1] = 0.;
+/*< L = L - 2 >*/
+ l += -2;
+/*< >*/
+ if (l >= lend) {
+ goto L90;
+ }
+/*< GO TO 140 >*/
+ goto L140;
+/*< END IF >*/
+ }
+
+/*< >*/
+ if (jtot == nmaxit) {
+ goto L140;
+ }
+/*< JTOT = JTOT + 1 >*/
+ ++jtot;
+
+/* Form shift. */
+
+/*< G = ( D( L-1 )-P ) / ( TWO*E( L-1 ) ) >*/
+ g = (d__[l - 1] - p) / (e[l - 1] * 2.);
+/*< R = DLAPY2( G, ONE ) >*/
+ r__ = dlapy2_(&g, &c_b10);
+/*< G = D( M ) - P + ( E( L-1 ) / ( G+SIGN( R, G ) ) ) >*/
+ g = d__[m] - p + e[l - 1] / (g + d_sign(&r__, &g));
+
+/*< S = ONE >*/
+ s = 1.;
+/*< C = ONE >*/
+ c__ = 1.;
+/*< P = ZERO >*/
+ p = 0.;
+
+/* Inner loop */
+
+/*< LM1 = L - 1 >*/
+ lm1 = l - 1;
+/*< DO 120 I = M, LM1 >*/
+ i__1 = lm1;
+ for (i__ = m; i__ <= i__1; ++i__) {
+/*< F = S*E( I ) >*/
+ f = s * e[i__];
+/*< B = C*E( I ) >*/
+ b = c__ * e[i__];
+/*< CALL DLARTG( G, F, C, S, R ) >*/
+ dlartg_(&g, &f, &c__, &s, &r__);
+/*< >*/
+ if (i__ != m) {
+ e[i__ - 1] = r__;
+ }
+/*< G = D( I ) - P >*/
+ g = d__[i__] - p;
+/*< R = ( D( I+1 )-G )*S + TWO*C*B >*/
+ r__ = (d__[i__ + 1] - g) * s + c__ * 2. * b;
+/*< P = S*R >*/
+ p = s * r__;
+/*< D( I ) = G + P >*/
+ d__[i__] = g + p;
+/*< G = C*R - B >*/
+ g = c__ * r__ - b;
+
+/* If eigenvectors are desired, then save rotations. */
+
+/*< IF( ICOMPZ.GT.0 ) THEN >*/
+ if (icompz > 0) {
+/*< WORK( I ) = C >*/
+ work[i__] = c__;
+/*< WORK( N-1+I ) = S >*/
+ work[*n - 1 + i__] = s;
+/*< END IF >*/
+ }
+
+/*< 120 CONTINUE >*/
+/* L120: */
+ }
+
+/* If eigenvectors are desired, then apply saved rotations. */
+
+/*< IF( ICOMPZ.GT.0 ) THEN >*/
+ if (icompz > 0) {
+/*< MM = L - M + 1 >*/
+ mm = l - m + 1;
+/*< >*/
+ dlasr_("R", "V", "F", n, &mm, &work[m], &work[*n - 1 + m], &z__[m
+ * z_dim1 + 1], ldz, (ftnlen)1, (ftnlen)1, (ftnlen)1);
+/*< END IF >*/
+ }
+
+/*< D( L ) = D( L ) - P >*/
+ d__[l] -= p;
+/*< E( LM1 ) = G >*/
+ e[lm1] = g;
+/*< GO TO 90 >*/
+ goto L90;
+
+/* Eigenvalue found. */
+
+/*< 130 CONTINUE >*/
+L130:
+/*< D( L ) = P >*/
+ d__[l] = p;
+
+/*< L = L - 1 >*/
+ --l;
+/*< >*/
+ if (l >= lend) {
+ goto L90;
+ }
+/*< GO TO 140 >*/
+ goto L140;
+
+/*< END IF >*/
+ }
+
+/* Undo scaling if necessary */
+
+/*< 140 CONTINUE >*/
+L140:
+/*< IF( ISCALE.EQ.1 ) THEN >*/
+ if (iscale == 1) {
+/*< >*/
+ i__1 = lendsv - lsv + 1;
+ dlascl_("G", &c__0, &c__0, &ssfmax, &anorm, &i__1, &c__1, &d__[lsv],
+ n, info, (ftnlen)1);
+/*< >*/
+ i__1 = lendsv - lsv;
+ dlascl_("G", &c__0, &c__0, &ssfmax, &anorm, &i__1, &c__1, &e[lsv], n,
+ info, (ftnlen)1);
+/*< ELSE IF( ISCALE.EQ.2 ) THEN >*/
+ } else if (iscale == 2) {
+/*< >*/
+ i__1 = lendsv - lsv + 1;
+ dlascl_("G", &c__0, &c__0, &ssfmin, &anorm, &i__1, &c__1, &d__[lsv],
+ n, info, (ftnlen)1);
+/*< >*/
+ i__1 = lendsv - lsv;
+ dlascl_("G", &c__0, &c__0, &ssfmin, &anorm, &i__1, &c__1, &e[lsv], n,
+ info, (ftnlen)1);
+/*< END IF >*/
+ }
+
+/* Check for no convergence to an eigenvalue after a total */
+/* of N*MAXIT iterations. */
+
+/*< >*/
+ if (jtot < nmaxit) {
+ goto L10;
+ }
+/*< DO 150 I = 1, N - 1 >*/
+ i__1 = *n - 1;
+ for (i__ = 1; i__ <= i__1; ++i__) {
+/*< >*/
+ if (e[i__] != 0.) {
+ ++(*info);
+ }
+/*< 150 CONTINUE >*/
+/* L150: */
+ }
+/*< GO TO 190 >*/
+ goto L190;
+
+/* Order eigenvalues and eigenvectors. */
+
+/*< 160 CONTINUE >*/
+L160:
+/*< IF( ICOMPZ.EQ.0 ) THEN >*/
+ if (icompz == 0) {
+
+/* Use Quick Sort */
+
+/*< CALL DLASRT( 'I', N, D, INFO ) >*/
+ dlasrt_("I", n, &d__[1], info, (ftnlen)1);
+
+/*< ELSE >*/
+ } else {
+
+/* Use Selection Sort to minimize swaps of eigenvectors */
+
+/*< DO 180 II = 2, N >*/
+ i__1 = *n;
+ for (ii = 2; ii <= i__1; ++ii) {
+/*< I = II - 1 >*/
+ i__ = ii - 1;
+/*< K = I >*/
+ k = i__;
+/*< P = D( I ) >*/
+ p = d__[i__];
+/*< DO 170 J = II, N >*/
+ i__2 = *n;
+ for (j = ii; j <= i__2; ++j) {
+/*< IF( D( J ).LT.P ) THEN >*/
+ if (d__[j] < p) {
+/*< K = J >*/
+ k = j;
+/*< P = D( J ) >*/
+ p = d__[j];
+/*< END IF >*/
+ }
+/*< 170 CONTINUE >*/
+/* L170: */
+ }
+/*< IF( K.NE.I ) THEN >*/
+ if (k != i__) {
+/*< D( K ) = D( I ) >*/
+ d__[k] = d__[i__];
+/*< D( I ) = P >*/
+ d__[i__] = p;
+/*< CALL DSWAP( N, Z( 1, I ), 1, Z( 1, K ), 1 ) >*/
+ dswap_(n, &z__[i__ * z_dim1 + 1], &c__1, &z__[k * z_dim1 + 1],
+ &c__1);
+/*< END IF >*/
+ }
+/*< 180 CONTINUE >*/
+/* L180: */
+ }
+/*< END IF >*/
+ }
+
+/*< 190 CONTINUE >*/
+L190:
+/*< RETURN >*/
+ return 0;
+
+/* End of DSTEQR */
+
+/*< END >*/
+} /* dsteqr_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.f
new file mode 100644
index 0000000000000000000000000000000000000000..a0ec5cdb523644fd51281a1c93a9b3352ed23623
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.f
@@ -0,0 +1,501 @@
+ SUBROUTINE DSTEQR( COMPZ, N, D, E, Z, LDZ, WORK, INFO )
+*
+* -- LAPACK routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ CHARACTER COMPZ
+ INTEGER INFO, LDZ, N
+* ..
+* .. Array Arguments ..
+ DOUBLE PRECISION D( * ), E( * ), WORK( * ), Z( LDZ, * )
+* ..
+*
+* Purpose
+* =======
+*
+* DSTEQR computes all eigenvalues and, optionally, eigenvectors of a
+* symmetric tridiagonal matrix using the implicit QL or QR method.
+* The eigenvectors of a full or band symmetric matrix can also be found
+* if DSYTRD or DSPTRD or DSBTRD has been used to reduce this matrix to
+* tridiagonal form.
+*
+* Arguments
+* =========
+*
+* COMPZ (input) CHARACTER*1
+* = 'N': Compute eigenvalues only.
+* = 'V': Compute eigenvalues and eigenvectors of the original
+* symmetric matrix. On entry, Z must contain the
+* orthogonal matrix used to reduce the original matrix
+* to tridiagonal form.
+* = 'I': Compute eigenvalues and eigenvectors of the
+* tridiagonal matrix. Z is initialized to the identity
+* matrix.
+*
+* N (input) INTEGER
+* The order of the matrix. N >= 0.
+*
+* D (input/output) DOUBLE PRECISION array, dimension (N)
+* On entry, the diagonal elements of the tridiagonal matrix.
+* On exit, if INFO = 0, the eigenvalues in ascending order.
+*
+* E (input/output) DOUBLE PRECISION array, dimension (N-1)
+* On entry, the (n-1) subdiagonal elements of the tridiagonal
+* matrix.
+* On exit, E has been destroyed.
+*
+* Z (input/output) DOUBLE PRECISION array, dimension (LDZ, N)
+* On entry, if COMPZ = 'V', then Z contains the orthogonal
+* matrix used in the reduction to tridiagonal form.
+* On exit, if INFO = 0, then if COMPZ = 'V', Z contains the
+* orthonormal eigenvectors of the original symmetric matrix,
+* and if COMPZ = 'I', Z contains the orthonormal eigenvectors
+* of the symmetric tridiagonal matrix.
+* If COMPZ = 'N', then Z is not referenced.
+*
+* LDZ (input) INTEGER
+* The leading dimension of the array Z. LDZ >= 1, and if
+* eigenvectors are desired, then LDZ >= max(1,N).
+*
+* WORK (workspace) DOUBLE PRECISION array, dimension (max(1,2*N-2))
+* If COMPZ = 'N', then WORK is not referenced.
+*
+* INFO (output) INTEGER
+* = 0: successful exit
+* < 0: if INFO = -i, the i-th argument had an illegal value
+* > 0: the algorithm has failed to find all the eigenvalues in
+* a total of 30*N iterations; if INFO = i, then i
+* elements of E have not converged to zero; on exit, D
+* and E contain the elements of a symmetric tridiagonal
+* matrix which is orthogonally similar to the original
+* matrix.
+*
+* =====================================================================
+*
+* .. Parameters ..
+ DOUBLE PRECISION ZERO, ONE, TWO, THREE
+ PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0, TWO = 2.0D0,
+ $ THREE = 3.0D0 )
+ INTEGER MAXIT
+ PARAMETER ( MAXIT = 30 )
+* ..
+* .. Local Scalars ..
+ INTEGER I, ICOMPZ, II, ISCALE, J, JTOT, K, L, L1, LEND,
+ $ LENDM1, LENDP1, LENDSV, LM1, LSV, M, MM, MM1,
+ $ NM1, NMAXIT
+ DOUBLE PRECISION ANORM, B, C, EPS, EPS2, F, G, P, R, RT1, RT2,
+ $ S, SAFMAX, SAFMIN, SSFMAX, SSFMIN, TST
+* ..
+* .. External Functions ..
+ LOGICAL LSAME
+ DOUBLE PRECISION DLAMCH, DLANST, DLAPY2
+ EXTERNAL LSAME, DLAMCH, DLANST, DLAPY2
+* ..
+* .. External Subroutines ..
+ EXTERNAL DLAE2, DLAEV2, DLARTG, DLASCL, DLASET, DLASR,
+ $ DLASRT, DSWAP, XERBLA
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS, MAX, SIGN, SQRT
+* ..
+* .. Executable Statements ..
+*
+* Test the input parameters.
+*
+ INFO = 0
+*
+ IF( LSAME( COMPZ, 'N' ) ) THEN
+ ICOMPZ = 0
+ ELSE IF( LSAME( COMPZ, 'V' ) ) THEN
+ ICOMPZ = 1
+ ELSE IF( LSAME( COMPZ, 'I' ) ) THEN
+ ICOMPZ = 2
+ ELSE
+ ICOMPZ = -1
+ END IF
+ IF( ICOMPZ.LT.0 ) THEN
+ INFO = -1
+ ELSE IF( N.LT.0 ) THEN
+ INFO = -2
+ ELSE IF( ( LDZ.LT.1 ) .OR. ( ICOMPZ.GT.0 .AND. LDZ.LT.MAX( 1,
+ $ N ) ) ) THEN
+ INFO = -6
+ END IF
+ IF( INFO.NE.0 ) THEN
+ CALL XERBLA( 'DSTEQR', -INFO )
+ RETURN
+ END IF
+*
+* Quick return if possible
+*
+ IF( N.EQ.0 )
+ $ RETURN
+*
+ IF( N.EQ.1 ) THEN
+ IF( ICOMPZ.EQ.2 )
+ $ Z( 1, 1 ) = ONE
+ RETURN
+ END IF
+*
+* Determine the unit roundoff and over/underflow thresholds.
+*
+ EPS = DLAMCH( 'E' )
+ EPS2 = EPS**2
+ SAFMIN = DLAMCH( 'S' )
+ SAFMAX = ONE / SAFMIN
+ SSFMAX = SQRT( SAFMAX ) / THREE
+ SSFMIN = SQRT( SAFMIN ) / EPS2
+*
+* Compute the eigenvalues and eigenvectors of the tridiagonal
+* matrix.
+*
+ IF( ICOMPZ.EQ.2 )
+ $ CALL DLASET( 'Full', N, N, ZERO, ONE, Z, LDZ )
+*
+ NMAXIT = N*MAXIT
+ JTOT = 0
+*
+* Determine where the matrix splits and choose QL or QR iteration
+* for each block, according to whether top or bottom diagonal
+* element is smaller.
+*
+ L1 = 1
+ NM1 = N - 1
+*
+ 10 CONTINUE
+ IF( L1.GT.N )
+ $ GO TO 160
+ IF( L1.GT.1 )
+ $ E( L1-1 ) = ZERO
+ IF( L1.LE.NM1 ) THEN
+ DO 20 M = L1, NM1
+ TST = ABS( E( M ) )
+ IF( TST.EQ.ZERO )
+ $ GO TO 30
+ IF( TST.LE.( SQRT( ABS( D( M ) ) )*SQRT( ABS( D( M+
+ $ 1 ) ) ) )*EPS ) THEN
+ E( M ) = ZERO
+ GO TO 30
+ END IF
+ 20 CONTINUE
+ END IF
+ M = N
+*
+ 30 CONTINUE
+ L = L1
+ LSV = L
+ LEND = M
+ LENDSV = LEND
+ L1 = M + 1
+ IF( LEND.EQ.L )
+ $ GO TO 10
+*
+* Scale submatrix in rows and columns L to LEND
+*
+ ANORM = DLANST( 'I', LEND-L+1, D( L ), E( L ) )
+ ISCALE = 0
+ IF( ANORM.EQ.ZERO )
+ $ GO TO 10
+ IF( ANORM.GT.SSFMAX ) THEN
+ ISCALE = 1
+ CALL DLASCL( 'G', 0, 0, ANORM, SSFMAX, LEND-L+1, 1, D( L ), N,
+ $ INFO )
+ CALL DLASCL( 'G', 0, 0, ANORM, SSFMAX, LEND-L, 1, E( L ), N,
+ $ INFO )
+ ELSE IF( ANORM.LT.SSFMIN ) THEN
+ ISCALE = 2
+ CALL DLASCL( 'G', 0, 0, ANORM, SSFMIN, LEND-L+1, 1, D( L ), N,
+ $ INFO )
+ CALL DLASCL( 'G', 0, 0, ANORM, SSFMIN, LEND-L, 1, E( L ), N,
+ $ INFO )
+ END IF
+*
+* Choose between QL and QR iteration
+*
+ IF( ABS( D( LEND ) ).LT.ABS( D( L ) ) ) THEN
+ LEND = LSV
+ L = LENDSV
+ END IF
+*
+ IF( LEND.GT.L ) THEN
+*
+* QL Iteration
+*
+* Look for small subdiagonal element.
+*
+ 40 CONTINUE
+ IF( L.NE.LEND ) THEN
+ LENDM1 = LEND - 1
+ DO 50 M = L, LENDM1
+ TST = ABS( E( M ) )**2
+ IF( TST.LE.( EPS2*ABS( D( M ) ) )*ABS( D( M+1 ) )+
+ $ SAFMIN )GO TO 60
+ 50 CONTINUE
+ END IF
+*
+ M = LEND
+*
+ 60 CONTINUE
+ IF( M.LT.LEND )
+ $ E( M ) = ZERO
+ P = D( L )
+ IF( M.EQ.L )
+ $ GO TO 80
+*
+* If remaining matrix is 2-by-2, use DLAE2 or SLAEV2
+* to compute its eigensystem.
+*
+ IF( M.EQ.L+1 ) THEN
+ IF( ICOMPZ.GT.0 ) THEN
+ CALL DLAEV2( D( L ), E( L ), D( L+1 ), RT1, RT2, C, S )
+ WORK( L ) = C
+ WORK( N-1+L ) = S
+ CALL DLASR( 'R', 'V', 'B', N, 2, WORK( L ),
+ $ WORK( N-1+L ), Z( 1, L ), LDZ )
+ ELSE
+ CALL DLAE2( D( L ), E( L ), D( L+1 ), RT1, RT2 )
+ END IF
+ D( L ) = RT1
+ D( L+1 ) = RT2
+ E( L ) = ZERO
+ L = L + 2
+ IF( L.LE.LEND )
+ $ GO TO 40
+ GO TO 140
+ END IF
+*
+ IF( JTOT.EQ.NMAXIT )
+ $ GO TO 140
+ JTOT = JTOT + 1
+*
+* Form shift.
+*
+ G = ( D( L+1 )-P ) / ( TWO*E( L ) )
+ R = DLAPY2( G, ONE )
+ G = D( M ) - P + ( E( L ) / ( G+SIGN( R, G ) ) )
+*
+ S = ONE
+ C = ONE
+ P = ZERO
+*
+* Inner loop
+*
+ MM1 = M - 1
+ DO 70 I = MM1, L, -1
+ F = S*E( I )
+ B = C*E( I )
+ CALL DLARTG( G, F, C, S, R )
+ IF( I.NE.M-1 )
+ $ E( I+1 ) = R
+ G = D( I+1 ) - P
+ R = ( D( I )-G )*S + TWO*C*B
+ P = S*R
+ D( I+1 ) = G + P
+ G = C*R - B
+*
+* If eigenvectors are desired, then save rotations.
+*
+ IF( ICOMPZ.GT.0 ) THEN
+ WORK( I ) = C
+ WORK( N-1+I ) = -S
+ END IF
+*
+ 70 CONTINUE
+*
+* If eigenvectors are desired, then apply saved rotations.
+*
+ IF( ICOMPZ.GT.0 ) THEN
+ MM = M - L + 1
+ CALL DLASR( 'R', 'V', 'B', N, MM, WORK( L ), WORK( N-1+L ),
+ $ Z( 1, L ), LDZ )
+ END IF
+*
+ D( L ) = D( L ) - P
+ E( L ) = G
+ GO TO 40
+*
+* Eigenvalue found.
+*
+ 80 CONTINUE
+ D( L ) = P
+*
+ L = L + 1
+ IF( L.LE.LEND )
+ $ GO TO 40
+ GO TO 140
+*
+ ELSE
+*
+* QR Iteration
+*
+* Look for small superdiagonal element.
+*
+ 90 CONTINUE
+ IF( L.NE.LEND ) THEN
+ LENDP1 = LEND + 1
+ DO 100 M = L, LENDP1, -1
+ TST = ABS( E( M-1 ) )**2
+ IF( TST.LE.( EPS2*ABS( D( M ) ) )*ABS( D( M-1 ) )+
+ $ SAFMIN )GO TO 110
+ 100 CONTINUE
+ END IF
+*
+ M = LEND
+*
+ 110 CONTINUE
+ IF( M.GT.LEND )
+ $ E( M-1 ) = ZERO
+ P = D( L )
+ IF( M.EQ.L )
+ $ GO TO 130
+*
+* If remaining matrix is 2-by-2, use DLAE2 or SLAEV2
+* to compute its eigensystem.
+*
+ IF( M.EQ.L-1 ) THEN
+ IF( ICOMPZ.GT.0 ) THEN
+ CALL DLAEV2( D( L-1 ), E( L-1 ), D( L ), RT1, RT2, C, S )
+ WORK( M ) = C
+ WORK( N-1+M ) = S
+ CALL DLASR( 'R', 'V', 'F', N, 2, WORK( M ),
+ $ WORK( N-1+M ), Z( 1, L-1 ), LDZ )
+ ELSE
+ CALL DLAE2( D( L-1 ), E( L-1 ), D( L ), RT1, RT2 )
+ END IF
+ D( L-1 ) = RT1
+ D( L ) = RT2
+ E( L-1 ) = ZERO
+ L = L - 2
+ IF( L.GE.LEND )
+ $ GO TO 90
+ GO TO 140
+ END IF
+*
+ IF( JTOT.EQ.NMAXIT )
+ $ GO TO 140
+ JTOT = JTOT + 1
+*
+* Form shift.
+*
+ G = ( D( L-1 )-P ) / ( TWO*E( L-1 ) )
+ R = DLAPY2( G, ONE )
+ G = D( M ) - P + ( E( L-1 ) / ( G+SIGN( R, G ) ) )
+*
+ S = ONE
+ C = ONE
+ P = ZERO
+*
+* Inner loop
+*
+ LM1 = L - 1
+ DO 120 I = M, LM1
+ F = S*E( I )
+ B = C*E( I )
+ CALL DLARTG( G, F, C, S, R )
+ IF( I.NE.M )
+ $ E( I-1 ) = R
+ G = D( I ) - P
+ R = ( D( I+1 )-G )*S + TWO*C*B
+ P = S*R
+ D( I ) = G + P
+ G = C*R - B
+*
+* If eigenvectors are desired, then save rotations.
+*
+ IF( ICOMPZ.GT.0 ) THEN
+ WORK( I ) = C
+ WORK( N-1+I ) = S
+ END IF
+*
+ 120 CONTINUE
+*
+* If eigenvectors are desired, then apply saved rotations.
+*
+ IF( ICOMPZ.GT.0 ) THEN
+ MM = L - M + 1
+ CALL DLASR( 'R', 'V', 'F', N, MM, WORK( M ), WORK( N-1+M ),
+ $ Z( 1, M ), LDZ )
+ END IF
+*
+ D( L ) = D( L ) - P
+ E( LM1 ) = G
+ GO TO 90
+*
+* Eigenvalue found.
+*
+ 130 CONTINUE
+ D( L ) = P
+*
+ L = L - 1
+ IF( L.GE.LEND )
+ $ GO TO 90
+ GO TO 140
+*
+ END IF
+*
+* Undo scaling if necessary
+*
+ 140 CONTINUE
+ IF( ISCALE.EQ.1 ) THEN
+ CALL DLASCL( 'G', 0, 0, SSFMAX, ANORM, LENDSV-LSV+1, 1,
+ $ D( LSV ), N, INFO )
+ CALL DLASCL( 'G', 0, 0, SSFMAX, ANORM, LENDSV-LSV, 1, E( LSV ),
+ $ N, INFO )
+ ELSE IF( ISCALE.EQ.2 ) THEN
+ CALL DLASCL( 'G', 0, 0, SSFMIN, ANORM, LENDSV-LSV+1, 1,
+ $ D( LSV ), N, INFO )
+ CALL DLASCL( 'G', 0, 0, SSFMIN, ANORM, LENDSV-LSV, 1, E( LSV ),
+ $ N, INFO )
+ END IF
+*
+* Check for no convergence to an eigenvalue after a total
+* of N*MAXIT iterations.
+*
+ IF( JTOT.LT.NMAXIT )
+ $ GO TO 10
+ DO 150 I = 1, N - 1
+ IF( E( I ).NE.ZERO )
+ $ INFO = INFO + 1
+ 150 CONTINUE
+ GO TO 190
+*
+* Order eigenvalues and eigenvectors.
+*
+ 160 CONTINUE
+ IF( ICOMPZ.EQ.0 ) THEN
+*
+* Use Quick Sort
+*
+ CALL DLASRT( 'I', N, D, INFO )
+*
+ ELSE
+*
+* Use Selection Sort to minimize swaps of eigenvectors
+*
+ DO 180 II = 2, N
+ I = II - 1
+ K = I
+ P = D( I )
+ DO 170 J = II, N
+ IF( D( J ).LT.P ) THEN
+ K = J
+ P = D( J )
+ END IF
+ 170 CONTINUE
+ IF( K.NE.I ) THEN
+ D( K ) = D( I )
+ D( I ) = P
+ CALL DSWAP( N, Z( 1, I ), 1, Z( 1, K ), 1 )
+ END IF
+ 180 CONTINUE
+ END IF
+*
+ 190 CONTINUE
+ RETURN
+*
+* End of DSTEQR
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.h
new file mode 100644
index 0000000000000000000000000000000000000000..8c8180613ca71e093974bf1b1787e3ab460391d2
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dsteqr.h
@@ -0,0 +1,11 @@
+extern int v3p_netlib_dsteqr_(
+ char *compz,
+ v3p_netlib_integer *n,
+ v3p_netlib_doublereal *d__,
+ v3p_netlib_doublereal *e,
+ v3p_netlib_doublereal *z__,
+ v3p_netlib_integer *ldz,
+ v3p_netlib_doublereal *work,
+ v3p_netlib_integer *info,
+ v3p_netlib_ftnlen compz_len
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dtgsy2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dtgsy2.c
index 758a447bbf1b72efeb4ee67b86e681a805498e8a..f8cf602c2ea09ebdf22fe284172ad6fb8335674d 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dtgsy2.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dtgsy2.c
@@ -52,7 +52,7 @@ static integer c__0 = 0;
integer *), dgemm_(char *, char *, integer *, integer *, integer *
, doublereal *, doublereal *, integer *, doublereal *, integer *,
doublereal *, doublereal *, integer *, ftnlen, ftnlen);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int dgemv_(char *, integer *, integer *,
doublereal *, doublereal *, integer *, doublereal *, integer *,
doublereal *, doublereal *, integer *, ftnlen), dcopy_(integer *,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dtgsyl.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dtgsyl.c
index 532c9cfc522f7069c87b93dc5bebe78c655b3d84..5212172390ff39a6ff62893b915c5a06294a271c 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dtgsyl.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dtgsyl.c
@@ -50,7 +50,7 @@ static doublereal c_b54 = 1.;
integer *), dgemm_(char *, char *, integer *, integer *, integer *
, doublereal *, doublereal *, integer *, doublereal *, integer *,
doublereal *, doublereal *, integer *, ftnlen, ftnlen);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
integer ifunc, linfo;
extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
doublereal *, integer *);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.P
new file mode 100644
index 0000000000000000000000000000000000000000..cb70f0b9b8a64b259942f62d6c3cb7302e6b1d68
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.P
@@ -0,0 +1 @@
+extern doublereal dzsum1_(integer *n, doublecomplex *cx, integer *incx);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.c
new file mode 100644
index 0000000000000000000000000000000000000000..9f09c7c47bbe6ae0c61b4bb25c04130382b9d835
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.c
@@ -0,0 +1,144 @@
+/* lapack/double/dzsum1.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< DOUBLE PRECISION FUNCTION DZSUM1( N, CX, INCX ) >*/
+doublereal dzsum1_(integer *n, doublecomplex *cx, integer *incx)
+{
+ /* System generated locals */
+ integer i__1, i__2;
+ doublereal ret_val;
+
+ /* Builtin functions */
+ double z_abs(doublecomplex *);
+
+ /* Local variables */
+ integer i__, nincx;
+ doublereal stemp;
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER INCX, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< COMPLEX*16 CX( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* DZSUM1 takes the sum of the absolute values of a complex */
+/* vector and returns a double precision result. */
+
+/* Based on DZASUM from the Level 1 BLAS. */
+/* The change is to use the 'genuine' absolute value. */
+
+/* Contributed by Nick Higham for use with ZLACON. */
+
+/* Arguments */
+/* ========= */
+
+/* N (input) INTEGER */
+/* The number of elements in the vector CX. */
+
+/* CX (input) COMPLEX*16 array, dimension (N) */
+/* The vector whose elements will be summed. */
+
+/* INCX (input) INTEGER */
+/* The spacing between successive values of CX. INCX > 0. */
+
+/* ===================================================================== */
+
+/* .. Local Scalars .. */
+/*< INTEGER I, NINCX >*/
+/*< DOUBLE PRECISION STEMP >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/*< DZSUM1 = 0.0D0 >*/
+ /* Parameter adjustments */
+ --cx;
+
+ /* Function Body */
+ ret_val = 0.;
+/*< STEMP = 0.0D0 >*/
+ stemp = 0.;
+/*< >*/
+ if (*n <= 0) {
+ return ret_val;
+ }
+/*< >*/
+ if (*incx == 1) {
+ goto L20;
+ }
+
+/* CODE FOR INCREMENT NOT EQUAL TO 1 */
+
+/*< NINCX = N*INCX >*/
+ nincx = *n * *incx;
+/*< DO 10 I = 1, NINCX, INCX >*/
+ i__1 = nincx;
+ i__2 = *incx;
+ for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
+
+/* NEXT LINE MODIFIED. */
+
+/*< STEMP = STEMP + ABS( CX( I ) ) >*/
+ stemp += z_abs(&cx[i__]);
+/*< 10 CONTINUE >*/
+/* L10: */
+ }
+/*< DZSUM1 = STEMP >*/
+ ret_val = stemp;
+/*< RETURN >*/
+ return ret_val;
+
+/* CODE FOR INCREMENT EQUAL TO 1 */
+
+/*< 20 CONTINUE >*/
+L20:
+/*< DO 30 I = 1, N >*/
+ i__2 = *n;
+ for (i__ = 1; i__ <= i__2; ++i__) {
+
+/* NEXT LINE MODIFIED. */
+
+/*< STEMP = STEMP + ABS( CX( I ) ) >*/
+ stemp += z_abs(&cx[i__]);
+/*< 30 CONTINUE >*/
+/* L30: */
+ }
+/*< DZSUM1 = STEMP >*/
+ ret_val = stemp;
+/*< RETURN >*/
+ return ret_val;
+
+/* End of DZSUM1 */
+
+/*< END >*/
+} /* dzsum1_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.f
new file mode 100644
index 0000000000000000000000000000000000000000..5acaca8cff342cd433ab924ac87ad3520b21e71d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.f
@@ -0,0 +1,82 @@
+ DOUBLE PRECISION FUNCTION DZSUM1( N, CX, INCX )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER INCX, N
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 CX( * )
+* ..
+*
+* Purpose
+* =======
+*
+* DZSUM1 takes the sum of the absolute values of a complex
+* vector and returns a double precision result.
+*
+* Based on DZASUM from the Level 1 BLAS.
+* The change is to use the 'genuine' absolute value.
+*
+* Contributed by Nick Higham for use with ZLACON.
+*
+* Arguments
+* =========
+*
+* N (input) INTEGER
+* The number of elements in the vector CX.
+*
+* CX (input) COMPLEX*16 array, dimension (N)
+* The vector whose elements will be summed.
+*
+* INCX (input) INTEGER
+* The spacing between successive values of CX. INCX > 0.
+*
+* =====================================================================
+*
+* .. Local Scalars ..
+ INTEGER I, NINCX
+ DOUBLE PRECISION STEMP
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS
+* ..
+* .. Executable Statements ..
+*
+ DZSUM1 = 0.0D0
+ STEMP = 0.0D0
+ IF( N.LE.0 )
+ $ RETURN
+ IF( INCX.EQ.1 )
+ $ GO TO 20
+*
+* CODE FOR INCREMENT NOT EQUAL TO 1
+*
+ NINCX = N*INCX
+ DO 10 I = 1, NINCX, INCX
+*
+* NEXT LINE MODIFIED.
+*
+ STEMP = STEMP + ABS( CX( I ) )
+ 10 CONTINUE
+ DZSUM1 = STEMP
+ RETURN
+*
+* CODE FOR INCREMENT EQUAL TO 1
+*
+ 20 CONTINUE
+ DO 30 I = 1, N
+*
+* NEXT LINE MODIFIED.
+*
+ STEMP = STEMP + ABS( CX( I ) )
+ 30 CONTINUE
+ DZSUM1 = STEMP
+ RETURN
+*
+* End of DZSUM1
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.h
new file mode 100644
index 0000000000000000000000000000000000000000..ab1cf000356663e2bfab8cf9d51b8449938889f2
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/double/dzsum1.h
@@ -0,0 +1,5 @@
+extern v3p_netlib_doublereal v3p_netlib_dzsum1_(
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *cx,
+ v3p_netlib_integer *incx
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvd.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvd.c
index 07458766b30ea72a211ff48bbb932fb24b42e9d1..c2ab829e478d8fb31793618c75e1580212028f23 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvd.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvd.c
@@ -20,7 +20,7 @@ extern "C" {
static integer c__1 = 1;
/*< >*/
-/* Subroutine */ int sggsvd_(char *jobu, char *jobv, char *jobq, integer *m,
+/* Subroutine */ int sggsvd_(const char *jobu, const char *jobv, const char *jobq, integer *m,
integer *n, integer *p, integer *k, integer *l, real *a, integer *lda,
real *b, integer *ldb, real *alpha, real *beta, real *u, integer *
ldu, real *v, integer *ldv, real *q, integer *ldq, real *work,
@@ -38,7 +38,7 @@ static integer c__1 = 1;
real tola;
integer isub;
real tolb, unfl, temp, smax;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
real anorm, bnorm;
logical wantq;
extern /* Subroutine */ int scopy_(integer *, real *, integer *, real *,
@@ -48,11 +48,11 @@ static integer c__1 = 1;
integer *, real *, integer *, real *, ftnlen);
integer ncycle;
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen), stgsja_(
- char *, char *, char *, integer *, integer *, integer *, integer *
+ const char *, const char *, const char *, integer *, integer *, integer *, integer *
, integer *, real *, integer *, real *, integer *, real *, real *,
real *, real *, real *, integer *, real *, integer *, real *,
integer *, real *, integer *, integer *, ftnlen, ftnlen, ftnlen),
- sggsvp_(char *, char *, char *, integer *, integer *, integer *,
+ sggsvp_(const char *, const char *, const char *, integer *, integer *, integer *,
real *, integer *, real *, integer *, real *, real *, integer *,
integer *, real *, integer *, real *, integer *, real *, integer *
, integer *, real *, real *, integer *, ftnlen, ftnlen, ftnlen);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvd.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvd.h
index 3228e0c611eb65ec06378cfe236b9a0dcb9fb098..1682142d25a3aa0db521a72b4160ec11ef9a7625 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvd.h
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvd.h
@@ -1,7 +1,7 @@
extern int v3p_netlib_sggsvd_(
- char *jobu,
- char *jobv,
- char *jobq,
+ const char *jobu,
+ const char *jobv,
+ const char *jobq,
v3p_netlib_integer *m,
v3p_netlib_integer *n,
v3p_netlib_integer *p,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvp.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvp.c
index ab442b5ff37bb77485ac1535af269cf68780edb1..2d83595a69ee64e46d306736bb3ce736002aa452 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvp.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvp.c
@@ -21,7 +21,7 @@ static real c_b12 = (float)0.;
static real c_b22 = (float)1.;
/*< >*/
-/* Subroutine */ int sggsvp_(char *jobu, char *jobv, char *jobq, integer *m,
+/* Subroutine */ int sggsvp_(const char *jobu, const char *jobv, const char *jobq, integer *m,
integer *p, integer *n, real *a, integer *lda, real *b, integer *ldb,
real *tola, real *tolb, integer *k, integer *l, real *u, integer *ldu,
real *v, integer *ldv, real *q, integer *ldq, integer *iwork, real *
@@ -35,7 +35,7 @@ static real c_b22 = (float)1.;
/* Local variables */
integer i__, j;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
logical wantq, wantu, wantv;
extern /* Subroutine */ int sgeqr2_(integer *, integer *, real *, integer
*, real *, real *, integer *), sgerq2_(integer *, integer *, real
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvp.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvp.h
index 1cdc92011d19010d683d6f68d76bd6f54ebb204f..cd50eacae5a4aafbde38cf0fdc2cb11a521a0c5b 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvp.h
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sggsvp.h
@@ -1,7 +1,7 @@
extern int v3p_netlib_sggsvp_(
- char *jobu,
- char *jobv,
- char *jobq,
+ const char *jobu,
+ const char *jobv,
+ const char *jobq,
v3p_netlib_integer *m,
v3p_netlib_integer *p,
v3p_netlib_integer *n,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slacpy.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slacpy.c
index 30dfae1ee926c13e206bc560ba9c549aec79f41f..c17c7ecb60e3213902e19a6ee5e976a26d007abf 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slacpy.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slacpy.c
@@ -24,7 +24,7 @@ extern "C" {
/* Local variables */
integer i__, j;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
(void)uplo_len;
/* -- LAPACK auxiliary routine (version 3.0) -- */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slange.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slange.c
index f2e18a736bcaeda0f32ad1972d497ab669dde0c6..4c721693bcf6ecf1ce3885421436231f8e70307a 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slange.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slange.c
@@ -33,7 +33,7 @@ doublereal slange_(char *norm, integer *m, integer *n, real *a, integer *lda,
/* Local variables */
integer i__, j;
real sum, scale;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
real value=0;
extern /* Subroutine */ int slassq_(integer *, real *, integer *, real *,
real *);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slarf.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slarf.c
index ef5a2938d3f1f6b3490cb72a4f5f0876595cfc77..52b06df6c18365c844206a49aa6130a30df91cc7 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slarf.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slarf.c
@@ -33,7 +33,7 @@ static integer c__1 = 1;
/* Local variables */
extern /* Subroutine */ int sger_(integer *, integer *, real *, real *,
integer *, real *, integer *, real *, integer *);
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int sgemv_(char *, integer *, integer *, real *,
real *, integer *, real *, integer *, real *, real *, integer *,
ftnlen);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slaset.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slaset.c
index dd25c3966576b71030dd0eb9c182a216f73258c4..ef25b31c2d732f7e2bdbd7d98ab28d2c8df5b4af 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slaset.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/slaset.c
@@ -24,7 +24,7 @@ extern "C" {
/* Local variables */
integer i__, j;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
(void)uplo_len;
/* -- LAPACK auxiliary routine (version 3.0) -- */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sorm2r.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sorm2r.c
index 7a85ebfccc2bc38a8bd533daa2ba87fd1dca6f87..80f6d9d2d50bee5d05d9fd3befc12bf6447d4501 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sorm2r.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sorm2r.c
@@ -31,7 +31,7 @@ static integer c__1 = 1;
integer i__, i1, i2, i3, ic=0, jc=0, mi, ni, nq;
real aii;
logical left;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int slarf_(char *, integer *, integer *, real *,
integer *, real *, real *, integer *, real *, ftnlen), xerbla_(
char *, integer *, ftnlen);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sormr2.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sormr2.c
index 63282b80a31f4a870e5a5bd001d9e185592b83c6..15b0aa8dfc0d7521bcd1d575624ad77998191f1d 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sormr2.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/sormr2.c
@@ -27,7 +27,7 @@ extern "C" {
integer i__, i1, i2, i3, mi, ni, nq;
real aii;
logical left;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int slarf_(char *, integer *, integer *, real *,
integer *, real *, real *, integer *, real *, ftnlen), xerbla_(
char *, integer *, ftnlen);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/stgsja.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/stgsja.c
index a56153885fd7b93226a33de29dda1767820bb813..a1da747e5431ef5372f50422199058f2467a667a 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/stgsja.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/stgsja.c
@@ -23,7 +23,7 @@ static integer c__1 = 1;
static real c_b43 = (float)-1.;
/*< >*/
-/* Subroutine */ int stgsja_(char *jobu, char *jobv, char *jobq, integer *m,
+/* Subroutine */ int stgsja_(const char *jobu, const char *jobv, const char *jobq, integer *m,
integer *p, integer *n, integer *k, integer *l, real *a, integer *lda,
real *b, integer *ldb, real *tola, real *tolb, real *alpha, real *
beta, real *u, integer *ldu, real *v, integer *ldv, real *q, integer *
@@ -41,7 +41,7 @@ static real c_b43 = (float)-1.;
extern /* Subroutine */ int srot_(integer *, real *, integer *, real *,
integer *, real *, real *);
real gamma;
- extern logical lsame_(char *, char *, ftnlen, ftnlen);
+ extern logical lsame_(const char *, const char *, ftnlen, ftnlen);
extern /* Subroutine */ int sscal_(integer *, real *, real *, integer *);
logical initq, initu, initv, wantq, upper;
real error, ssmin;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/stgsja.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/stgsja.h
index 00faa0511e4e7163e5c96563ee429e058b223db7..c9a89ea9f8a2e551e8492b7f265923759c51f464 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/stgsja.h
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/single/stgsja.h
@@ -1,7 +1,7 @@
extern int v3p_netlib_stgsja_(
- char *jobu,
- char *jobv,
- char *jobq,
+ const char *jobu,
+ const char *jobv,
+ const char *jobq,
v3p_netlib_integer *m,
v3p_netlib_integer *p,
v3p_netlib_integer *n,
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/ilaenv.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/ilaenv.c
index 44efb7c4c699b20a9e14216b039fc6424727f91a..a0c7071985a09677483bc151eceaa4d9e56907eb 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/ilaenv.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/ilaenv.c
@@ -206,14 +206,14 @@ L100:
/*< IF( IC.GE.97 .AND. IC.LE.122 ) THEN >*/
if (ic >= 97 && ic <= 122) {
/*< SUBNAM( 1:1 ) = CHAR( IC-32 ) >*/
- *(unsigned char *)subnam = (char) (ic - 32);
+ *(unsigned char *)subnam = (unsigned char) (ic - 32);
/*< DO 10 I = 2, 6 >*/
for (i__ = 2; i__ <= 6; ++i__) {
/*< IC = ICHAR( SUBNAM( I:I ) ) >*/
ic = *(unsigned char *)&subnam[i__ - 1];
/*< >*/
if (ic >= 97 && ic <= 122) {
- *(unsigned char *)&subnam[i__ - 1] = (char) (ic - 32);
+ *(unsigned char *)&subnam[i__ - 1] = (unsigned char) (ic - 32);
}
/*< 10 CONTINUE >*/
/* L10: */
@@ -230,7 +230,7 @@ L100:
if ((ic >= 129 && ic <= 137) || (ic >= 145 && ic <= 153) || (ic >= 162 &&
ic <= 169)) {
/*< SUBNAM( 1:1 ) = CHAR( IC+64 ) >*/
- *(unsigned char *)subnam = (char) (ic + 64);
+ *(unsigned char *)subnam = (unsigned char) (ic + 64);
/*< DO 20 I = 2, 6 >*/
for (i__ = 2; i__ <= 6; ++i__) {
/*< IC = ICHAR( SUBNAM( I:I ) ) >*/
@@ -238,7 +238,7 @@ L100:
/*< >*/
if ((ic >= 129 && ic <= 137) || (ic >= 145 && ic <= 153) || (ic >=
162 && ic <= 169)) {
- *(unsigned char *)&subnam[i__ - 1] = (char) (ic + 64);
+ *(unsigned char *)&subnam[i__ - 1] = (unsigned char) (ic + 64);
}
/*< 20 CONTINUE >*/
/* L20: */
@@ -254,14 +254,14 @@ L100:
/*< IF( IC.GE.225 .AND. IC.LE.250 ) THEN >*/
if (ic >= 225 && ic <= 250) {
/*< SUBNAM( 1:1 ) = CHAR( IC-32 ) >*/
- *(unsigned char *)subnam = (char) (ic - 32);
+ *(unsigned char *)subnam = (unsigned char) (ic - 32);
/*< DO 30 I = 2, 6 >*/
for (i__ = 2; i__ <= 6; ++i__) {
/*< IC = ICHAR( SUBNAM( I:I ) ) >*/
ic = *(unsigned char *)&subnam[i__ - 1];
/*< >*/
if (ic >= 225 && ic <= 250) {
- *(unsigned char *)&subnam[i__ - 1] = (char) (ic - 32);
+ *(unsigned char *)&subnam[i__ - 1] = (unsigned char) (ic - 32);
}
/*< 30 CONTINUE >*/
/* L30: */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.P b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.P
new file mode 100644
index 0000000000000000000000000000000000000000..58c247e4ac960cc9f831a219d8e22646359c2947
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.P
@@ -0,0 +1 @@
+extern integer izmax1_(integer *n, doublecomplex *cx, integer *incx);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.c
new file mode 100644
index 0000000000000000000000000000000000000000..ea05f50ec1a1320d5260430964401d05e16e7398
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.c
@@ -0,0 +1,168 @@
+/* lapack/util/izmax1.f -- translated by f2c (version 20090411).
+ You must link the resulting object file with libf2c:
+ on Microsoft Windows system, link with libf2c.lib;
+ on Linux or Unix systems, link with .../path/to/libf2c.a -lm
+ or, if you install libf2c.a in a standard place, with -lf2c -lm
+ -- in that order, at the end of the command line, as in
+ cc *.o -lf2c -lm
+ Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
+
+ http://www.netlib.org/f2c/libf2c.zip
+*/
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+#include "v3p_netlib.h"
+
+/*< INTEGER FUNCTION IZMAX1( N, CX, INCX ) >*/
+integer izmax1_(integer *n, doublecomplex *cx, integer *incx)
+{
+ /* System generated locals */
+ integer ret_val, i__1;
+
+ /* Builtin functions */
+ double z_abs(doublecomplex *);
+
+ /* Local variables */
+ integer i__, ix;
+ doublereal smax;
+
+
+/* -- LAPACK auxiliary routine (version 3.2) -- */
+/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
+/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
+/* November 2006 */
+
+/* .. Scalar Arguments .. */
+/*< INTEGER INCX, N >*/
+/* .. */
+/* .. Array Arguments .. */
+/*< COMPLEX*16 CX( * ) >*/
+/* .. */
+
+/* Purpose */
+/* ======= */
+
+/* IZMAX1 finds the index of the element whose real part has maximum */
+/* absolute value. */
+
+/* Based on IZAMAX from Level 1 BLAS. */
+/* The change is to use the 'genuine' absolute value. */
+
+/* Contributed by Nick Higham for use with ZLACON. */
+
+/* Arguments */
+/* ========= */
+
+/* N (input) INTEGER */
+/* The number of elements in the vector CX. */
+
+/* CX (input) COMPLEX*16 array, dimension (N) */
+/* The vector whose elements will be summed. */
+
+/* INCX (input) INTEGER */
+/* The spacing between successive values of CX. INCX >= 1. */
+
+/* ===================================================================== */
+
+/* .. Local Scalars .. */
+/*< INTEGER I, IX >*/
+/*< DOUBLE PRECISION SMAX >*/
+/*< COMPLEX*16 ZDUM >*/
+/* .. */
+/* .. Intrinsic Functions .. */
+/*< INTRINSIC ABS >*/
+/* .. */
+/* .. Statement Functions .. */
+/*< DOUBLE PRECISION CABS1 >*/
+/* .. */
+/* .. Statement Function definitions .. */
+
+/* NEXT LINE IS THE ONLY MODIFICATION. */
+/*< CABS1( ZDUM ) = ABS( ZDUM ) >*/
+/* .. */
+/* .. Executable Statements .. */
+
+/*< IZMAX1 = 0 >*/
+ /* Parameter adjustments */
+ --cx;
+
+ /* Function Body */
+ ret_val = 0;
+/*< >*/
+ if (*n < 1) {
+ return ret_val;
+ }
+/*< IZMAX1 = 1 >*/
+ ret_val = 1;
+/*< >*/
+ if (*n == 1) {
+ return ret_val;
+ }
+/*< >*/
+ if (*incx == 1) {
+ goto L30;
+ }
+
+/* CODE FOR INCREMENT NOT EQUAL TO 1 */
+
+/*< IX = 1 >*/
+ ix = 1;
+/*< SMAX = CABS1( CX( 1 ) ) >*/
+ smax = z_abs(&cx[1]);
+/*< IX = IX + INCX >*/
+ ix += *incx;
+/*< DO 20 I = 2, N >*/
+ i__1 = *n;
+ for (i__ = 2; i__ <= i__1; ++i__) {
+/*< >*/
+ if (z_abs(&cx[ix]) <= smax) {
+ goto L10;
+ }
+/*< IZMAX1 = I >*/
+ ret_val = i__;
+/*< SMAX = CABS1( CX( IX ) ) >*/
+ smax = z_abs(&cx[ix]);
+/*< 10 CONTINUE >*/
+L10:
+/*< IX = IX + INCX >*/
+ ix += *incx;
+/*< 20 CONTINUE >*/
+/* L20: */
+ }
+/*< RETURN >*/
+ return ret_val;
+
+/* CODE FOR INCREMENT EQUAL TO 1 */
+
+/*< 30 CONTINUE >*/
+L30:
+/*< SMAX = CABS1( CX( 1 ) ) >*/
+ smax = z_abs(&cx[1]);
+/*< DO 40 I = 2, N >*/
+ i__1 = *n;
+ for (i__ = 2; i__ <= i__1; ++i__) {
+/*< >*/
+ if (z_abs(&cx[i__]) <= smax) {
+ goto L40;
+ }
+/*< IZMAX1 = I >*/
+ ret_val = i__;
+/*< SMAX = CABS1( CX( I ) ) >*/
+ smax = z_abs(&cx[i__]);
+/*< 40 CONTINUE >*/
+L40:
+ ;
+ }
+/*< RETURN >*/
+ return ret_val;
+
+/* End of IZMAX1 */
+
+/*< END >*/
+} /* izmax1_ */
+
+#ifdef __cplusplus
+ }
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.f
new file mode 100644
index 0000000000000000000000000000000000000000..22bb8b12bbeab035a62d898cd4ddd528b7e92fc5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.f
@@ -0,0 +1,96 @@
+ INTEGER FUNCTION IZMAX1( N, CX, INCX )
+*
+* -- LAPACK auxiliary routine (version 3.2) --
+* -- LAPACK is a software package provided by Univ. of Tennessee, --
+* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
+* November 2006
+*
+* .. Scalar Arguments ..
+ INTEGER INCX, N
+* ..
+* .. Array Arguments ..
+ COMPLEX*16 CX( * )
+* ..
+*
+* Purpose
+* =======
+*
+* IZMAX1 finds the index of the element whose real part has maximum
+* absolute value.
+*
+* Based on IZAMAX from Level 1 BLAS.
+* The change is to use the 'genuine' absolute value.
+*
+* Contributed by Nick Higham for use with ZLACON.
+*
+* Arguments
+* =========
+*
+* N (input) INTEGER
+* The number of elements in the vector CX.
+*
+* CX (input) COMPLEX*16 array, dimension (N)
+* The vector whose elements will be summed.
+*
+* INCX (input) INTEGER
+* The spacing between successive values of CX. INCX >= 1.
+*
+* =====================================================================
+*
+* .. Local Scalars ..
+ INTEGER I, IX
+ DOUBLE PRECISION SMAX
+ COMPLEX*16 ZDUM
+* ..
+* .. Intrinsic Functions ..
+ INTRINSIC ABS
+* ..
+* .. Statement Functions ..
+ DOUBLE PRECISION CABS1
+* ..
+* .. Statement Function definitions ..
+*
+* NEXT LINE IS THE ONLY MODIFICATION.
+ CABS1( ZDUM ) = ABS( ZDUM )
+* ..
+* .. Executable Statements ..
+*
+ IZMAX1 = 0
+ IF( N.LT.1 )
+ $ RETURN
+ IZMAX1 = 1
+ IF( N.EQ.1 )
+ $ RETURN
+ IF( INCX.EQ.1 )
+ $ GO TO 30
+*
+* CODE FOR INCREMENT NOT EQUAL TO 1
+*
+ IX = 1
+ SMAX = CABS1( CX( 1 ) )
+ IX = IX + INCX
+ DO 20 I = 2, N
+ IF( CABS1( CX( IX ) ).LE.SMAX )
+ $ GO TO 10
+ IZMAX1 = I
+ SMAX = CABS1( CX( IX ) )
+ 10 CONTINUE
+ IX = IX + INCX
+ 20 CONTINUE
+ RETURN
+*
+* CODE FOR INCREMENT EQUAL TO 1
+*
+ 30 CONTINUE
+ SMAX = CABS1( CX( 1 ) )
+ DO 40 I = 2, N
+ IF( CABS1( CX( I ) ).LE.SMAX )
+ $ GO TO 40
+ IZMAX1 = I
+ SMAX = CABS1( CX( I ) )
+ 40 CONTINUE
+ RETURN
+*
+* End of IZMAX1
+*
+ END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.h
new file mode 100644
index 0000000000000000000000000000000000000000..275aec97a8a03ad61b62bb73c4fad34f3ebb749d
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/izmax1.h
@@ -0,0 +1,5 @@
+extern v3p_netlib_integer v3p_netlib_izmax1_(
+ v3p_netlib_integer *n,
+ v3p_netlib_doublecomplex *cx,
+ v3p_netlib_integer *incx
+ );
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/lsame.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/lsame.c
index 92d88fcaf8c14fb5449931105db17f41a143b541..e960bb14118f574bb9f534971f3fcf70e9121e3f 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/lsame.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/lsame.c
@@ -16,7 +16,7 @@ extern "C" {
#include "v3p_netlib.h"
/*< LOGICAL FUNCTION LSAME( CA, CB ) >*/
-logical lsame_(char *ca, char *cb, ftnlen ca_len, ftnlen cb_len)
+logical lsame_(const char *ca, const char *cb, ftnlen ca_len, ftnlen cb_len)
{
/* System generated locals */
logical ret_val;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/lsame.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/lsame.h
index a5c9b8d0d2e2846270686bb454f5cc0c2edcc677..47867bb03483036d52aadefe57daa1094c316275 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/lsame.h
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/lapack/util/lsame.h
@@ -1,6 +1,6 @@
extern v3p_netlib_logical v3p_netlib_lsame_(
- char *ca,
- char *cb,
+ const char *ca,
+ const char *cb,
v3p_netlib_ftnlen ca_len,
v3p_netlib_ftnlen cb_len
);
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/arithchk.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/arithchk.c
index 59fd61eb0cabb89d4c4b1a4b65f8b13c50d946e2..176613b07c43ebb28433a70a3d5ab2f139c88f1b 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/arithchk.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/arithchk.c
@@ -211,9 +211,11 @@ main()
if (need_nancheck())
fprintf(f, "#define NANCHECK\n");
}
+ fclose(f);
return 0;
}
fprintf(f, "/* Unknown arithmetic */\n");
+ fclose(f);
return 1;
}
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/makefile.u b/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/makefile.u
index ff2f93b211b9e1fd2ef0888d558c867413464788..9263e1248d499dc016b3650c73a1bacfb3405d97 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/makefile.u
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/makefile.u
@@ -19,9 +19,9 @@ CFLAGS = -O
# compile, then strip unnecessary symbols
.c.o:
- $(CC) -c -DSkip_f2c_Undefs $(CFLAGS) $*.c
- ld -r -x -o $*.xxx $*.o
- mv $*.xxx $*.o
+ $(CC) -c -DSkip_f2c_Undefs $(CFLAGS) $*.c
+ ld -r -x -o $*.xxx $*.o
+ mv $*.xxx $*.o
## Under Solaris (and other systems that do not understand ld -x),
## omit -x in the ld line above.
## If your system does not have the ld command, comment out
@@ -49,11 +49,11 @@ CMP = l_ge.o l_gt.o l_le.o l_lt.o hl_ge.o hl_gt.o hl_le.o hl_lt.o
EFL = ef1asc_.o ef1cmc_.o
CHAR = f77_aloc.o s_cat.o s_cmp.o s_copy.o
I77 = backspac.o close.o dfe.o dolio.o due.o endfile.o err.o\
- fmt.o fmtlib.o ftell_.o iio.o ilnw.o inquire.o lread.o lwrite.o\
+ fmt.o iio.o ilnw.o inquire.o lread.o lwrite.o\
open.o rdfmt.o rewind.o rsfe.o rsli.o rsne.o sfe.o sue.o\
typesize.o uio.o util.o wref.o wrtfmt.o wsfe.o wsle.o wsne.o xwsne.o
-QINT = pow_qq.o qbitbits.o qbitshft.o ftell64_.o
-TIME = dtime_.o etime_.o
+QINT = pow_qq.o qbitbits.o qbitshft.o
+TIME = etime_.o
# If you get an error compiling dtime_.c or etime_.c, try adding
# -DUSE_CLOCK to the CFLAGS assignment above; if that does not work,
@@ -72,8 +72,8 @@ OFILES = $(MISC) $(POW) $(CX) $(DCX) $(REAL) $(DBL) $(INT) \
all: f2c.h signal1.h sysdep1.h libf2c.a
libf2c.a: $(OFILES)
- ar r libf2c.a $?
- -ranlib libf2c.a
+ ar r libf2c.a $?
+ -ranlib libf2c.a
## Shared-library variant: the following rule works on Linux
## systems. Details are system-dependent. Under Linux, -fPIC
@@ -82,30 +82,30 @@ libf2c.a: $(OFILES)
## of "cc -shared".
libf2c.so: $(OFILES)
- cc -shared -o libf2c.so $(OFILES)
+ cc -shared -o libf2c.so $(OFILES)
### If your system lacks ranlib, you don't need it; see README.
f77vers.o: f77vers.c
- $(CC) -c f77vers.c
+ $(CC) -c f77vers.c
i77vers.o: i77vers.c
- $(CC) -c i77vers.c
+ $(CC) -c i77vers.c
# To get an "f2c.h" for use with "f2c -C++", first "make hadd"
hadd: f2c.h0 f2ch.add
- cat f2c.h0 f2ch.add >f2c.h
+ cat f2c.h0 f2ch.add >f2c.h
# For use with "f2c" and "f2c -A":
f2c.h: f2c.h0
- cp f2c.h0 f2c.h
+ cp f2c.h0 f2c.h
# You may need to adjust signal1.h and sysdep1.h suitably for your system...
signal1.h: signal1.h0
- cp signal1.h0 signal1.h
+ cp signal1.h0 signal1.h
sysdep1.h: sysdep1.h0
- cp sysdep1.h0 sysdep1.h
+ cp sysdep1.h0 sysdep1.h
# If your system lacks onexit() and you are not using an
# ANSI C compiler, then you should uncomment the following
@@ -118,11 +118,11 @@ sysdep1.h: sysdep1.h0
# $(CC) -c -Donexit=on_exit -DSkip_f2c_Undefs main.c
install: libf2c.a
- cp libf2c.a $(LIBDIR)
- -ranlib $(LIBDIR)/libf2c.a
+ cp libf2c.a $(LIBDIR)
+ -ranlib $(LIBDIR)/libf2c.a
clean:
- rm -f libf2c.a *.o arith.h signal1.h sysdep1.h
+ rm -f libf2c.a *.o arith.h signal1.h sysdep1.h
backspac.o: fio.h
close.o: fio.h
@@ -179,36 +179,36 @@ xwsne.o: lio.h
xwsne.o: fmt.h
arith.h: arithchk.c
- $(CC) $(CFLAGS) -DNO_FPINIT arithchk.c -lm ||\
- $(CC) -DNO_LONG_LONG $(CFLAGS) -DNO_FPINIT arithchk.c -lm
- ./a.out >arith.h
- rm -f a.out arithchk.o
+ $(CC) $(CFLAGS) -DNO_FPINIT arithchk.c -lm ||\
+ $(CC) -DNO_LONG_LONG $(CFLAGS) -DNO_FPINIT arithchk.c -lm
+ ./a.out >arith.h
+ rm -f a.out arithchk.o
check:
- xsum Notice README abort_.c arithchk.c backspac.c c_abs.c c_cos.c \
- c_div.c c_exp.c c_log.c c_sin.c c_sqrt.c cabs.c close.c comptry.bat \
- d_abs.c d_acos.c d_asin.c d_atan.c d_atn2.c d_cnjg.c d_cos.c d_cosh.c \
- d_dim.c d_exp.c d_imag.c d_int.c d_lg10.c d_log.c d_mod.c \
- d_nint.c d_prod.c d_sign.c d_sin.c d_sinh.c d_sqrt.c d_tan.c \
- d_tanh.c derf_.c derfc_.c dfe.c dolio.c dtime_.c due.c ef1asc_.c \
- ef1cmc_.c endfile.c erf_.c erfc_.c err.c etime_.c exit_.c f2c.h0 \
- f2ch.add f77_aloc.c f77vers.c fio.h fmt.c fmt.h fmtlib.c \
- fp.h ftell_.c ftell64_.c \
- getarg_.c getenv_.c h_abs.c h_dim.c h_dnnt.c h_indx.c h_len.c \
- h_mod.c h_nint.c h_sign.c hl_ge.c hl_gt.c hl_le.c hl_lt.c \
- i77vers.c i_abs.c i_dim.c i_dnnt.c i_indx.c i_len.c i_mod.c \
- i_nint.c i_sign.c iargc_.c iio.c ilnw.c inquire.c l_ge.c l_gt.c \
- l_le.c l_lt.c lbitbits.c lbitshft.c libf2c.lbc libf2c.sy lio.h \
- lread.c lwrite.c main.c makefile.sy makefile.u makefile.vc \
- makefile.wat math.hvc mkfile.plan9 open.c pow_ci.c pow_dd.c \
- pow_di.c pow_hh.c pow_ii.c pow_qq.c pow_ri.c pow_zi.c pow_zz.c \
- qbitbits.c qbitshft.c r_abs.c r_acos.c r_asin.c r_atan.c r_atn2.c \
- r_cnjg.c r_cos.c r_cosh.c r_dim.c r_exp.c r_imag.c r_int.c r_lg10.c \
- r_log.c r_mod.c r_nint.c r_sign.c r_sin.c r_sinh.c r_sqrt.c \
- r_tan.c r_tanh.c rawio.h rdfmt.c rewind.c rsfe.c rsli.c rsne.c \
- s_cat.c s_cmp.c s_copy.c s_paus.c s_rnge.c s_stop.c scomptry.bat sfe.c \
- sig_die.c signal1.h0 signal_.c signbit.c sue.c sysdep1.h0 system_.c \
- typesize.c \
- uio.c uninit.c util.c wref.c wrtfmt.c wsfe.c wsle.c wsne.c xwsne.c \
- z_abs.c z_cos.c z_div.c z_exp.c z_log.c z_sin.c z_sqrt.c >xsum1.out
- cmp xsum0.out xsum1.out && mv xsum1.out xsum.out || diff xsum[01].out
+ xsum Notice README abort_.c arithchk.c backspac.c c_abs.c c_cos.c \
+ c_div.c c_exp.c c_log.c c_sin.c c_sqrt.c cabs.c close.c comptry.bat \
+ d_abs.c d_acos.c d_asin.c d_atan.c d_atn2.c d_cnjg.c d_cos.c d_cosh.c \
+ d_dim.c d_exp.c d_imag.c d_int.c d_lg10.c d_log.c d_mod.c \
+ d_nint.c d_prod.c d_sign.c d_sin.c d_sinh.c d_sqrt.c d_tan.c \
+ d_tanh.c derf_.c derfc_.c dfe.c dolio.c dtime_.c due.c ef1asc_.c \
+ ef1cmc_.c endfile.c erf_.c erfc_.c err.c etime_.c exit_.c f2c.h0 \
+ f2ch.add f77_aloc.c f77vers.c fio.h fmt.c fmt.h fmtlib.c \
+ fp.h ftell_.c ftell64_.c \
+ getarg_.c getenv_.c h_abs.c h_dim.c h_dnnt.c h_indx.c h_len.c \
+ h_mod.c h_nint.c h_sign.c hl_ge.c hl_gt.c hl_le.c hl_lt.c \
+ i77vers.c i_abs.c i_dim.c i_dnnt.c i_indx.c i_len.c i_mod.c \
+ i_nint.c i_sign.c iargc_.c iio.c ilnw.c inquire.c l_ge.c l_gt.c \
+ l_le.c l_lt.c lbitbits.c lbitshft.c libf2c.lbc libf2c.sy lio.h \
+ lread.c lwrite.c main.c makefile.sy makefile.u makefile.vc \
+ makefile.wat math.hvc mkfile.plan9 open.c pow_ci.c pow_dd.c \
+ pow_di.c pow_hh.c pow_ii.c pow_qq.c pow_ri.c pow_zi.c pow_zz.c \
+ qbitbits.c qbitshft.c r_abs.c r_acos.c r_asin.c r_atan.c r_atn2.c \
+ r_cnjg.c r_cos.c r_cosh.c r_dim.c r_exp.c r_imag.c r_int.c r_lg10.c \
+ r_log.c r_mod.c r_nint.c r_sign.c r_sin.c r_sinh.c r_sqrt.c \
+ r_tan.c r_tanh.c rawio.h rdfmt.c rewind.c rsfe.c rsli.c rsne.c \
+ s_cat.c s_cmp.c s_copy.c s_paus.c s_rnge.c s_stop.c scomptry.bat sfe.c \
+ sig_die.c signal1.h0 signal_.c signbit.c sue.c sysdep1.h0 system_.c \
+ typesize.c \
+ uio.c uninit.c util.c wref.c wrtfmt.c wsfe.c wsle.c wsne.c xwsne.c \
+ z_abs.c z_cos.c z_div.c z_exp.c z_log.c z_sin.c z_sqrt.c >xsum1.out
+ cmp xsum0.out xsum1.out && mv xsum1.out xsum.out || diff xsum[01].out
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/sig_die.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/sig_die.c
index f8fddc853ef11cbf8819d9fd89599de4b417d422..8e52a0929fe217426d10be494b2c0ef447e54c48 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/sig_die.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/libf2c/sig_die.c
@@ -13,7 +13,7 @@
#endif
#ifdef KR_headers
-void sig_die(s, kill) register char *s; int kill;
+void sig_die(s, killsignal) register char *s; int killsignal;
#else
#include "stdlib.h"
#ifdef __cplusplus
@@ -23,13 +23,13 @@ extern "C" {
extern "C" {
#endif
-void sig_die(register char *s, int kill)
+void sig_die(register char *s, int killsignal)
#endif
{
/* print error message, then clear buffers */
fprintf(stderr, "%s\n", s);
- if(kill)
+ if(killsignal)
{
abort();
}
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/CMakeLists.txt
index ea24157d7b389c74a215eb5f2b71b838519cc377..7de7a5bedf9937beb3f7a7d82b0e38cbd38fc17c 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/CMakeLists.txt
@@ -19,10 +19,11 @@ ENDIF(ITK_LIBRARY_PROPERTIES)
IF(NOT VXL_INSTALL_NO_LIBRARIES)
INSTALL(TARGETS itkv3p_lsqr
- RUNTIME DESTINATION ${VXL_INSTALL_BIN_DIR_CM24} COMPONENT RuntimeLibraries
- LIBRARY DESTINATION ${VXL_INSTALL_LIB_DIR_CM24} COMPONENT RuntimeLibraries
- ARCHIVE DESTINATION ${VXL_INSTALL_LIB_DIR_CM24} COMPONENT Development)
+ EXPORT ${VXL_INSTALL_EXPORT_NAME}
+ RUNTIME DESTINATION ${VXL_INSTALL_RUNTIME_DIR} COMPONENT RuntimeLibraries
+ LIBRARY DESTINATION ${VXL_INSTALL_LIBRARY_DIR} COMPONENT RuntimeLibraries
+ ARCHIVE DESTINATION ${VXL_INSTALL_ARCHIVE_DIR} COMPONENT Development)
ENDIF(NOT VXL_INSTALL_NO_LIBRARIES)
IF(NOT VXL_INSTALL_NO_DEVELOPMENT)
- INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_ROOT}/v3p/netlib ${V3P_NETLIB_lsqr_SOURCES})
+ INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_INCLUDE_DIR} ${V3P_NETLIB_lsqr_SOURCES})
ENDIF(NOT VXL_INSTALL_NO_DEVELOPMENT)
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/lsqrBase.cxx b/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/lsqrBase.cxx
index 4d3fad7a4f17cbfacdefb0fbe9caa5cba82149c0..23bbb78d63d2b06904c04036726def0a4d7c03b3 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/lsqrBase.cxx
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/lsqrBase.cxx
@@ -1,18 +1,20 @@
/*=========================================================================
-
- Program: Insight Segmentation & Registration Toolkit
- Language: C++
- Date: $Date: 2010-04-14 20:49:34 $
- Version: $Revision: 1.4 $
-
- Copyright (c) Insight Software Consortium. All rights reserved.
- See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
-
- This software is distributed WITHOUT ANY WARRANTY; without even
- the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
- PURPOSE. See the above copyright notices for more information.
-
-=========================================================================*/
+ *
+ * Copyright Insight Software Consortium
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0.txt
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ *
+ *=========================================================================*/
#include "lsqrBase.h"
#include <math.h>
@@ -140,14 +142,14 @@ lsqrBase::GetFinalEstimateOfNormRbar() const
}
-double
+double
lsqrBase::GetFinalEstimateOfNormOfResiduals() const
{
return this->Arnorm;
}
-double
+double
lsqrBase::GetFinalEstimateOfNormOfX() const
{
return this->xnorm;
@@ -231,7 +233,7 @@ lsqrBase::D2Norm( double a, double b ) const
{
return zero;
}
-
+
const double sa = a / scale;
const double sb = b / scale;
@@ -261,12 +263,12 @@ lsqrBase::Dnrm2( unsigned int n, const double *x ) const
for ( unsigned int i = 0; i < n; i++ )
{
- if ( x[i] != 0.0 )
+ if ( x[i] != 0.0 )
{
double dx = x[i];
const double absxi = Abs(dx);
- if ( magnitudeOfLargestElement < absxi )
+ if ( magnitudeOfLargestElement < absxi )
{
// rescale the sum to the range of the new element
dx = magnitudeOfLargestElement / absxi;
@@ -288,7 +290,7 @@ lsqrBase::Dnrm2( unsigned int n, const double *x ) const
}
-/**
+/**
*
* The array b must have size m
*
@@ -303,16 +305,16 @@ Solve( unsigned int m, unsigned int n, const double * b, double * x )
{
(*this->nout) << "Enter LSQR " << std::endl;
(*this->nout) << m << ", " << n << std::endl;
- (*this->nout) << this->damp << ", " << this->wantse << std::endl;
- (*this->nout) << this->atol << ", " << this->conlim << std::endl;
- (*this->nout) << this->btol << ", " << this->itnlim << std::endl;
+ (*this->nout) << this->damp << ", " << this->wantse << std::endl;
+ (*this->nout) << this->atol << ", " << this->conlim << std::endl;
+ (*this->nout) << this->btol << ", " << this->itnlim << std::endl;
}
this->damped = ( this->damp > zero );
this->itn = 0;
this->istop = 0;
-
+
unsigned int nstop = 0;
this->maxdx = 0;
@@ -385,7 +387,7 @@ Solve( unsigned int m, unsigned int n, const double * b, double * x )
return;
}
-
+
double rhobar = alpha;
double phibar = beta;
@@ -394,7 +396,7 @@ Solve( unsigned int m, unsigned int n, const double * b, double * x )
double test1 = 0.0;
double test2 = 0.0;
-
+
if ( this->nout )
{
@@ -438,7 +440,7 @@ Solve( unsigned int m, unsigned int n, const double * b, double * x )
//
do {
- this->itn++;
+ this->itn++;
//----------------------------------------------------------------
// Perform the next step of the bidiagonalization to obtain the
@@ -510,7 +512,7 @@ Solve( unsigned int m, unsigned int n, const double * b, double * x )
double t3 = one / rho;
double dknorm = zero;
- if ( this->wantse )
+ if ( this->wantse )
{
for ( unsigned int i = 0; i < n; i++ )
{
@@ -672,7 +674,7 @@ Solve( unsigned int m, unsigned int n, const double * b, double * x )
}
}
- } while ( istop == 0);
+ } while ( istop == 0);
//===================================================================
// End of iteration loop.
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/lsqrBase.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/lsqrBase.h
index 5f2b0956cae08810f3395517fb52491595906f4e..c7801bc487310a12356f08a7081526a04b52e4be 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/lsqrBase.h
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/linalg/lsqrBase.h
@@ -1,18 +1,21 @@
/*=========================================================================
+ *
+ * Copyright Insight Software Consortium
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0.txt
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ *
+ *=========================================================================*/
- Program: Insight Segmentation & Registration Toolkit
- Language: C++
- Date: $Date: 2010-04-14 19:43:36 $
- Version: $Revision: 1.2 $
-
- Copyright (c) Insight Software Consortium. All rights reserved.
- See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
-
- This software is distributed WITHOUT ANY WARRANTY; without even
- the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
- PURPOSE. See the above copyright notices for more information.
-
-=========================================================================*/
#ifndef __itk_lsqr_h
#define __itk_lsqr_h
@@ -24,44 +27,44 @@
* \brief implement a solver for a set of linear equations.
*
* LSQR finds a solution x to the following problems:
- *
+ *
* 1. Unsymmetric equations: Solve A*x = b
- *
+ *
* 2. Linear least squares: Solve A*x = b
* in the least-squares sense
- *
+ *
* 3. Damped least squares: Solve ( A )*x = ( b )
* ( damp*I ) ( 0 )
* in the least-squares sense
- *
+ *
* where A is a matrix with m rows and n columns, b is an m-vector,
* and damp is a scalar. (All quantities are real.)
* The matrix A is treated as a linear operator. It is accessed
* by means of subroutine calls with the following purpose:
- *
+ *
* call Aprod1(m,n,x,y) must compute y = y + A*x without altering x.
* call Aprod2(m,n,x,y) must compute x = x + A'*y without altering y.
- *
+ *
* LSQR uses an iterative method to approximate the solution.
* The number of iterations required to reach a certain accuracy
* depends strongly on the scaling of the problem. Poor scaling of
* the rows or columns of A should therefore be avoided where
* possible.
- *
+ *
* For example, in problem 1 the solution is unaltered by
* row-scaling. If a row of A is very small or large compared to
* the other rows of A, the corresponding row of ( A b ) should be
* scaled up or down.
- *
+ *
* In problems 1 and 2, the solution x is easily recovered
* following column-scaling. Unless better information is known,
* the nonzero columns of A should be scaled so that they all have
* the same Euclidean norm (e.g., 1.0).
- *
+ *
* In problem 3, there is no freedom to re-scale if damp is
* nonzero. However, the value of damp should be assigned only
* after attention has been paid to the scaling of A.
- *
+ *
* The parameter damp is intended to help regularize
* ill-conditioned systems, by preventing the true solution from
* being very large. Another aid to regularization is provided by
@@ -72,13 +75,13 @@
* of the solver that is available at
* http://www.stanford.edu/group/SOL/software.html
* distributed under a BSD license.
- *
+ *
* This class is a replacement for the lsqr code taken from netlib.
* That code had to be removed because it is copyrighted by ACM and
* its license was incompatible with a BSD license.
- *
+ *
*/
-class lsqrBase
+class lsqrBase
{
public:
@@ -100,7 +103,7 @@ public:
* The size of the vector y is m.
*/
virtual void Aprod2(unsigned int m, unsigned int n, double * x, const double * y ) const = 0;
-
+
/**
* returns sqrt( a**2 + b**2 )
* with precautions to avoid overflow.
@@ -112,12 +115,12 @@ public:
* with precautions to avoid overflow.
*/
double Dnrm2( unsigned int n, const double *x ) const;
-
+
/**
* Scale a vector by multiplying with a constant
*/
void Scale( unsigned int n, double factor, double *x ) const;
-
+
/** A logical variable to say if the array se(*) of standard error estimates
* should be computed. If m > n or damp > 0, the system is overdetermined
* and the standard errors may be useful. (See the first LSQR reference.)
@@ -125,7 +128,7 @@ public:
* storage can be saved by setting wantse = .false. and using any convenient
* array for se(*), which won't be touched. If you call this method with the
* flag ON, then you MUST provide a working memory array to store the standard
- * error estimates, via the method SetStandardErrorEstimates()
+ * error estimates, via the method SetStandardErrorEstimates()
*/
void SetStandardErrorEstimatesFlag( bool );
@@ -135,8 +138,8 @@ public:
*/
void SetToleranceA( double );
- /** An estimate of the relative error in the data
- * defining the rhs b. For example, if b is
+ /** An estimate of the relative error in the data
+ * defining the rhs b. For example, if b is
* accurate to about 6 digits, set btol = 1.0e-6.
*/
void SetToleranceB( double );
@@ -179,9 +182,9 @@ public:
* of damp in the range 0 to sqrt(eps)*norm(A)
* will probably have a negligible effect.
* Larger values of damp will tend to decrease
- * the norm of x and reduce the number of
+ * the norm of x and reduce the number of
* iterations required by LSQR.
- *
+ *
* The work per iteration and the storage needed
* by LSQR are the same for all values of damp.
*
@@ -196,41 +199,41 @@ public:
*/
void SetMaximumNumberOfIterations( unsigned int );
- /**
+ /**
* If provided, a summary will be printed out to this stream during
* the execution of the Solve function.
*/
void SetOutputStream( std::ostream & os );
- /** Provide the array where the standard error estimates will be stored.
+ /** Provide the array where the standard error estimates will be stored.
* You MUST provide this working memory array if you turn on the computation
* of standard error estimates with teh method SetStandardErrorEstimatesFlag().
*/
void SetStandardErrorEstimates( double * array );
- /**
+ /**
* Returns an integer giving the reason for termination:
- *
+ *
* 0 x = 0 is the exact solution.
* No iterations were performed.
- *
+ *
* 1 The equations A*x = b are probably compatible.
* Norm(A*x - b) is sufficiently small, given the
* values of atol and btol.
- *
+ *
* 2 damp is zero. The system A*x = b is probably
* not compatible. A least-squares solution has
* been obtained that is sufficiently accurate,
* given the value of atol.
- *
+ *
* 3 damp is nonzero. A damped least-squares
* solution has been obtained that is sufficiently
* accurate, given the value of atol.
- *
+ *
* 4 An estimate of cond(Abar) has exceeded conlim.
* The system A*x = b appears to be ill-conditioned,
* or there could be an error in Aprod1 or Aprod2.
- *
+ *
* 5 The iteration limit itnlim was reached.
*
*/
@@ -241,7 +244,7 @@ public:
unsigned int GetNumberOfIterationsPerformed() const;
- /**
+ /**
* An estimate of the Frobenius norm of Abar.
* This is the square-root of the sum of squares
* of the elements of Abar.
@@ -254,7 +257,7 @@ public:
double GetFrobeniusNormEstimateOfAbar() const;
- /**
+ /**
* An estimate of cond(Abar), the condition
* number of Abar. A very high value of Acond
* may again indicate an error in Aprod1 or Aprod2.
@@ -288,7 +291,7 @@ public:
/**
* Execute the solver
- *
+ *
* solves Ax = b or min ||Ax - b|| with or without damping,
*
* m is the size of the input vector b
@@ -332,4 +335,4 @@ private:
double * se;
};
-#endif
+#endif
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/napack/cg.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/napack/cg.c
index 12a1e9a814a912ec7afe016828132561332aba18..1d54ab2fbae82a00f93c0749893f051483dace6d 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/napack/cg.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/napack/cg.c
@@ -117,7 +117,7 @@ extern "C" {
/* Local variables */
doublereal a, b, c__, d__, f, g;
integer i__, j, k, l=0;
- doublereal p, q, r__, s, v=0, w=0, y[50], z__[50], a8,
+ doublereal p, q, r__, s, v=0, w=0, y[54], z__[54], a8,
c0, c1=0, d0, f0, f1, l3, da, db, fa, fb, fc;
extern doublereal fd_(doublereal *, doublereal *, doublereal *, integer *,
void (*grad)(double*,double*,void*), void*);
@@ -134,7 +134,7 @@ extern "C" {
;
/*< INTEGER I,IT,J,K,L,LIMIT,M,N,NA,NB,NC,ND >*/
-/*< REAL*8 H(N,1),X(1),Y(50),Z(50),A1,A2,A3,A4,A5,A6,A7,A8,A,B,C,C0,C1 >*/
+/*< REAL*8 H(N,1),X(1),Y(54),Z(54),A1,A2,A3,A4,A5,A6,A7,A8,A,B,C,C0,C1 >*/
/*< REAL*8 D,D0,DA,DB,E,F,F0,F1,FA,FB,FC,G,L3,P,Q,R,S,STEP,T,V,W >*/
/*< REAL*8 FV,FD,VALUE >*/
/*< EXTERNAL BOTH,GRAD,PRE,VALUE >*/
@@ -1116,7 +1116,14 @@ L640:
goto L135;
/*< 650 WRITE(6,*) 'UNABLE TO SATISFY ARMIJO CONDITION' >*/
L650:
- printf("UNABLE TO SATISFY ARMIJO CONDITION\n");
+ if(error_code)
+ {
+ *error_code = 4;
+ }
+ else
+ {
+ printf("UNABLE TO SATISFY ARMIJO CONDITION\n");
+ }
/*< RETURN >*/
return 0;
/*< 660 STEP = A >*/
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/opt/lbfgs.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/opt/lbfgs.c
index b0ead95d1623a72cd5dd215b9252da826a114f84..4bfe2550f0168fbb71ba4eff29b3a6eb6a615044 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/opt/lbfgs.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/opt/lbfgs.c
@@ -1447,7 +1447,7 @@ L45:
double sqrt(doublereal);
/* Local variables */
- doublereal p, q, r__, s, sgnd, stpc, stpf, stpq, gamma, theta;
+ doublereal p, q, r__, s, sgnd, stpc, stpf, stpq, gammavalue, theta;
logical mcbound;
/*< INTEGER INFOC >*/
@@ -1548,15 +1548,15 @@ L45:
/*< GAMMA = S*SQRT((THETA/S)**2 - (DX/S)*(DP/S)) >*/
/* Computing 2nd power */
d__1 = theta / s;
- gamma = s * sqrt(d__1 * d__1 - *dx / s * (*dp / s));
+ gammavalue = s * sqrt(d__1 * d__1 - *dx / s * (*dp / s));
/*< IF (STP .LT. STX) GAMMA = -GAMMA >*/
if (stp < stx) {
- gamma = -gamma;
+ gammavalue = -gammavalue;
}
/*< P = (GAMMA - DX) + THETA >*/
- p = gamma - *dx + theta;
+ p = gammavalue - *dx + theta;
/*< Q = ((GAMMA - DX) + GAMMA) + DP >*/
- q = gamma - *dx + gamma + *dp;
+ q = gammavalue - *dx + gammavalue + *dp;
/*< R = P/Q >*/
r__ = p / q;
/*< STPC = STX + R*(STP - STX) >*/
@@ -1599,15 +1599,15 @@ L45:
/*< GAMMA = S*SQRT((THETA/S)**2 - (DX/S)*(DP/S)) >*/
/* Computing 2nd power */
d__1 = theta / s;
- gamma = s * sqrt(d__1 * d__1 - *dx / s * (*dp / s));
+ gammavalue = s * sqrt(d__1 * d__1 - *dx / s * (*dp / s));
/*< IF (STP .GT. STX) GAMMA = -GAMMA >*/
if (stp > stx) {
- gamma = -gamma;
+ gammavalue = -gammavalue;
}
/*< P = (GAMMA - DP) + THETA >*/
- p = gamma - *dp + theta;
+ p = gammavalue - *dp + theta;
/*< Q = ((GAMMA - DP) + GAMMA) + DX >*/
- q = gamma - *dp + gamma + *dx;
+ q = gammavalue - *dp + gammavalue + *dx;
/*< R = P/Q >*/
r__ = p / q;
/*< STPC = STP + R*(STX - STP) >*/
@@ -1659,19 +1659,19 @@ L45:
/* Computing 2nd power */
d__3 = theta / s;
d__1 = 0., d__2 = d__3 * d__3 - *dx / s * (*dp / s);
- gamma = s * sqrt((max(d__1,d__2)));
+ gammavalue = s * sqrt((max(d__1,d__2)));
/*< IF (STP .GT. STX) GAMMA = -GAMMA >*/
if (stp > stx) {
- gamma = -gamma;
+ gammavalue = -gammavalue;
}
/*< P = (GAMMA - DP) + THETA >*/
- p = gamma - *dp + theta;
+ p = gammavalue - *dp + theta;
/*< Q = (GAMMA + (DX - DP)) + GAMMA >*/
- q = gamma + (*dx - *dp) + gamma;
+ q = gammavalue + (*dx - *dp) + gammavalue;
/*< R = P/Q >*/
r__ = p / q;
/*< IF (R .LT. 0.0 .AND. GAMMA .NE. 0.0) THEN >*/
- if (r__ < (float)0. && gamma != (float)0.) {
+ if (r__ < (float)0. && gammavalue != (float)0.) {
/*< STPC = STP + R*(STX - STP) >*/
stpc = stp + r__ * (stx - stp);
/*< ELSE IF (STP .GT. STX) THEN >*/
@@ -1738,15 +1738,15 @@ L45:
/*< GAMMA = S*SQRT((THETA/S)**2 - (DY/S)*(DP/S)) >*/
/* Computing 2nd power */
d__1 = theta / s;
- gamma = s * sqrt(d__1 * d__1 - *dy / s * (*dp / s));
+ gammavalue = s * sqrt(d__1 * d__1 - *dy / s * (*dp / s));
/*< IF (STP .GT. STY) GAMMA = -GAMMA >*/
if (stp > sty) {
- gamma = -gamma;
+ gammavalue = -gammavalue;
}
/*< P = (GAMMA - DP) + THETA >*/
- p = gamma - *dp + theta;
+ p = gammavalue - *dp + theta;
/*< Q = ((GAMMA - DP) + GAMMA) + DY >*/
- q = gamma - *dp + gamma + *dy;
+ q = gammavalue - *dp + gammavalue + *dy;
/*< R = P/Q >*/
r__ = p / q;
/*< STPC = STP + R*(STY - STP) >*/
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/opt/lbfgsb.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/opt/lbfgsb.c
index e1ef4bc5d3e8b6ad944494d642fce6fc8765ca06..487c155ec52136fcd1e01e1c44bd69687abd251d 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/opt/lbfgsb.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/opt/lbfgsb.c
@@ -948,7 +948,7 @@ static doublereal c_b277 = .1;
}
/* Compute f0 and g0. */
/*< task = 'FG_START' >*/
- s_copy(task, "FG_START", (ftnlen)60, (ftnlen)8);
+ s_copy(task, "FG_START", (ftnlen)60, (ftnlen)(8+1));
/* return to the driver to calculate f and g; reenter at 111. */
/*< goto 1000 >*/
goto L1000;
@@ -985,7 +985,7 @@ L111:
/* terminate the algorithm. */
/*< task = 'CONVERGENCE: NORM OF PROJECTED GRADIENT <= PGTOL' >*/
s_copy(task, "CONVERGENCE: NORM OF PROJECTED GRADIENT <= PGTOL", (
- ftnlen)60, (ftnlen)48);
+ ftnlen)60, (ftnlen)(48 + 1));
/*< goto 999 >*/
goto L999;
/*< endif >*/
@@ -1238,7 +1238,7 @@ L666:
}
/*< task = 'ABNORMAL_TERMINATION_IN_LNSRCH' >*/
s_copy(task, "ABNORMAL_TERMINATION_IN_LNSRCH", (ftnlen)60, (
- ftnlen)30);
+ ftnlen)(30+1));
/*< iter = iter + 1 >*/
++iter;
/*< goto 999 >*/
@@ -1273,7 +1273,7 @@ L666:
/*< updatd = .false. >*/
updatd = FALSE_;
/*< task = 'RESTART_FROM_LNSRCH' >*/
- s_copy(task, "RESTART_FROM_LNSRCH", (ftnlen)60, (ftnlen)19);
+ s_copy(task, "RESTART_FROM_LNSRCH", (ftnlen)60, (ftnlen)(19+1));
/*< call timer(cpu2) >*/
timer_(&cpu2);
/*< lnscht = lnscht + cpu2 - cpu1 >*/
@@ -1315,7 +1315,7 @@ L777:
/* terminate the algorithm. */
/*< task = 'CONVERGENCE: NORM OF PROJECTED GRADIENT <= PGTOL' >*/
s_copy(task, "CONVERGENCE: NORM OF PROJECTED GRADIENT <= PGTOL", (
- ftnlen)60, (ftnlen)48);
+ ftnlen)60, (ftnlen)(48+1));
/*< goto 999 >*/
goto L999;
/*< endif >*/
@@ -1329,7 +1329,7 @@ L777:
/* terminate the algorithm. */
/*< task = 'CONVERGENCE: REL_REDUCTION_OF_F <= FACTR*EPSMCH' >*/
s_copy(task, "CONVERGENCE: REL_REDUCTION_OF_F <= FACTR*EPSMCH", (
- ftnlen)60, (ftnlen)47);
+ ftnlen)60, (ftnlen)(47+1));
/*< if (iback .ge. 10) info = -5 >*/
if (iback >= 10) {
info = -5;
@@ -2830,15 +2830,15 @@ L999:
/* Function Body */
if (*n <= 0) {
- s_copy(task, "ERROR: N .LE. 0", (ftnlen)60, (ftnlen)15);
+ s_copy(task, "ERROR: N .LE. 0", (ftnlen)60, (ftnlen)(15+1));
}
/*< if (m .le. 0) task = 'ERROR: M .LE. 0' >*/
if (*m <= 0) {
- s_copy(task, "ERROR: M .LE. 0", (ftnlen)60, (ftnlen)15);
+ s_copy(task, "ERROR: M .LE. 0", (ftnlen)60, (ftnlen)(15+1));
}
/*< if (factr .lt. zero) task = 'ERROR: FACTR .LT. 0' >*/
if (*factr < 0.) {
- s_copy(task, "ERROR: FACTR .LT. 0", (ftnlen)60, (ftnlen)19);
+ s_copy(task, "ERROR: FACTR .LT. 0", (ftnlen)60, (ftnlen)(19+1));
}
/* Check the validity of the arrays nbd(i), u(i), and l(i). */
/*< do 10 i = 1, n >*/
@@ -2848,7 +2848,7 @@ L999:
if (nbd[i__] < 0 || nbd[i__] > 3) {
/* return */
/*< task = 'ERROR: INVALID NBD' >*/
- s_copy(task, "ERROR: INVALID NBD", (ftnlen)60, (ftnlen)18);
+ s_copy(task, "ERROR: INVALID NBD", (ftnlen)60, (ftnlen)(18+1));
/*< info = -6 >*/
*info = -6;
/*< k = i >*/
@@ -2862,7 +2862,7 @@ L999:
/* return */
/*< task = 'ERROR: NO FEASIBLE SOLUTION' >*/
s_copy(task, "ERROR: NO FEASIBLE SOLUTION", (ftnlen)60, (
- ftnlen)27);
+ ftnlen)(27+1));
/*< info = -7 >*/
*info = -7;
/*< k = i >*/
@@ -4011,7 +4011,7 @@ L30:
/*< iback = 0 >*/
*iback = 0;
/*< csave = 'START' >*/
- s_copy(csave, "START", (ftnlen)60, (ftnlen)5);
+ s_copy(csave, "START", (ftnlen)60, (ftnlen)(5+1));
/*< 556 continue >*/
L556:
/*< gd = ddot(n,g,1,d,1) >*/
@@ -4041,7 +4041,7 @@ L556:
if (s_cmp(csave, "CONV", (ftnlen)4, (ftnlen)4) != 0 && s_cmp(csave, "WARN"
, (ftnlen)4, (ftnlen)4) != 0) {
/*< task = 'FG_LNSRCH' >*/
- s_copy(task, "FG_LNSRCH", (ftnlen)60, (ftnlen)9);
+ s_copy(task, "FG_LNSRCH", (ftnlen)60, (ftnlen)(9+1));
/*< ifun = ifun + 1 >*/
++(*ifun);
/*< nfgv = nfgv + 1 >*/
@@ -4067,7 +4067,7 @@ L556:
/*< else >*/
} else {
/*< task = 'NEW_X' >*/
- s_copy(task, "NEW_X", (ftnlen)60, (ftnlen)5);
+ s_copy(task, "NEW_X", (ftnlen)60, (ftnlen)(5+1));
/*< endif >*/
}
/*< return >*/
@@ -5527,35 +5527,35 @@ L999:
/* Check the input arguments for errors. */
/*< if (stp .lt. stpmin) task = 'ERROR: STP .LT. STPMIN' >*/
if (*stp < *stpmin) {
- s_copy(task, "ERROR: STP .LT. STPMIN", task_len, (ftnlen)22);
+ s_copy(task, "ERROR: STP .LT. STPMIN", task_len, (ftnlen)(22+1));
}
/*< if (stp .gt. stpmax) task = 'ERROR: STP .GT. STPMAX' >*/
if (*stp > *stpmax) {
- s_copy(task, "ERROR: STP .GT. STPMAX", task_len, (ftnlen)22);
+ s_copy(task, "ERROR: STP .GT. STPMAX", task_len, (ftnlen)(22+1));
}
/*< if (g .ge. zero) task = 'ERROR: INITIAL G .GE. ZERO' >*/
if (*g >= 0.) {
- s_copy(task, "ERROR: INITIAL G .GE. ZERO", task_len, (ftnlen)26);
+ s_copy(task, "ERROR: INITIAL G .GE. ZERO", task_len, (ftnlen)(26+1));
}
/*< if (ftol .lt. zero) task = 'ERROR: FTOL .LT. ZERO' >*/
if (*ftol < 0.) {
- s_copy(task, "ERROR: FTOL .LT. ZERO", task_len, (ftnlen)21);
+ s_copy(task, "ERROR: FTOL .LT. ZERO", task_len, (ftnlen)(21+1));
}
/*< if (gtol .lt. zero) task = 'ERROR: GTOL .LT. ZERO' >*/
if (*gtol < 0.) {
- s_copy(task, "ERROR: GTOL .LT. ZERO", task_len, (ftnlen)21);
+ s_copy(task, "ERROR: GTOL .LT. ZERO", task_len, (ftnlen)(21+1));
}
/*< if (xtol .lt. zero) task = 'ERROR: XTOL .LT. ZERO' >*/
if (*xtol < 0.) {
- s_copy(task, "ERROR: XTOL .LT. ZERO", task_len, (ftnlen)21);
+ s_copy(task, "ERROR: XTOL .LT. ZERO", task_len, (ftnlen)(21+1));
}
/*< if (stpmin .lt. zero) task = 'ERROR: STPMIN .LT. ZERO' >*/
if (*stpmin < 0.) {
- s_copy(task, "ERROR: STPMIN .LT. ZERO", task_len, (ftnlen)23);
+ s_copy(task, "ERROR: STPMIN .LT. ZERO", task_len, (ftnlen)(23+1));
}
/*< if (stpmax .lt. stpmin) task = 'ERROR: STPMAX .LT. STPMIN' >*/
if (*stpmax < *stpmin) {
- s_copy(task, "ERROR: STPMAX .LT. STPMIN", task_len, (ftnlen)25);
+ s_copy(task, "ERROR: STPMAX .LT. STPMIN", task_len, (ftnlen)(25+1));
}
/* Exit if there are errors on input. */
/*< if (task(1:5) .eq. 'ERROR') return >*/
@@ -5600,7 +5600,7 @@ L999:
/*< stmax = stp + xtrapu*stp >*/
stmax = *stp + *stp * 4.;
/*< task = 'FG' >*/
- s_copy(task, "FG", task_len, (ftnlen)2);
+ s_copy(task, "FG", task_len, (ftnlen)(2+1));
/*< goto 1000 >*/
goto L1000;
/*< else >*/
@@ -5658,24 +5658,24 @@ L999:
/*< >*/
if (brackt && (*stp <= stmin || *stp >= stmax)) {
s_copy(task, "WARNING: ROUNDING ERRORS PREVENT PROGRESS", task_len, (
- ftnlen)41);
+ ftnlen)(41+1));
}
/*< >*/
if (brackt && stmax - stmin <= *xtol * stmax) {
- s_copy(task, "WARNING: XTOL TEST SATISFIED", task_len, (ftnlen)28);
+ s_copy(task, "WARNING: XTOL TEST SATISFIED", task_len, (ftnlen)(28+1));
}
/*< >*/
if (*stp == *stpmax && *f <= ftest && *g <= gtest) {
- s_copy(task, "WARNING: STP = STPMAX", task_len, (ftnlen)21);
+ s_copy(task, "WARNING: STP = STPMAX", task_len, (ftnlen)(21+1));
}
/*< >*/
if (*stp == *stpmin && (*f > ftest || *g >= gtest)) {
- s_copy(task, "WARNING: STP = STPMIN", task_len, (ftnlen)21);
+ s_copy(task, "WARNING: STP = STPMIN", task_len, (ftnlen)(21+1));
}
/* Test for convergence. */
/*< >*/
if (*f <= ftest && abs(*g) <= *gtol * (-ginit)) {
- s_copy(task, "CONVERGENCE", task_len, (ftnlen)11);
+ s_copy(task, "CONVERGENCE", task_len, (ftnlen)(11+1));
}
/* Test for termination. */
/*< if (task(1:4) .eq. 'WARN' .or. task(1:4) .eq. 'CONV') goto 1000 >*/
@@ -5764,7 +5764,7 @@ L999:
}
/* Obtain another function and derivative. */
/*< task = 'FG' >*/
- s_copy(task, "FG", task_len, (ftnlen)2);
+ s_copy(task, "FG", task_len, (ftnlen)(2+1));
/*< 1000 continue >*/
L1000:
/* Save local variables. */
@@ -5824,7 +5824,7 @@ L1000:
double sqrt(doublereal);
/* Local variables */
- doublereal p, q, r__, s, sgnd, stpc, stpf, stpq, gamma, theta;
+ doublereal p, q, r__, s, sgnd, stpc, stpf, stpq, gammavalue, theta;
/*< logical brackt >*/
/*< double precision stx,fx,dx,sty,fy,dy,stp,fp,dp,stpmin,stpmax >*/
@@ -5922,7 +5922,7 @@ L1000:
/* ********** */
/*< double precision zero,p66,two,three >*/
/*< parameter(zero=0.0d0,p66=0.66d0,two=2.0d0,three=3.0d0) >*/
-/*< double precision gamma,p,q,r,s,sgnd,stpc,stpf,stpq,theta >*/
+/*< double precision gammavalue,p,q,r,s,sgnd,stpc,stpf,stpq,theta >*/
/*< sgnd = dp*(dx/abs(dx)) >*/
sgnd = *dp * (*dx / abs(*dx));
/* First case: A higher function value. The minimum is bracketed. */
@@ -5938,18 +5938,18 @@ L1000:
d__1 = abs(theta), d__2 = abs(*dx), d__1 = max(d__1,d__2), d__2 = abs(
*dp);
s = max(d__1,d__2);
-/*< gamma = s*sqrt((theta/s)**2 - (dx/s)*(dp/s)) >*/
+/*< gammavalue = s*sqrt((theta/s)**2 - (dx/s)*(dp/s)) >*/
/* Computing 2nd power */
d__1 = theta / s;
- gamma = s * sqrt(d__1 * d__1 - *dx / s * (*dp / s));
-/*< if (stp .lt. stx) gamma = -gamma >*/
+ gammavalue = s * sqrt(d__1 * d__1 - *dx / s * (*dp / s));
+/*< if (stp .lt. stx) gammavalue = -gammavalue >*/
if (*stp < *stx) {
- gamma = -gamma;
+ gammavalue = -gammavalue;
}
-/*< p = (gamma - dx) + theta >*/
- p = gamma - *dx + theta;
-/*< q = ((gamma - dx) + gamma) + dp >*/
- q = gamma - *dx + gamma + *dp;
+/*< p = (gammavalue - dx) + theta >*/
+ p = gammavalue - *dx + theta;
+/*< q = ((gammavalue - dx) + gammavalue) + dp >*/
+ q = gammavalue - *dx + gammavalue + *dp;
/*< r = p/q >*/
r__ = p / q;
/*< stpc = stx + r*(stp - stx) >*/
@@ -5983,18 +5983,18 @@ L1000:
d__1 = abs(theta), d__2 = abs(*dx), d__1 = max(d__1,d__2), d__2 = abs(
*dp);
s = max(d__1,d__2);
-/*< gamma = s*sqrt((theta/s)**2 - (dx/s)*(dp/s)) >*/
+/*< gammavalue = s*sqrt((theta/s)**2 - (dx/s)*(dp/s)) >*/
/* Computing 2nd power */
d__1 = theta / s;
- gamma = s * sqrt(d__1 * d__1 - *dx / s * (*dp / s));
-/*< if (stp .gt. stx) gamma = -gamma >*/
+ gammavalue = s * sqrt(d__1 * d__1 - *dx / s * (*dp / s));
+/*< if (stp .gt. stx) gammavalue = -gammavalue >*/
if (*stp > *stx) {
- gamma = -gamma;
+ gammavalue = -gammavalue;
}
-/*< p = (gamma - dp) + theta >*/
- p = gamma - *dp + theta;
-/*< q = ((gamma - dp) + gamma) + dx >*/
- q = gamma - *dp + gamma + *dx;
+/*< p = (gammavalue - dp) + theta >*/
+ p = gammavalue - *dp + theta;
+/*< q = ((gammavalue - dp) + gammavalue) + dx >*/
+ q = gammavalue - *dp + gammavalue + *dx;
/*< r = p/q >*/
r__ = p / q;
/*< stpc = stp + r*(stx - stp) >*/
@@ -6029,26 +6029,26 @@ L1000:
d__1 = abs(theta), d__2 = abs(*dx), d__1 = max(d__1,d__2), d__2 = abs(
*dp);
s = max(d__1,d__2);
-/* The case gamma = 0 only arises if the cubic does not tend */
+/* The case gammavalue = 0 only arises if the cubic does not tend */
/* to infinity in the direction of the step. */
-/*< gamma = s*sqrt(max(zero,(theta/s)**2-(dx/s)*(dp/s))) >*/
+/*< gammavalue = s*sqrt(max(zero,(theta/s)**2-(dx/s)*(dp/s))) >*/
/* Computing MAX */
/* Computing 2nd power */
d__3 = theta / s;
d__1 = 0., d__2 = d__3 * d__3 - *dx / s * (*dp / s);
- gamma = s * sqrt((max(d__1,d__2)));
-/*< if (stp .gt. stx) gamma = -gamma >*/
+ gammavalue = s * sqrt((max(d__1,d__2)));
+/*< if (stp .gt. stx) gammavalue = -gammavalue >*/
if (*stp > *stx) {
- gamma = -gamma;
+ gammavalue = -gammavalue;
}
-/*< p = (gamma - dp) + theta >*/
- p = gamma - *dp + theta;
-/*< q = (gamma + (dx - dp)) + gamma >*/
- q = gamma + (*dx - *dp) + gamma;
+/*< p = (gammavalue - dp) + theta >*/
+ p = gammavalue - *dp + theta;
+/*< q = (gammavalue + (dx - dp)) + gammavalue >*/
+ q = gammavalue + (*dx - *dp) + gammavalue;
/*< r = p/q >*/
r__ = p / q;
-/*< if (r .lt. zero .and. gamma .ne. zero) then >*/
- if (r__ < 0. && gamma != 0.) {
+/*< if (r .lt. zero .and. gammavalue .ne. zero) then >*/
+ if (r__ < 0. && gammavalue != 0.) {
/*< stpc = stp + r*(stx - stp) >*/
stpc = *stp + r__ * (*stx - *stp);
/*< else if (stp .gt. stx) then >*/
@@ -6130,18 +6130,18 @@ L1000:
d__1 = abs(theta), d__2 = abs(*dy), d__1 = max(d__1,d__2), d__2 =
abs(*dp);
s = max(d__1,d__2);
-/*< gamma = s*sqrt((theta/s)**2 - (dy/s)*(dp/s)) >*/
+/*< gammavalue = s*sqrt((theta/s)**2 - (dy/s)*(dp/s)) >*/
/* Computing 2nd power */
d__1 = theta / s;
- gamma = s * sqrt(d__1 * d__1 - *dy / s * (*dp / s));
-/*< if (stp .gt. sty) gamma = -gamma >*/
+ gammavalue = s * sqrt(d__1 * d__1 - *dy / s * (*dp / s));
+/*< if (stp .gt. sty) gammavalue = -gammavalue >*/
if (*stp > *sty) {
- gamma = -gamma;
+ gammavalue = -gammavalue;
}
-/*< p = (gamma - dp) + theta >*/
- p = gamma - *dp + theta;
-/*< q = ((gamma - dp) + gamma) + dy >*/
- q = gamma - *dp + gamma + *dy;
+/*< p = (gammavalue - dp) + theta >*/
+ p = gammavalue - *dp + theta;
+/*< q = ((gammavalue - dp) + gammavalue) + dy >*/
+ q = gammavalue - *dp + gammavalue + *dy;
/*< r = p/q >*/
r__ = p / q;
/*< stpc = stp + r*(sty - stp) >*/
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spFactor.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spFactor.c
index 3f8d634a798e37d7411e2a07dd51242473b629c9..f75fd009d44a51f77fb3ba688c098bd5fedb976f 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spFactor.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spFactor.c
@@ -1173,7 +1173,8 @@ RealNumber PivotMag;
* N-1 bottles of beer on the wall.
*/
}
- I = pMarkowitzProduct - Matrix->MarkowitzProd + 1;
+ I = (int)(pMarkowitzProduct - Matrix->MarkowitzProd + 1);
+ // No point leaving in ptrdiff_t since, matrix::size is int
/* Assure that I is valid. */
if (I < Step) break; /* while (Singletons-- > 0) */
@@ -1581,7 +1582,7 @@ RealNumber FindBiggestInColExclude();
{ /* Just passing through. */
}
- I = pMarkowitzProduct - Matrix->MarkowitzProd;
+ I = (int)(pMarkowitzProduct - Matrix->MarkowitzProd);
/* Assure that I is valid; if I < Step, terminate search. */
if (I < Step) break; /* Endless for loop */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spOutput.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spOutput.c
index 3bf9f40a97874dec33e7cd7c76fff56c237cd6bb..1416bb35f599129bfc46b6358acacbabbc0f5015 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spOutput.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spOutput.c
@@ -6,7 +6,7 @@
* UC Berkeley
*/
/*! \file
- *
+ *
* This file contains the output-to-file and output-to-screen routines for
* the matrix package.
*
@@ -60,11 +60,7 @@ Removed File IO routines to get rid of fopen warnings - JLM
#include "spDefs.h"
-
-
-
#if DOCUMENTATION
-
/*!
* Formats and send the matrix to standard output. Some elementary
* statistics are also output. The matrix is output in a format that is
@@ -143,7 +139,7 @@ spPrint(
MatrixPtr Matrix = (MatrixPtr)eMatrix;
register int J = 0;
int I, Row, Col, Size, Top, StartCol = 1, StopCol, Columns, ElementCount = 0;
-double Magnitude, SmallestDiag, SmallestElement;
+double Magnitude, SmallestDiag=LARGEST_REAL, SmallestElement=LARGEST_REAL;
double LargestElement = 0.0, LargestDiag = 0.0;
ElementPtr pElement, pImagElements[PRINTER_WIDTH/10+1];
int *PrintOrdToIntRowMap, *PrintOrdToIntColMap;
@@ -159,9 +155,16 @@ int *PrintOrdToIntRowMap, *PrintOrdToIntColMap;
Top = Matrix->AllocatedSize;
#endif
CALLOC( PrintOrdToIntRowMap, int, Top + 1 );
+ if ( PrintOrdToIntRowMap == NULL)
+ {
+ Matrix->Error = spNO_MEMORY;
+ return;
+ }
CALLOC( PrintOrdToIntColMap, int, Top + 1 );
- if ( PrintOrdToIntRowMap == NULL OR PrintOrdToIntColMap == NULL)
- { Matrix->Error = spNO_MEMORY;
+ if ( PrintOrdToIntColMap == NULL)
+ {
+ Matrix->Error = spNO_MEMORY;
+ FREE(PrintOrdToIntRowMap);
return;
}
for (I = 1; I <= Size; I++)
@@ -191,11 +194,13 @@ int *PrintOrdToIntRowMap, *PrintOrdToIntColMap;
printf("Matrix after factorization:\n");
else
printf("Matrix before factorization:\n");
-
- SmallestElement = LARGEST_REAL;
- SmallestDiag = SmallestElement;
}
- if (Size == 0) return;
+ if (Size == 0)
+ {
+ FREE(PrintOrdToIntColMap);
+ FREE(PrintOrdToIntRowMap);
+ return;
+ }
/* Determine how many columns to use. */
Columns = PRINTER_WIDTH;
@@ -261,7 +266,7 @@ int *PrintOrdToIntRowMap, *PrintOrdToIntColMap;
Col = PrintOrdToIntColMap[J];
pElement = Matrix->FirstInCol[Col];
- while(pElement != NULL AND pElement->Row != Row)
+ while (pElement != NULL AND pElement->Row != Row)
pElement = pElement->NextInCol;
if (Data)
@@ -353,7 +358,7 @@ int *PrintOrdToIntRowMap, *PrintOrdToIntColMap;
#endif /* DOCUMENTATION */
-/* Added to export the row and column maps to convert the
+/* Added to export the row and column maps to convert the
internal matrix to an external form - JLM */
void
spRowColOrder(
@@ -363,7 +368,7 @@ spRowColOrder(
)
{
MatrixPtr Matrix = (MatrixPtr)eMatrix;
-
+
int I, Size;
ASSERT_IS_SPARSE( Matrix );
Size = Matrix->Size;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spUtils.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spUtils.c
index 5647fd0ff530568cb5df6c9463ec4b68b75ab98a..a320ef298ed31a7da67be559c82c359885a4bdab 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spUtils.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/sparse/spUtils.c
@@ -197,7 +197,7 @@ spMNA_Preorder( spMatrix eMatrix )
{
MatrixPtr Matrix = (MatrixPtr)eMatrix;
register int J, Size;
-ElementPtr pTwin1, pTwin2;
+ElementPtr pTwin1=0, pTwin2=0;
int Twins, StartAt = 1;
BOOLEAN Swapped, AnotherPassNeeded;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/temperton/gpfa2f.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/temperton/gpfa2f.c
index 98021b6ac9043fb0cb306bdee4f2b13b0b3ad6a9..442baee4d39582fe64eebab777b8ccf2a48588e9 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/temperton/gpfa2f.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/temperton/gpfa2f.c
@@ -162,10 +162,10 @@ static integer c__2 = 2;
mu = 4 - mu;
}
/*< ss = 1.0 >*/
- ss = (float)1.;
+ ss = 1.f;
/*< if (mu.eq.3) ss = -1.0 >*/
if (mu == 3) {
- ss = (float)-1.;
+ ss = -1.f;
}
/*< if (mh.eq.0) go to 200 >*/
@@ -678,13 +678,13 @@ L300:
mu = 8 - mu;
}
/*< c1 = 1.0 >*/
- c1 = (float)1.;
+ c1 = 1.f;
/*< if (mu.eq.3.or.mu.eq.7) c1 = -1.0 >*/
if (mu == 3 || mu == 7) {
- c1 = (float)-1.;
+ c1 = -1.f;
}
/*< c2 = sqrt(0.5) >*/
- c2 = sqrt((float).5);
+ c2 = sqrt(.5f);
/*< if (mu.eq.3.or.mu.eq.5) c2 = -c2 >*/
if (mu == 3 || mu == 5) {
c2 = -c2;
@@ -1275,10 +1275,10 @@ L400:
mu = 4 - mu;
}
/*< ss = 1.0 >*/
- ss = (float)1.;
+ ss = 1.f;
/*< if (mu.eq.3) ss = -1.0 >*/
if (mu == 3) {
- ss = (float)-1.;
+ ss = -1.f;
}
/*< do 480 ipass = mh+1 , m >*/
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/temperton/setgpfa.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/temperton/setgpfa.c
index 3aa8aed48b3c69bd5c49dad3a270214e94db770d..7c5b0b3e3626b6d1655d7b5a801e5e7e78b663c3 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/temperton/setgpfa.c
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/temperton/setgpfa.c
@@ -140,7 +140,7 @@ L20:
nj[2] = pow_ii(&c__5, &ir);
/*< TWOPI = 4.0 * ASIN(1.0) >*/
- twopi = asin((float)1.) * (float)4.;
+ twopi = asin(1.f) * 4.f;
/*< I = 1 >*/
i__ = 1;
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/CMakeLists.txt
deleted file mode 100644
index 768ce24f14deb1206e93883621fc932ef9af1a14..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/CMakeLists.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-IF(BUILD_TESTING)
- # test
- ADD_EXECUTABLE( netlib_lbfgs_example lbfgs-example.c )
- ADD_TEST( netlib_test_lbfgs ${EXECUTABLE_OUTPUT_PATH}/netlib_lbfgs_example )
- TARGET_LINK_LIBRARIES(netlib_lbfgs_example itkv3p_netlib)
- # test
- ADD_EXECUTABLE( netlib_lbfgsb_example lbfgsb-example1.c )
- ADD_TEST( netlib_test_lbfgsb ${EXECUTABLE_OUTPUT_PATH}/netlib_lbfgsb_example )
- TARGET_LINK_LIBRARIES(netlib_lbfgsb_example itkv3p_netlib)
- # test
- # FIXME ADD_EXECUTABLE( netlib_lsqr_test lsqr-test.c )
- # FIXME ADD_TEST( netlib_test_lsqr ${EXECUTABLE_OUTPUT_PATH}/netlib_lsqr_test )
- # FIXME TARGET_LINK_LIBRARIES(netlib_lsqr_test itkv3p_netlib)
- # test
- ADD_EXECUTABLE( netlib_slamch_test slamch-test.c )
- ADD_TEST( netlib_test_slamch ${EXECUTABLE_OUTPUT_PATH}/netlib_slamch_test )
- TARGET_LINK_LIBRARIES(netlib_slamch_test itkv3p_netlib)
- # test
- ADD_EXECUTABLE( netlib_integral_test integral-test.c )
- ADD_TEST( netlib_test_integral ${EXECUTABLE_OUTPUT_PATH}/netlib_integral_test )
- TARGET_LINK_LIBRARIES(netlib_integral_test itkv3p_netlib)
-ENDIF(BUILD_TESTING)
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/integral-test.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/integral-test.c
deleted file mode 100644
index 1d742a1987d698c7580521e1a5f0cf7eddd78749..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/integral-test.c
+++ /dev/null
@@ -1,56 +0,0 @@
-#include "v3p_netlib.h"
-
-#include <stdio.h>
-
-double f(double *x)
-{
- return (*x)/(1+(*x)*(*x));
-}
-
-void test_simpson_integral()
-{
- double a = 0;
- double b = 1;
- double res;
- long n = 100;
-
- v3p_netlib_simpru_(&f, &a, &b, &n, &res);
- printf("simpson integral of x/(1+x^2) from 0 to 1 (%ld grids) is %2.10f\n", n, res);
-}
-
-void test_adapted_simpson_integral()
-{
- double a = 0;
- double b = 1;
- double res;
- long n = 100;
- double rmat[1111];
- double tol = 1e-10;
- double errbound;
- long stat;
-
- v3p_netlib_adaptquad_(&f, &a, &b, &tol, rmat, &res, &errbound, &n, &stat);
- printf("adapted simpson integral (with tol=%g) of x/(1+x^2) from 0 to 1 (%ld grids) is %2.10f\n", tol, n, res);
- printf("errbound is %f, state is %ld\n", errbound, stat);
-}
-
-void test_trapezod_integral()
-{
- double a = 0;
- double b = 1;
- double res;
- long n = 500;
-
- v3p_netlib_trapru_(&f, &a, &b, &n, &res);
- printf("trapezod integral of x/(1+x^2) from 0 to 1 (%ld grids) is %f\n", n, res);
-}
-
-
-
-int main()
-{
- test_simpson_integral();
- test_adapted_simpson_integral();
- test_trapezod_integral();
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgs-example.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgs-example.c
deleted file mode 100644
index de6dbf5872d58b9f04da2d852a99c231a1ba6f6e..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgs-example.c
+++ /dev/null
@@ -1,135 +0,0 @@
-/* tests/lbfgs-example.f -- translated by f2c (version 20050501).
- You must link the resulting object file with libf2c:
- on Microsoft Windows system, link with libf2c.lib;
- on Linux or Unix systems, link with .../path/to/libf2c.a -lm
- or, if you install libf2c.a in a standard place, with -lf2c -lm
- -- in that order, at the end of the command line, as in
- cc *.o -lf2c -lm
- Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
-
- http://www.netlib.org/f2c/libf2c.zip
-*/
-
-#include "v3p_netlib.h"
-
-/* *********************** */
-/* SIMPLE DRIVER FOR LBFGS */
-/* *********************** */
-
-/* Example of driver for LBFGS routine, using a */
-/* simple test problem. The solution point is at */
-/* X=(1,...,1) and the optimal function value of 0. */
-
-/* JORGE NOCEDAL */
-/* *** July 1990 *** */
-
-/*< PROGRAM SDRIVE >*/
-/* Main program */ int main()
-{
- /* System generated locals */
- integer i__1;
- doublereal d__1, d__2;
-
- /* Local variables */
- doublereal f, g[2000];
- integer j, m, n;
- doublereal w[30014], x[2000], t1, t2, eps, diag[2000], xtol;
- integer iflag, icall;
- logical diagco;
- integer iprint[2];
-
- v3p_netlib_lbfgs_global_t lbfgs_global;
- v3p_netlib_lbfgs_init(&lbfgs_global);
-
-/*< PARAMETER(NDIM=2000,MSAVE=7,NWORK=NDIM*(2*MSAVE +1)+2*MSAVE) >*/
-/*< DOUBLE PRECISION X(NDIM),G(NDIM),DIAG(NDIM),W(NWORK) >*/
-/*< DOUBLE PRECISION F,EPS,XTOL,GTOL,T1,T2,STPMIN,STPMAX >*/
-/*< INTEGER IPRINT(2),IFLAG,ICALL,N,M,MP,LP,J >*/
-/*< LOGICAL DIAGCO >*/
-
-/* The driver for LBFGS must always declare LB2 as EXTERNAL */
-
-/*< EXTERNAL LB2 >*/
-/*< COMMON /LB3/MP,LP,GTOL,STPMIN,STPMAX >*/
-
-/*< N=100 >*/
- n = 100;
-/*< M=5 >*/
- m = 5;
-/*< IPRINT(1)= 1 >*/
- iprint[0] = 1;
-/*< IPRINT(2)= 0 >*/
- iprint[1] = 0;
-
-/* We do not wish to provide the diagonal matrices Hk0, and */
-/* therefore set DIAGCO to FALSE. */
-
-/*< DIAGCO= .FALSE. >*/
- diagco = FALSE_;
-/*< EPS= 1.0D-5 >*/
- eps = 1e-5;
-/*< XTOL= 1.0D-16 >*/
- xtol = 1e-16;
-/*< ICALL=0 >*/
- icall = 0;
-/*< IFLAG=0 >*/
- iflag = 0;
-/*< DO 10 J=1,N,2 >*/
- i__1 = n;
- for (j = 1; j <= i__1; j += 2) {
-/*< X(J)=-1.2D0 >*/
- x[j - 1] = -1.2;
-/*< X(J+1)=1.D0 >*/
- x[j] = 1.;
-/*< 10 CONTINUE >*/
-/* L10: */
- }
-
-/*< 20 CONTINUE >*/
-L20:
-/*< F= 0.D0 >*/
- f = 0.;
-/*< DO 30 J=1,N,2 >*/
- i__1 = n;
- for (j = 1; j <= i__1; j += 2) {
-/*< T1= 1.D0-X(J) >*/
- t1 = 1. - x[j - 1];
-/*< T2= 1.D1*(X(J+1)-X(J)**2) >*/
-/* Computing 2nd power */
- d__1 = x[j - 1];
- t2 = (x[j] - d__1 * d__1) * 10.;
-/*< G(J+1)= 2.D1*T2 >*/
- g[j] = t2 * 20.;
-/*< G(J)= -2.D0*(X(J)*G(J+1)+T1) >*/
- g[j - 1] = (x[j - 1] * g[j] + t1) * -2.;
-/*< F= F+T1**2+T2**2 >*/
-/* Computing 2nd power */
- d__1 = t1;
-/* Computing 2nd power */
- d__2 = t2;
- f = f + d__1 * d__1 + d__2 * d__2;
-/*< 30 CONTINUE >*/
-/* L30: */
- }
-/*< CALL LBFGS(N,M,X,F,G,DIAGCO,DIAG,IPRINT,EPS,XTOL,W,IFLAG) >*/
- v3p_netlib_lbfgs_(
- &n, &m, x, &f, g, &diagco, diag, iprint, &eps, &xtol, w, &iflag,
- &lbfgs_global);
-/*< IF(IFLAG.LE.0) GO TO 50 >*/
- if (iflag <= 0) {
- goto L50;
- }
-/*< ICALL=ICALL + 1 >*/
- ++icall;
-/* We allow at most 2000 evaluations of F and G */
-/*< IF(ICALL.GT.2000) GO TO 50 >*/
- if (icall > 2000) {
- goto L50;
- }
-/*< GO TO 20 >*/
- goto L20;
-/*< 50 CONTINUE >*/
-L50:
-/*< END >*/
- return 0;
-} /* MAIN__ */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgs-example.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgs-example.f
deleted file mode 100644
index 925ea595307ecf95be5eb33418a1ccbcd6a0fa1c..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgs-example.f
+++ /dev/null
@@ -1,62 +0,0 @@
-C
-C ***********************
-C SIMPLE DRIVER FOR LBFGS
-C ***********************
-C
-C Example of driver for LBFGS routine, using a
-C simple test problem. The solution point is at
-C X=(1,...,1) and the optimal function value of 0.
-C
-C JORGE NOCEDAL
-C *** July 1990 ***
-C
- PROGRAM SDRIVE
- PARAMETER(NDIM=2000,MSAVE=7,NWORK=NDIM*(2*MSAVE +1)+2*MSAVE)
- DOUBLE PRECISION X(NDIM),G(NDIM),DIAG(NDIM),W(NWORK)
- DOUBLE PRECISION F,EPS,XTOL,GTOL,T1,T2,STPMIN,STPMAX
- INTEGER IPRINT(2),IFLAG,ICALL,N,M,MP,LP,J
- LOGICAL DIAGCO
-C
-C The driver for LBFGS must always declare LB2 as EXTERNAL
-C
- EXTERNAL LB2
- COMMON /LB3/MP,LP,GTOL,STPMIN,STPMAX
-C
- N=100
- M=5
- IPRINT(1)= 1
- IPRINT(2)= 0
-C
-C We do not wish to provide the diagonal matrices Hk0, and
-C therefore set DIAGCO to FALSE.
-C
- DIAGCO= .FALSE.
- EPS= 1.0D-5
- XTOL= 1.0D-16
- ICALL=0
- IFLAG=0
- DO 10 J=1,N,2
- X(J)=-1.2D0
- X(J+1)=1.D0
- 10 CONTINUE
-C
- 20 CONTINUE
- F= 0.D0
- DO 30 J=1,N,2
- T1= 1.D0-X(J)
- T2= 1.D1*(X(J+1)-X(J)**2)
- G(J+1)= 2.D1*T2
- G(J)= -2.D0*(X(J)*G(J+1)+T1)
- F= F+T1**2+T2**2
- 30 CONTINUE
- CALL LBFGS(N,M,X,F,G,DIAGCO,DIAG,IPRINT,EPS,XTOL,W,IFLAG)
- IF(IFLAG.LE.0) GO TO 50
- ICALL=ICALL + 1
-C We allow at most 2000 evaluations of F and G
- IF(ICALL.GT.2000) GO TO 50
- GO TO 20
- 50 CONTINUE
- END
-C
-C ** LAST LINE OF SIMPLE DRIVER (SDRIVE) **
-
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgsb-example1.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgsb-example1.c
deleted file mode 100644
index fbca492664674b219192a254fc30077efbb5906c..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgsb-example1.c
+++ /dev/null
@@ -1,241 +0,0 @@
-/* lbfgsb-example1.f -- translated by f2c (version 20050501).
- You must link the resulting object file with libf2c:
- on Microsoft Windows system, link with libf2c.lib;
- on Linux or Unix systems, link with .../path/to/libf2c.a -lm
- or, if you install libf2c.a in a standard place, with -lf2c -lm
- -- in that order, at the end of the command line, as in
- cc *.o -lf2c -lm
- Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
-
- http://www.netlib.org/f2c/libf2c.zip
-*/
-
-#include "v3p_netlib.h"
-
-/* DRIVER 1 */
-/* -------------------------------------------------------------- */
-/* SIMPLE DRIVER FOR L-BFGS-B (version 2.1) */
-/* -------------------------------------------------------------- */
-
-/* L-BFGS-B is a code for solving large nonlinear optimization */
-/* problems with simple bounds on the variables. */
-
-/* The code can also be used for unconstrained problems and is */
-/* as efficient for these problems as the earlier limited memory */
-/* code L-BFGS. */
-
-/* This is the simplest driver in the package. It uses all the */
-/* default settings of the code. */
-
-
-/* References: */
-
-/* [1] R. H. Byrd, P. Lu, J. Nocedal and C. Zhu, ``A limited */
-/* memory algorithm for bound constrained optimization'', */
-/* SIAM J. Scientific Computing 16 (1995), no. 5, pp. 1190--1208. */
-
-/* [2] C. Zhu, R.H. Byrd, P. Lu, J. Nocedal, ``L-BFGS-B: FORTRAN */
-/* Subroutines for Large Scale Bound Constrained Optimization'' */
-/* Tech. Report, NAM-11, EECS Department, Northwestern University, */
-/* 1994. */
-
-
-/* (Postscript files of these papers are available via anonymous */
-/* ftp to eecs.nwu.edu in the directory pub/lbfgs/lbfgs_bcm.) */
-
-/* * * * */
-
-/* NEOS, November 1994. (Latest revision June 1996.) */
-/* Optimization Technology Center. */
-/* Argonne National Laboratory and Northwestern University. */
-/* Written by */
-/* Ciyou Zhu */
-/* in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal. */
-
-/* NOTE: The user should adapt the subroutine 'timer' if 'etime' is */
-/* not available on the system. An example for system */
-/* AIX Version 3.2 is available at the end of this driver. */
-
-/* ************** */
-/*< program driver >*/
-/* Main program */ int main()
-{
- /* System generated locals */
- integer i__1;
- doublereal d__1, d__2;
-
- /* Subroutine */ int s_copy(char *, char *, ftnlen, ftnlen);
- integer s_cmp(char *, char *, ftnlen, ftnlen);
-
- /* Local variables */
- doublereal f, g[1024];
- integer i__;
- doublereal l[1024];
- integer m, n;
- doublereal u[1024], x[1024], t1, t2, wa[42584];
- integer nbd[1024], iwa[3072];
- char task[60];
- doublereal factr;
- char csave[60];
- doublereal dsave[29];
- integer isave[44];
- logical lsave[4];
- doublereal pgtol;
- integer iprint;
-
-/* This simple driver demonstrates how to call the L-BFGS-B code to */
-/* solve a sample problem (the extended Rosenbrock function */
-/* subject to bounds on the variables). The dimension n of this */
-/* problem is variable. */
-/*< integer nmax, mmax >*/
-/*< parameter (nmax=1024, mmax=17) >*/
-/* nmax is the dimension of the largest problem to be solved. */
-/* mmax is the maximum number of limited memory corrections. */
-/* Declare the variables needed by the code. */
-/* A description of all these variables is given at the end of */
-/* the driver. */
-/*< character*60 task, csave >*/
-/*< logical lsave(4) >*/
-/*< >*/
-/*< >*/
-/* Declare a few additional variables for this sample problem. */
-/*< double precision t1, t2 >*/
-/*< integer i >*/
-/* We wish to have output at every iteration. */
-/*< iprint = 1 >*/
- iprint = 1;
-/* We specify the tolerances in the stopping criteria. */
-/*< factr=1.0d+7 >*/
- factr = 1e7;
-/*< pgtol=1.0d-5 >*/
- pgtol = 1e-5;
-/* We specify the dimension n of the sample problem and the number */
-/* m of limited memory corrections stored. (n and m should not */
-/* exceed the limits nmax and mmax respectively.) */
-/*< n=25 >*/
- n = 25;
-/*< m=5 >*/
- m = 5;
-/* We now provide nbd which defines the bounds on the variables: */
-/* l specifies the lower bounds, */
-/* u specifies the upper bounds. */
-/* First set bounds on the odd-numbered variables. */
-/*< do 10 i=1,n,2 >*/
- i__1 = n;
- for (i__ = 1; i__ <= i__1; i__ += 2) {
-/*< nbd(i)=2 >*/
- nbd[i__ - 1] = 2;
-/*< l(i)=1.0d0 >*/
- l[i__ - 1] = 1.;
-/*< u(i)=1.0d2 >*/
- u[i__ - 1] = 100.;
-/*< 10 continue >*/
-/* L10: */
- }
-/* Next set bounds on the even-numbered variables. */
-/*< do 12 i=2,n,2 >*/
- i__1 = n;
- for (i__ = 2; i__ <= i__1; i__ += 2) {
-/*< nbd(i)=2 >*/
- nbd[i__ - 1] = 2;
-/*< l(i)=-1.0d2 >*/
- l[i__ - 1] = -100.;
-/*< u(i)=1.0d2 >*/
- u[i__ - 1] = 100.;
-/*< 12 continue >*/
-/* L12: */
- }
-/* We now define the starting point. */
-/*< do 14 i=1,n >*/
- i__1 = n;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< x(i)=3.0d0 >*/
- x[i__ - 1] = 3.;
-/*< 14 continue >*/
-/* L14: */
- }
-/*< write (6,16) >*/
-/*
- 16 format(/,5x, 'Solving sample problem.',
- + /,5x, ' (f = 0.0 at the optimal solution.)',/)
-*/
-#if 0
- printf(" Solving sample problem.\n"
- " (f = 0.0 at the optimal solution.)\n");
-#endif
-/*< >*/
-/* We start the iteration by initializing task. */
-
-/*< task = 'START' >*/
- s_copy(task, "START", (ftnlen)60, (ftnlen)5);
-/* ------- the beginning of the loop ---------- */
-/*< 111 continue >*/
-L111:
-/* This is the call to the L-BFGS-B code. */
-/*< >*/
- setulb_(&n, &m, x, l, u, nbd, &f, g, &factr, &pgtol, wa, iwa, task, &
- iprint, csave, lsave, isave, dsave);
-/*< if (task(1:2) .eq. 'FG') then >*/
- if (s_cmp(task, "FG", (ftnlen)2, (ftnlen)2) == 0) {
-/* the minimization routine has returned to request the */
-/* function f and gradient g values at the current x. */
-/* Compute function value f for the sample problem. */
-/*< f=.25d0*(x(1)-1.d0)**2 >*/
-/* Computing 2nd power */
- d__1 = x[0] - 1.;
- f = d__1 * d__1 * .25;
-/*< do 20 i=2,n >*/
- i__1 = n;
- for (i__ = 2; i__ <= i__1; ++i__) {
-/*< f=f+(x(i)-x(i-1)**2)**2 >*/
-/* Computing 2nd power */
- d__2 = x[i__ - 2];
-/* Computing 2nd power */
- d__1 = x[i__ - 1] - d__2 * d__2;
- f += d__1 * d__1;
-/*< 20 continue >*/
-/* L20: */
- }
-/*< f=4.d0*f >*/
- f *= 4.;
-/* Compute gradient g for the sample problem. */
-/*< t1=x(2)-x(1)**2 >*/
-/* Computing 2nd power */
- d__1 = x[0];
- t1 = x[1] - d__1 * d__1;
-/*< g(1)=2.d0*(x(1)-1.d0)-1.6d1*x(1)*t1 >*/
- g[0] = (x[0] - 1.) * 2. - x[0] * 16. * t1;
-/*< do 22 i=2,n-1 >*/
- i__1 = n - 1;
- for (i__ = 2; i__ <= i__1; ++i__) {
-/*< t2=t1 >*/
- t2 = t1;
-/*< t1=x(i+1)-x(i)**2 >*/
-/* Computing 2nd power */
- d__1 = x[i__ - 1];
- t1 = x[i__] - d__1 * d__1;
-/*< g(i)=8.d0*t2-1.6d1*x(i)*t1 >*/
- g[i__ - 1] = t2 * 8. - x[i__ - 1] * 16. * t1;
-/*< 22 continue >*/
-/* L22: */
- }
-/*< g(n)=8.d0*t1 >*/
- g[n - 1] = t1 * 8.;
-/* go back to the minimization routine. */
-/*< goto 111 >*/
- goto L111;
-/*< endif >*/
- }
-
-/*< if (task(1:5) .eq. 'NEW_X') goto 111 >*/
- if (s_cmp(task, "NEW_X", (ftnlen)5, (ftnlen)5) == 0) {
- goto L111;
- }
-/* the minimization routine has returned with a new iterate, */
-/* and we have opted to continue the iteration. */
-/* ---------- the end of the loop ------------- */
-/* If task is neither FG nor NEW_X we terminate execution. */
-/*< stop >*/
-/*< end >*/
- return 0;
-} /* MAIN__ */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgsb-example1.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgsb-example1.f
deleted file mode 100644
index e35664aff134ab7d612769ee619138f514d92145..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lbfgsb-example1.f
+++ /dev/null
@@ -1,331 +0,0 @@
-c DRIVER 1
-c --------------------------------------------------------------
-c SIMPLE DRIVER FOR L-BFGS-B (version 2.1)
-c --------------------------------------------------------------
-c
-c L-BFGS-B is a code for solving large nonlinear optimization
-c problems with simple bounds on the variables.
-c
-c The code can also be used for unconstrained problems and is
-c as efficient for these problems as the earlier limited memory
-c code L-BFGS.
-c
-c This is the simplest driver in the package. It uses all the
-c default settings of the code.
-c
-c
-c References:
-c
-c [1] R. H. Byrd, P. Lu, J. Nocedal and C. Zhu, ``A limited
-c memory algorithm for bound constrained optimization'',
-c SIAM J. Scientific Computing 16 (1995), no. 5, pp. 1190--1208.
-c
-c [2] C. Zhu, R.H. Byrd, P. Lu, J. Nocedal, ``L-BFGS-B: FORTRAN
-c Subroutines for Large Scale Bound Constrained Optimization''
-c Tech. Report, NAM-11, EECS Department, Northwestern University,
-c 1994.
-c
-c
-c (Postscript files of these papers are available via anonymous
-c ftp to eecs.nwu.edu in the directory pub/lbfgs/lbfgs_bcm.)
-c
-c * * *
-c
-c NEOS, November 1994. (Latest revision June 1996.)
-c Optimization Technology Center.
-c Argonne National Laboratory and Northwestern University.
-c Written by
-c Ciyou Zhu
-c in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
-c
-c NOTE: The user should adapt the subroutine 'timer' if 'etime' is
-c not available on the system. An example for system
-c AIX Version 3.2 is available at the end of this driver.
-c
-c **************
-
- program driver
-
-c This simple driver demonstrates how to call the L-BFGS-B code to
-c solve a sample problem (the extended Rosenbrock function
-c subject to bounds on the variables). The dimension n of this
-c problem is variable.
-
- integer nmax, mmax
- parameter (nmax=1024, mmax=17)
-c nmax is the dimension of the largest problem to be solved.
-c mmax is the maximum number of limited memory corrections.
-
-c Declare the variables needed by the code.
-c A description of all these variables is given at the end of
-c the driver.
-
- character*60 task, csave
- logical lsave(4)
- integer n, m, iprint,
- + nbd(nmax), iwa(3*nmax), isave(44)
- double precision f, factr, pgtol,
- + x(nmax), l(nmax), u(nmax), g(nmax), dsave(29),
- + wa(2*mmax*nmax+4*nmax+12*mmax*mmax+12*mmax)
-
-c Declare a few additional variables for this sample problem.
-
- double precision t1, t2
- integer i
-
-c We wish to have output at every iteration.
-
- iprint = 1
-
-c We specify the tolerances in the stopping criteria.
-
- factr=1.0d+7
- pgtol=1.0d-5
-
-c We specify the dimension n of the sample problem and the number
-c m of limited memory corrections stored. (n and m should not
-c exceed the limits nmax and mmax respectively.)
-
- n=25
- m=5
-
-c We now provide nbd which defines the bounds on the variables:
-c l specifies the lower bounds,
-c u specifies the upper bounds.
-
-c First set bounds on the odd-numbered variables.
-
- do 10 i=1,n,2
- nbd(i)=2
- l(i)=1.0d0
- u(i)=1.0d2
- 10 continue
-
-c Next set bounds on the even-numbered variables.
-
- do 12 i=2,n,2
- nbd(i)=2
- l(i)=-1.0d2
- u(i)=1.0d2
- 12 continue
-
-c We now define the starting point.
-
- do 14 i=1,n
- x(i)=3.0d0
- 14 continue
-
- write (6,16)
- 16 format(/,5x, 'Solving sample problem.',
- + /,5x, ' (f = 0.0 at the optimal solution.)',/)
-
-c We start the iteration by initializing task.
-c
- task = 'START'
-
-c ------- the beginning of the loop ----------
-
- 111 continue
-
-c This is the call to the L-BFGS-B code.
-
- call setulb(n,m,x,l,u,nbd,f,g,factr,pgtol,wa,iwa,task,iprint,
- + csave,lsave,isave,dsave)
-
- if (task(1:2) .eq. 'FG') then
-c the minimization routine has returned to request the
-c function f and gradient g values at the current x.
-
-c Compute function value f for the sample problem.
-
- f=.25d0*(x(1)-1.d0)**2
- do 20 i=2,n
- f=f+(x(i)-x(i-1)**2)**2
- 20 continue
- f=4.d0*f
-
-c Compute gradient g for the sample problem.
-
- t1=x(2)-x(1)**2
- g(1)=2.d0*(x(1)-1.d0)-1.6d1*x(1)*t1
- do 22 i=2,n-1
- t2=t1
- t1=x(i+1)-x(i)**2
- g(i)=8.d0*t2-1.6d1*x(i)*t1
- 22 continue
- g(n)=8.d0*t1
-
-c go back to the minimization routine.
- goto 111
- endif
-c
- if (task(1:5) .eq. 'NEW_X') goto 111
-c the minimization routine has returned with a new iterate,
-c and we have opted to continue the iteration.
-
-c ---------- the end of the loop -------------
-
-c If task is neither FG nor NEW_X we terminate execution.
-
- stop
-
- end
-
-c======================= The end of driver1 ============================
-
-c --------------------------------------------------------------
-c DESCRIPTION OF THE VARIABLES IN L-BFGS-B
-c --------------------------------------------------------------
-c
-c n is an INTEGER variable that must be set by the user to the
-c number of variables. It is not altered by the routine.
-c
-c m is an INTEGER variable that must be set by the user to the
-c number of corrections used in the limited memory matrix.
-c It is not altered by the routine. Values of m < 3 are
-c not recommended, and large values of m can result in excessive
-c computing time. The range 3 <= m <= 20 is recommended.
-c
-c x is a DOUBLE PRECISION array of length n. On initial entry
-c it must be set by the user to the values of the initial
-c estimate of the solution vector. Upon successful exit, it
-c contains the values of the variables at the best point
-c found (usually an approximate solution).
-c
-c l is a DOUBLE PRECISION array of length n that must be set by
-c the user to the values of the lower bounds on the variables. If
-c the i-th variable has no lower bound, l(i) need not be defined.
-c
-c u is a DOUBLE PRECISION array of length n that must be set by
-c the user to the values of the upper bounds on the variables. If
-c the i-th variable has no upper bound, u(i) need not be defined.
-c
-c nbd is an INTEGER array of dimension n that must be set by the
-c user to the type of bounds imposed on the variables:
-c nbd(i)=0 if x(i) is unbounded,
-c 1 if x(i) has only a lower bound,
-c 2 if x(i) has both lower and upper bounds,
-c 3 if x(i) has only an upper bound.
-c
-c f is a DOUBLE PRECISION variable. If the routine setulb returns
-c with task(1:2)= 'FG', then f must be set by the user to
-c contain the value of the function at the point x.
-c
-c g is a DOUBLE PRECISION array of length n. If the routine setulb
-c returns with taskb(1:2)= 'FG', then g must be set by the user to
-c contain the components of the gradient at the point x.
-c
-c factr is a DOUBLE PRECISION variable that must be set by the user.
-c It is a tolerance in the termination test for the algorithm.
-c The iteration will stop when
-c
-c (f^k - f^{k+1})/max{|f^k|,|f^{k+1}|,1} <= factr*epsmch
-c
-c where epsmch is the machine precision which is automatically
-c generated by the code. Typical values for factr on a computer
-c with 15 digits of accuracy in double precision are:
-c factr=1.d+12 for low accuracy;
-c 1.d+7 for moderate accuracy;
-c 1.d+1 for extremely high accuracy.
-c The user can suppress this termination test by setting factr=0.
-c
-c pgtol is a double precision variable.
-c On entry pgtol >= 0 is specified by the user. The iteration
-c will stop when
-c
-c max{|proj g_i | i = 1, ..., n} <= pgtol
-c
-c where pg_i is the ith component of the projected gradient.
-c The user can suppress this termination test by setting pgtol=0.
-c
-c wa is a DOUBLE PRECISION array of length
-c (2mmax + 4)nmax + 12mmax^2 + 12mmax used as workspace.
-c This array must not be altered by the user.
-c
-c iwa is an INTEGER array of length 3nmax used as
-c workspace. This array must not be altered by the user.
-c
-c task is a CHARACTER string of length 60.
-c On first entry, it must be set to 'START'.
-c On a return with task(1:2)='FG', the user must evaluate the
-c function f and gradient g at the returned value of x.
-c On a return with task(1:5)='NEW_X', an iteration of the
-c algorithm has concluded, and f and g contain f(x) and g(x)
-c respectively. The user can decide whether to continue or stop
-c the iteration.
-c When
-c task(1:4)='CONV', the termination test in L-BFGS-B has been
-c satisfied;
-c task(1:4)='ABNO', the routine has terminated abnormally
-c without being able to satisfy the termination conditions,
-c x contains the best approximation found,
-c f and g contain f(x) and g(x) respectively;
-c task(1:5)='ERROR', the routine has detected an error in the
-c input parameters;
-c On exit with task = 'CONV', 'ABNO' or 'ERROR', the variable task
-c contains additional information that the user can print.
-c This array should not be altered unless the user wants to
-c stop the run for some reason. See driver2 or driver3
-c for a detailed explanation on how to stop the run
-c by assigning task(1:4)='STOP' in the driver.
-c
-c iprint is an INTEGER variable that must be set by the user.
-c It controls the frequency and type of output generated:
-c iprint<0 no output is generated;
-c iprint=0 print only one line at the last iteration;
-c 0<iprint<99 print also f and |proj g| every iprint iterations;
-c iprint=99 print details of every iteration except n-vectors;
-c iprint=100 print also the changes of active set and final x;
-c iprint>100 print details of every iteration including x and g;
-c When iprint > 0, the file iterate.dat will be created to
-c summarize the iteration.
-c
-c csave is a CHARACTER working array of length 60.
-c
-c lsave is a LOGICAL working array of dimension 4.
-c On exit with task = 'NEW_X', the following information is
-c available:
-c lsave(1) = .true. the initial x did not satisfy the bounds;
-c lsave(2) = .true. the problem contains bounds;
-c lsave(3) = .true. each variable has upper and lower bounds.
-c
-c isave is an INTEGER working array of dimension 44.
-c On exit with task = 'NEW_X', it contains information that
-c the user may want to access:
-c isave(30) = the current iteration number;
-c isave(34) = the total number of function and gradient
-c evaluations;
-c isave(36) = the number of function value or gradient
-c evaluations in the current iteration;
-c isave(38) = the number of free variables in the current
-c iteration;
-c isave(39) = the number of active constraints at the current
-c iteration;
-c
-c see the subroutine setulb.f for a description of other
-c information contained in isave
-c
-c dsave is a DOUBLE PRECISION working array of dimension 29.
-c On exit with task = 'NEW_X', it contains information that
-c the user may want to access:
-c dsave(2) = the value of f at the previous iteration;
-c dsave(5) = the machine precision epsmch generated by the code;
-c dsave(13) = the infinity norm of the projected gradient;
-c
-c see the subroutine setulb.f for a description of other
-c information contained in dsave
-c
-c --------------------------------------------------------------
-c END OF THE DESCRIPTION OF THE VARIABLES IN L-BFGS-B
-c --------------------------------------------------------------
-c
-c << An example of subroutine 'timer' for AIX Version 3.2 >>
-c
-c subroutine timer(ttime)
-c double precision ttime
-c integer itemp, integer mclock
-c itemp = mclock()
-c ttime = dble(itemp)*1.0d-2
-c return
-c end
-c-----------------------------------------------------------------------
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lsqr-test.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lsqr-test.c
deleted file mode 100644
index 26eb98be6100950eb043709c9451031a1705149b..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lsqr-test.c
+++ /dev/null
@@ -1,730 +0,0 @@
-/* tests/lsqr-test.f -- translated by f2c (version 20050501).
- You must link the resulting object file with libf2c:
- on Microsoft Windows system, link with libf2c.lib;
- on Linux or Unix systems, link with .../path/to/libf2c.a -lm
- or, if you install libf2c.a in a standard place, with -lf2c -lm
- -- in that order, at the end of the command line, as in
- cc *.o -lf2c -lm
- Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
-
- http://www.netlib.org/f2c/libf2c.zip
-*/
-
-#include "v3p_netlib.h"
-
-#include <stdio.h>
-
-/* Table of constant values */
-
-static integer c__1 = 1;
-static integer c__600 = 600;
-static doublereal c_b53 = -1.;
-static integer c__2 = 2;
-static integer c__40 = 40;
-static integer c__4 = 4;
-static integer c__80 = 80;
-
-/* ******************************************************** */
-
-/* These routines are for testing LSQR. */
-
-/* ******************************************************** */
-/*< SUBROUTINE APROD ( MODE, M, N, X, Y, LENIW, LENRW, IW, RW ) >*/
-/* Subroutine */ int aprod_(integer *mode, integer *m, integer *n, doublereal
- *x, doublereal *y, integer *leniw, integer *lenrw, integer *iw,
- doublereal *rw, void* userdata)
-{
- integer locd, locw, lochy, lochz;
- extern /* Subroutine */ int aprod1_(integer *, integer *, doublereal *,
- doublereal *, doublereal *, doublereal *, doublereal *,
- doublereal *), aprod2_(integer *, integer *, doublereal *,
- doublereal *, doublereal *, doublereal *, doublereal *,
- doublereal *);
- (void)leniw;
- (void)lenrw;
- (void)userdata;
-
-/*< INTEGER MODE, M, N, LENIW, LENRW >*/
-/*< INTEGER IW(LENIW) >*/
-/*< DOUBLE PRECISION X(N), Y(M), RW(LENRW) >*/
-/* ------------------------------------------------------------------ */
-/* This is the matrix-vector product routine required by LSQR */
-/* for a test matrix of the form A = HY*D*HZ. The quantities */
-/* defining D, HY, HZ are in the work array RW, followed by a */
-/* work array W. These are passed to APROD1 and APROD2 in order to */
-/* make the code readable. */
-/* ------------------------------------------------------------------ */
-/*< INTEGER LOCD, LOCHY, LOCHZ, LOCW >*/
-/*< LOCD = 1 >*/
- /* Parameter adjustments */
- --y;
- --x;
- --iw;
- --rw;
-
- /* Function Body */
- locd = 1;
-/*< LOCHY = LOCD + N >*/
- lochy = locd + *n;
-/*< LOCHZ = LOCHY + M >*/
- lochz = lochy + *m;
-/*< LOCW = LOCHZ + N >*/
- locw = lochz + *n;
-/*< >*/
- if (*mode == 1) {
- aprod1_(m, n, &x[1], &y[1], &rw[locd], &rw[lochy], &rw[lochz], &rw[
- locw]);
- }
-/*< >*/
- if (*mode != 1) {
- aprod2_(m, n, &x[1], &y[1], &rw[locd], &rw[lochy], &rw[lochz], &rw[
- locw]);
- }
-/* End of APROD */
-/*< END >*/
- return 0;
-} /* aprod_ */
-
-/*< SUBROUTINE APROD1( M, N, X, Y, D, HY, HZ, W ) >*/
-/* Subroutine */ int aprod1_(integer *m, integer *n, doublereal *x,
- doublereal *y, doublereal *d__, doublereal *hy, doublereal *hz,
- doublereal *w)
-{
- /* System generated locals */
- integer i__1;
-
- /* Local variables */
- integer i__;
- extern /* Subroutine */ int hprod_(integer *, doublereal *, doublereal *,
- doublereal *);
-
-/*< INTEGER M, N >*/
-/*< DOUBLE PRECISION X(N), Y(M), D(N), HY(M), HZ(N), W(M) >*/
-/* ------------------------------------------------------------------ */
-/* APROD1 computes Y = Y + A*X for subroutine APROD, */
-/* where A is a test matrix of the form A = HY*D*HZ, */
-/* and the latter matrices HY, D, HZ are represented by */
-/* input vectors with the same name. */
-/* ------------------------------------------------------------------ */
-/*< INTEGER I >*/
-/*< DOUBLE PRECISION ZERO >*/
-/*< PARAMETER ( ZERO = 0.0 ) >*/
-/*< CALL HPROD ( N, HZ, X, W ) >*/
- /* Parameter adjustments */
- --w;
- --hy;
- --y;
- --hz;
- --d__;
- --x;
-
- /* Function Body */
- hprod_(n, &hz[1], &x[1], &w[1]);
-/*< DO 100 I = 1, N >*/
- i__1 = *n;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< W(I) = D(I) * W(I) >*/
- w[i__] = d__[i__] * w[i__];
-/*< 100 CONTINUE >*/
-/* L100: */
- }
-/*< DO 200 I = N + 1, M >*/
- i__1 = *m;
- for (i__ = *n + 1; i__ <= i__1; ++i__) {
-/*< W(I) = ZERO >*/
- w[i__] = 0.;
-/*< 200 CONTINUE >*/
-/* L200: */
- }
-/*< CALL HPROD ( M, HY, W, W ) >*/
- hprod_(m, &hy[1], &w[1], &w[1]);
-/*< DO 600 I = 1, M >*/
- i__1 = *m;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< Y(I) = Y(I) + W(I) >*/
- y[i__] += w[i__];
-/*< 600 CONTINUE >*/
-/* L600: */
- }
-/* End of APROD1 */
-/*< END >*/
- return 0;
-} /* aprod1_ */
-
-/*< SUBROUTINE APROD2( M, N, X, Y, D, HY, HZ, W ) >*/
-/* Subroutine */ int aprod2_(integer *m, integer *n, doublereal *x,
- doublereal *y, doublereal *d__, doublereal *hy, doublereal *hz,
- doublereal *w)
-{
- /* System generated locals */
- integer i__1;
-
- /* Local variables */
- integer i__;
- extern /* Subroutine */ int hprod_(integer *, doublereal *, doublereal *,
- doublereal *);
-
-/*< INTEGER M, N >*/
-/*< DOUBLE PRECISION X(N), Y(M), D(N), HY(M), HZ(N), W(M) >*/
-/* ------------------------------------------------------------------ */
-/* APROD2 computes X = X + A(T)*Y for subroutine APROD, */
-/* where A is a test matrix of the form A = HY*D*HZ, */
-/* and the latter matrices HY, D, HZ are represented by */
-/* input vectors with the same name. */
-/* ------------------------------------------------------------------ */
-/*< INTEGER I >*/
-/*< CALL HPROD ( M, HY, Y, W ) >*/
- /* Parameter adjustments */
- --w;
- --hy;
- --y;
- --hz;
- --d__;
- --x;
-
- /* Function Body */
- hprod_(m, &hy[1], &y[1], &w[1]);
-/*< DO 100 I = 1, N >*/
- i__1 = *n;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< W(I) = D(I)*W(I) >*/
- w[i__] = d__[i__] * w[i__];
-/*< 100 CONTINUE >*/
-/* L100: */
- }
-/*< CALL HPROD ( N, HZ, W, W ) >*/
- hprod_(n, &hz[1], &w[1], &w[1]);
-/*< DO 600 I = 1, N >*/
- i__1 = *n;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< X(I) = X(I) + W(I) >*/
- x[i__] += w[i__];
-/*< 600 CONTINUE >*/
-/* L600: */
- }
-/* End of APROD2 */
-/*< END >*/
- return 0;
-} /* aprod2_ */
-
-/*< SUBROUTINE HPROD ( N, HZ, X, Y ) >*/
-/* Subroutine */ int hprod_(integer *n, doublereal *hz, doublereal *x,
- doublereal *y)
-{
- /* System generated locals */
- integer i__1;
-
- /* Local variables */
- integer i__;
- doublereal s;
-
-/*< INTEGER N >*/
-/*< DOUBLE PRECISION HZ(N), X(N), Y(N) >*/
-/* ------------------------------------------------------------------ */
-/* HPROD applies a Householder transformation stored in HZ */
-/* to get Y = ( I - 2*HZ*HZ(transpose) ) * X. */
-/* ------------------------------------------------------------------ */
-/*< INTEGER I >*/
-/*< DOUBLE PRECISION S >*/
-/*< S = 0.0 >*/
- /* Parameter adjustments */
- --y;
- --x;
- --hz;
-
- /* Function Body */
- s = (float)0.;
-/*< DO 100 I = 1, N >*/
- i__1 = *n;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< S = HZ(I) * X(I) + S >*/
- s = hz[i__] * x[i__] + s;
-/*< 100 CONTINUE >*/
-/* L100: */
- }
-/*< S = S + S >*/
- s += s;
-/*< DO 200 I = 1, N >*/
- i__1 = *n;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< Y(I) = X(I) - S * HZ(I) >*/
- y[i__] = x[i__] - s * hz[i__];
-/*< 200 CONTINUE >*/
-/* L200: */
- }
-/* End of HPROD */
-/*< END >*/
- return 0;
-} /* hprod_ */
-
-/*< >*/
-/* Subroutine */ int lstp_(integer *m, integer *n, integer *nduplc, integer *
- npower, doublereal *damp, doublereal *x, doublereal *b, doublereal *
- d__, doublereal *hy, doublereal *hz, doublereal *w, doublereal *acond,
- doublereal *rnorm)
-{
- /* System generated locals */
- integer i__1;
- doublereal d__1, d__2;
-
- /* Builtin functions */
- double sin(doublereal), cos(doublereal), pow_di(doublereal *, integer *),
- sqrt(doublereal);
-
- /* Local variables */
- integer i__, j;
- doublereal t, alfa, beta;
- extern doublereal dnrm2_(integer *, doublereal *, integer *);
- extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
- integer *), hprod_(integer *, doublereal *, doublereal *,
- doublereal *), aprod1_(integer *, integer *, doublereal *,
- doublereal *, doublereal *, doublereal *, doublereal *,
- doublereal *);
- doublereal dampsq, fourpi;
-
-/*< INTEGER M, N, MAXMN, NDUPLC, NPOWER >*/
-/*< DOUBLE PRECISION DAMP, ACOND, RNORM >*/
-/*< DOUBLE PRECISION B(M), X(N), D(N), HY(M), HZ(N), W(M) >*/
-/* ------------------------------------------------------------------ */
-/* LSTP generates a sparse least-squares test problem of the form */
-
-/* ( A )*X = ( B ) */
-/* ( DAMP*I ) ( 0 ) */
-
-/* having a specified solution X. The matrix A is constructed */
-/* in the form A = HY*D*HZ, where D is an M by N diagonal matrix, */
-/* and HY and HZ are Householder transformations. */
-
-/* The first 6 parameters are input to LSTP. The remainder are */
-/* output. LSTP is intended for use with M .GE. N. */
-
-
-/* Functions and subroutines */
-
-/* TESTPROB APROD1, HPROD */
-/* BLAS DNRM2 */
-/* ------------------------------------------------------------------ */
-/* Intrinsics and local variables */
-/*< INTRINSIC COS, SIN, SQRT >*/
-/*< INTEGER I, J >*/
-/*< DOUBLE PRECISION DNRM2 >*/
-/*< DOUBLE PRECISION ALFA, BETA, DAMPSQ, FOURPI, T >*/
-/*< DOUBLE PRECISION ZERO, ONE >*/
-/*< PARAMETER ( ZERO = 0.0, ONE = 1.0 ) >*/
-/* ------------------------------------------------------------------ */
-/* Make two vectors of norm 1.0 for the Householder transformations. */
-/* FOURPI need not be exact. */
-/* ------------------------------------------------------------------ */
-/*< DAMPSQ = DAMP**2 >*/
- /* Parameter adjustments */
- --w;
- --hy;
- --b;
- --hz;
- --d__;
- --x;
-
- /* Function Body */
-/* Computing 2nd power */
- d__1 = *damp;
- dampsq = d__1 * d__1;
-/*< FOURPI = 4.0 * 3.141592 >*/
- fourpi = (float)12.566368000000001;
-/*< ALFA = FOURPI / M >*/
- alfa = fourpi / *m;
-/*< BETA = FOURPI / N >*/
- beta = fourpi / *n;
-/*< DO 100 I = 1, M >*/
- i__1 = *m;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< HY(I) = SIN( I * ALFA ) >*/
- hy[i__] = sin(i__ * alfa);
-/*< 100 CONTINUE >*/
-/* L100: */
- }
-/*< DO 200 I = 1, N >*/
- i__1 = *n;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< HZ(I) = COS( I * BETA ) >*/
- hz[i__] = cos(i__ * beta);
-/*< 200 CONTINUE >*/
-/* L200: */
- }
-/*< ALFA = DNRM2 ( M, HY, 1 ) >*/
- alfa = dnrm2_(m, &hy[1], &c__1);
-/*< BETA = DNRM2 ( N, HZ, 1 ) >*/
- beta = dnrm2_(n, &hz[1], &c__1);
-/*< CALL DSCAL ( M, (- ONE / ALFA), HY, 1 ) >*/
- d__1 = -1. / alfa;
- dscal_(m, &d__1, &hy[1], &c__1);
-/*< CALL DSCAL ( N, (- ONE / BETA), HZ, 1 ) >*/
- d__1 = -1. / beta;
- dscal_(n, &d__1, &hz[1], &c__1);
-
-/* ------------------------------------------------------------------ */
-/* Set the diagonal matrix D. These are the singular values of A. */
-/* ------------------------------------------------------------------ */
-/*< DO 300 I = 1, N >*/
- i__1 = *n;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< J = (I - 1 + NDUPLC) / NDUPLC >*/
- j = (i__ - 1 + *nduplc) / *nduplc;
-/*< T = J * NDUPLC >*/
- t = (doublereal) (j * *nduplc);
-/*< T = T / N >*/
- t /= *n;
-/*< D(I) = T**NPOWER >*/
- d__[i__] = pow_di(&t, npower);
-/*< 300 CONTINUE >*/
-/* L300: */
- }
-/*< ACOND = SQRT( (D(N)**2 + DAMPSQ) / (D(1)**2 + DAMPSQ) ) >*/
-/* Computing 2nd power */
- d__1 = d__[*n];
-/* Computing 2nd power */
- d__2 = d__[1];
- *acond = sqrt((d__1 * d__1 + dampsq) / (d__2 * d__2 + dampsq));
-/* ------------------------------------------------------------------ */
-/* Compute the residual vector, storing it in B. */
-/* It takes the form HY*( s ) */
-/* ( t ) */
-/* where s is obtained from D*s = DAMP**2 * HZ * X */
-/* and t can be anything. */
-/* ------------------------------------------------------------------ */
-/*< CALL HPROD ( N, HZ, X, B ) >*/
- hprod_(n, &hz[1], &x[1], &b[1]);
-/*< DO 500 I = 1, N >*/
- i__1 = *n;
- for (i__ = 1; i__ <= i__1; ++i__) {
-/*< B(I) = DAMPSQ * B(I) / D(I) >*/
- b[i__] = dampsq * b[i__] / d__[i__];
-/*< 500 CONTINUE >*/
-/* L500: */
- }
-/*< T = ONE >*/
- t = 1.;
-/*< DO 600 I = N + 1, M >*/
- i__1 = *m;
- for (i__ = *n + 1; i__ <= i__1; ++i__) {
-/*< J = I - N >*/
- j = i__ - *n;
-/*< B(I) = (T * J) / M >*/
- b[i__] = t * j / *m;
-/*< T = - T >*/
- t = -t;
-/*< 600 CONTINUE >*/
-/* L600: */
- }
-/*< CALL HPROD ( M, HY, B, B ) >*/
- hprod_(m, &hy[1], &b[1], &b[1]);
-/* ------------------------------------------------------------------ */
-/* Now compute the true B = RESIDUAL + A*X. */
-/* ------------------------------------------------------------------ */
-/*< >*/
-/* Computing 2nd power */
- d__1 = dnrm2_(m, &b[1], &c__1);
-/* Computing 2nd power */
- d__2 = dnrm2_(n, &x[1], &c__1);
- *rnorm = sqrt(d__1 * d__1 + dampsq * (d__2 * d__2));
-/*< CALL APROD1( M, N, X, B, D, HY, HZ, W ) >*/
- aprod1_(m, n, &x[1], &b[1], &d__[1], &hy[1], &hz[1], &w[1]);
-/* End of LSTP */
-/*< END >*/
- return 0;
-} /* lstp_ */
-
-/*< SUBROUTINE TEST ( M, N, NDUPLC, NPOWER, DAMP ) >*/
-/* Subroutine */ int test_(integer *m, integer *n, integer *nduplc, integer *
- npower, doublereal *damp)
-{
- /* System generated locals */
- integer i__1;
- doublereal d__1, d__2;
-
- /* Builtin functions */
- double sqrt(doublereal);
-
- /* Local variables */
- doublereal b[200];
- integer j;
- doublereal u[200], v[100], w[100], x[100], se[100];
- integer iw[1];
- doublereal rw[600];
- integer itn, locd;
- doublereal atol, btol, etol;
- integer locw;
- extern int lstp_(integer *, integer *, integer *
- , integer *, doublereal *, doublereal *, doublereal *, doublereal
- *, doublereal *, doublereal *, doublereal *, doublereal *,
- doublereal *);
- integer nout;
- extern doublereal dnrm2_(integer *, doublereal *, integer *);
- doublereal acond;
- extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
- integer *), aprod_(integer *, integer *, integer *, doublereal *,
- doublereal *, integer *, integer *, integer *, doublereal *,
- void*);
- doublereal anorm;
- integer lochy;
- doublereal enorm;
- integer lochz;
- extern /* Subroutine */ int dcopy_(integer *, doublereal *, integer *,
- doublereal *, integer *);
- doublereal rnorm;
- integer istop;
- doublereal xnorm, xtrue[100], conlim, dampsq;
- integer itnlim;
- doublereal arnorm;
- integer ltotal;
-
-/*< INTEGER M, N, NDUPLC, NPOWER >*/
-/*< DOUBLE PRECISION DAMP >*/
-/* ------------------------------------------------------------------ */
-/* This is an example driver routine for running LSQR. */
-/* It generates a test problem, solves it, and examines the results. */
-/* Note that subroutine APROD must be declared EXTERNAL */
-/* if it is used only in the call to LSQR. */
-
-
-/* Functions and subroutines */
-
-/* TESTPROB APROD */
-/* BLAS DCOPY, DNRM2, DSCAL */
-/* ------------------------------------------------------------------ */
-/* Intrinsics and local variables */
-/*< INTRINSIC MAX, SQRT >*/
-/*< EXTERNAL APROD >*/
-/*< INTEGER ISTOP, ITNLIM, J, NOUT >*/
-/*< DOUBLE PRECISION DNRM2 >*/
-/*< PARAMETER ( MAXM = 200, MAXN = 100 ) >*/
-/*< >*/
-/*< >*/
-/*< PARAMETER ( LENIW = 1, LENRW = 600 ) >*/
-/*< INTEGER IW(LENIW) >*/
-/*< DOUBLE PRECISION RW(LENRW) >*/
-/*< INTEGER LOCD, LOCHY, LOCHZ, LOCW, LTOTAL >*/
-/*< DOUBLE PRECISION ONE >*/
-/*< PARAMETER ( ONE = 1.0 ) >*/
-/*< CHARACTER*34 LINE >*/
-/*< >*/
-/* Set the desired solution XTRUE. */
-/*< DO 100 J = 1, N >*/
- i__1 = *n;
- for (j = 1; j <= i__1; ++j) {
-/*< XTRUE(J) = N - J >*/
- xtrue[j - 1] = (doublereal) (*n - j);
-/*< 100 CONTINUE >*/
-/* L100: */
- }
-/* Generate the specified test problem. */
-/* The workspace array IW is not needed in this application. */
-/* The workspace array RW is used for the following vectors: */
-/* D(N), HY(M), HZ(N), W(MAX(M,N)). */
-/* The vectors D, HY, HZ will define the test matrix A. */
-/* W is needed for workspace in APROD1 and APROD2. */
-/*< LOCD = 1 >*/
- locd = 1;
-/*< LOCHY = LOCD + N >*/
- lochy = locd + *n;
-/*< LOCHZ = LOCHY + M >*/
- lochz = lochy + *m;
-/*< LOCW = LOCHZ + N >*/
- locw = lochz + *n;
-/*< LTOTAL = LOCW + MAX(M,N) - 1 >*/
- ltotal = locw + max(*m,*n) - 1;
-/*< IF (LTOTAL .GT. LENRW) GO TO 900 >*/
- if (ltotal > 600) {
- goto L900;
- }
-/*< >*/
- lstp_(m, n, nduplc, npower, damp, xtrue, b, &rw[locd - 1], &rw[lochy - 1],
- &rw[lochz - 1], &rw[locw - 1], &acond, &rnorm);
-/* Solve the problem defined by APROD, DAMP and B. */
-/* Copy the rhs vector B into U (LSQR will overwrite U) */
-/* and set the other input parameters for LSQR. */
-/*< CALL DCOPY ( M, B, 1, U, 1 ) >*/
- dcopy_(m, b, &c__1, u, &c__1);
-/*< ATOL = 1.0E-10 >*/
- atol = (float)1e-10;
-/*< BTOL = ATOL >*/
- btol = atol;
-/*< CONLIM = 10.0 * ACOND >*/
- conlim = acond * (float)10.;
-/*< ITNLIM = M + N + 50 >*/
- itnlim = *m + *n + 50;
-/*< NOUT = 6 >*/
- nout = 6;
-/*< >*/
- printf("\n\n --------------------------------------------------------------------\n");
- printf(" Least-Squares Test Problem P( %ld %ld %ld %ld %12.2e )\n\n", *m,*n,*nduplc,*npower,*damp);
- printf(" Condition no. =%12.4e Residual function =%17.9e\n", acond, rnorm);
- printf(" --------------------------------------------------------------------\n");
-/*< >*/
- lsqr_(m, n, aprod_, damp, &c__1, &c__600, iw, rw, u, v, w, x, se, &
- atol, &btol, &conlim, &itnlim, &nout, &istop, &itn, &anorm, &
- acond, &rnorm, &arnorm, &xnorm, 0);
-/* Examine the results. */
-/* We print the residual norms RNORM and ARNORM given by LSQR, */
-/* and then compute their true values in terms of the solution X */
-/* obtained by LSQR. At least one of them should be small. */
-/*< DAMPSQ = DAMP**2 >*/
-/* Computing 2nd power */
- d__1 = *damp;
- dampsq = d__1 * d__1;
-/*< WRITE(NOUT, 2000) >*/
-/*
- 2000 FORMAT(
- $ // 22X, ' Residual norm Residual norm Solution norm'
- $ / 22X, '(Abar X - bbar) (Normal eqns) (X)' /)
-*/
- printf("\n\n Residual norm Residual norm Solution norm\n");
- printf(" (Abar X - bbar) (Normal eqns) (X)\n");
-/*< WRITE(NOUT, 2100) RNORM, ARNORM, XNORM >*/
-/*
- 2100 FORMAT(1P, ' Estimated by LSQR', 3E17.5)
-*/
- printf(" Estimated by LSQR%17.5e%17.5e%17.5e\n", rnorm, arnorm, xnorm);
-/* Compute U = A*X - B. */
-/* This is the negative of the usual residual vector. */
-/* It will be close to zero only if B is a compatible rhs */
-/* and X is close to a solution. */
-/*< CALL DCOPY ( M, B, 1, U, 1 ) >*/
- dcopy_(m, b, &c__1, u, &c__1);
-/*< CALL DSCAL ( M, (-ONE), U, 1 ) >*/
- dscal_(m, &c_b53, u, &c__1);
-/*< CALL APROD ( 1, M, N, X, U, LENIW, LENRW, IW, RW ) >*/
- aprod_(&c__1, m, n, x, u, &c__1, &c__600, iw, rw, 0);
-/* Compute V = A(transpose)*U + DAMP**2 * X. */
-/* This will be close to zero in all cases */
-/* if X is close to a solution. */
-/*< CALL DCOPY ( N, X, 1, V, 1 ) >*/
- dcopy_(n, x, &c__1, v, &c__1);
-/*< CALL DSCAL ( N, DAMPSQ, V, 1 ) >*/
- dscal_(n, &dampsq, v, &c__1);
-/*< CALL APROD ( 2, M, N, V, U, LENIW, LENRW, IW, RW ) >*/
- aprod_(&c__2, m, n, v, u, &c__1, &c__600, iw, rw, 0);
-/* Compute the norms associated with X, U, V. */
-/*< XNORM = DNRM2 ( N, X, 1 ) >*/
- xnorm = dnrm2_(n, x, &c__1);
-/*< RNORM = SQRT( DNRM2 ( M, U, 1 )**2 + DAMPSQ * XNORM**2 ) >*/
-/* Computing 2nd power */
- d__1 = dnrm2_(m, u, &c__1);
-/* Computing 2nd power */
- d__2 = xnorm;
- rnorm = sqrt(d__1 * d__1 + dampsq * (d__2 * d__2));
-/*< ARNORM = DNRM2 ( N, V, 1 ) >*/
- arnorm = dnrm2_(n, v, &c__1);
-/*< WRITE(NOUT, 2200) RNORM, ARNORM, XNORM >*/
-/*
- 2200 FORMAT(1P, ' Computed from X ', 3E17.5)
-*/
- printf(" Computed from X %17.5e%17.5e%17.5e\n", rnorm, arnorm, xnorm);
-/* Print the solution and standard error estimates from LSQR. */
-/*< WRITE(NOUT, 2500) (J, X(J), J = 1, N) >*/
-/*
- 2500 FORMAT(//' Solution X' / 4(I6, G14.6))
-*/
- printf("\n\n Solution X\n");
- for (j = 0; j < *n; ++j)
- printf("%6ld%14.6g\n", j+1, x[j]);
-/*< WRITE(NOUT, 2600) (J, SE(J), J = 1, N) >*/
-/*
- 2600 FORMAT(/ ' Standard errors SE' / 4(I6, G14.6))
-*/
- printf("\n\n Standard errors SE\n");
- for (j = 0; j < *n; ++j)
- printf("%6ld%14.6g\n", j+1, se[j]);
- printf("\n");
-/* Print a clue about whether the solution looks OK. */
-/*< DO 500 J = 1, N >*/
- i__1 = *n;
- for (j = 1; j <= i__1; ++j) {
-/*< W(J) = X(J) - XTRUE(J) >*/
- w[j - 1] = x[j - 1] - xtrue[j - 1];
-/*< 500 CONTINUE >*/
-/* L500: */
- }
-/*< ENORM = DNRM2 ( N, W, 1 ) / (ONE + DNRM2 ( N, XTRUE, 1 )) >*/
- enorm = dnrm2_(n, w, &c__1) / (dnrm2_(n, xtrue, &c__1) + 1.);
-/*< ETOL = 1.0D-5 >*/
- etol = 1e-5;
-/*< IF (ENORM .LE. ETOL) WRITE(NOUT, 3000) ENORM >*/
-/*
- 3000 FORMAT(1P / ' LSQR appears to be successful.',
- $ ' Relative error in X =', E10.2)
-*/
- if (enorm <= etol) {
- printf("\n LSQR appears to be successful. Relative error in X =%10.2e\n", enorm);
- }
-/*< IF (ENORM .GT. ETOL) WRITE(NOUT, 3100) ENORM >*/
-/*
- 3100 FORMAT(1P / ' LSQR appears to have failed. ',
- $ ' Relative error in X =', E10.2)
-*/
- if (enorm > etol) {
- printf("\n LSQR appears to have failed. Relative error in X =%10.2e\n", enorm);
- }
-/*< RETURN >*/
- return 0;
-/* Not enough workspace. */
-/*< 900 WRITE(NOUT, 9000) LTOTAL >*/
-/*
- 9000 FORMAT(/ ' XXX Insufficient workspace.',
- $ ' The length of RW should be at least', I6)
-*/
-L900:
- printf("\n XXX Insufficient workspace."
- " The length of RW should be at least %ld\n", ltotal);
-/*< RETURN >*/
- return 0;
-/*< 1 >*/
-/*< 2 >*/
-/*< 2100 FORMAT(1P, ' Estimated by LSQR', 3E17.5) >*/
-/*< 2200 FORMAT(1P, ' Computed from X ', 3E17.5) >*/
-/*< 2500 FORMAT(//' Solution X' / 4(I6, G14.6)) >*/
-/*< 2600 FORMAT(/ ' Standard errors SE' / 4(I6, G14.6)) >*/
-/*< 3 >*/
-/*< 3 >*/
-/*< 9 >*/
-/* End of TEST */
-/*< END >*/
-} /* test_ */
-
-/* ------------- */
-/* Main program. */
-/* ------------- */
-/*< DOUBLE PRECISION DAMP1, DAMP2, DAMP3, DAMP4, ZERO >*/
-/* Main program */ int main()
-{
- /* Local variables */
- doublereal zero;
- extern /* Subroutine */ int test_(integer *, integer *, integer *,
- integer *, doublereal *);
- doublereal damp1, damp2, damp3, damp4;
-
-
-/*< ZERO = 0.0 >*/
- zero = (float)0.;
-/*< DAMP1 = 0.1 >*/
- damp1 = (float).1;
-/*< DAMP2 = 0.01 >*/
- damp2 = (float).01;
-/*< DAMP3 = 0.001 >*/
- damp3 = (float).001;
-/*< DAMP4 = 0.0001 >*/
- damp4 = (float)1e-4;
-/*< CALL TEST ( 1, 1, 1, 1, ZERO ) >*/
- test_(&c__1, &c__1, &c__1, &c__1, &zero);
-/*< CALL TEST ( 2, 1, 1, 1, ZERO ) >*/
- test_(&c__2, &c__1, &c__1, &c__1, &zero);
-/*< CALL TEST ( 40, 40, 4, 4, ZERO ) >*/
- test_(&c__40, &c__40, &c__4, &c__4, &zero);
-/*< CALL TEST ( 40, 40, 4, 4, DAMP2 ) >*/
- test_(&c__40, &c__40, &c__4, &c__4, &damp2);
-/*< CALL TEST ( 80, 40, 4, 4, DAMP2 ) >*/
- test_(&c__80, &c__40, &c__4, &c__4, &damp2);
-/*< STOP >*/
-/* End of main program for testing LSQR */
-/*< END >*/
- return 0;
-} /* MAIN__ */
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lsqr-test.f b/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lsqr-test.f
deleted file mode 100644
index 6c1aa30ad79a9b7ca6c271ef74974394f029ce2b..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/lsqr-test.f
+++ /dev/null
@@ -1,407 +0,0 @@
-*********************************************************
-*
-* These routines are for testing LSQR.
-*
-*********************************************************
-
- SUBROUTINE APROD ( MODE, M, N, X, Y, LENIW, LENRW, IW, RW )
- INTEGER MODE, M, N, LENIW, LENRW
- INTEGER IW(LENIW)
- DOUBLE PRECISION X(N), Y(M), RW(LENRW)
-
-* ------------------------------------------------------------------
-* This is the matrix-vector product routine required by LSQR
-* for a test matrix of the form A = HY*D*HZ. The quantities
-* defining D, HY, HZ are in the work array RW, followed by a
-* work array W. These are passed to APROD1 and APROD2 in order to
-* make the code readable.
-* ------------------------------------------------------------------
-
- INTEGER LOCD, LOCHY, LOCHZ, LOCW
-
- LOCD = 1
- LOCHY = LOCD + N
- LOCHZ = LOCHY + M
- LOCW = LOCHZ + N
-
- IF (MODE .EQ. 1) CALL APROD1( M, N, X, Y,
- $ RW(LOCD), RW(LOCHY), RW(LOCHZ), RW(LOCW) )
-
- IF (MODE .NE. 1) CALL APROD2( M, N, X, Y,
- $ RW(LOCD), RW(LOCHY), RW(LOCHZ), RW(LOCW) )
-
-* End of APROD
- END
-
- SUBROUTINE APROD1( M, N, X, Y, D, HY, HZ, W )
- INTEGER M, N
- DOUBLE PRECISION X(N), Y(M), D(N), HY(M), HZ(N), W(M)
-
-* ------------------------------------------------------------------
-* APROD1 computes Y = Y + A*X for subroutine APROD,
-* where A is a test matrix of the form A = HY*D*HZ,
-* and the latter matrices HY, D, HZ are represented by
-* input vectors with the same name.
-* ------------------------------------------------------------------
-
- INTEGER I
- DOUBLE PRECISION ZERO
- PARAMETER ( ZERO = 0.0 )
-
- CALL HPROD ( N, HZ, X, W )
-
- DO 100 I = 1, N
- W(I) = D(I) * W(I)
- 100 CONTINUE
-
- DO 200 I = N + 1, M
- W(I) = ZERO
- 200 CONTINUE
-
- CALL HPROD ( M, HY, W, W )
-
- DO 600 I = 1, M
- Y(I) = Y(I) + W(I)
- 600 CONTINUE
-
-* End of APROD1
- END
-
- SUBROUTINE APROD2( M, N, X, Y, D, HY, HZ, W )
- INTEGER M, N
- DOUBLE PRECISION X(N), Y(M), D(N), HY(M), HZ(N), W(M)
-
-* ------------------------------------------------------------------
-* APROD2 computes X = X + A(T)*Y for subroutine APROD,
-* where A is a test matrix of the form A = HY*D*HZ,
-* and the latter matrices HY, D, HZ are represented by
-* input vectors with the same name.
-* ------------------------------------------------------------------
-
- INTEGER I
-
- CALL HPROD ( M, HY, Y, W )
-
- DO 100 I = 1, N
- W(I) = D(I)*W(I)
- 100 CONTINUE
-
- CALL HPROD ( N, HZ, W, W )
-
- DO 600 I = 1, N
- X(I) = X(I) + W(I)
- 600 CONTINUE
-
-* End of APROD2
- END
-
- SUBROUTINE HPROD ( N, HZ, X, Y )
- INTEGER N
- DOUBLE PRECISION HZ(N), X(N), Y(N)
-
-* ------------------------------------------------------------------
-* HPROD applies a Householder transformation stored in HZ
-* to get Y = ( I - 2*HZ*HZ(transpose) ) * X.
-* ------------------------------------------------------------------
-
- INTEGER I
- DOUBLE PRECISION S
-
- S = 0.0
- DO 100 I = 1, N
- S = HZ(I) * X(I) + S
- 100 CONTINUE
-
- S = S + S
- DO 200 I = 1, N
- Y(I) = X(I) - S * HZ(I)
- 200 CONTINUE
-
-* End of HPROD
- END
-
- SUBROUTINE LSTP ( M, N, NDUPLC, NPOWER, DAMP, X,
- $ B, D, HY, HZ, W, ACOND, RNORM )
-
- INTEGER M, N, MAXMN, NDUPLC, NPOWER
- DOUBLE PRECISION DAMP, ACOND, RNORM
- DOUBLE PRECISION B(M), X(N), D(N), HY(M), HZ(N), W(M)
-
-* ------------------------------------------------------------------
-* LSTP generates a sparse least-squares test problem of the form
-*
-* ( A )*X = ( B )
-* ( DAMP*I ) ( 0 )
-*
-* having a specified solution X. The matrix A is constructed
-* in the form A = HY*D*HZ, where D is an M by N diagonal matrix,
-* and HY and HZ are Householder transformations.
-*
-* The first 6 parameters are input to LSTP. The remainder are
-* output. LSTP is intended for use with M .GE. N.
-*
-*
-* Functions and subroutines
-*
-* TESTPROB APROD1, HPROD
-* BLAS DNRM2
-* ------------------------------------------------------------------
-
-* Intrinsics and local variables
-
- INTRINSIC COS, SIN, SQRT
- INTEGER I, J
- DOUBLE PRECISION DNRM2
- DOUBLE PRECISION ALFA, BETA, DAMPSQ, FOURPI, T
- DOUBLE PRECISION ZERO, ONE
- PARAMETER ( ZERO = 0.0, ONE = 1.0 )
-
-* ------------------------------------------------------------------
-* Make two vectors of norm 1.0 for the Householder transformations.
-* FOURPI need not be exact.
-* ------------------------------------------------------------------
- DAMPSQ = DAMP**2
- FOURPI = 4.0 * 3.141592
- ALFA = FOURPI / M
- BETA = FOURPI / N
-
- DO 100 I = 1, M
- HY(I) = SIN( I * ALFA )
- 100 CONTINUE
-
- DO 200 I = 1, N
- HZ(I) = COS( I * BETA )
- 200 CONTINUE
-
- ALFA = DNRM2 ( M, HY, 1 )
- BETA = DNRM2 ( N, HZ, 1 )
- CALL DSCAL ( M, (- ONE / ALFA), HY, 1 )
- CALL DSCAL ( N, (- ONE / BETA), HZ, 1 )
-*
-* ------------------------------------------------------------------
-* Set the diagonal matrix D. These are the singular values of A.
-* ------------------------------------------------------------------
- DO 300 I = 1, N
- J = (I - 1 + NDUPLC) / NDUPLC
- T = J * NDUPLC
- T = T / N
- D(I) = T**NPOWER
- 300 CONTINUE
-
- ACOND = SQRT( (D(N)**2 + DAMPSQ) / (D(1)**2 + DAMPSQ) )
-
-* ------------------------------------------------------------------
-* Compute the residual vector, storing it in B.
-* It takes the form HY*( s )
-* ( t )
-* where s is obtained from D*s = DAMP**2 * HZ * X
-* and t can be anything.
-* ------------------------------------------------------------------
- CALL HPROD ( N, HZ, X, B )
-
- DO 500 I = 1, N
- B(I) = DAMPSQ * B(I) / D(I)
- 500 CONTINUE
-
- T = ONE
- DO 600 I = N + 1, M
- J = I - N
- B(I) = (T * J) / M
- T = - T
- 600 CONTINUE
-
- CALL HPROD ( M, HY, B, B )
-
-* ------------------------------------------------------------------
-* Now compute the true B = RESIDUAL + A*X.
-* ------------------------------------------------------------------
- RNORM = SQRT( DNRM2 ( M, B, 1 )**2
- $ + DAMPSQ * DNRM2 ( N, X, 1 )**2 )
- CALL APROD1( M, N, X, B, D, HY, HZ, W )
-
-* End of LSTP
- END
-
- SUBROUTINE TEST ( M, N, NDUPLC, NPOWER, DAMP )
- INTEGER M, N, NDUPLC, NPOWER
- DOUBLE PRECISION DAMP
-
-* ------------------------------------------------------------------
-* This is an example driver routine for running LSQR.
-* It generates a test problem, solves it, and examines the results.
-* Note that subroutine APROD must be declared EXTERNAL
-* if it is used only in the call to LSQR.
-*
-*
-* Functions and subroutines
-*
-* TESTPROB APROD
-* BLAS DCOPY, DNRM2, DSCAL
-* ------------------------------------------------------------------
-
-* Intrinsics and local variables
-
- INTRINSIC MAX, SQRT
- EXTERNAL APROD
- INTEGER ISTOP, ITNLIM, J, NOUT
- DOUBLE PRECISION DNRM2
-
- PARAMETER ( MAXM = 200, MAXN = 100 )
- DOUBLE PRECISION B(MAXM), U(MAXM),
- $ V(MAXN), W(MAXN), X(MAXN),
- $ SE(MAXN), XTRUE(MAXN)
- DOUBLE PRECISION ATOL, BTOL, CONLIM,
- $ ANORM, ACOND, RNORM, ARNORM,
- $ DAMPSQ, ENORM, ETOL, XNORM
-
- PARAMETER ( LENIW = 1, LENRW = 600 )
- INTEGER IW(LENIW)
- DOUBLE PRECISION RW(LENRW)
- INTEGER LOCD, LOCHY, LOCHZ, LOCW, LTOTAL
-
- DOUBLE PRECISION ONE
- PARAMETER ( ONE = 1.0 )
-
- CHARACTER*34 LINE
- DATA LINE
- $ /'----------------------------------'/
-
-
-* Set the desired solution XTRUE.
-
- DO 100 J = 1, N
- XTRUE(J) = N - J
- 100 CONTINUE
-
-* Generate the specified test problem.
-* The workspace array IW is not needed in this application.
-* The workspace array RW is used for the following vectors:
-* D(N), HY(M), HZ(N), W(MAX(M,N)).
-* The vectors D, HY, HZ will define the test matrix A.
-* W is needed for workspace in APROD1 and APROD2.
-
- LOCD = 1
- LOCHY = LOCD + N
- LOCHZ = LOCHY + M
- LOCW = LOCHZ + N
- LTOTAL = LOCW + MAX(M,N) - 1
- IF (LTOTAL .GT. LENRW) GO TO 900
-
- CALL LSTP ( M, N, NDUPLC, NPOWER, DAMP, XTRUE,
- $ B, RW(LOCD), RW(LOCHY), RW(LOCHZ), RW(LOCW),
- $ ACOND, RNORM )
-
-* Solve the problem defined by APROD, DAMP and B.
-* Copy the rhs vector B into U (LSQR will overwrite U)
-* and set the other input parameters for LSQR.
-
- CALL DCOPY ( M, B, 1, U, 1 )
- ATOL = 1.0E-10
- BTOL = ATOL
- CONLIM = 10.0 * ACOND
- ITNLIM = M + N + 50
- NOUT = 6
- WRITE(NOUT, 1000) LINE, LINE,
- $ M, N, NDUPLC, NPOWER, DAMP, ACOND, RNORM,
- $ LINE, LINE
-
- CALL LSQR ( M, N, APROD, DAMP,
- $ LENIW, LENRW, IW, RW,
- $ U, V, W, X, SE,
- $ ATOL, BTOL, CONLIM, ITNLIM, NOUT,
- $ ISTOP, ITN, ANORM, ACOND, RNORM, ARNORM, XNORM )
-
-* Examine the results.
-* We print the residual norms RNORM and ARNORM given by LSQR,
-* and then compute their true values in terms of the solution X
-* obtained by LSQR. At least one of them should be small.
-
- DAMPSQ = DAMP**2
- WRITE(NOUT, 2000)
- WRITE(NOUT, 2100) RNORM, ARNORM, XNORM
-
-* Compute U = A*X - B.
-* This is the negative of the usual residual vector.
-* It will be close to zero only if B is a compatible rhs
-* and X is close to a solution.
-
- CALL DCOPY ( M, B, 1, U, 1 )
- CALL DSCAL ( M, (-ONE), U, 1 )
- CALL APROD ( 1, M, N, X, U, LENIW, LENRW, IW, RW )
-
-* Compute V = A(transpose)*U + DAMP**2 * X.
-* This will be close to zero in all cases
-* if X is close to a solution.
-
- CALL DCOPY ( N, X, 1, V, 1 )
- CALL DSCAL ( N, DAMPSQ, V, 1 )
- CALL APROD ( 2, M, N, V, U, LENIW, LENRW, IW, RW )
-
-* Compute the norms associated with X, U, V.
-
- XNORM = DNRM2 ( N, X, 1 )
- RNORM = SQRT( DNRM2 ( M, U, 1 )**2 + DAMPSQ * XNORM**2 )
- ARNORM = DNRM2 ( N, V, 1 )
- WRITE(NOUT, 2200) RNORM, ARNORM, XNORM
-
-* Print the solution and standard error estimates from LSQR.
-
- WRITE(NOUT, 2500) (J, X(J), J = 1, N)
- WRITE(NOUT, 2600) (J, SE(J), J = 1, N)
-
-* Print a clue about whether the solution looks OK.
-
- DO 500 J = 1, N
- W(J) = X(J) - XTRUE(J)
- 500 CONTINUE
- ENORM = DNRM2 ( N, W, 1 ) / (ONE + DNRM2 ( N, XTRUE, 1 ))
- ETOL = 1.0D-5
- IF (ENORM .LE. ETOL) WRITE(NOUT, 3000) ENORM
- IF (ENORM .GT. ETOL) WRITE(NOUT, 3100) ENORM
- RETURN
-
-* Not enough workspace.
-
- 900 WRITE(NOUT, 9000) LTOTAL
- RETURN
-
- 1000 FORMAT(1P
- $ // 1X, 2A
- $ / ' Least-Squares Test Problem P(', 4I5, E12.2, ' )'
- $ // ' Condition no. =', E12.4, ' Residual function =', E17.9
- $ / 1X, 2A)
- 2000 FORMAT(
- $ // 22X, ' Residual norm Residual norm Solution norm'
- $ / 22X, '(Abar X - bbar) (Normal eqns) (X)' /)
- 2100 FORMAT(1P, ' Estimated by LSQR', 3E17.5)
- 2200 FORMAT(1P, ' Computed from X ', 3E17.5)
- 2500 FORMAT(//' Solution X' / 4(I6, G14.6))
- 2600 FORMAT(/ ' Standard errors SE' / 4(I6, G14.6))
- 3000 FORMAT(1P / ' LSQR appears to be successful.',
- $ ' Relative error in X =', E10.2)
- 3100 FORMAT(1P / ' LSQR appears to have failed. ',
- $ ' Relative error in X =', E10.2)
- 9000 FORMAT(/ ' XXX Insufficient workspace.',
- $ ' The length of RW should be at least', I6)
-* End of TEST
- END
-
-* -------------
-* Main program.
-* -------------
- DOUBLE PRECISION DAMP1, DAMP2, DAMP3, DAMP4, ZERO
-*
- ZERO = 0.0
- DAMP1 = 0.1
- DAMP2 = 0.01
- DAMP3 = 0.001
- DAMP4 = 0.0001
- CALL TEST ( 1, 1, 1, 1, ZERO )
- CALL TEST ( 2, 1, 1, 1, ZERO )
- CALL TEST ( 40, 40, 4, 4, ZERO )
- CALL TEST ( 40, 40, 4, 4, DAMP2 )
- CALL TEST ( 80, 40, 4, 4, DAMP2 )
- STOP
-
-* End of main program for testing LSQR
- END
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/slamch-test.c b/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/slamch-test.c
deleted file mode 100644
index eb6efe1dade4fccb470cde8aa8ce80168df1cb5d..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/tests/slamch-test.c
+++ /dev/null
@@ -1,18 +0,0 @@
-/* slamch-test.c -- Written by Peter Vanroose, 9 November 2003 */
-#include "v3p_netlib.h"
-#include <stdio.h>
-
-int main(void)
-{
- printf("eps = %g\n", v3p_netlib_slamch_("E", 1));
- printf("sfmin= %g\n", v3p_netlib_slamch_("S", 1));
- printf("base = %g\n", v3p_netlib_slamch_("B", 1));
- printf("prec = %g\n", v3p_netlib_slamch_("P", 1));
- printf("t = %g\n", v3p_netlib_slamch_("N", 1));
- printf("rnd = %g\n", v3p_netlib_slamch_("R", 1));
- printf("emin = %g\n", v3p_netlib_slamch_("M", 1));
- printf("rmin = %g\n", v3p_netlib_slamch_("U", 1));
- printf("emax = %g\n", v3p_netlib_slamch_("L", 1));
- printf("rmax = %g\n", v3p_netlib_slamch_("O", 1));
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_mangle.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_mangle.h
index 3b64bfdb862099ba241fb3646e4a9cadd07d6c03..027aa83681d098ce61c5b6a5bdd392b21b8ed999 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_mangle.h
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_mangle.h
@@ -51,6 +51,7 @@ nm libv3p_netlib.a |grep " [TR] "
#define dgerq2_ v3p_netlib_dgerq2_
#define dgesc2_ v3p_netlib_dgesc2_
#define dgetc2_ v3p_netlib_dgetc2_
+#define dgetv0_ v3p_netlib_dgetv0_
#define dggbak_ v3p_netlib_dggbak_
#define dggbal_ v3p_netlib_dggbal_
#define dgges_ v3p_netlib_dgges_
@@ -67,6 +68,7 @@ nm libv3p_netlib.a |grep " [TR] "
#define dlacon_ v3p_netlib_dlacon_
#define dlacpy_ v3p_netlib_dlacpy_
#define dladiv_ v3p_netlib_dladiv_
+#define dlae2_ v3p_netlib_dlae2_
#define dlaeig_ v3p_netlib_dlaeig_
#define dlaev2_ v3p_netlib_dlaev2_
#define dlag2_ v3p_netlib_dlag2_
@@ -80,6 +82,7 @@ nm libv3p_netlib.a |grep " [TR] "
#define dlamch_ v3p_netlib_dlamch_
#define dlange_ v3p_netlib_dlange_
#define dlanhs_ v3p_netlib_dlanhs_
+#define dlanst_ v3p_netlib_dlanst_
#define dlapy2_ v3p_netlib_dlapy2_
#define dlapy3_ v3p_netlib_dlapy3_
#define dlaran_ v3p_netlib_dlaran_
@@ -87,9 +90,13 @@ nm libv3p_netlib.a |grep " [TR] "
#define dlarfb_ v3p_netlib_dlarfb_
#define dlarfg_ v3p_netlib_dlarfg_
#define dlarft_ v3p_netlib_dlarft_
+#define dlarnv_ v3p_netlib_dlarnv_
#define dlartg_ v3p_netlib_dlartg_
+#define dlaruv_ v3p_netlib_dlaruv_
#define dlascl_ v3p_netlib_dlascl_
#define dlaset_ v3p_netlib_dlaset_
+#define dlasr_ v3p_netlib_dlasr_
+#define dlasrt_ v3p_netlib_dlasrt_
#define dlassq_ v3p_netlib_dlassq_
#define dlasv2_ v3p_netlib_dlasv2_
#define dlaswp_ v3p_netlib_dlaswp_
@@ -119,10 +126,23 @@ nm libv3p_netlib.a |grep " [TR] "
#define drot_ v3p_netlib_drot_
#define drotg_ v3p_netlib_drotg_
#define drscl_ v3p_netlib_drscl_
+#define dsaitr_ v3p_netlib_dsaitr_
+#define dsapps_ v3p_netlib_dsapps_
+#define dsaup2_ v3p_netlib_dsaup2_
+#define dsaupd_ v3p_netlib_dsaupd_
#define dscal_ v3p_netlib_dscal_
+#define dsconv_ v3p_netlib_dsconv_
+#define dseigt_ v3p_netlib_dseigt_
+#define dsesrt_ v3p_netlib_dsesrt_
+#define dseupd_ v3p_netlib_dseupd_
+#define dsgets_ v3p_netlib_dsgets_
+#define dsortr_ v3p_netlib_dsortr_
#define dspr_ v3p_netlib_dspr_
#define dsptrf_ v3p_netlib_dsptrf_
#define dsptrs_ v3p_netlib_dsptrs_
+#define dstats_ v3p_netlib_dstats_
+#define dsteqr_ v3p_netlib_dsteqr_
+#define dstqrb_ v3p_netlib_dstqrb_
#define dsvdc_ v3p_netlib_dsvdc_
#define dswap_ v3p_netlib_dswap_
#define dtgex2_ v3p_netlib_dtgex2_
@@ -211,6 +231,7 @@ nm libv3p_netlib.a |grep " [TR] "
#define scopy_ v3p_netlib_scopy_
#define sdiff_ v3p_netlib_sdiff_
#define sdot_ v3p_netlib_sdot_
+#define second_ v3p_netlib_second_
#define setdgpfa_ v3p_netlib_setdgpfa_
#define setgpfa_ v3p_netlib_setgpfa_
#define setulb_ v3p_netlib_setulb_
@@ -326,3 +347,33 @@ nm libv3p_netlib.a |grep " [TR] "
#define zung2r_ v3p_netlib_zung2r_
#define zunghr_ v3p_netlib_zunghr_
#define zungqr_ v3p_netlib_zungqr_
+#define ztgsyl_ v3p_netlib_ztgsyl_
+#define zrot_ v3p_netlib_zrot_
+#define zlatdf_ v3p_netlib_zlatdf_
+#define zlacn2_ v3p_netlib_zlacn2_
+#define ztgsy2_ v3p_netlib_ztgsy2_
+#define ztgexc_ v3p_netlib_ztgexc_
+#define zggbak_ v3p_netlib_zggbak_
+#define zgetc2_ v3p_netlib_zgetc2_
+#define zhgeqz_ v3p_netlib_zhgeqz_
+#define zgges_ v3p_netlib_zgges_
+#define zlaswp_ v3p_netlib_zlaswp_
+#define zdrscl_ v3p_netlib_zdrscl_
+#define zlartg_ v3p_netlib_zlartg_
+#define zggbal_ v3p_netlib_zggbal_
+#define zgeqr2_ v3p_netlib_zgeqr2_
+#define zgecon_ v3p_netlib_zgecon_
+#define zunmqr_ v3p_netlib_zunmqr_
+#define zunm2r_ v3p_netlib_zunm2r_
+#define zgeqrf_ v3p_netlib_zgeqrf_
+#define ztgex2_ v3p_netlib_ztgex2_
+#define zgesc2_ v3p_netlib_zgesc2_
+#define ztgsen_ v3p_netlib_ztgsen_
+#define zgghrd_ v3p_netlib_zgghrd_
+#define zgeru_ v3p_netlib_zgeru_
+#define izmax1_ v3p_netlib_izmax1_
+#define dzsum1_ v3p_netlib_dzsum1_
+#define zgees_ v3p_netlib_zgees_
+#define ztrexc_ v3p_netlib_ztrexc_
+#define ztrsen_ v3p_netlib_ztrsen_
+#define ztrsyl_ v3p_netlib_ztrsyl_
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_prototypes.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_prototypes.h
index 66e6a93ef977b1ec99c2f0ac431e7bf4b1880463..9242b4910e0341835cf2664eb223daccf712ac30 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_prototypes.h
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_prototypes.h
@@ -49,6 +49,7 @@
#include "blas/zgemm.h"
#include "blas/zgemv.h"
#include "blas/zgerc.h"
+#include "blas/zgeru.h"
#include "blas/zscal.h"
#include "blas/zswap.h"
#include "blas/ztrmm.h"
@@ -111,11 +112,24 @@
#include "laso/dortqr.h"
#include "laso/dvsort.h"
#include "laso/urand.h"
+#include "arpack/dgetv0.h"
+#include "arpack/dsaitr.h"
+#include "arpack/dsapps.h"
+#include "arpack/dsaup2.h"
+#include "arpack/dsaupd.h"
+#include "arpack/dsconv.h"
+#include "arpack/dseigt.h"
+#include "arpack/dsesrt.h"
+#include "arpack/dseupd.h"
+#include "arpack/dsgets.h"
+#include "arpack/dsortr.h"
+#include "arpack/dstqrb.h"
#include "lapack/complex16/zgebak.h"
#include "lapack/complex16/zgebal.h"
#include "lapack/complex16/zgeev.h"
#include "lapack/complex16/zgehd2.h"
#include "lapack/complex16/zgehrd.h"
+#include "lapack/complex16/zgges.h"
#include "lapack/complex16/zhseqr.h"
#include "lapack/complex16/zlacgv.h"
#include "lapack/complex16/zlacpy.h"
@@ -137,6 +151,32 @@
#include "lapack/complex16/zung2r.h"
#include "lapack/complex16/zunghr.h"
#include "lapack/complex16/zungqr.h"
+#include "lapack/complex16/zdrscl.h"
+#include "lapack/complex16/zgecon.h"
+#include "lapack/complex16/zgeqr2.h"
+#include "lapack/complex16/zgeqrf.h"
+#include "lapack/complex16/zgesc2.h"
+#include "lapack/complex16/zgetc2.h"
+#include "lapack/complex16/zggbak.h"
+#include "lapack/complex16/zggbal.h"
+#include "lapack/complex16/zgghrd.h"
+#include "lapack/complex16/zhgeqz.h"
+#include "lapack/complex16/zlacn2.h"
+#include "lapack/complex16/zlartg.h"
+#include "lapack/complex16/zlaswp.h"
+#include "lapack/complex16/zlatdf.h"
+#include "lapack/complex16/zrot.h"
+#include "lapack/complex16/ztgex2.h"
+#include "lapack/complex16/ztgexc.h"
+#include "lapack/complex16/ztgsen.h"
+#include "lapack/complex16/ztgsy2.h"
+#include "lapack/complex16/ztgsyl.h"
+#include "lapack/complex16/zunm2r.h"
+#include "lapack/complex16/zunmqr.h"
+#include "lapack/complex16/zgees.h"
+#include "lapack/complex16/ztrsen.h"
+#include "lapack/complex16/ztrexc.h"
+#include "lapack/complex16/ztrsyl.h"
#include "lapack/double/dgecon.h"
#include "lapack/double/dgeqr2.h"
#include "lapack/double/dgeqrf.h"
@@ -152,25 +192,31 @@
#include "lapack/double/dlacon.h"
#include "lapack/double/dlacpy.h"
#include "lapack/double/dladiv.h"
+#include "lapack/double/dlae2.h"
+#include "lapack/double/dlaev2.h"
#include "lapack/double/dlag2.h"
#include "lapack/double/dlagv2.h"
#include "lapack/double/dlange.h"
#include "lapack/double/dlanhs.h"
+#include "lapack/double/dlanst.h"
#include "lapack/double/dlapy2.h"
#include "lapack/double/dlapy3.h"
#include "lapack/double/dlarf.h"
#include "lapack/double/dlarfb.h"
#include "lapack/double/dlarfg.h"
#include "lapack/double/dlarft.h"
+#include "lapack/double/dlarnv.h"
#include "lapack/double/dlartg.h"
+#include "lapack/double/dlaruv.h"
#include "lapack/double/dlascl.h"
#include "lapack/double/dlaset.h"
+#include "lapack/double/dlasr.h"
+#include "lapack/double/dlasrt.h"
#include "lapack/double/dlassq.h"
#include "lapack/double/dlasv2.h"
#include "lapack/double/dlaswp.h"
#include "lapack/double/dlatdf.h"
#include "lapack/double/dlatrs.h"
-#include "lapack/double/dlaev2.h"
#include "lapack/double/dorg2r.h"
#include "lapack/double/dorgqr.h"
#include "lapack/double/dorgr2.h"
@@ -181,11 +227,13 @@
#include "lapack/double/dspr.h"
#include "lapack/double/dsptrf.h"
#include "lapack/double/dsptrs.h"
+#include "lapack/double/dsteqr.h"
#include "lapack/double/dtgex2.h"
#include "lapack/double/dtgexc.h"
#include "lapack/double/dtgsen.h"
#include "lapack/double/dtgsy2.h"
#include "lapack/double/dtgsyl.h"
+#include "lapack/double/dzsum1.h"
#include "lapack/single/sgeqpf.h"
#include "lapack/single/sgeqr2.h"
#include "lapack/single/sgerq2.h"
@@ -211,6 +259,7 @@
#include "lapack/util/ieeeck.h"
#include "lapack/util/ilaenv.h"
#include "lapack/util/lsame.h"
+#include "lapack/util/izmax1.h"
#include "napack/cg.h"
#include "minpack/dpmpar.h"
#include "minpack/enorm.h"
diff --git a/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_unmangle.h b/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_unmangle.h
index 53426d41e836eadd885ca6749f0d2332fa1ef181..1a82cf951593daf225ff61898c0fc7344bc86a8c 100644
--- a/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_unmangle.h
+++ b/Utilities/ITK/Utilities/vxl/v3p/netlib/v3p_netlib_unmangle.h
@@ -1,4 +1,4 @@
-/* This header undefines mangled names defined by v3p_netlib_mangle.h.
+/* This header undefines mangled names defined by v3p_
There are purposely no include blockers so translation units can
mangle/unmangle repeatedly. */
@@ -42,6 +42,7 @@
#undef dgerq2_
#undef dgesc2_
#undef dgetc2_
+#undef dgetv0_
#undef dggbak_
#undef dggbal_
#undef dgges_
@@ -58,6 +59,7 @@
#undef dlacon_
#undef dlacpy_
#undef dladiv_
+#undef dlae2_
#undef dlaeig_
#undef dlaev2_
#undef dlag2_
@@ -71,6 +73,7 @@
#undef dlamch_
#undef dlange_
#undef dlanhs_
+#undef dlanst_
#undef dlapy2_
#undef dlapy3_
#undef dlaran_
@@ -78,9 +81,13 @@
#undef dlarfb_
#undef dlarfg_
#undef dlarft_
+#undef dlarnv_
#undef dlartg_
+#undef dlaruv_
#undef dlascl_
#undef dlaset_
+#undef dlasr_
+#undef dlasrt_
#undef dlassq_
#undef dlasv2_
#undef dlaswp_
@@ -110,10 +117,23 @@
#undef drot_
#undef drotg_
#undef drscl_
+#undef dsaitr_
+#undef dsapps_
+#undef dsaup2_
+#undef dsaupd_
#undef dscal_
+#undef dsconv_
+#undef dseigt_
+#undef dsesrt_
+#undef dseupd_
+#undef dsgets_
+#undef dsortr_
#undef dspr_
#undef dsptrf_
#undef dsptrs_
+#undef dstats_
+#undef dsteqr_
+#undef dstqrb_
#undef dsvdc_
#undef dswap_
#undef dtgex2_
@@ -202,6 +222,7 @@
#undef scopy_
#undef sdiff_
#undef sdot_
+#undef second_
#undef setdgpfa_
#undef setgpfa_
#undef setulb_
@@ -317,3 +338,33 @@
#undef zung2r_
#undef zunghr_
#undef zungqr_
+#undef ztgsyl_
+#undef zrot_
+#undef zlatdf_
+#undef zlacn2_
+#undef ztgsy2_
+#undef ztgexc_
+#undef zggbak_
+#undef zgetc2_
+#undef zhgeqz_
+#undef zgges_
+#undef zlaswp_
+#undef zdrscl_
+#undef zlartg_
+#undef zggbal_
+#undef zgeqr2_
+#undef zgecon_
+#undef zunmqr_
+#undef zunm2r_
+#undef zgeqrf_
+#undef ztgex2_
+#undef zgesc2_
+#undef ztgsen_
+#undef zgghrd_
+#undef zgeru_
+#undef izmax1_
+#undef dzsum1_
+#undef zgees_
+#undef ztrexc_
+#undef ztrsen_
+#undef ztrsyl_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/vcl/CMakeLists.txt
index 39ccbe344acdfe291bc2103c594408a52409f235..ab7b2f5660502ae271c5c33bd5da785ccca65ea6 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/vcl/CMakeLists.txt
@@ -123,6 +123,7 @@ SET( vcl_sources
generic/vcl_locale.h
generic/vcl_map.h
generic/vcl_memory.h
+ generic/vcl_memory_tr1.h
generic/vcl_numeric.h
generic/vcl_ostream.h
generic/vcl_queue.h
@@ -179,6 +180,7 @@ SET( vcl_sources
iso/vcl_limits.h
iso/vcl_locale.h
iso/vcl_memory.h
+ iso/vcl_memory_tr1.h
iso/vcl_new.h
iso/vcl_numeric.h
iso/vcl_ostream.h
@@ -320,6 +322,11 @@ SET( vcl_sources
win32-vc70/vcl_cstdlib.h
win32-vc70/vcl_valarray.h
+ win32-vc8/vcl_cmath.h
+ win32-vc8/vcl_complex.h
+ win32-vc8/vcl_cstdlib.h
+ win32-vc8/vcl_valarray.h
+
borland55/vcl_cfloat.h
borland55/vcl_cmath.h
borland55/vcl_complex.h
@@ -334,6 +341,16 @@ SET( vcl_sources
stlport/vcl_cmath.h
stlport/vcl_complex.h
stlport/vcl_cstdlib.h
+
+ # The following shall not be used other than as reference count for smart pointers
+ vcl_atomic_count.h
+ internal/vcl_atomic_count_gcc.h
+ internal/vcl_atomic_count_gcc_x86.h
+ internal/vcl_atomic_count_pthreads.h
+ internal/vcl_atomic_count_solaris.h
+ internal/vcl_atomic_count_sync.h
+ internal/vcl_atomic_count_win32.h
+ internal/vcl_interlocked.h
)
# We use implicit instantiation of the standard library now,
@@ -344,11 +361,15 @@ SET( vcl_sources
ADD_LIBRARY(itkvcl ${vcl_sources})
-IF(WIN32)
- IF(NOT CYGWIN)
- ADD_DEFINITIONS( -DBUILDING_VCL_DLL )
- ENDIF(NOT CYGWIN)
-ENDIF(WIN32)
+# CMake can automatically figure out the compiler characteristics on
+# Windows too. No need to do manual config.
+
+# IF(WIN32)
+# IF(NOT CYGWIN)
+# ADD_DEFINITIONS( -DBUILDING_VCL_DLL )
+# INCLUDE_DIRECTORIES( config.win32 )
+# ENDIF(NOT CYGWIN)
+# ENDIF(WIN32)
IF(UNIX)
TARGET_LINK_LIBRARIES( itkvcl m )
@@ -361,16 +382,17 @@ ENDIF(ITK_LIBRARY_PROPERTIES)
# Installation
IF(NOT VXL_INSTALL_NO_LIBRARIES)
INSTALL(TARGETS itkvcl
- RUNTIME DESTINATION ${VXL_INSTALL_BIN_DIR_CM24} COMPONENT RuntimeLibraries
- LIBRARY DESTINATION ${VXL_INSTALL_LIB_DIR_CM24} COMPONENT RuntimeLibraries
- ARCHIVE DESTINATION ${VXL_INSTALL_LIB_DIR_CM24} COMPONENT Development)
+ EXPORT ${VXL_INSTALL_EXPORT_NAME}
+ RUNTIME DESTINATION ${VXL_INSTALL_RUNTIME_DIR} COMPONENT RuntimeLibraries
+ LIBRARY DESTINATION ${VXL_INSTALL_LIBRARY_DIR} COMPONENT RuntimeLibraries
+ ARCHIVE DESTINATION ${VXL_INSTALL_ARCHIVE_DIR} COMPONENT Development)
ENDIF(NOT VXL_INSTALL_NO_LIBRARIES)
IF(NOT VXL_INSTALL_NO_DEVELOPMENT)
- INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_ROOT}/vcl ${vcl_sources})
+ INSTALL_NOBASE_HEADER_FILES(${VXL_INSTALL_INCLUDE_DIR} ${vcl_sources})
ENDIF(NOT VXL_INSTALL_NO_DEVELOPMENT)
# INCLUDE( ${vxl_SOURCE_DIR}/vcl/LinkSTLPort.cmake )
IF( BUILD_TESTING)
- SUBDIRS(tests)
+# SUBDIRS(tests)
ENDIF( BUILD_TESTING)
diff --git a/Utilities/ITK/Utilities/vxl/vcl/config.README b/Utilities/ITK/Utilities/vxl/vcl/config.README
index fde2efd82a508357172c6d3d8155e21e97cc03a7..22484b55cae27cd305c53039c071bea6d2e837aa 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/config.README
+++ b/Utilities/ITK/Utilities/vxl/vcl/config.README
@@ -1,4 +1,4 @@
The purpose of the config.$build_tag directories is to hold
files generated by the configure script. Apart from platforms
where configure is not used (e.g. Windows) these directories
-are generated and thus should not be under CVS control.
+are generated and thus should not be under CVS or svn control.
diff --git a/Utilities/ITK/Utilities/vxl/vcl/config.stlport.win32-vc60/vcl_config_compiler.h b/Utilities/ITK/Utilities/vxl/vcl/config.stlport.win32-vc60/vcl_config_compiler.h
index 66c996b24f17e6bb6033b009b1d41273bf9b1ba3..61b9ba08463ad128706a4f8ab43b8cbd887cc7b9 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/config.stlport.win32-vc60/vcl_config_compiler.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/config.stlport.win32-vc60/vcl_config_compiler.h
@@ -512,7 +512,7 @@ text { return ret; }
//#define VCL_DEFAULT_TMPL_ARG(arg) /* no need */
//#define VCL_DEFAULT_TMPL_ARG(arg) arg
-#define VCL_DEFAULT_TMPL_ARG(arg)
+#define VCL_DEFAULT_TMPL_ARG(arg)
//
#define VCL_CAN_DO_COMPLETE_DEFAULT_TYPE_PARAMETER 1
@@ -601,7 +601,7 @@ text { return ret; }
// infinity issues
//: VCL_NUMERIC_LIMITS_HAS_INFINITY
-// Set to true if there is a numeric_limits and it reports having an floating point infinity.
+// Set to true if there is a numeric_limits and it reports having a floating point infinity.
#define VCL_NUMERIC_LIMITS_HAS_INFINITY 1
//: VCL_PROCESSOR_HAS_INFINITY
diff --git a/Utilities/ITK/Utilities/vxl/vcl/config.win32/vc60/vcl_config_compiler.h b/Utilities/ITK/Utilities/vxl/vcl/config.win32/vc60/vcl_config_compiler.h
index 7c0162652e43148c0b80b7e16359267fd3bbf5e3..1f47bc2936366b9580288f993bd48db841e60b5f 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/config.win32/vc60/vcl_config_compiler.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/config.win32/vc60/vcl_config_compiler.h
@@ -518,7 +518,7 @@ text { return ret; }
//#define VCL_DEFAULT_TMPL_ARG(arg) /* no need */
//#define VCL_DEFAULT_TMPL_ARG(arg) arg
-#define VCL_DEFAULT_TMPL_ARG(arg)
+#define VCL_DEFAULT_TMPL_ARG(arg)
//
#define VCL_CAN_DO_COMPLETE_DEFAULT_TYPE_PARAMETER 1
@@ -610,7 +610,7 @@ text { return ret; }
// infinity issues
//: VCL_NUMERIC_LIMITS_HAS_INFINITY
-// Set to true if there is a numeric_limits and it reports having an floating point infinity.
+// Set to true if there is a numeric_limits and it reports having a floating point infinity.
#define VCL_NUMERIC_LIMITS_HAS_INFINITY 1
//: VCL_PROCESSOR_HAS_INFINITY
diff --git a/Utilities/ITK/Utilities/vxl/vcl/config.win32/vc70/vcl_config_compiler.h b/Utilities/ITK/Utilities/vxl/vcl/config.win32/vc70/vcl_config_compiler.h
index 0a45efedfb984a8b24ac988e97303fec39a44fff..18240925830719d7ec0dd36f637c8ec044fef93c 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/config.win32/vc70/vcl_config_compiler.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/config.win32/vc70/vcl_config_compiler.h
@@ -519,7 +519,7 @@ text { return ret; }
//#define VCL_DEFAULT_TMPL_ARG(arg) /* no need */
//#define VCL_DEFAULT_TMPL_ARG(arg) arg
-#define VCL_DEFAULT_TMPL_ARG(arg)
+#define VCL_DEFAULT_TMPL_ARG(arg)
//
#define VCL_CAN_DO_COMPLETE_DEFAULT_TYPE_PARAMETER 1
@@ -611,7 +611,7 @@ text { return ret; }
// infinity issues
//: VCL_NUMERIC_LIMITS_HAS_INFINITY
-// Set to true if there is a numeric_limits and it reports having an floating point infinity.
+// Set to true if there is a numeric_limits and it reports having a floating point infinity.
#define VCL_NUMERIC_LIMITS_HAS_INFINITY 1
//: VCL_PROCESSOR_HAS_INFINITY
diff --git a/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_algobase.h b/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_algobase.h
index 35baace72608c2cd227e13a9acc5e60085ecb243..92f5a93ef0bae4fc77ececc68a80a80364e97649 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_algobase.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_algobase.h
@@ -209,8 +209,8 @@ INLINE_LOOP void vcl_destroy(ForwardIterator first, ForwardIterator last)
template <class InputIterator, class ForwardIterator>
INLINE_LOOP ForwardIterator vcl_uninitialized_copy(InputIterator first,
- InputIterator last,
- ForwardIterator result)
+ InputIterator last,
+ ForwardIterator result)
{
__stl_debug_check(__check_range(first, last));
# if defined ( __STL_USE_EXCEPTIONS )
@@ -234,7 +234,7 @@ INLINE_LOOP ForwardIterator vcl_uninitialized_copy(InputIterator first,
template <class ForwardIterator, class T>
INLINE_LOOP void
vcl_uninitialized_fill(ForwardIterator first, ForwardIterator last,
- const T& x)
+ const T& x)
{
__stl_debug_check(__check_range(first, last));
# if defined ( __STL_USE_EXCEPTIONS )
@@ -256,7 +256,7 @@ vcl_uninitialized_fill(ForwardIterator first, ForwardIterator last,
template <class ForwardIterator, class Size, class T>
INLINE_LOOP ForwardIterator vcl_uninitialized_fill_n(ForwardIterator first, Size n,
- const T& x)
+ const T& x)
{
# if defined ( __STL_USE_EXCEPTIONS )
ForwardIterator saveFirst = first;
@@ -361,7 +361,7 @@ __copy(RandomAccessIterator first, RandomAccessIterator last,
template <class InputIterator, class OutputIterator>
inline OutputIterator vcl_copy(InputIterator first, InputIterator last,
- OutputIterator result)
+ OutputIterator result)
{
__stl_debug_check(__check_range(first, last));
return __copy(first, last, result, iterator_category(first));
@@ -369,8 +369,8 @@ inline OutputIterator vcl_copy(InputIterator first, InputIterator last,
template <class BidirectionalIterator1, class BidirectionalIterator2>
INLINE_LOOP BidirectionalIterator2 vcl_copy_backward(BidirectionalIterator1 first,
- BidirectionalIterator1 last,
- BidirectionalIterator2 result)
+ BidirectionalIterator1 last,
+ BidirectionalIterator2 result)
{
__stl_debug_check(__check_range(first, last));
while (first != last) *--result = *--last;
@@ -397,8 +397,8 @@ vcl_fill_n(OutputIterator first, Size n, const T& value)
template <class InputIterator1, class InputIterator2>
INLINE_LOOP vcl_pair<InputIterator1, InputIterator2> vcl_mismatch(InputIterator1 first1,
- InputIterator1 last1,
- InputIterator2 first2)
+ InputIterator1 last1,
+ InputIterator2 first2)
{
__stl_debug_check(__check_range(first1, last1));
while (first1 != last1 && *first1 == *first2) { ++first1; ++first2; }
@@ -407,9 +407,9 @@ INLINE_LOOP vcl_pair<InputIterator1, InputIterator2> vcl_mismatch(InputIterator1
template <class InputIterator1, class InputIterator2, class BinaryPredicate>
INLINE_LOOP vcl_pair<InputIterator1, InputIterator2> vcl_mismatch(InputIterator1 first1,
- InputIterator1 last1,
- InputIterator2 first2,
- BinaryPredicate binary_pred)
+ InputIterator1 last1,
+ InputIterator2 first2,
+ BinaryPredicate binary_pred)
{
__stl_debug_check(__check_range(first1, last1));
while (first1 != last1 && binary_pred(*first1, *first2)) { ++first1; ++first2; }
@@ -418,7 +418,7 @@ INLINE_LOOP vcl_pair<InputIterator1, InputIterator2> vcl_mismatch(InputIterator1
template <class InputIterator1, class InputIterator2>
INLINE_LOOP bool vcl_equal(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2)
+ InputIterator2 first2)
{
__stl_debug_check(__check_range(first1, last1));
for (; first1 != last1; ++first1, ++first2)
@@ -429,7 +429,7 @@ INLINE_LOOP bool vcl_equal(InputIterator1 first1, InputIterator1 last1,
template <class InputIterator1, class InputIterator2, class BinaryPredicate>
INLINE_LOOP bool vcl_equal(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, BinaryPredicate binary_pred)
+ InputIterator2 first2, BinaryPredicate binary_pred)
{
__stl_debug_check(__check_range(first1, last1));
for (; first1 != last1; ++first1, ++first2)
@@ -441,7 +441,7 @@ INLINE_LOOP bool vcl_equal(InputIterator1 first1, InputIterator1 last1,
template <class InputIterator1, class InputIterator2>
INLINE_LOOP bool
vcl_lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2)
+ InputIterator2 first2, InputIterator2 last2)
{
__stl_debug_check(__check_range(first1, last1));
__stl_debug_check(__check_range(first2, last2));
@@ -456,8 +456,8 @@ vcl_lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
template <class InputIterator1, class InputIterator2, class Compare>
INLINE_LOOP bool
vcl_lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
- InputIterator2 first2, InputIterator2 last2,
- Compare comp)
+ InputIterator2 first2, InputIterator2 last2,
+ Compare comp)
{
__stl_debug_check(__check_range(first1, last1));
__stl_debug_check(__check_range(first2, last2));
@@ -471,7 +471,7 @@ vcl_lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
inline bool
vcl_lexicographical_compare(unsigned char* first1, unsigned char* last1,
- unsigned char* first2, unsigned char* last2)
+ unsigned char* first2, unsigned char* last2)
{
__stl_debug_check(__check_range(first1, last1));
__stl_debug_check(__check_range(first2, last2));
@@ -482,18 +482,18 @@ vcl_lexicographical_compare(unsigned char* first1, unsigned char* last1,
}
inline bool vcl_lexicographical_compare(char* first1, char* last1,
- char* first2, char* last2)
+ char* first2, char* last2)
{
__stl_debug_check(__check_range(first1, last1));
__stl_debug_check(__check_range(first2, last2));
#if CHAR_MAX == SCHAR_MAX
return vcl_lexicographical_compare((signed char*) first1, (signed char*) last1,
- (signed char*) first2, (signed char*) last2);
+ (signed char*) first2, (signed char*) last2);
#else
return vcl_lexicographical_compare((unsigned char*) first1,
- (unsigned char*) last1,
- (unsigned char*) first2,
- (unsigned char*) last2);
+ (unsigned char*) last1,
+ (unsigned char*) first2,
+ (unsigned char*) last2);
#endif
}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_hashtable.h b/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_hashtable.h
index d374086791c48619ff06f2ac8e75c26601a409ac..609490575343e5c5d71507c7c3ca629e7d71dd79 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_hashtable.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_hashtable.h
@@ -106,27 +106,35 @@ struct vcl_hash<const char*>
struct vcl_hash<char> {
vcl_size_t operator()(char x) const { return x; }
};
+
struct vcl_hash<unsigned char> {
vcl_size_t operator()(unsigned char x) const { return x; }
};
+
struct vcl_hash<signed char> {
vcl_size_t operator()(unsigned char x) const { return x; }
};
+
struct vcl_hash<short> {
vcl_size_t operator()(short x) const { return x; }
};
+
struct vcl_hash<unsigned short> {
vcl_size_t operator()(unsigned short x) const { return x; }
};
+
struct vcl_hash<int> {
vcl_size_t operator()(int x) const { return x; }
};
+
struct vcl_hash<unsigned int> {
vcl_size_t operator()(unsigned int x) const { return x; }
};
+
struct vcl_hash<long> {
vcl_size_t operator()(long x) const { return x; }
};
+
struct vcl_hash<unsigned long> {
vcl_size_t operator()(unsigned long x) const { return x; }
};
@@ -216,7 +224,7 @@ struct vcl_hashtable_const_iterator
};
// Note: assumes long is at least 32 bits.
-// fbp: try to avoid intances in every module
+// fbp: try to avoid instances in every module
enum { VCL_num_primes = 28 };
#if ( __STL_STATIC_TEMPLATE_DATA > 0 ) && ! defined (VCL_WIN32)
@@ -424,8 +432,8 @@ class vcl_hashtable : protected vcl_hashtable_base<Value, Alloc>
typename node* cur1 = buckets[n];
typename node* cur2 = ht2.buckets[n];
for (; cur1 && cur2 && cur1->val == cur2->val;
- cur1 = cur1->next, cur2 = cur2->next)
- {}
+ cur1 = cur1->next, cur2 = cur2->next)
+ {}
if (cur1 || cur2)
return false;
}
@@ -437,7 +445,7 @@ class vcl_hashtable : protected vcl_hashtable_base<Value, Alloc>
size_type bucket_count() const { return buckets.size(); }
size_type max_bucket_count() const
- { return VCL_prime_list[VCL_num_primes - 1]; }
+ { return VCL_prime_list[VCL_num_primes - 1]; }
size_type elems_in_bucket(size_type bucket) const
{
diff --git a/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_iterator.h b/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_iterator.h
index 5c83ddf9c402de3a15216065496bc5f921499140..7b742fcd0f6de9039204365264b5a37d2f932f5f 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_iterator.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_iterator.h
@@ -538,7 +538,7 @@ inline
bool operator==(const vcl_istream_iterator<T, Distance>& x,
const vcl_istream_iterator<T, Distance>& y) {
return x.stream == y.stream && x.end_marker == y.end_marker ||
- x.end_marker == false && y.end_marker == false;
+ ! x.end_marker && ! y.end_marker;
}
template <class T>
diff --git a/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_tempbuf.h b/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_tempbuf.h
index 52d5fd1d71fc693b587caf1cfca8c66e5229a2de..e3574cde9220e81012e1362ab58d1034dfc01e5b 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_tempbuf.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/emulation/vcl_tempbuf.h
@@ -55,7 +55,8 @@
#include "vcl_pair.h"
template <class T>
-vcl_pair<T*, vcl_ptrdiff_t> get_temporary_buffer(vcl_ptrdiff_t len, T*) {
+vcl_pair<T*, vcl_ptrdiff_t> get_temporary_buffer(vcl_ptrdiff_t len, T*)
+{
if (len > vcl_ptrdiff_t(INT_MAX / sizeof(T)))
len = INT_MAX / sizeof(T);
@@ -70,7 +71,8 @@ vcl_pair<T*, vcl_ptrdiff_t> get_temporary_buffer(vcl_ptrdiff_t len, T*) {
}
template <class T>
-inline void return_temporary_buffer(T* p) {
+inline void return_temporary_buffer(T* p)
+{
free(p);
}
@@ -82,7 +84,7 @@ inline void return_temporary_buffer(T* p) {
template <class T, VCL_DFL_TYPE_PARAM_STLDECL(Distance,vcl_ptrdiff_t)>
struct __stl_tempbuf
{
-public:
+ public:
typedef T value_type;
typedef T* pointer;
typedef Distance difference_type;
@@ -106,9 +108,9 @@ public:
bool empty() const { return size()==0; }
difference_type max_size() const { return buf.second; }
difference_type capacity() const { return buf.second; }
- // reflects change in initalized area
+ // reflects change in initialized area
void adjust_size(difference_type len) { fill_pointer=len; }
-protected:
+ protected:
vcl_pair<T*, vcl_ptrdiff_t> buf;
difference_type fill_pointer;
};
diff --git a/Utilities/ITK/Utilities/vxl/vcl/generic/blah b/Utilities/ITK/Utilities/vxl/vcl/generic/blah
index 25b9c1e7c58840babed8d0bfb996b69bd0e8e1d4..41b8b50bbd5336e392d21ff493f21bfc74c426b7 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/generic/blah
+++ b/Utilities/ITK/Utilities/vxl/vcl/generic/blah
@@ -34,6 +34,7 @@ list
locale
map
memory
+memory_tr1
new
numeric
ostream
diff --git a/Utilities/ITK/Utilities/vxl/vcl/generic/blah_tr1 b/Utilities/ITK/Utilities/vxl/vcl/generic/blah_tr1
new file mode 100644
index 0000000000000000000000000000000000000000..2142c3ad3ce3e2246b36e4196e0c6acd540f84a7
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/generic/blah_tr1
@@ -0,0 +1 @@
+memory
diff --git a/Utilities/ITK/Utilities/vxl/vcl/generic/vcl_memory_tr1.h b/Utilities/ITK/Utilities/vxl/vcl/generic/vcl_memory_tr1.h
new file mode 100644
index 0000000000000000000000000000000000000000..11a99d955a38f15686207c2ac5d201256f263805
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/generic/vcl_memory_tr1.h
@@ -0,0 +1,44 @@
+#ifndef vcl_generic_memory_tr1_h_
+#define vcl_generic_memory_tr1_h_
+
+// THIS IS A GENERATED FILE. DO NOT EDIT! -- Instead, edit vcl_memory_tr1.hhh and run make
+
+// [20.6] lib.memory (additions in 0x draft: 2006-11-06)
+// bad_weak_ptr
+#ifndef vcl_bad_weak_ptr
+#define vcl_bad_weak_ptr vcl_generic_memory_tr1_STD :: bad_weak_ptr
+#endif
+// shared_ptr
+#ifndef vcl_shared_ptr
+#define vcl_shared_ptr vcl_generic_memory_tr1_STD :: shared_ptr
+#endif
+// swap
+#ifndef vcl_swap
+#define vcl_swap vcl_generic_memory_tr1_STD :: swap
+#endif
+// static_pointer_cast
+#ifndef vcl_static_pointer_cast
+#define vcl_static_pointer_cast vcl_generic_memory_tr1_STD :: static_pointer_cast
+#endif
+// dynamic_pointer_cast
+#ifndef vcl_dynamic_pointer_cast
+#define vcl_dynamic_pointer_cast vcl_generic_memory_tr1_STD :: dynamic_pointer_cast
+#endif
+// const_pointer_cast
+#ifndef vcl_const_pointer_cast
+#define vcl_const_pointer_cast vcl_generic_memory_tr1_STD :: const_pointer_cast
+#endif
+// get_deleter
+#ifndef vcl_get_deleter
+#define vcl_get_deleter vcl_generic_memory_tr1_STD :: get_deleter
+#endif
+// weak_ptr
+#ifndef vcl_weak_ptr
+#define vcl_weak_ptr vcl_generic_memory_tr1_STD :: weak_ptr
+#endif
+// enable_shared_from_this
+#ifndef vcl_enable_shared_from_this
+#define vcl_enable_shared_from_this vcl_generic_memory_tr1_STD :: enable_shared_from_this
+#endif
+
+#endif // vcl_generic_memory_tr1_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/generic/vcl_memory_tr1.hhh b/Utilities/ITK/Utilities/vxl/vcl/generic/vcl_memory_tr1.hhh
new file mode 100644
index 0000000000000000000000000000000000000000..545e0f5c190e48c1e7be35d6bd182ed9c65746d7
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/generic/vcl_memory_tr1.hhh
@@ -0,0 +1,10 @@
+// [20.6] lib.memory (additions in 0x draft: 2006-11-06)
+@bad_weak_ptr
+@shared_ptr
+@swap
+@static_pointer_cast
+@dynamic_pointer_cast
+@const_pointer_cast
+@get_deleter
+@weak_ptr
+@enable_shared_from_this
diff --git a/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_gcc.h b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_gcc.h
new file mode 100644
index 0000000000000000000000000000000000000000..70cd4fda9fecf413273f094b03182c727f5aa6d5
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_gcc.h
@@ -0,0 +1,66 @@
+#ifndef vcl_atomic_count_gcc_h_
+#define vcl_atomic_count_gcc_h_
+//:
+// \file
+// \brief thread/SMP safe reference counter
+// \author www.boost.org
+// \verbatim
+// Modifications
+// Gehua Yang (DualAlign) - 28 Aug. 2008 - first port from Boost 1.36.0
+// \endverbatim
+//
+// boost/detail/atomic_count_gcc.hpp
+//
+// vcl_atomic_count for GNU libstdc++ v3
+//
+// http://gcc.gnu.org/onlinedocs/porting/Thread-safety.html
+//
+// Copyright (c) 2001, 2002 Peter Dimov and Multi Media Ltd.
+// Copyright (c) 2002 Lars Gullik Bjønnes <larsbj@lyx.org>
+// Copyright 2003-2005 Peter Dimov
+//
+// Distributed under the Boost Software License, Version 1.0. (See
+// accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+//
+
+#include <bits/atomicity.h>
+
+
+#if defined(__GLIBCXX__) // g++ 3.4+
+
+using __gnu_cxx::__atomic_add;
+using __gnu_cxx::__exchange_and_add;
+
+#endif
+
+class vcl_atomic_count
+{
+ public:
+
+ explicit vcl_atomic_count(long v) : value_(v) {}
+
+ void operator++()
+ {
+ __atomic_add(&value_, 1);
+ }
+
+ long operator--()
+ {
+ return __exchange_and_add(&value_, -1) - 1;
+ }
+
+ operator long() const
+ {
+ return __exchange_and_add(&value_, 0);
+ }
+
+ private:
+
+ vcl_atomic_count(vcl_atomic_count const &);
+ vcl_atomic_count & operator=(vcl_atomic_count const &);
+
+ mutable _Atomic_word value_;
+};
+
+#endif // #ifndef vcl_atomic_count_gcc_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_gcc_x86.h b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_gcc_x86.h
new file mode 100644
index 0000000000000000000000000000000000000000..ad2ad4f717a641fe4ec74823cbc59b868c082884
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_gcc_x86.h
@@ -0,0 +1,81 @@
+#ifndef vcl_atomic_count_gcc_x86_h_
+#define vcl_atomic_count_gcc_x86_h_
+//:
+// \file
+// \brief thread/SMP safe reference counter
+// \author www.boost.org
+// \verbatim
+// Modifications
+// Gehua Yang (DualAlign) - 28 Aug. 2008 - first port from Boost 1.36.0
+// \endverbatim
+//
+// boost/detail/atomic_count_gcc_x86.hpp
+//
+// vcl_atomic_count for g++ on 486+/AMD64
+//
+// Copyright 2007 Peter Dimov
+//
+// Distributed under the Boost Software License, Version 1.0. (See
+// accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+//
+
+class vcl_atomic_count
+{
+ public:
+
+ explicit vcl_atomic_count( long v ) : value_( static_cast< int >( v ) ) {}
+
+ void operator++()
+ {
+ __asm__
+ (
+ "lock\n\t"
+ "incl %0":
+ "+m"( value_ ): // output (%0)
+ : // inputs
+ "cc" // clobbers
+ );
+ }
+
+ long operator--()
+ {
+ return atomic_exchange_and_add( &value_, -1 ) - 1;
+ }
+
+ operator long() const
+ {
+ return atomic_exchange_and_add( &value_, 0 );
+ }
+
+ private:
+
+ vcl_atomic_count(vcl_atomic_count const &);
+ vcl_atomic_count & operator=(vcl_atomic_count const &);
+
+ mutable int value_;
+
+ private:
+
+ static int atomic_exchange_and_add( int * pw, int dv )
+ {
+ // int r = *pw;
+ // *pw += dv;
+ // return r;
+
+ int r;
+
+ __asm__ __volatile__
+ (
+ "lock\n\t"
+ "xadd %1, %0":
+ "+m"( *pw ), "=r"( r ): // outputs (%0, %1)
+ "1"( dv ): // inputs (%2 == %1)
+ "memory", "cc" // clobbers
+ );
+
+ return r;
+ }
+};
+
+#endif // #ifndef vcl_atomic_count_gcc_x86_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_pthreads.h b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_pthreads.h
new file mode 100644
index 0000000000000000000000000000000000000000..6822a8968ae5582fff682114da5192f288ae4eb9
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_pthreads.h
@@ -0,0 +1,93 @@
+#ifndef vcl_atomic_count_pthreads_h_
+#define vcl_atomic_count_pthreads_h_
+//:
+// \file
+// \brief thread/SMP safe reference counter
+// \author www.boost.org
+// \verbatim
+// Modifications
+// Gehua Yang (DualAlign) - 28 Aug. 2008 - first port from Boost 1.36.0
+// \endverbatim
+//
+// boost/detail/atomic_count_pthreads.hpp
+//
+// Copyright (c) 2001, 2002 Peter Dimov and Multi Media Ltd.
+//
+// Distributed under the Boost Software License, Version 1.0. (See
+// accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+//
+
+#include <pthread.h>
+
+//
+// The generic pthread_mutex-based implementation sometimes leads to
+// inefficiencies. Example: a class with two vcl_atomic_count members
+// can get away with a single mutex.
+//
+// Users can detect this situation by checking BOOST_AC_USE_PTHREADS.
+//
+
+class vcl_atomic_count
+{
+ private:
+
+ class scoped_lock
+ {
+ public:
+
+ scoped_lock(pthread_mutex_t & m): m_(m)
+ {
+ pthread_mutex_lock(&m_);
+ }
+
+ ~scoped_lock()
+ {
+ pthread_mutex_unlock(&m_);
+ }
+
+ private:
+
+ pthread_mutex_t & m_;
+ };
+
+ public:
+
+ explicit vcl_atomic_count(long v): value_(v)
+ {
+ pthread_mutex_init(&mutex_, 0);
+ }
+
+ ~vcl_atomic_count()
+ {
+ pthread_mutex_destroy(&mutex_);
+ }
+
+ void operator++()
+ {
+ scoped_lock lock(mutex_);
+ ++value_;
+ }
+
+ long operator--()
+ {
+ scoped_lock lock(mutex_);
+ return --value_;
+ }
+
+ operator long() const
+ {
+ scoped_lock lock(mutex_);
+ return value_;
+ }
+
+ private:
+
+ vcl_atomic_count(vcl_atomic_count const &);
+ vcl_atomic_count & operator=(vcl_atomic_count const &);
+
+ mutable pthread_mutex_t mutex_;
+ long value_;
+};
+
+#endif // #ifndef vcl_atomic_count_pthreads_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_solaris.h b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_solaris.h
new file mode 100644
index 0000000000000000000000000000000000000000..cd2462c00147a333222fdda9aa01c248b1284ca6
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_solaris.h
@@ -0,0 +1,56 @@
+#ifndef vcl_atomic_count_solaris_h_
+#define vcl_atomic_count_solaris_h_
+//:
+// \file
+// \brief thread/SMP safe reference counter
+// \author www.boost.org
+// \verbatim
+// Modifications
+// Gehua Yang (DualAlign) - 28 Aug. 2008 - first port from Boost 1.36.0
+// \endverbatim
+//
+// boost/detail/atomic_count_solaris.hpp
+// based on: boost/detail/atomic_count_win32.hpp
+//
+// Copyright (c) 2001-2005 Peter Dimov
+// Copyright (c) 2006 Michael van der Westhuizen
+//
+// Distributed under the Boost Software License, Version 1.0. (See
+// accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+//
+
+#include <atomic.h>
+
+class vcl_atomic_count
+{
+ public:
+
+ explicit vcl_atomic_count( uint32_t v ): value_( v )
+ {
+ }
+
+ long operator++()
+ {
+ return atomic_inc_32_nv( &value_ );
+ }
+
+ long operator--()
+ {
+ return atomic_dec_32_nv( &value_ );
+ }
+
+ operator uint32_t() const
+ {
+ return static_cast<uint32_t const volatile &>( value_ );
+ }
+
+ private:
+
+ vcl_atomic_count( vcl_atomic_count const & );
+ vcl_atomic_count & operator=( vcl_atomic_count const & );
+
+ uint32_t value_;
+};
+
+#endif // #ifndef vcl_atomic_count_solaris_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_sync.h b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_sync.h
new file mode 100644
index 0000000000000000000000000000000000000000..5e4747a621ba496514d53acbf343dce175c428cf
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_sync.h
@@ -0,0 +1,54 @@
+#ifndef vcl_atomic_count_sync_h_
+#define vcl_atomic_count_sync_h_
+//:
+// \file
+// \brief thread/SMP safe reference counter
+// \author www.boost.org
+// \verbatim
+// Modifications
+// Gehua Yang (DualAlign) - 28 Aug. 2008 - first port from Boost 1.36.0
+// \endverbatim
+//
+// boost/detail/atomic_count_sync.hpp
+//
+// vcl_atomic_count for g++ 4.1+
+//
+// http://gcc.gnu.org/onlinedocs/gcc-4.1.1/gcc/Atomic-Builtins.html
+//
+// Copyright 2007 Peter Dimov
+//
+// Distributed under the Boost Software License, Version 1.0. (See
+// accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+//
+
+class vcl_atomic_count
+{
+ public:
+
+ explicit vcl_atomic_count( long v ) : value_( v ) {}
+
+ void operator++()
+ {
+ __sync_add_and_fetch( &value_, 1 );
+ }
+
+ long operator--()
+ {
+ return __sync_add_and_fetch( &value_, -1 );
+ }
+
+ operator long() const
+ {
+ return __sync_fetch_and_add( &value_, 0 );
+ }
+
+ private:
+
+ vcl_atomic_count(vcl_atomic_count const &);
+ vcl_atomic_count & operator=(vcl_atomic_count const &);
+
+ mutable long value_;
+};
+
+#endif // #ifndef vcl_atomic_count_sync_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_win32.h b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_win32.h
new file mode 100644
index 0000000000000000000000000000000000000000..88860ff0e862fcdce6428a25bac9d5a90edef968
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_atomic_count_win32.h
@@ -0,0 +1,60 @@
+#ifndef vcl_atomic_count_win32_h_
+#define vcl_atomic_count_win32_h_
+
+// MS compatible compilers support #pragma once
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+# pragma once
+#endif
+//:
+// \file
+// \brief thread/SMP safe reference counter
+// \author www.boost.org
+// \verbatim
+// Modifications
+// Gehua Yang (DualAlign) - 28 Aug. 2008 - first port from Boost 1.36.0
+// \endverbatim
+//
+// boost/detail/atomic_count_win32.hpp
+//
+// Copyright (c) 2001-2005 Peter Dimov
+//
+// Distributed under the Boost Software License, Version 1.0. (See
+// accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+//
+
+#include "vcl_interlocked.h"
+
+class vcl_atomic_count
+{
+ public:
+
+ explicit vcl_atomic_count( long v ): value_( v )
+ {
+ }
+
+ long operator++()
+ {
+ return BOOST_INTERLOCKED_INCREMENT( &value_ );
+ }
+
+ long operator--()
+ {
+ return BOOST_INTERLOCKED_DECREMENT( &value_ );
+ }
+
+ operator long() const
+ {
+ return static_cast<long const volatile &>( value_ );
+ }
+
+ private:
+
+ vcl_atomic_count( vcl_atomic_count const & );
+ vcl_atomic_count & operator=( vcl_atomic_count const & );
+
+ long value_;
+};
+
+#endif // #ifndef vcl_atomic_count_win32_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_interlocked.h b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_interlocked.h
new file mode 100644
index 0000000000000000000000000000000000000000..a1ae67b361504d6c86a92c55de126755a88cd76f
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/internal/vcl_interlocked.h
@@ -0,0 +1,135 @@
+#ifndef vcl_interlocked_h_
+#define vcl_interlocked_h_
+
+// MS compatible compilers support #pragma once
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+# pragma once
+#endif
+//:
+// \file
+// \brief thread/SMP safe reference counter
+// \author www.boost.org
+// \verbatim
+// Modifications
+// Gehua Yang (DualAlign) - 28 Aug. 2008 - first port from Boost 1.36.0
+// \endverbatim
+//
+// boost/detail/interlocked.hpp
+//
+// Copyright 2005 Peter Dimov
+//
+// Distributed under the Boost Software License, Version 1.0. (See
+// accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+ //
+
+// for the problematic Visual Studio 6
+#if defined(_WIN32) || defined(WIN32)
+# if _MSC_VER < 1300
+# define VCL_INTERLOCKED_VC6
+# endif
+#endif
+
+//
+// Do we need this?
+#if defined( __BORLANDC__ ) || defined( VCL_INTERLOCKED_VC6 )
+
+# define NOMINMAX
+# include <windows.h>
+
+# define BOOST_INTERLOCKED_INCREMENT InterlockedIncrement
+# define BOOST_INTERLOCKED_DECREMENT InterlockedDecrement
+# define BOOST_INTERLOCKED_COMPARE_EXCHANGE InterlockedCompareExchange
+# define BOOST_INTERLOCKED_EXCHANGE InterlockedExchange
+# define BOOST_INTERLOCKED_EXCHANGE_ADD InterlockedExchangeAdd
+# define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER InterlockedCompareExchangePointer
+# define BOOST_INTERLOCKED_EXCHANGE_POINTER InterlockedExchangePointer
+
+#elif defined(_WIN32_WCE)
+
+// under Windows CE we still have old-style Interlocked* functions
+
+ extern "C" long __cdecl InterlockedIncrement( long* );
+ extern "C" long __cdecl InterlockedDecrement( long* );
+ extern "C" long __cdecl InterlockedCompareExchange( long*, long, long );
+ extern "C" long __cdecl InterlockedExchange( long*, long );
+ extern "C" long __cdecl InterlockedExchangeAdd( long*, long );
+
+# define BOOST_INTERLOCKED_INCREMENT InterlockedIncrement
+# define BOOST_INTERLOCKED_DECREMENT InterlockedDecrement
+# define BOOST_INTERLOCKED_COMPARE_EXCHANGE InterlockedCompareExchange
+# define BOOST_INTERLOCKED_EXCHANGE InterlockedExchange
+# define BOOST_INTERLOCKED_EXCHANGE_ADD InterlockedExchangeAdd
+
+# define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest,exchange,compare) \
+ ((void*)BOOST_INTERLOCKED_COMPARE_EXCHANGE((long*)(dest),(long)(exchange),(long)(compare)))
+# define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest,exchange) \
+ ((void*)BOOST_INTERLOCKED_EXCHANGE((long*)(dest),(long)(exchange)))
+
+#elif defined( _MSC_VER ) || defined( __ICC )
+
+ extern "C" long __cdecl _InterlockedIncrement( long volatile * );
+ extern "C" long __cdecl _InterlockedDecrement( long volatile * );
+ extern "C" long __cdecl _InterlockedCompareExchange( long volatile *, long, long );
+ extern "C" long __cdecl _InterlockedExchange( long volatile *, long);
+ extern "C" long __cdecl _InterlockedExchangeAdd( long volatile *, long);
+
+# pragma intrinsic( _InterlockedIncrement )
+# pragma intrinsic( _InterlockedDecrement )
+# pragma intrinsic( _InterlockedCompareExchange )
+# pragma intrinsic( _InterlockedExchange )
+# pragma intrinsic( _InterlockedExchangeAdd )
+
+# if defined(_M_IA64) || defined(_M_AMD64)
+
+ extern "C" void* __cdecl _InterlockedCompareExchangePointer( void* volatile *, void*, void* );
+ extern "C" void* __cdecl _InterlockedExchangePointer( void* volatile *, void* );
+
+# pragma intrinsic( _InterlockedCompareExchangePointer )
+# pragma intrinsic( _InterlockedExchangePointer )
+
+# define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER _InterlockedCompareExchangePointer
+# define BOOST_INTERLOCKED_EXCHANGE_POINTER _InterlockedExchangePointer
+
+# else
+
+# define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest,exchange,compare) \
+ ((void*)BOOST_INTERLOCKED_COMPARE_EXCHANGE((long volatile*)(dest),(long)(exchange),(long)(compare)))
+# define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest,exchange) \
+ ((void*)BOOST_INTERLOCKED_EXCHANGE((long volatile*)(dest),(long)(exchange)))
+
+# endif
+
+# define BOOST_INTERLOCKED_INCREMENT _InterlockedIncrement
+# define BOOST_INTERLOCKED_DECREMENT _InterlockedDecrement
+# define BOOST_INTERLOCKED_COMPARE_EXCHANGE _InterlockedCompareExchange
+# define BOOST_INTERLOCKED_EXCHANGE _InterlockedExchange
+# define BOOST_INTERLOCKED_EXCHANGE_ADD _InterlockedExchangeAdd
+
+#elif defined( WIN32 ) || defined( _WIN32 ) || defined( __WIN32__ ) || defined( __CYGWIN__ )
+
+ extern "C" __declspec(dllimport) long __stdcall InterlockedIncrement( long volatile * );
+ extern "C" __declspec(dllimport) long __stdcall InterlockedDecrement( long volatile * );
+ extern "C" __declspec(dllimport) long __stdcall InterlockedCompareExchange( long volatile *, long, long );
+ extern "C" __declspec(dllimport) long __stdcall InterlockedExchange( long volatile *, long );
+ extern "C" __declspec(dllimport) long __stdcall InterlockedExchangeAdd( long volatile *, long );
+
+# define BOOST_INTERLOCKED_INCREMENT InterlockedIncrement
+# define BOOST_INTERLOCKED_DECREMENT InterlockedDecrement
+# define BOOST_INTERLOCKED_COMPARE_EXCHANGE InterlockedCompareExchange
+# define BOOST_INTERLOCKED_EXCHANGE InterlockedExchange
+# define BOOST_INTERLOCKED_EXCHANGE_ADD InterlockedExchangeAdd
+
+# define BOOST_INTERLOCKED_COMPARE_EXCHANGE_POINTER(dest,exchange,compare) \
+ ((void*)BOOST_INTERLOCKED_COMPARE_EXCHANGE((long volatile*)(dest),(long)(exchange),(long)(compare)))
+# define BOOST_INTERLOCKED_EXCHANGE_POINTER(dest,exchange) \
+ ((void*)BOOST_INTERLOCKED_EXCHANGE((long volatile*)(dest),(long)(exchange)))
+
+#else
+
+# error "Interlocked intrinsics not available"
+
+#endif
+
+#endif // #ifndef vcl_interlocked_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/iso/vcl_memory_tr1.h b/Utilities/ITK/Utilities/vxl/vcl/iso/vcl_memory_tr1.h
new file mode 100644
index 0000000000000000000000000000000000000000..6eddefffbbc800cac326a27ac9a06368b59a2f11
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/iso/vcl_memory_tr1.h
@@ -0,0 +1,16 @@
+#ifndef vcl_iso_memory_tr1_h_
+#define vcl_iso_memory_tr1_h_
+
+// This is a generated file. DO NOT EDIT! Not even a little bit.
+
+#include <memory_tr1>
+
+#ifdef vcl_generic_memory_tr1_STD
+ ** error **
+#else
+# define vcl_generic_memory_tr1_STD std
+#endif
+
+#include "../generic/vcl_memory_tr1.h"
+
+#endif // vcl_iso_memory_tr1_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/vcl/tests/CMakeLists.txt
deleted file mode 100644
index 74fe59a4ac4cee9f340ac3d697d750d4ebbac31c..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/CMakeLists.txt
+++ /dev/null
@@ -1,64 +0,0 @@
-# vcl/tests/CMakeLists.txt
-
-# Avoid adding more test executables here, in order to keep the number
-# of projects small. (This is a concern for IDEs like Visual Studio.)
-# Try to follow one of the other tests, like test_algorithm.cxx,
-# and add the test into test_driver.cxx.
-
-ADD_EXECUTABLE( vcl_test_all
- # Driver
- test_driver.cxx
- # The actual tests
- test_algorithm.cxx
- test_cctype.cxx
- test_cmath.cxx
- test_compiler.cxx
- test_complex.cxx
- test_deque.cxx
- test_exception.cxx
- test_fstream.cxx
- test_iostream.cxx
- test_iterator.cxx
- test_list.cxx
- test_limits.cxx
- test_map.cxx
- #test_memory.cxx
- test_multimap.cxx
- test_new.cxx
- test_set.cxx
- test_stlfwd.cxx
- test_string.cxx
- test_sstream.cxx
- test_vector.cxx
- test_cstdio.cxx
- test_preprocessor.cxx
-)
-TARGET_LINK_LIBRARIES( vcl_test_all itkvcl )
-
-ADD_TEST( vcl_test_algorithm ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_algorithm )
-ADD_TEST( vcl_test_cctype ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_cctype )
-ADD_TEST( vcl_test_cmath ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_cmath )
-ADD_TEST( vcl_test_compiler ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_compiler )
-ADD_TEST( vcl_test_complex ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_complex )
-ADD_TEST( vcl_test_deque ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_deque )
-ADD_TEST( vcl_test_exception ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_exception )
-ADD_TEST( vcl_test_fstream ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_fstream )
-ADD_TEST( vcl_test_iostream ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_iostream )
-ADD_TEST( vcl_test_iterator ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_iterator )
-ADD_TEST( vcl_test_list ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_list )
-ADD_TEST( vcl_test_limits ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_limits )
-ADD_TEST( vcl_test_map ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_map )
-#ADD_TEST( vcl_test_memory ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_memory )
-ADD_TEST( vcl_test_multimap ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_multimap )
-ADD_TEST( vcl_test_new ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_new )
-ADD_TEST( vcl_test_set ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_set )
-ADD_TEST( vcl_test_string ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_string )
-ADD_TEST( vcl_test_sstream ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_sstream )
-ADD_TEST( vcl_test_vector ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_vector )
-ADD_TEST( vcl_test_cstdio ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_cstdio ${CMAKE_CURRENT_SOURCE_DIR}/test_cstdio.txt )
-ADD_TEST( vcl_test_preprocessor ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_preprocessor )
-# Only a compiler test:
-#ADD_TEST( vcl_test_stlfwd ${EXECUTABLE_OUTPUT_PATH}/vcl_test_all test_stlfwd )
-
-ADD_EXECUTABLE( vcl_test_include test_include.cxx )
-TARGET_LINK_LIBRARIES( vcl_test_include itkvcl )
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_algorithm.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_algorithm.cxx
deleted file mode 100644
index 5c4f6dd4553bddd851aba62d80d0ec7bf2af8181..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_algorithm.cxx
+++ /dev/null
@@ -1,12 +0,0 @@
-/*
- fsm
-*/
-#include <vcl_algorithm.h>
-
-int test_algorithm_main(int /*argc*/,char* /*argv*/[])
-{
- double v[5] = {1,5,2,4,3};
- vcl_sort(v, v+5);
-
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_cctype.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_cctype.cxx
deleted file mode 100644
index 968a4ccad775ba1a2b9c404f4f38f0590e5086f4..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_cctype.cxx
+++ /dev/null
@@ -1,21 +0,0 @@
-#include <vcl_cctype.h>
-
-// Test the functionality, and also cause a link to make sure the
-// function exists.
-
-int test_cctype_main(int /*argc*/,char* /*argv*/[])
-{
- return ! ( vcl_isspace(' ') && vcl_isspace('\n') && !vcl_isspace('a') &&
- vcl_isalnum('1') && vcl_isalnum('z') && !vcl_isalnum('@') &&
- vcl_isdigit('4') && !vcl_isdigit('k') && !vcl_isdigit('%') &&
- vcl_isprint(' ') && vcl_isprint('(') && !vcl_isprint('\n') &&
- vcl_isupper('A') && !vcl_isupper('a') && !vcl_isupper('1') &&
- vcl_islower('b') && !vcl_islower('G') && !vcl_islower('8') &&
- vcl_isalpha('A') && vcl_isalpha('a') && !vcl_isalpha('1') &&
- vcl_isgraph('%') && vcl_isgraph('j') && !vcl_isgraph(' ') &&
- vcl_ispunct('&') && !vcl_ispunct('a') && !vcl_ispunct(' ') &&
- vcl_isxdigit('8') && vcl_isxdigit('F') && vcl_isxdigit('f') && !vcl_isxdigit('g') &&
- vcl_iscntrl('\n') && vcl_iscntrl('\177') && !vcl_iscntrl('i') &&
- vcl_tolower('A')=='a' && vcl_tolower('a')=='a' && vcl_tolower('@')=='@' &&
- vcl_toupper('K')=='K' && vcl_toupper('j')=='J' && vcl_toupper('$')=='$' );
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_cmath.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_cmath.cxx
deleted file mode 100644
index 4e43c125f02a3202bc18219c92248e4cc37007a6..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_cmath.cxx
+++ /dev/null
@@ -1,68 +0,0 @@
-/*
- fsm
-*/
-
-// The purpose of this is to check there are no
-// clashes between vcl_sqrt() and vcl_abs().
-#include <vcl_complex.h>
-#include <vcl_cmath.h>
-#include <vcl_cstdlib.h>
-
-#include <vcl_iostream.h>
-
-int test_cmath_main(int /*argc*/,char* /*argv*/[])
-{
- {
- int xi = 314159265;
- long xl = 314159265L;
- float xf = 13.14159265358979323846f;
- double xd = 23.14159265358979323846;
- long double ld = xd;
- vcl_complex<double> xc(xd,0.0);
-
-#define macro(var, type) \
-do { \
- if (vcl_abs(var) == var && vcl_abs(- var) == var) \
- vcl_cout << "vcl_abs(" #type ") PASSED" << vcl_endl; \
- else \
- vcl_cerr << "vcl_abs(" #type ") *** FAILED *** " << vcl_endl; \
-} while (false)
- macro(xi, int);
- macro(xl, long);
- macro(xf, float);
- macro(xd, double);
- macro(ld, long double);
- macro(xc, vcl_complex<double>);
-#undef macro
- }
-
- {
- // This shows why
- // #define vcl_cos cos
- // isn't good enough. It has to be
- // #define vcl_cos ::cos
- // or
- // #define vcl_cos std::cos
- double theta = 0.1234;
- double cos = vcl_cos(theta);
- double sin = vcl_sin(theta);
- double tan = vcl_tan(theta);
- (void)theta; (void)cos; (void)sin; (void)tan; // quell 'unused variable' warning.
- }
-
-#define macro(T, eps) \
- do { \
- T x = 2; \
- T y = vcl_sqrt(x); \
- if (vcl_abs(x - y*y) < eps) \
- vcl_cout << "vcl_sqrt(" #T ") PASSED" << vcl_endl; \
- else \
- vcl_cout << "vcl_sqrt(" #T ") *** FAILED *** " << vcl_endl; \
- } while (false)
- macro(float, 1e-6); // actually sqrtf()
- macro(double, 1e-14);
- macro(long double, 1e-14); // actually sqrtl()
-#undef macro
-
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_compiler.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_compiler.cxx
deleted file mode 100644
index 824e1299e57c64c6cd70470120544b49338e9e77..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_compiler.cxx
+++ /dev/null
@@ -1,118 +0,0 @@
-#include <vcl_compiler.h>
-
-// ------------------------------------------------
-
-// this *does* work for SGI CC 7.2.1 -- fsm
-
-template <class T>
-struct X
-{
- int x;
- X();
- // declaration of static template member.
- static X<T> *pl;
-};
-
-template <class T>
-X<T>::X() : x(1728) { }
-
-// definition (not specialization) of static template member.
-template <class T>
-X<T> *X<T>::pl = 0;
-
-// explicit instantiation of class also instantiates statics.
-template struct X<int>;
-
-// ------------------------------------------------
-
-struct A
-{
- int x;
- mutable int y;
- A() : x(0), y(0) { }
- void f() { ++ x; }
- void g() const { ++ y; }
-};
-
-// ------------------------------------------------
-
-#include <vcl_iostream.h>
-
-void vcl_test_implicit_instantiation(int n);
-
-
-int test_compiler_main(int /*argc*/,char* /*argv*/[])
-{
- int result = 0;
-
- vcl_cout << "Testing static template member..." << vcl_flush;
- if ( X<int>::pl == 0 ) {
- vcl_cout << " PASSED" << vcl_endl;
- } else {
- vcl_cout << "**FAILED**" << vcl_endl;
- result = 1;
- }
-
- // If it links, it passed!
- vcl_cout << "Testing implicit instantation..." << vcl_flush;
- vcl_test_implicit_instantiation(100);
- vcl_cout << " PASSED" << vcl_endl;
-
- return result;
-}
-
-#if defined(VCL_USE_IMPLICIT_TEMPLATES) && VCL_USE_IMPLICIT_TEMPLATES
-#include <vcl_vector.h>
-#include <vcl_map.h>
-#include <vcl_algorithm.h>
-
-struct mystery_type
-{
- mystery_type();
- mystery_type(int, float);
- mystery_type(mystery_type const &);
- mystery_type &operator=(mystery_type const &);
- int a;
- float b;
-};
-bool operator==(mystery_type const &, mystery_type const &);
-bool operator< (mystery_type const &, mystery_type const &);
-
-void vcl_test_implicit_instantiation(int n)
-{
- vcl_vector<mystery_type> v;
- v.resize(n);
- for (int i=0; i<n; ++i) {
- v[i].a = i;
- v[i].b = i/float(n);
- }
- v.reserve(2*n);
- v.resize(n/2);
- vcl_sort(v.begin(), v.end());
- v = v;
- v.clear();
-
- typedef vcl_map<int, mystery_type, vcl_less<int> > map_t;
- map_t m;
- for (int i=0; i<n; ++i)
- m.insert(map_t::value_type(0, mystery_type(i, i/float(n))));
- m.clear();
-}
-
-mystery_type::mystery_type()
-{ }
-mystery_type::mystery_type(int a_, float b_)
- : a(a_), b(b_) { }
-mystery_type::mystery_type(mystery_type const &that)
- : a(that.a), b(that.b) { }
-mystery_type &mystery_type::operator=(mystery_type const &that)
-{ a = that.a; b = that.b; return *this; }
-
-bool operator==(mystery_type const &x, mystery_type const &y)
-{ return (x.a == y.a) && (x.b == y.b); }
-bool operator< (mystery_type const &x, mystery_type const &y)
-{ return (x.a < y.b) || ((x.a == y.a) && (x.b < y.b)); }
-
-#else
-void vcl_test_implicit_instantiation(int) { }
-#endif
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_complex.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_complex.cxx
deleted file mode 100644
index 7929e5f637d1e7d6fedec6dd91b675da21407fe4..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_complex.cxx
+++ /dev/null
@@ -1,87 +0,0 @@
-// now #include the definition of vcl_complex<>
-// and define the doublify() function.
-
-
-#include <vcl_complex.h>
-
-
-vcl_complex<double> doublify(vcl_complex<float> const &z)
-{
- return vcl_complex<double>(vcl_real(z), vcl_imag(z));
-}
-
-#include <vcl_iostream.h>
-
-int test_complex_main(int /*argc*/,char* /*argv*/[])
-{
- vcl_complex<double> dc1(1.1,1.2), dc2(2.1,2.2);
- vcl_complex<float> fc1(1.1f,1.2f), fc2(2.1f,2.2f);
-
- vcl_cout << dc1 << " + " << dc2 << " = " << (dc1+dc2) << vcl_endl
- << fc1 << " + " << fc2 << " = " << (fc1+fc2) << vcl_endl;
-
- vcl_complex<double> dc3(vcl_real(dc1),vcl_imag(dc2));
- vcl_complex<float> fc3(vcl_real(fc1),vcl_imag(fc2));
-
- vcl_cout << dc3 << " / " << dc1 << " = " << dc3/dc1 << vcl_endl
- << fc3 << " / " << fc1 << " = " << fc3/fc1 << vcl_endl;
-
- vcl_cout << "polar representation of " << dc3 << " is [" << vcl_abs(dc3) << ',' << vcl_arg(dc3) << "]\n"
- << "going back: " << dc3 << " must be = " << vcl_polar(vcl_abs(dc3), vcl_arg(dc3)) << vcl_endl;
- vcl_complex<float> fcsr3 = vcl_sqrt(fc3);
- vcl_cout << "sqrt(" << fc3 << ") is " << fcsr3 << ", so " << fcsr3 << " * " << fcsr3 << " = " << fcsr3*fcsr3 << vcl_endl;
-
- // Should also test form of complex stream input and output. The standard says:
- // [26.2.6.12] operator>> understands "u", "(u)" and "(u,v)" where u, v are real.
- // [26.2.6.13] operator<< does f << '(' << x.real() << ',' << x.imag() << ')';
- // In particular, complex numbers written with operator<< can be read again with
- // operator>>.
-
- // complex should have a type called value_type;
- vcl_complex<float>::value_type tmp = 1.0f;
- tmp += 2.0f; // to avoid unused variable warnings.
-
-
- // Test the vcl_pow functions
-
- bool success = true;
-
- const vcl_complex<double> neg1(-1.0, 0.0);
- const vcl_complex<double> i(0.0,1.0);
- vcl_complex<double> sqrt_neg1 = vcl_pow(neg1, 0.5);
- vcl_cout << "pow("<<neg1<<",0.5) = "<<sqrt_neg1<<
- " and should be (0,1)"<<vcl_endl;
- double error = vcl_abs(sqrt_neg1-i);
-// need to be careful of quiet NANs
- if ( error < 0.0 || 1e-6 < error)
- {
- vcl_cout << "** FAILURE **\n";
- success = false;
- }
-
- const vcl_complex<double> half(0.5,0.0);
- sqrt_neg1 = vcl_pow(neg1, half);
- vcl_cout << "pow("<<neg1<<","<<half<<") = "<<sqrt_neg1<<
- " and should be (0,1)"<<vcl_endl;
- error = vcl_abs(sqrt_neg1-i);
- if ( error < 0.0 || 1e-6 < error)
- {
- vcl_cout << "** FAILURE **\n";
- success = false;
- }
-
- vcl_complex<double> zero(0.0,0.0);
- vcl_cout << "Implementation defines vcl_pow((0,0),(0,0)) = "
- << vcl_pow(zero, zero) << vcl_endl;
-
- {
- vcl_complex<double> x(2, 3);
- vcl_complex<double> xc = vcl_conj(x);
- vcl_cout << "Conjugate " << x << " = " << xc << "\n";
- if( xc != vcl_complex<double>(2,-3) ) {
- success = false;
- }
- }
-
- return success?0:1;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_cstdio.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_cstdio.cxx
deleted file mode 100644
index e7d0424ab3924b7475071686b712892ce0de4002..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_cstdio.cxx
+++ /dev/null
@@ -1,44 +0,0 @@
-#include <vcl_cstdio.h>
-
-int test_cstdio_main(int argc,char* argv[])
-{
- vcl_printf( "Hello. %d %f %03x.\n", 1, 2.0f, 3 );
-
- bool fail = false; // global status of the test suite
-
- int rc; // return code
-
-#define ASSERT(x,y) if (!(x)) { vcl_printf("FAIL: " y "\n"); fail=true; }
-#define ASSERT1(x,y,a) if (!(x)) { vcl_printf("FAIL: " y "\n",a); fail=true; }
-#define ASSERT2(x,y,a,b) if (!(x)){vcl_printf("FAIL: " y "\n",a,b);fail=true;}
-
- // Close the standard input. All reads from
- // stdin should fail after this.
- rc = vcl_fclose(stdin);
- ASSERT(rc==0, "couldn't close standard input")
-
- rc = vcl_getchar();
- ASSERT(rc==EOF, "std::getchar() read a value from a closed stream")
-
- ASSERT(argc>=2, "no file name given as the first command line argument")
- vcl_FILE* fh = vcl_fopen( argv[1], "r" );
- ASSERT1(fh, "couldn't open %s\n (skipping file tests)", argv[1])
-
- if (fh)
- {
- rc = vcl_getc( fh );
- ASSERT(rc=='t', "first character read was not 't'")
-
- rc = vcl_ungetc( 'x', fh );
- ASSERT(rc=='x', "ungetc failed")
- else {
- rc = vcl_getc( fh );
- ASSERT2(rc=='x', "getc returned %d, and not %d ('x') as expected",rc,'x')
- }
-
- rc = vcl_fclose( fh );
- ASSERT(rc==0, "failed to close file")
- }
-
- return fail ? 1 : 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_cstdio.txt b/Utilities/ITK/Utilities/vxl/vcl/tests/test_cstdio.txt
deleted file mode 100644
index 815a33cfad7b5aad545a7b5a4604cd02930f7bd2..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_cstdio.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-this is the input file
-for test_vcl_cstdio.
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_deque.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_deque.cxx
deleted file mode 100644
index 3ec8e59ab07158ba3128a3a4ed5521d9da03aaff..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_deque.cxx
+++ /dev/null
@@ -1,17 +0,0 @@
-#include <vcl_iostream.h>
-#include <vcl_deque.h>
-
-int test_deque_main(int /*argc*/,char* /*argv*/[])
-{
- typedef vcl_deque<int> mydeque;
- mydeque dq;
-
- dq.push_front(2);
- dq.push_back(3);
- dq.push_front(1);
-
- for (mydeque::iterator p = dq.begin(); p != dq.end(); ++p)
- vcl_cout << *p << vcl_endl;
-
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_driver.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_driver.cxx
deleted file mode 100644
index de0c2111bd02378206611e01981a8c18cc2b7ae7..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_driver.cxx
+++ /dev/null
@@ -1,126 +0,0 @@
-//:
-// \file
-// \brief vcl_tests.cxx : Run all vcl tests from one app.
-// I think this is preferable to having many vcl_test_* projects.
-// Note that all tests' main function should have signature (int,char**).
-// \author awf, mar 2000
-
-#include <vcl_iostream.h>
-#include <vcl_string.h>
-
-#if defined(VCL_BORLAND)
-# include <math.h>
-# include <float.h>
-#endif // defined(VCL_BORLAND)
-
-int test_algorithm_main(int, char*[]);
-int test_cctype_main(int, char*[]);
-int test_cmath_main(int, char*[]);
-int test_compiler_main(int, char*[]);
-int test_complex_main(int, char*[]);
-int test_deque_main(int, char*[]);
-int test_exception_main(int, char*[]);
-int test_fstream_main(int, char*[]);
-int test_headers_main(int, char**); // need not be called: just a compiler test
-int test_iostream_main(int, char*[]);
-int test_iterator_main(int, char*[]);
-int test_list_main(int, char*[]);
-int test_limits_main(int, char*[]);
-int test_map_main(int, char*[]);
-//int test_memory_main(int, char*[]);
-int test_multimap_main(int, char*[]);
-int test_new_main(int, char*[]);
-int test_set_main(int, char*[]);
-int test_stlfwd_main(int, char*[]); // need not be called: just a compiler test
-int test_string_main(int, char*[]);
-int test_sstream_main(int, char*[]);
-int test_vector_main(int, char*[]);
-int test_cstdio_main(int, char*[]);
-int test_preprocessor_main(int, char*[]);
-
-int passed;
-int failed;
-
-void testname( const char* testname )
-{
- vcl_cout << " Testing vcl_" << testname << " ... ";
- vcl_cout.flush();
-}
-
-void testresult( int testresult )
-{
- if ( testresult==0 ) {
- ++passed;
- vcl_cout << " PASSED" << vcl_endl;
- } else {
- ++failed;
- vcl_cout << " **FAILED**" << vcl_endl;
- }
-}
-
-// The else is for a trailing ; after the macro
-#define DO_TEST( Name ) \
- if ( name == "" || name == "test_" #Name ) { \
- testname( #Name ); \
- testresult( test_##Name##_main(argc,argv) ); \
- test_run = 1; \
- } else
-
-int main( int argc, char* argv[] )
-{
- int test_run = 0;
- passed = failed = 0;
- vcl_string name = "";
-
- if ( argc > 1 ) {
- name = argv[1];
- ++argv;
- --argc;
- }
-
- // Disable Borland's floating point exceptions.
-#if defined(VCL_BORLAND)
- _control87(MCW_EM, MCW_EM);
-#endif // defined(VCL_BORLAND)
-
- DO_TEST(algorithm);
- DO_TEST(cctype);
- DO_TEST(cmath);
- DO_TEST(compiler);
- DO_TEST(complex);
- DO_TEST(cstdio);
- DO_TEST(deque);
- DO_TEST(exception);
- DO_TEST(fstream);
- DO_TEST(iostream);
- DO_TEST(iterator);
- DO_TEST(list);
- DO_TEST(limits);
- //DO_TEST(memory);
- DO_TEST(map);
- DO_TEST(multimap);
- DO_TEST(new);
- DO_TEST(set);
- DO_TEST(string);
- DO_TEST(sstream);
- DO_TEST(vector);
- DO_TEST(preprocessor)
-;
- if (test_run == 0)
- {
- vcl_cout << "Unsupported test " << name
- << "; should first be added to test_driver.cxx\n";
- failed = true;
- }
-
- vcl_cout << name << " Test Summary: ";
- if (failed > 0)
- vcl_cout<<passed<<" tests succeeded, "<<failed<<" tests failed\t\t\t*****";
- else if (passed > 1)
- vcl_cout<<"All "<<passed<<" tests succeeded";
- else
- vcl_cout<<"All tests succeeded";
- vcl_cout << "\n-----------------------------------------------------------------------------\n";
-
- return failed;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_exception.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_exception.cxx
deleted file mode 100644
index b898f2e4b63e24ebeab9b4d7cafd09345127def8..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_exception.cxx
+++ /dev/null
@@ -1,27 +0,0 @@
-// This is vcl/tests/test_exception.cxx
-#include <vcl_exception.h>
-#include <vcl_iostream.h>
-
-int test_exception_main(int /*argc*/,char* /*argv*/[])
-{
-#if VCL_HAS_EXCEPTIONS
- const char *ex = "\"const char* exception\"";
- int result;
- vcl_try {
- vcl_cout << "throw " << ex << vcl_endl;
- vcl_throw ex;
- }
- vcl_catch (const char* e) {
- vcl_cout << "caught " << e << ". Good." << vcl_endl;
- result = 0;
- }
- vcl_catch_all {
- vcl_cout << "caught nothing. Bad." << vcl_endl;
- result = 1;
- }
- return result;
-#else
- vcl_cout << "this compiler does not support exception handling\n";
- return 0;
-#endif
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_fstream.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_fstream.cxx
deleted file mode 100644
index 46a836b025701a648bdce2bdfec6c84a3436f5b1..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_fstream.cxx
+++ /dev/null
@@ -1,16 +0,0 @@
-#include <vcl_fstream.h>
-
-int test_fstream_main(int /*argc*/,char* /*argv*/[])
-{
- if (false) {
- vcl_fstream f("dont_worry_this_file_is_not_created", vcl_ios_out | vcl_ios_binary);
-
- f.write("hello, file", 11);
-
- f.seekp(0);
- f.seekg(0);
-
- f.close();
- }
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_include.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_include.cxx
deleted file mode 100644
index 6c9f3031c60efa2e32487407b673f03da1090cf1..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_include.cxx
+++ /dev/null
@@ -1,74 +0,0 @@
-#include <vcl_cassert.h>
-#ifndef VCL_SGI_CC_720 //SGI7.2.1
-#include <vcl_ciso646.h>
-#endif
-#include <vcl_csetjmp.h>
-#include <vcl_cstdio.h>
-#include <vcl_ctime.h>
-#include <vcl_cctype.h>
-#include <vcl_climits.h>
-#include <vcl_csignal.h>
-#include <vcl_cstdlib.h>
-#ifndef __FreeBSD__ //FreeBSD4
-#include <vcl_cwchar.h>
-#ifndef __sun
-#include <vcl_cwctype.h>
-#endif
-#endif
-#include <vcl_cerrno.h>
-#include <vcl_clocale.h>
-#include <vcl_cstdarg.h>
-#include <vcl_cstring.h>
-#include <vcl_cmath.h>
-#include <vcl_cfloat.h>
-#include <vcl_cstddef.h>
-#include <vcl_algorithm.h>
-#include <vcl_iomanip.h>
-#include <vcl_list.h>
-#include <vcl_ostream.h>
-#include <vcl_streambuf.h>
-#ifndef VCL_EGCS //egcs
-#include <vcl_bitset.h>
-#endif
-#include <vcl_ios.h>
-#ifndef VCL_GCC_295 //gcc2.95
-#include <vcl_locale.h>
-#endif
-#include <vcl_limits.h>
-#include <vcl_queue.h>
-#include <vcl_string.h>
-#include <vcl_complex.h>
-#include <vcl_iosfwd.h>
-#include <vcl_map.h>
-#include <vcl_set.h>
-#if VCL_CXX_HAS_HEADER_TYPEINFO
-#include <vcl_typeinfo.h>
-#endif
-#include <vcl_deque.h>
-#include <vcl_iostream.h>
-#include <vcl_istream.h>
-#include <vcl_sstream.h>
-#include <vcl_fstream.h>
-#include <vcl_iterator.h>
-#include <vcl_memory.h>
-#include <vcl_utility.h>
-#include <vcl_exception.h>
-#include <vcl_new.h>
-#include <vcl_stack.h>
-#ifndef VCL_SGI_CC_720 //SGI7.2.1
-#include <vcl_valarray.h>
-#include <vcl_numeric.h>
-#include <vcl_stdexcept.h>
-#endif
-#include <vcl_vector.h>
-#include <vcl_functional.h>
-
-#include <vcl_complex_fwd.h>
-#include <vcl_stlfwd.h>
-#include <vcl_where_root_dir.h>
-#include <vcl_compiler.h>
-#include <vcl_deprecated.h>
-#define vcl_deprecated_header_h_ // to avoid deprecation warning in here
-#include <vcl_deprecated_header.h>
-
-int main() { return 0; }
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_iostream.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_iostream.cxx
deleted file mode 100644
index 7f4aefa8f8deccfdb88d25808f6e899e194919fa..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_iostream.cxx
+++ /dev/null
@@ -1,127 +0,0 @@
-// include all the streams headers and <string>, to
-// ensure they are compatible.
-#include <vcl_string.h>
-#include <vcl_ios.h> // for vcl_ios_fixed etc.
-#include <vcl_iomanip.h> // for vcl_fixed etc.
-#include <vcl_iostream.h>
-#include <vcl_fstream.h>
-#include <vcl_sstream.h>
-
-// This appears to do nothing, and it doesn't compile on MSVC with some weird error
-// 'flux' : illegal member initialization: 'fstream' is not a base or member
-#ifndef VCL_VC
-struct flux : public vcl_fstream
-{
- // check that bitwise OR of {openmode}s works.
- flux(vcl_ios_openmode mode = vcl_ios_in | vcl_ios_binary)
- : vcl_fstream("/tmp/flux", mode) { }
-};
-#endif
-
-int test_iostream_main(int /*argc*/,char* /*argv*/[])
-{
- vcl_cout << vcl_string("hello, vcl") << vcl_endl
- << vcl_oct << 01000 << vcl_endl
- << vcl_hex << 0x1000 << vcl_endl
- << vcl_dec << 1000 << vcl_endl
- << vcl_endl;
-
- // I/O formatting
- vcl_cin.flags(vcl_ios_skipws | vcl_ios_boolalpha);
- vcl_cout.unsetf(vcl_ios_dec);
- vcl_ios_fmtflags flgs =
- vcl_cout.setf(vcl_ios_uppercase |
- vcl_ios_showbase |
- vcl_ios_showpos |
- vcl_ios_showpoint);
- vcl_cout.setf(vcl_ios_oct, vcl_ios_basefield);
- vcl_cout.setf(vcl_ios_scientific, vcl_ios_floatfield);
- vcl_cout.setf(vcl_ios_left, vcl_ios_adjustfield);
- vcl_cout << "Scientific, precision=2, width=20, pad_right : [";
- vcl_cout.precision(2); vcl_cout.width(20); vcl_cout.fill('x');
- // Note that precision() only applies to the next numeric or string entry!
- vcl_cout << 27182.81828 << "] oct " << 10 << vcl_endl;
- vcl_cout.flags(vcl_ios_showbase | vcl_ios_showpoint);
- vcl_cout.setf(vcl_ios_hex, vcl_ios_basefield);
- vcl_cout.setf(vcl_ios_fixed, vcl_ios_floatfield);
- vcl_cout.setf(vcl_ios_right, vcl_ios_adjustfield);
- vcl_cout << "Fixed, precision=2, width=20, pad_left : [";
- vcl_cout.width(20);
- vcl_cout << 27182.81828 << "] hex " << 10 << vcl_endl;
- vcl_cout.flags(flgs); // restore
- vcl_cout.setf(vcl_ios_showpos);
- vcl_cout.setf((vcl_ios_fmtflags)0, vcl_ios_floatfield);
- vcl_cout.setf(vcl_ios_internal, vcl_ios_adjustfield);
- vcl_cout << "Default, precision=2, width=20, pad_intern: [";
- vcl_cout.precision(2); vcl_cout.width(20);
- vcl_cout << 27182.81828 << "] dec " << 10 << vcl_endl << vcl_endl;
-
- // Now the same output, using manipulators from <iomanip> :
- if (false) vcl_cin >> vcl_ws >> vcl_boolalpha;
- vcl_cout << vcl_resetiosflags(vcl_ios_dec)
- << vcl_uppercase << vcl_showbase << vcl_showpos << vcl_showpoint
- << vcl_oct << vcl_scientific << vcl_left
- << "Scientific, precision=2, width=20, pad_right : ["
- << vcl_setprecision(2) << vcl_setw(20) << vcl_setfill('x')
- << 27182.81828 << "] oct " << 10 << vcl_endl
- << vcl_nouppercase << vcl_noshowpos
- << vcl_hex << vcl_fixed << vcl_right
- << "Fixed, precision=2, width=20, pad_left : ["
- << vcl_setw(20)
- << 27182.81828 << "] hex " << 10 << vcl_endl
- << vcl_noshowbase << vcl_showpos << vcl_noshowpoint
- << vcl_resetiosflags(vcl_ios_fixed | vcl_ios_scientific)
- << vcl_resetiosflags(vcl_ios_right | vcl_ios_left)
- << vcl_dec << vcl_internal
- << "Default, precision=2, width=20, pad_intern: ["
- << vcl_setprecision(2) << vcl_setw(20)
- << 27182.81828 << "] dec " << 10 << vcl_endl << vcl_endl;
-
- vcl_streampos a = vcl_cin.tellg();
- vcl_streampos b = vcl_cout.tellp();
- a = b; b = a; // quell warning about unused vars. compilers are sooo gullible.
-
- vcl_streambuf *ptr = 0;
- if (ptr) // quell warning.
- ++ ptr;
-
- vcl_streamsize size = 3141;
- ++ size; // quell warning.
-
- if (false) {
- int x;
- vcl_cin >> x; // read from stdin [27.3.1.2]
- vcl_cout << "cout goes to stdout [27.3.1.3]" << vcl_endl;
- vcl_cerr << "cerr goes to stderr [27.3.1.4]" << vcl_endl;
- vcl_clog << "clog goes to stderr [27.3.1.5]" << vcl_endl;
- }
-
- if (false) {
- vcl_ofstream f("dont_worry_this_file_is_not_created",
- vcl_ios_in |
- vcl_ios_out |
- vcl_ios_ate |
- vcl_ios_app |
- vcl_ios_trunc |
- vcl_ios_binary);
-
- f.write("hello, file", 11);
- f.seekp(10);
- f.seekp(-2, vcl_ios_cur);
- f.seekp(1, vcl_ios_beg);
- f.seekp(-1, vcl_ios_end);
- f.close();
- }
-
- if (false) {
- signed char sc;
- vcl_cin >> sc;
-
- bool bb;
- vcl_cin >> bb;
- }
-
- vcl_stringstream s(vcl_ios_in | vcl_ios_out | vcl_ios_binary);
-
- return !s;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_iterator.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_iterator.cxx
deleted file mode 100644
index 305f0cf395d422a627a6b23c9e60b4dc9c867233..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_iterator.cxx
+++ /dev/null
@@ -1,12 +0,0 @@
-/*
- fsm
-*/
-#include <vcl_iterator.h>
-
-void f(vcl_iterator<float, int> *) { }
-
-int test_iterator_main(int /*argc*/,char* /*argv*/[])
-{
- // invent some more tests.
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_limits.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_limits.cxx
deleted file mode 100644
index 57edd415dc99eb6cf289a9b95930eff4cf62cc0f..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_limits.cxx
+++ /dev/null
@@ -1,120 +0,0 @@
-#include <vcl_iostream.h>
-#include <vcl_limits.h>
-
-static
-void test_if_bool_defined( bool )
-{
-}
-
-static
-void test_if_int_defined( int )
-{
-}
-
-
-// if this function compiles and links, then all the constants have
-// definitions as they should.
-static
-void test_static_const_definition()
-{
-#define TEST_TYPE( Type ) \
- test_if_bool_defined( vcl_numeric_limits< Type >::is_specialized ); \
- test_if_int_defined( vcl_numeric_limits< Type >::digits ); \
- test_if_int_defined( vcl_numeric_limits< Type >::digits10 ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::is_signed ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::is_integer ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::is_exact ); \
- test_if_int_defined( vcl_numeric_limits< Type >::radix ); \
- test_if_int_defined( vcl_numeric_limits< Type >::min_exponent ); \
- test_if_int_defined( vcl_numeric_limits< Type >::min_exponent10 ); \
- test_if_int_defined( vcl_numeric_limits< Type >::max_exponent ); \
- test_if_int_defined( vcl_numeric_limits< Type >::max_exponent10 ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::has_infinity ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::has_quiet_NaN ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::has_signaling_NaN ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::has_denorm ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::is_iec559 ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::is_bounded ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::is_modulo ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::traps ); \
- test_if_bool_defined( vcl_numeric_limits< Type >::tinyness_before );
-
- TEST_TYPE(int);
- TEST_TYPE(long);
- TEST_TYPE(unsigned long);
- TEST_TYPE(short);
- TEST_TYPE(unsigned short);
- TEST_TYPE(float);
- TEST_TYPE(double);
-#undef TEST_TYPE
-}
-
-#define TEST(m,x,y) if (x!=y) { vcl_cout<< "FAIL: " << m << '\n'; fail=true; } \
- else { vcl_cout<< "PASS: " << m << '\n'; }
-
-int test_limits_main(int /*argc*/, char* /*argv*/[])
-{
- // call it to avoid "unused function" compiler warnings,
- // and to force compilation with "very clever" compilers:
- test_static_const_definition();
-
- bool fail=false;
- vcl_cout << "dmax = " << vcl_numeric_limits<double>::max() << vcl_endl
- << "dmin = " << vcl_numeric_limits<double>::min() << vcl_endl
- << "deps = " << vcl_numeric_limits<double>::epsilon() << vcl_endl
- << "dnmin = " << vcl_numeric_limits<double>::denorm_min() << vcl_endl
- << "dnan = " << vcl_numeric_limits<double>::quiet_NaN() << vcl_endl
- << "dsnan = " << vcl_numeric_limits<double>::signaling_NaN() << vcl_endl
- << "dinf = " << vcl_numeric_limits<double>::infinity() << vcl_endl
- << "-dinf = " <<-vcl_numeric_limits<double>::infinity() << vcl_endl
- << "rnder = " << vcl_numeric_limits<double>::round_error() << vcl_endl
-
- << "fmax = " << vcl_numeric_limits<float>::max() << vcl_endl
- << "fmin = " << vcl_numeric_limits<float>::min() << vcl_endl
- << "feps = " << vcl_numeric_limits<float>::epsilon() << vcl_endl
- << "fnmin = " << vcl_numeric_limits<float>::denorm_min() << vcl_endl
- << "fnan = " << vcl_numeric_limits<float>::quiet_NaN() << vcl_endl
- << "fsnan = " << vcl_numeric_limits<float>::signaling_NaN() << vcl_endl
- << "finf = " << vcl_numeric_limits<float>::infinity() << vcl_endl
- << "-finf = " <<-vcl_numeric_limits<float>::infinity() << vcl_endl
- << "rnder = " << vcl_numeric_limits<float>::round_error() << vcl_endl
-
- << "s8max = " << int(vcl_numeric_limits<signed char>::max()) << vcl_endl
- << "s8min = " << int(vcl_numeric_limits<signed char>::min()) << vcl_endl
-
- << "u8max = " << int(vcl_numeric_limits<unsigned char>::max()) << vcl_endl
- << "u8min = " << int(vcl_numeric_limits<unsigned char>::min()) << vcl_endl
-
- << "s16max = " << vcl_numeric_limits<signed short>::max() << vcl_endl
- << "s16min = " << vcl_numeric_limits<signed short>::min() << vcl_endl
-
- << "u16max = " << vcl_numeric_limits<unsigned short>::max() << vcl_endl
- << "u16min = " << vcl_numeric_limits<unsigned short>::min() << vcl_endl
-
- << "s32max = " << vcl_numeric_limits<signed int>::max() << vcl_endl
- << "s32min = " << vcl_numeric_limits<signed int>::min() << vcl_endl
-
- << "u32max = " << vcl_numeric_limits<unsigned int>::max() << vcl_endl
- << "u32min = " << vcl_numeric_limits<unsigned int>::min() << vcl_endl;
-
- TEST("dmax", vcl_numeric_limits<double>::max() > 1e308, true);
- if (vcl_numeric_limits<double>::has_infinity)
- TEST("dinf", vcl_numeric_limits<double>::infinity() >
- vcl_numeric_limits<double>::max(), true);
- TEST("dmin", vcl_numeric_limits<double>::min() < 1e-307 &&
- vcl_numeric_limits<double>::min() > 0, true);
- TEST("deps", vcl_numeric_limits<double>::epsilon() < 1e-12 &&
- vcl_numeric_limits<double>::epsilon() > 0, true);
- TEST("rnder",vcl_numeric_limits<double>::round_error() <= 1.0, true);
- TEST("fmax", vcl_numeric_limits<float>::max() > 1e38f, true);
- if (vcl_numeric_limits<float>::has_infinity)
- TEST("finf", vcl_numeric_limits<float>::infinity() >
- vcl_numeric_limits<float>::max(), true);
- TEST("fmin", vcl_numeric_limits<float>::min() < 1e-37f &&
- vcl_numeric_limits<float>::min() > 0, true);
- TEST("feps", vcl_numeric_limits<float>::epsilon() < 1e-6f &&
- vcl_numeric_limits<float>::epsilon() > 0, true);
- TEST("rnder",vcl_numeric_limits<float>::round_error() <= 1.0, true);
- return fail?1:0;
-}
-
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_list.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_list.cxx
deleted file mode 100644
index 60310eafe74f3b8b2634a46c4613df5ea7c4e1af..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_list.cxx
+++ /dev/null
@@ -1,20 +0,0 @@
-
-#include <vcl_iostream.h>
-#include <vcl_list.h>
-
-int test_list_main(int /*argc*/,char* /*argv*/[])
-{
- typedef vcl_list<int> container;
- container m;
-
- m.push_back(1);
- m.push_back(2);
-
- for (container::iterator p = m.begin(); p != m.end(); ++p)
- vcl_cout << (*p) << vcl_endl;
-
-
- // fixme how do i do this on win32? copy(m.begin(), m.end(), ostream_iterator<int>(cerr));
-
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_map.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_map.cxx
deleted file mode 100644
index a66352f3f45a522132fc652478dff18704e2e832..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_map.cxx
+++ /dev/null
@@ -1,27 +0,0 @@
-// This is vcl/tests/test_map.cxx
-#include <vcl_functional.h>
-#include <vcl_iostream.h>
-#include <vcl_map.h>
-
-int test_map_main(int /*argc*/,char* /*argv*/[])
-{
- bool okay = true;
- typedef vcl_map<int, double, vcl_less<int> > mymap;
- mymap m;
-
- m.insert(mymap::value_type(1, 2718));
- m.insert(mymap::value_type(2, 3141));
-
- for (mymap::iterator p = m.begin(); p != m.end(); ++p)
- vcl_cout << (*p).first << " " << (*p).second << vcl_endl;
-
- mymap::iterator i = m.find(3);
- okay = okay && (i == m.end()); // not found (=OK)
- i = m.find(2);
- okay = okay && (i != m.end()) && ((*i).second == 3141);
-
- if ( okay )
- return 0;
- else
- return 1;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_memory.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_memory.cxx
deleted file mode 100644
index 76f6ee8bc2b60f30664abda344bc09320cb4f2eb..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_memory.cxx
+++ /dev/null
@@ -1,77 +0,0 @@
-#include <vcl_cstdio.h>
-#include <vcl_memory.h>
-
-#define ASSERT(x,y) if (!(x)) { vcl_printf("FAIL: " y "\n"); status = 1; }
-
-static int instances = 0;
-
-struct A
-{
- A() { ++instances; }
- ~A() { --instances; }
- A* self() {return this; }
-};
-struct B: public A {};
-
-static int function_call(vcl_auto_ptr<A> a)
-{
- return a.get()? 1:0;
-}
-
-static A* get_A(A& a) { return &a; }
-
-static vcl_auto_ptr<A> generate_auto_ptr () { return vcl_auto_ptr<A>(new A); }
-
-int test_memory_main(int /*argc*/,char* /*argv*/[])
-{
- int status = 0;
-
- // Keep everything in a subscope so we can detect leaks.
- {
- vcl_auto_ptr<A> pa0;
- vcl_auto_ptr<A> pa1(new A());
- vcl_auto_ptr<B> pb1(new B());
- vcl_auto_ptr<A> pa2(new B());
- vcl_auto_ptr<A> pa3(pb1);
-
- A* ptr = get_A(*pa1);
- ASSERT(ptr == pa1.get(),
- "auto_ptr does not return correct object when dereferenced");
- ptr = pa1->self();
- ASSERT(ptr == pa1.get(),
- "auto_ptr does not return correct pointer from operator->");
-
- A* before = pa0.get();
- pa0.reset(new A());
- ASSERT(pa0.get() && pa0.get() != before,
- "auto_ptr does not hold a new object after reset(new A())");
-
- before = pa0.get();
- pa0.reset(new B());
- ASSERT(pa0.get() && pa0.get() != before,
- "auto_ptr does not hold a new object after reset(new B())");
-
- delete pa0.release();
- ASSERT(!pa0.get(), "auto_ptr holds an object after release()");
-
- pa1 = pa3;
- ASSERT(!pa3.get(), "auto_ptr holds an object after assignment to another");
- ASSERT(pa1.get(),
- "auto_ptr does not hold an object after assignment from another");
-
- int copied = function_call(pa2);
- ASSERT(copied, "auto_ptr did not receive ownership in called function");
- ASSERT(!pa2.get(), "auto_ptr did not release ownership to called function");
-
-
- pa3 = generate_auto_ptr();
- ASSERT(pa3.get(),
- "auto_ptr does not hold an object after assignment from factory function");
-
-
- }
-
- ASSERT(instances == 0, "auto_ptr leaked an object");
-
- return status;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_multimap.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_multimap.cxx
deleted file mode 100644
index 9c69cf5a2a2d8f75f108ca4130696de9a28caa12..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_multimap.cxx
+++ /dev/null
@@ -1,48 +0,0 @@
-// This is vcl/tests/test_multimap.cxx
-#include <vcl_functional.h>
-#include <vcl_iostream.h>
-#include <vcl_map.h>
-
-typedef vcl_multimap<int, double, vcl_less<int> > mymap;
-
-vcl_ostream &operator<<(vcl_ostream &s, mymap::value_type const &x)
-{
- return s << '(' << x.first << ',' << x.second << ')';
-}
-
-int test_multimap_main(int /*argc*/,char* /*argv*/[])
-{
- mymap m;
- m.insert(mymap::value_type(0, 2.718281828459045)); // e
- m.insert(mymap::value_type(1, 3.141592653589793)); // pi
- m.insert(mymap::value_type(2, 1.414213562373095)); // sqrt(2)
- m.insert(mymap::value_type(3, 1.61803398874989)); // golden number
-
- mymap::iterator b = m.begin();
- mymap::iterator e = m.end();
-
- vcl_cout << "the whole container:" << vcl_endl;
- for (mymap::iterator p = b; p != e; ++p)
- vcl_cout << *p << vcl_endl;
-
- vcl_cout << "lower_bound() and upper_bound():" << vcl_endl;
- for (int k=-1; k<=4; ++k) {
- vcl_cout << "k=" << k << vcl_endl;
-
- mymap::iterator lo = m.lower_bound(k);
- vcl_cout << " lo: ";
- if (lo==b) vcl_cout << "begin";
- else if (lo==e) vcl_cout << "end";
- else vcl_cout << *lo;
- vcl_cout << vcl_endl;
-
- mymap::iterator hi = m.upper_bound(k);
- vcl_cout << " hi: ";
- if (hi==b) vcl_cout << "begin";
- else if (hi==e) vcl_cout << "end";
- else vcl_cout << *hi;
- vcl_cout << vcl_endl;
- }
-
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_new.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_new.cxx
deleted file mode 100644
index ceda493804e1b7ec450e3cc92d3ca07242aedda2..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_new.cxx
+++ /dev/null
@@ -1,21 +0,0 @@
-/*
- fsm
-*/
-#include <vcl_new.h>
-
-struct X_s
-{
- double *p;
- X_s() { p = new double[37]; }
- ~X_s() { delete [] p; }
-};
-
-int test_new_main(int /*argc*/,char* /*argv*/[])
-{
- X_s my_x;
-
- vcl_destroy(&my_x);
- new (&my_x) X_s; // vcl_construct(&my_x);
-
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_preprocessor.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_preprocessor.cxx
deleted file mode 100644
index 898ea3d233854bf545d9614c4d2dcdba634cd6bc..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_preprocessor.cxx
+++ /dev/null
@@ -1,265 +0,0 @@
-// Try to check that compiler preprocessor definitions are sane.
-
-#include <vcl_compiler.h>
-#include <vcl_iostream.h>
-
-int test_preprocessor_main(int /*argc*/,char* /*argv*/[])
-{
- unsigned compiler_count = 0;
- unsigned major_count = 0;
- unsigned minor_count = 0;
-
-#ifdef VCL_SGI_CC
- ++compiler_count;
-#endif
-
-#ifdef VCL_SGI_CC_6
- ++major_count;
-#endif
-
-#ifdef VCL_SGI_CC_7
- ++major_count;
-#endif
-#ifdef VCL_SGI_CC_720
- ++minor_count;
-#endif
-#ifdef VCL_SGI_CC_730
- ++minor_count;
-#endif
-
-
-#ifdef VCL_SUNPRO_CC
- ++compiler_count;
-#endif
-
-#ifdef VCL_SUNPRO_CC_5
- ++major_count;
-#endif
-#ifdef VCL_SUNPRO_CC_50
- ++minor_count;
-#endif
-#ifdef VCL_SUNPRO_CC_56
- ++minor_count;
-#endif
-
-
-#ifdef VCL_GCC
- ++compiler_count;
-#endif
-
-#ifdef VCL_GCC_2
- ++major_count;
-#endif
-#ifdef VCL_GCC_27
- ++minor_count;
-#endif
-#ifdef VCL_GCC_28
- ++minor_count;
-#endif
-#ifdef VCL_GCC_295
- ++minor_count;
-#endif
-
-#ifdef VCL_GCC_3
- ++major_count;
-#endif
-#ifdef VCL_GCC_30
- ++minor_count;
-#endif
-#ifdef VCL_GCC_31
- ++minor_count;
-#endif
-#ifdef VCL_GCC_32
- ++minor_count;
-#endif
-#ifdef VCL_GCC_33
- ++minor_count;
-#endif
-#ifdef VCL_GCC_34
- ++minor_count;
-#endif
-#ifdef VCL_GCC_35
- ++minor_count;
-#endif
-
-#ifdef VCL_GCC_4
- ++major_count;
-#endif
-#ifdef VCL_GCC_40
- ++minor_count;
-#endif
-#ifdef VCL_GCC_41
- ++minor_count;
-#endif
-#ifdef VCL_GCC_42
- ++minor_count;
-#endif
-#ifdef VCL_GCC_43
- ++minor_count;
-#endif
-#ifdef VCL_GCC_44
- ++minor_count;
-#endif
-
-
-#ifdef VCL_VC
- ++compiler_count;
-#endif
-
-#ifdef VCL_VC_8
- ++major_count;
-#endif
-#ifdef VCL_VC_80
- ++minor_count;
-#endif
-#ifdef VCL_VC_81
- ++minor_count;
-#endif
-#ifdef VCL_VC_82
- ++minor_count;
-#endif
-#ifdef VCL_VC_83
- ++minor_count;
-#endif
-
-#ifdef VCL_VC_7
- ++major_count;
-#endif
-#ifdef VCL_VC_70
- ++minor_count;
-#endif
-#ifdef VCL_VC_71
- ++minor_count;
-#endif
-#ifdef VCL_VC_72
- ++minor_count;
-#endif
-#ifdef VCL_VC_73
- ++minor_count;
-#endif
-
-#ifdef VCL_VC_6
- ++major_count;
-#endif
-#ifdef VCL_VC_60
- ++minor_count;
-#endif
-
-#ifdef VCL_VC_5
- ++major_count;
-#endif
-#ifdef VCL_VC_50
- ++minor_count;
-#endif
-
-
-#ifdef VCL_BORLAND
- ++compiler_count;
-#endif
-
-#ifdef VCL_BORLAND_5
- ++major_count;
-#endif
-#ifdef VCL_BORLAND_55
- ++minor_count;
-#endif
-#ifdef VCL_BORLAND_56
- ++minor_count;
-#endif
-#ifdef VCL_BORLAND_57
- ++minor_count;
-#endif
-
-
-#ifdef VCL_KAI
- ++compiler_count;
-#endif
-
-
-#ifdef VCL_ICC
- ++compiler_count;
-#endif
-#ifdef VCL_ICC_8
- ++major_count;
-#endif
-#ifdef VCL_ICC_80
- ++minor_count;
-#endif
-#ifdef VCL_ICC_81
- ++minor_count;
-#endif
-#ifdef VCL_ICC_82
- ++minor_count;
-#endif
-
-
-#ifdef VCL_COMO
- ++compiler_count;
-#endif
-
-
-#ifdef VCL_METRO_WERKS
- ++compiler_count;
-#endif
-
- int result = 0;
-
- vcl_cout << "Compiler brand uniquely identified: ";
- if ( compiler_count == 1 ) {
- vcl_cout << "PASSED\n";
- } else if ( compiler_count < 1 ) {
- result = 1;
- vcl_cout << "FAILED\n"
- << "This compiler is not recognized by vcl_compiler.h.\n"
- << "Please contact the VXL maintainers and ask them\n"
- << "to fix it. (vxl-maintainers@lists.sourceforge.net)\n";
- } else if ( compiler_count > 1 ) {
- result = 1;
- vcl_cout << "FAILED\n"
- << "This compiler is recognized as multiple compilers\n"
- << "by vcl_compiler.h.\n"
- << "Please contact the VXL maintainers and ask them\n"
- << "to fix it. (vxl-maintainers@lists.sourceforge.net)\n";
- }
-
- vcl_cout << "Compiler release identified: ";
- if ( major_count == 1 ) {
- vcl_cout << "PASSED\n";
- } else if ( major_count > 1 ) {
- result = 1;
- vcl_cout << "FAILED\n"
- << "This release is recognized as multiple releases\n"
- << "by vcl_compiler.h.\n"
- << "Please contact the VXL maintainers and ask them\n"
- << "to fix it. (vxl-maintainers@lists.sourceforge.net)\n";
- } else {
- vcl_cout << "(not identified) PASSED\n";
- }
-
- vcl_cout << "Compiler version identified: ";
- if ( minor_count == 1 ) {
- vcl_cout << "PASSED\n";
- } else if ( minor_count > 1 ) {
- result = 1;
- vcl_cout << "FAILED\n"
- << "This version is recognized as multiple versions\n"
- << "by vcl_compiler.h.\n"
- << "Please contact the VXL maintainers and ask them\n"
- << "to fix it. (vxl-maintainers@lists.sourceforge.net)\n";
- } else {
- vcl_cout << "(not identified) PASSED\n";
- }
-
- vcl_cout << "Version identified implies release identified: ";
- if ( minor_count>0 && major_count==0 ) {
- result = 1;
- vcl_cout << "FAILED\n"
- << "This compiler defines a flag for the compiler version\n"
- << "(minor version) without defining a flag for the\n"
- << "corresponding release (major version)\n";
- } else {
- vcl_cout << "PASSED\n";
- }
-
- return result;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_rel_ops.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_rel_ops.cxx
deleted file mode 100644
index 86b3bb80dd09954bc705afd4e3006406f91d93de..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_rel_ops.cxx
+++ /dev/null
@@ -1,32 +0,0 @@
-/*
- fsm
-*/
-struct Y
-{
- int x;
- Y(int x_) : x(x_) { }
- bool operator==(Y const &that) const { return x == that.x; }
- bool operator< (Y const &that) const { return x < that.x; }
-};
-
-#include <vcl_rel_ops.h>
-
-int function()
-{
- Y x(2), y(3);
- if (x == y) return 1;
- if (x != y) return 2;
- if (x < y) return 3;
- if (x > y) return 4;
- if (x <= y) return 5;
- if (x >= y) return 6;
- return 0;
-}
-
-int test_rel_ops_main(int /*argc*/,char* /*argv*/[])
-{
- function();
- return 0;
-}
-
-VCL_REL_OPS_INSTANTIATE(Y);
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_set.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_set.cxx
deleted file mode 100644
index f1e8157d7a175b8f1b7286f0875183a429d7a4f2..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_set.cxx
+++ /dev/null
@@ -1,15 +0,0 @@
-#include <vcl_iostream.h>
-#include <vcl_functional.h>
-#include <vcl_set.h>
-
-int test_set_main(int /*argc*/,char* /*argv*/[])
-{
- typedef vcl_set<int, vcl_less<int> > myset;
- myset s;
-
- s.insert(1);
-
- for (myset::iterator p = s.begin(); p != s.end(); ++p)
- vcl_cout << *p << vcl_endl;
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_sstream.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_sstream.cxx
deleted file mode 100644
index 539065f75dcb07d471eaaa66680e31e5a8b1a9d8..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_sstream.cxx
+++ /dev/null
@@ -1,27 +0,0 @@
-#include <vcl_string.h> // C++ specific includes first
-#include <vcl_iostream.h>
-#include <vcl_sstream.h>
-
-#define AssertEq(x,y) {status+=((x)==(y))?0:1;vcl_cout<<"TEST ["<<x<<"] == ["<<y<<"] : "<<((x)==(y)?"PASSED":"FAILED")<<vcl_endl;}
-
-int test_sstream_main(int /*argc*/,char* /*argv*/[])
-{
- int status = 0;
- vcl_string x = "fred";
- vcl_istringstream ss(x);
-
- vcl_string fred;
- ss >> fred;
- AssertEq(fred,"fred");
-
- vcl_istringstream s("wilma");
-
- char w;
- s >> w; AssertEq((int)w,'w');
- s >> w; AssertEq((int)w,'i');
- s >> w; AssertEq((int)w,'l');
- s >> w; AssertEq((int)w,'m');
- s >> w; AssertEq((int)w,'a');
-
- return status;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_stlfwd.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_stlfwd.cxx
deleted file mode 100644
index 233ae7bd160d052f072d5e833d18940f9271700c..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_stlfwd.cxx
+++ /dev/null
@@ -1,39 +0,0 @@
-// This is vcl/tests/test_stlfwd.cxx
-#include <vcl_functional.h>
-#include <vcl_string.h> // C++ specific includes first
-
-#if defined(TEST) && TEST == 1
-// STL included later - this does not work with vcl/emulation because of "redefinition of default argument"
-#include <vcl_stlfwd.h>
-#include <vcl_map.h>
-#include <vcl_set.h>
-#include <vcl_list.h>
-
-#else
-#if defined(TEST) && TEST == 2
-// stl included first
-
-#include <vcl_map.h>
-#include <vcl_set.h>
-#include <vcl_list.h>
-#include <vcl_stlfwd.h>
-
-#else
-// Normal
-#include <vcl_stlfwd.h>
-
-#endif
-#endif
-
-void f(vcl_map<int, vcl_string,vcl_less<int> >*,
- vcl_set<int,vcl_less<int> >*,
- vcl_list<int>*
- )
-{
-}
-
-
-int test_stlfwd_main(int /*argc*/,char* /*argv*/[])
-{
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_string.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_string.cxx
deleted file mode 100644
index 0ffc88471e1dcbdb6ebfded594b45f1af270ad06..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_string.cxx
+++ /dev/null
@@ -1,28 +0,0 @@
-#include <vcl_string.h> // C++ specific includes first
-#include <vcl_iostream.h>
-
-#define Assert(x) {vcl_cout << "TEST " #x " : "; vcl_cout << ((x)?"PASSED":"FAILED")}
-
-#define AssertEq(x) {vcl_cout<<"TEST ["<<fred<<"] == ["<<x<<"] : ";vcl_cout<<(fred==(x)?"PASSED":"FAILED")<<vcl_endl;}
-
-int test_string_main(int /*argc*/,char* /*argv*/[])
-{
- vcl_string fred;
- fred = "fred";
-
- AssertEq("fred");
-
- fred += ", una";
- AssertEq("fred, una");
-
- fred.replace(3,1, "on");
- AssertEq("freon, una");
-
- fred.erase(5, 2);
- AssertEq("freonuna");
-
- fred.erase(5);
- AssertEq("freon");
-
- return 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tests/test_vector.cxx b/Utilities/ITK/Utilities/vxl/vcl/tests/test_vector.cxx
deleted file mode 100644
index acf111edc3952e15ecb9a22f576b6d4651e77341..0000000000000000000000000000000000000000
--- a/Utilities/ITK/Utilities/vxl/vcl/tests/test_vector.cxx
+++ /dev/null
@@ -1,72 +0,0 @@
-// This is vcl/tests/test_vector.cxx
-#include <vcl_iostream.h>
-#include <vcl_vector.h>
-#include <vcl_algorithm.h>
-
-vcl_ostream &delim(vcl_ostream &os)
-{
- //return os << endl;
- return os << ", ";
-}
-
-int frurk(vcl_vector<int> const &a,
- vcl_vector<int> const &b)
-{
- if (a == b)
- return 0;
- if (a != b)
- return 1;
- return 2;
-}
-
-int test_vector_main(int /*argc*/,char* /*argv*/[])
-{
- bool fail = false;
- {
- typedef vcl_vector<int> container;
- container m;
-
- m.push_back(1);
- m.push_back(2);
-
- for (container::iterator p = m.begin(); p != m.end(); ++p)
- vcl_cout << (*p) << vcl_endl;
- }
- {
- vcl_vector<double> v;
- for (unsigned i=0; i<10; ++i)
- {
- vcl_cout << "size : " << v.size() << delim
- << "capacity : " << v.capacity() << delim;
- if (i>0)
- vcl_cout << "begin : " << (void*) &* v.begin()
- << delim << "end - 1: " << (void*) &* (v.end() - 1) << vcl_endl;
- else
- vcl_cout << vcl_endl;
-
- v.push_back(13.141592653589793 * i);
- }
- }
- {
- vcl_vector<bool> bv(2);
- bv[0] = true;
- bv[1] = false;
- vcl_nth_element(bv.begin(), bv.begin()+1, bv.end());
- }
- { // check contiguity
-#define macro(T) do { \
- vcl_vector<T > v; \
- for (int i=0; i<5; ++i) v.push_back(T(i)); \
- bool ok = true; \
- for (unsigned int i=1; i<v.size(); ++i) { T *p = &v[i-1]; T *q = &v[i]; if (p + 1 != q) ok = false; } \
- if (ok) vcl_cout << "PASS: vector<" << #T << "> has contiguous storage\n"; \
- else { vcl_cout << "FAIL: vector<" << #T << "> has non-contiguous storage\n"; fail = true; } \
-} while (false)
- macro(char);
- macro(int);
- macro(double);
-#undef macro
- }
-
- return fail ? 1 : 0;
-}
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tr1/README b/Utilities/ITK/Utilities/vxl/vcl/tr1/README
new file mode 100644
index 0000000000000000000000000000000000000000..4bac306ee909a6f2827d0a38ae1881b8bc84b180
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/tr1/README
@@ -0,0 +1,29 @@
+This directory is for compilers that are ISO and provide TR1
+extensions for the upcoming C++0x standard. This assumes
+the TR1 extensions for <blah> are in <tr1/blah> and defined in
+namespace std::tr1
+
+(in vcl_blah.h)
+
+If your compiler is ISO 0x compliant with all functions defined
+in <blah> and namespace std then
+
+#include "iso/vcl_blah_tr1.h"
+#include "iso/vcl_blah.h"
+
+If your compiler is ISO compliant with TR1 extensions then
+
+#include "tr1/vcl_blah.h"
+#include "iso/vcl_blah.h"
+
+If your compiler is ISO compliant with no 0x support then
+
+#include "emulation/vcl_new_blah_related_files.h"
+#include "iso/vcl_blah.h"
+
+
+
+All of the .h files in this directory should look like this:
+ #include <tr1/blah>
+ #define vcl_generic_blah_tr1_STD std::tr1
+ #include "../generic/vcl_blah_tr1.h"
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tr1/generate.sh b/Utilities/ITK/Utilities/vxl/vcl/tr1/generate.sh
new file mode 100644
index 0000000000000000000000000000000000000000..cfac3eb9092d57f8cf3d881bbaa2179cb9b09f21
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/tr1/generate.sh
@@ -0,0 +1,23 @@
+#! /bin/sh
+
+for blah in `cat ../generic/blah_tr1`; do
+ echo $blah
+(
+echo "#ifndef vcl_tr1_${blah}_h_"
+echo "#define vcl_tr1_${blah}_h_"
+echo ""
+echo "// This is a generated file. DO NOT EDIT! Not even a little bit."
+echo ""
+echo "#include <tr1/$blah>"
+echo ""
+echo "#ifdef vcl_generic_${blah}_tr1_STD"
+echo " ** error **"
+echo "#else"
+echo "# define vcl_generic_${blah}_tr1_STD std::tr1"
+echo "#endif"
+echo ""
+echo "#include \"../generic/vcl_${blah}_tr1.h\""
+echo ""
+echo "#endif // vcl_tr1_${blah}_h_"
+) > vcl_${blah}.h
+done
diff --git a/Utilities/ITK/Utilities/vxl/vcl/tr1/vcl_memory.h b/Utilities/ITK/Utilities/vxl/vcl/tr1/vcl_memory.h
new file mode 100644
index 0000000000000000000000000000000000000000..4494a3eeff55f991550676826f82f9f36002ad2c
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/tr1/vcl_memory.h
@@ -0,0 +1,16 @@
+#ifndef vcl_tr1_memory_h_
+#define vcl_tr1_memory_h_
+
+// This is a generated file. DO NOT EDIT! Not even a little bit.
+
+#include <tr1/memory>
+
+#ifdef vcl_generic_memory_tr1_STD
+ ** error **
+#else
+# define vcl_generic_memory_tr1_STD std::tr1
+#endif
+
+#include "../generic/vcl_memory_tr1.h"
+
+#endif // vcl_tr1_memory_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_atomic_count.h b/Utilities/ITK/Utilities/vxl/vcl/vcl_atomic_count.h
new file mode 100644
index 0000000000000000000000000000000000000000..b141278487337c76207901a0cfb17b31e80dc656
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_atomic_count.h
@@ -0,0 +1,124 @@
+#ifndef vcl_atomic_count_h_
+#define vcl_atomic_count_h_
+
+// MS compatible compilers support #pragma once
+
+#if defined(_MSC_VER) && (_MSC_VER >= 1020)
+# pragma once
+#endif
+//:
+// \file
+// \brief thread/SMP safe reference counter
+// \author www.boost.org
+// \verbatim
+// Modifications
+// Gehua Yang (DualAlign) - 28 Aug. 2008 - first port from Boost 1.36.0
+// \endverbatim
+//
+// boost/detail/atomic_count.hpp - thread/SMP safe reference counter
+//
+// Copyright (c) 2001, 2002 Peter Dimov and Multi Media Ltd.
+//
+// Distributed under the Boost Software License, Version 1.0. (See
+// accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+//
+// typedef <implementation-defined> boost::detail::atomic_count;
+//
+// atomic_count a(n);
+//
+// (n is convertible to long)
+//
+// Effects: Constructs an atomic_count with an initial value of n
+//
+// a;
+//
+// Returns: (long) the current value of a
+//
+// ++a;
+//
+// Effects: Atomically increments the value of a
+// Returns: nothing
+//
+// --a;
+//
+// Effects: Atomically decrements the value of a
+// Returns: (long) zero if the new value of a is zero,
+// unspecified non-zero value otherwise (usually the new value)
+//
+// Important note: when --a returns zero, it must act as a
+// read memory barrier (RMB); i.e. the calling thread must
+// have a synchronized view of the memory
+//
+// On Intel IA-32 (x86) memory is always synchronized, so this
+// is not a problem.
+//
+// On many architectures the atomic instructions already act as
+// a memory barrier.
+//
+// This property is necessary for proper reference counting, since
+// a thread can update the contents of a shared object, then
+// release its reference, and another thread may immediately
+// release the last reference causing object destruction.
+//
+// The destructor needs to have a synchronized view of the
+// object to perform proper cleanup.
+//
+// Original example by Alexander Terekhov:
+//
+// Given:
+//
+// - a mutable shared object OBJ;
+// - two threads THREAD1 and THREAD2 each holding
+// a private smart_ptr object pointing to that OBJ.
+//
+// t1: THREAD1 updates OBJ (thread-safe via some synchronization)
+// and a few cycles later (after "unlock") destroys smart_ptr;
+//
+// t2: THREAD2 destroys smart_ptr WITHOUT doing any synchronization
+// with respect to shared mutable object OBJ; OBJ destructors
+// are called driven by smart_ptr interface...
+//
+#include <vcl_config_manual.h>
+#if !defined(VCL_USE_ATOMIC_COUNT) || !VCL_USE_ATOMIC_COUNT
+
+typedef long int vcl_atomic_count;
+
+// I do not know when a pthread version is required
+//#elif defined(BOOST_AC_USE_PTHREADS)
+//# include <boost/detail/atomic_count_pthreads.hpp>
+
+#elif defined( __GNUC__ ) && ( defined( __i386__ ) || defined( __x86_64__ ) )
+
+# include "internal/vcl_atomic_count_gcc_x86.h"
+
+#elif defined(WIN32) || defined(_WIN32) || defined(__WIN32__)
+
+# include "internal/vcl_atomic_count_win32.h"
+
+#elif defined( __GNUC__ ) && ( __GNUC__ * 100 + __GNUC_MINOR__ >= 401 )
+
+# include "internal/vcl_atomic_count_sync.h"
+
+#elif defined(__GLIBCPP__) || defined(__GLIBCXX__)
+
+# include "internal/vcl_atomic_count_gcc.h"
+
+// When building OSX universal binary, it could use pthread implementation.
+#elif defined(BOOST_HAS_PTHREADS) || defined(macintosh) || defined(__APPLE__) || defined(__APPLE_CC__)
+
+# include "internal/vcl_atomic_count_pthreads.h"
+
+// Similarly for SGI
+#elif defined(__sgi)
+
+# include "internal/vcl_atomic_count_pthreads.h"
+
+#else
+
+// Use #define BOOST_DISABLE_THREADS to avoid the error
+#error Unrecognized threading platform
+
+#endif
+
+#endif // #ifndef vcl_atomic_count_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_cassert.h b/Utilities/ITK/Utilities/vxl/vcl/vcl_cassert.h
index d6014900229e88980b6208d3caed4d78caf0e330..27a68b45e715b0ec072f5a4fa19cf8700f412962 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_cassert.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_cassert.h
@@ -20,28 +20,30 @@
// #endif
// If the system/compiler version works, use that instead.
-// Win32 doesn't work as you can't set a bp on abort
-#ifdef _WIN32
-#undef assert
-#ifdef NDEBUG
-# define assert(x) ((void) 0)
-#else
-extern void vcl_cassert_failure(char const *, int, char const *);
-# define assert(x) do { if (!(x)) vcl_cassert_failure(__FILE__, __LINE__, #x); } while (false)
-#endif
-#ifdef VCL_METRO_WERKS
-// for some reason, MW's <cassert> doesn't have its own printf() and abort() declarations.
-# include <vcl_cstdio.h>
-# include <vcl_cstdlib.h>
-#endif
+// Only redefine the macro with MSVC 6.0
+#ifdef VCL_VC_6
+# undef assert
+# ifdef NDEBUG
+# define assert(x) ((void) 0)
+# else
+ extern void vcl_cassert_failure(char const *, int, char const *);
+# define assert(x) do { if (!(x)) vcl_cassert_failure(__FILE__, __LINE__, #x); } while (false)
+# endif
-#else
-#if !VCL_CXX_HAS_HEADER_CASSERT
-# include <assert.h>
-#else
-# include "iso/vcl_cassert.h"
-#endif
+#else // For all other compilers, include the standard C/CXX header
+
+# ifdef VCL_METRO_WERKS
+// for some reason, MW's <cassert> doesn't have its own printf() and abort() declarations.
+# include <vcl_cstdio.h>
+# include <vcl_cstdlib.h>
+# endif
+
+# if !VCL_CXX_HAS_HEADER_CASSERT
+# include <assert.h>
+# else
+# include "iso/vcl_cassert.h"
+# endif
#endif
// fsm: There should not be a vcl_assert macro as there is no
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_cmath.h b/Utilities/ITK/Utilities/vxl/vcl/vcl_cmath.h
index 7a09c86c4863681f2471b97cc737d1f04619400e..3436603824530a049d93070304cae56587c67a36 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_cmath.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_cmath.h
@@ -45,11 +45,13 @@
# include "gcc/vcl_cmath.h"
#elif defined(VCL_SGI_CC)
# include "sgi/vcl_cmath.h"
-#elif defined(VCL_VC60)
+#elif defined(VCL_VC_60)
# include "win32-vc60/vcl_cmath.h"
// C++ .NET 2003 is iso compliant
-#elif defined(VCL_VC70) // C++ .NET earlier than 2003 is not iso compliant
+#elif defined(VCL_VC_70) // C++ .NET earlier than 2003 is not iso compliant
# include "win32-vc70/vcl_cmath.h"
+#elif defined(VCL_VC_8) || defined(VCL_VC_9) // C++ .NET earlier than 2003 is not iso compliant
+# include "win32-vc8/vcl_cmath.h"
#elif defined(VCL_SUNPRO_CC)
# include "sunpro/vcl_cmath.h"
#elif defined(VCL_METRO_WERKS)
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_compiler.h b/Utilities/ITK/Utilities/vxl/vcl/vcl_compiler.h
index 9741d4f35a54890b2c74736d801d5b53a3e2da00..0633b16a71a755c0678ffc48c933f97caa83d152 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_compiler.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_compiler.h
@@ -6,7 +6,7 @@
//
// It's much better to determine the compiler automatically here than to depend
// on command-line flags being set.
-
+//
// Be careful when modifying this file. In general, you need to make
// sure that exactly one of the preprocessor flags is defined. For
// example, if the compiler is GCC 3.4.2, then VCL_GCC should be
@@ -60,6 +60,13 @@
# endif
#endif
+#if defined(__FreeBSD__)
+# define VCL_FREEBSD
+# ifndef _GLIBCXX_USE_C99
+# define _GLIBCXX_USE_C99 1
+# endif
+#endif
+
#if defined(__SUNPRO_CC)
# define VCL_SUNPRO_CC
# if (__SUNPRO_CC>=0x500)
@@ -131,15 +138,15 @@
# if _MSC_VER >= 1300
# define VCL_VC_DOTNET 1 // VC is at least version >= 7.0
# endif
-# if _MSC_VER >= 1400 // .NET 2005 = Version 8.x
-# ifndef _CRT_SECURE_NO_DEPRECATE
-# define _CRT_SECURE_NO_DEPRECATE 1
-# endif
+
+// In future use VCL_VC_13_1 for 13.1, etc.
+# if _MSC_VER >= 1600 // Visual Studio 2010 = Version 10.x
+# define VCL_VC_10
+# elif _MSC_VER >= 1500 // Visual Studio 2008 = Version 9.x
+# define VCL_VC_9
+# elif _MSC_VER >= 1400 // .NET 2005 = Version 8.x
# define VCL_VC_8
-# if _MSC_VER >= 1400
-# define VCL_VC_80 1 // version 8.0
-# define VCL_VC80 // (deprecated)
-# endif
+# define VCL_VC80 1 // (deprecated)
# elif _MSC_VER >= 1300 // .NET 2003 = Version 7.x
# define VCL_VC_7
# if _MSC_VER >= 1310
@@ -188,12 +195,23 @@
# pragma warning(disable:4786 4355)
# pragma warning(disable:4018 4146 4267)
# endif
+
+// Disable warnings about C standard library functions.
+# if _MSC_VER >= 1400 // .NET 2005 = Version 8.x
+# ifndef _CRT_SECURE_NO_DEPRECATE
+# define _CRT_SECURE_NO_DEPRECATE 1
+# endif
+# endif
#endif
#if defined(__KCC) // KAI compiler
# define VCL_KAI
#endif
+#if defined(__CYGWIN__) // Cygwin GCC Compiler
+# define VCL_CYGWIN_GCC
+#endif
+
#if defined(__ICC) ||defined(__ECC) // Intel compiler?
# define VCL_ICC
# if __ICC >= 800
@@ -255,7 +273,7 @@
# define VCL_SUNPRO_ALLOCATOR_HACK(T) T // FIXME
#endif
-//-------------------- template instantiation
+ //-------------------- template instantiation ------------------------------
// if the compiler doesn't understand "export", we just leave it out.
// gcc and SunPro 5.0 understand it, but they ignore it noisily.
@@ -278,7 +296,7 @@
# define IUEi_STL_INLINE inline
#endif
-//--------------------------------------------------------------------------------
+ //--------------------------------------------------------------------------
// work-around to deal with some cases where some compilers (and the standard)
// requires an explicit typename qualifier. MSVC6.0 on the other had cannot cope
@@ -303,7 +321,7 @@ typedef int saw_VCL_FOR_SCOPE_HACK;
// fix to instantiate template functions
#define VCL_INSTANTIATE_NONINLINE(fn_decl) template fn_decl
-// -------------------- handy macros
+ // -------------------- handy macros ---------------------------------------
//: VCL_COMMA
//
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_complex.h b/Utilities/ITK/Utilities/vxl/vcl/vcl_complex.h
index 93cc8ff63038474527e2fcf55c41e4a1d52cb016..32d10e5ae04c7bc645d972a4f00b4674ea969b34 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_complex.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_complex.h
@@ -26,13 +26,17 @@
# include "stlport/vcl_complex.h"
// ---------- Visual Studio 6
-#elif defined(VCL_VC60)
+#elif defined(VCL_VC_6)
# include "win32-vc60/vcl_complex.h"
// ---------- Visual Studio 7.0
-#elif defined(VCL_VC70)
+#elif defined(VCL_VC_70)
# include "win32-vc70/vcl_complex.h"
+// ---------- Visual Studio 8 and 9
+#elif defined(VCL_VC_8) || defined(VCL_VC_9)
+# include "win32-vc8/vcl_complex.h"
+
// ---------- SunPro compiler
#elif defined(VCL_SUNPRO_CC)
# include "sunpro/vcl_complex.h"
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_config_manual.h.in b/Utilities/ITK/Utilities/vxl/vcl/vcl_config_manual.h.in
index 6c676c2c1dc9308b051e9809c0e537bf54ee0e5d..8b6db15e4e64565e219334238092175514548b88 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_config_manual.h.in
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_config_manual.h.in
@@ -10,6 +10,12 @@
// Whether to use the compiler's STL.
#define VCL_USE_NATIVE_STL @VCL_USE_NATIVE_STL@
+// Whether new additions to the C++0x standard are available
+// and where they are found
+#define VCL_INCLUDE_CXX_0X @VCL_INCLUDE_CXX_0X@
+#define VCL_MEMORY_HAS_SHARED_PTR @VCL_MEMORY_HAS_SHARED_PTR@
+#define VCL_TR1_MEMORY_HAS_SHARED_PTR @VCL_TR1_MEMORY_HAS_SHARED_PTR@
+
//: VCL_USE_NATIVE_COMPLEX
// Whether to use the compiler's complex type.
@@ -23,4 +29,8 @@
// Whether to use implicit template instantiation.
#define VCL_USE_IMPLICIT_TEMPLATES @VCL_USE_IMPLICIT_TEMPLATES@
+//: VCL_USE_ATOMIC_COUNT
+// Whether to use the atomic_count implemenation in vcl.
+#define VCL_USE_ATOMIC_COUNT @VCL_USE_ATOMIC_COUNT@
+
#endif // vcl_config_manual_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_cstdio.h b/Utilities/ITK/Utilities/vxl/vcl/vcl_cstdio.h
index eda6042b53b9d074d036f27d2e45a512997a2864..f2d629e67900b28e67b34b4307c2bc19a2ebffeb 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_cstdio.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_cstdio.h
@@ -17,6 +17,10 @@
# include <stdio.h>
# define vcl_generic_cstdio_STD /* */
# include "generic/vcl_cstdio.h"
+#elif defined(VCL_CYGWIN_GCC)
+# define vcl_snprintf snprintf
+# include "vcl_cstddef.h" // for size_t
+# include "iso/vcl_cstdio.h"
#elif defined(VCL_VC60)
# include <cstdio>
# define vcl_generic_cstdio_STD /**/
@@ -25,7 +29,7 @@
# include <cstdio>
# define vcl_generic_cstdio_STD /* */
# include "generic/vcl_cstdio.h"
-#elif defined(VCL_VC_70) || defined(VCL_VC_71)|| defined(VCL_VC_80)
+#elif defined(VCL_VC_7)|| defined(VCL_VC_8)|| defined(VCL_VC_9) || defined(VCL_VC_10)
# define vcl_snprintf _snprintf
# include "vcl_cstddef.h" // for size_t
# include "iso/vcl_cstdio.h"
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_cstdlib.h b/Utilities/ITK/Utilities/vxl/vcl/vcl_cstdlib.h
index cb5a4637ef4970732fa19a5817e8f9abb516e7a3..a8ab74c5c79414dc39d5d85431702794feaf2ca3 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_cstdlib.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_cstdlib.h
@@ -21,12 +21,14 @@
# include "sgi/vcl_cstdlib.h"
#elif defined(VCL_SUNPRO_CC)
# include "sunpro/vcl_cstdlib.h"
-#elif defined(VCL_VC60)
+#elif defined(VCL_VC_6)
# include "win32-vc60/vcl_cstdlib.h"
-#elif defined(VCL_VC71) // C++ .NET 2003 is iso compliant
+#elif defined(VCL_VC_71) // C++ .NET 2003 is iso compliant
# include "iso/vcl_cstdlib.h"
-#elif defined(VCL_VC70) // C++ .NET earlier than 2003 is not iso compliant
+#elif defined(VCL_VC_70) // C++ .NET earlier than 2003 is not iso compliant
# include "win32-vc70/vcl_cstdlib.h"
+#elif defined(VCL_VC_8) || defined(VCL_VC_9) // need to handle abs(__int64) correctly
+# include "win32-vc8/vcl_cstdlib.h"
#elif defined(VCL_METRO_WERKS)
# include "mwerks/vcl_cstdlib.h"
// At this time, the borland build works much better with iso/vcl_cstdlib.h
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_iostream.h b/Utilities/ITK/Utilities/vxl/vcl/vcl_iostream.h
index d9a45095ddbdc77d8b9608f8e60f449e58fa3ff5..33d8b522b28e3f1ffbace65024910c008bc49707 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_iostream.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_iostream.h
@@ -1,7 +1,7 @@
// This is vcl/vcl_iostream.h
#ifndef vcl_iostream_h_
#define vcl_iostream_h_
-//:
+//:
// \file
// \brief Include compiler's <iostream.h> in a uniform way.
// \author awf@robots.ox.ac.uk
@@ -24,21 +24,20 @@
// \endcode
//
-// Include this to ensure the two are consistent.
-#include "vcl_iosfwd.h"
+#include "vcl_iosfwd.h" // Include this to ensure the two are consistent.
// Notes to maintainers.
// The purpose of this file is to repair broken iostream
-// headers. Thus in conditional logic, the compilers that
+// headers. Thus in conditional logic, the compilers that
// behave in a non-standard way should be treated first, as
-// special cases, and the #else arm should contain the
+// special cases, and the #else arm should contain the
// appropriate action for an ISO compiler.
-
+//
// On win32, <iostream.h> contains old crufty iostreams and
// <iostream> contains new standard ones. There is no iosfwd
// for the old ones and <string> includes the new iostreams.
// So we must avoid the old ones at any price.
-
+//
// ------------------------------------------------------------
#if defined(VCL_SGI_CC_720)
@@ -48,9 +47,9 @@
# include "iso/vcl_iostream.h"
#endif
-// -------------------- miscellaneous fixes which can go at the end:
+ // -------------------- miscellaneous fixes which can go at the end: -------
-// Need std::ios::nocreate to avoid creating an empty file on
+// Need std::ios::nocreate to avoid creating an empty file on
// attempts to read a non-existent one. Don't we? -- fsm
#if defined(VCL_VC50)
# undef vcl_ios_in
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_memory.h b/Utilities/ITK/Utilities/vxl/vcl/vcl_memory.h
index a9a26b395304e4c0ad7ba2a34e35ed4b2db6f9ad..d6bc24bf8d8811f9bf30da62306b88d926b6709d 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_memory.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_memory.h
@@ -11,6 +11,13 @@
# include "emulation/vcl_iterator.h"
# include "emulation/vcl_algorithm.h"
# define vcl_auto_ptr auto_ptr // fixme
+
+# if VCL_INCLUDE_CXX_0X
+// This is where C++0x emulation goes when available
+****Error: shared_ptr emulation not available****
+// #include "emulation/vcl_shared_ptr.h"
+# endif // VCL_INCLUDE_CXX_0X
+
#elif defined(VCL_VC60)
# include "win32-vc60/vcl_memory.h"
#elif defined(VCL_GCC_295)
@@ -18,7 +25,21 @@
#elif defined(VCL_BORLAND_55)
# include "borland55/vcl_memory.h"
#else
+
# include "iso/vcl_memory.h"
-#endif
+
+# if VCL_INCLUDE_CXX_0X
+# if VCL_MEMORY_HAS_SHARED_PTR
+# include "iso/vcl_memory_tr1.h"
+# elif VCL_TR1_MEMORY_HAS_SHARED_PTR
+# include "tr1/vcl_memory.h"
+# else
+// This is where C++0x emulation goes when available
+****Error: shared_ptr emulation not available****
+// #include "emulation/vcl_shared_ptr.h"
+# endif // VCL_MEMORY_HAS_SHARED_PTR
+# endif // VCL_INCLUDE_CXX_0X
+
+#endif // !VCL_USE_NATIVE_STL
#endif // vcl_memory_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_sys/CMakeLists.txt b/Utilities/ITK/Utilities/vxl/vcl/vcl_sys/CMakeLists.txt
index 1740687448ab22f382ff578ed34eb3ce3324b244..b88df65ec5a0bb111c147a584bad1a75c38f034f 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_sys/CMakeLists.txt
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_sys/CMakeLists.txt
@@ -1,3 +1,3 @@
IF(NOT VXL_INSTALL_NO_DEVELOPMENT)
- INSTALL_FILES(${VXL_INSTALL_ROOT}/vcl/vcl_sys "(\\.h|\\.txx)$")
+ INSTALL_FILES(${VXL_INSTALL_INCLUDE_DIR}/vcl_sys "(\\.h|\\.txx)$")
ENDIF(NOT VXL_INSTALL_NO_DEVELOPMENT)
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_valarray.h b/Utilities/ITK/Utilities/vxl/vcl/vcl_valarray.h
index e024aee5796c74e34738f16eda753e2ce6d93d27..58e1b38cfa69f9c02fbec533c50f8e44de235c6e 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_valarray.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_valarray.h
@@ -10,12 +10,15 @@
# include <valarray> // 2.95
# define vcl_valarray valarray
-#elif defined(VCL_VC60)
+#elif defined(VCL_VC_6)
# include "win32-vc60/vcl_valarray.h"
-#elif defined(VCL_VC70)
+#elif defined(VCL_VC_70)
# include "win32-vc70/vcl_valarray.h"
+#elif defined(VCL_VC_8) || defined(VCL_VC_9)
+# include "win32-vc8/vcl_valarray.h"
+
#else
# include "iso/vcl_valarray.h"
#endif
diff --git a/Utilities/ITK/Utilities/vxl/vcl/vcl_where_root_dir.h.in b/Utilities/ITK/Utilities/vxl/vcl/vcl_where_root_dir.h.in
index 53a306aaf0c45547dcb2b9d020dc702ee8ca01f5..90454f0f48b77c1af332954fffbdab4d41f995e8 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/vcl_where_root_dir.h.in
+++ b/Utilities/ITK/Utilities/vxl/vcl/vcl_where_root_dir.h.in
@@ -10,6 +10,9 @@
// If we supply a default vcl_where_root_dir.h, it would be changed by cmake, and
// may get checked back into the repository by accident.
+#ifndef __vcl_where_root_dir_h_
+#define __vcl_where_root_dir_h_
#ifndef VCL_SOURCE_ROOT_DIR // file guard
#define VCL_SOURCE_ROOT_DIR "${vxl_SOURCE_DIR}"
#endif
+#endif // __vcl_where_root_dir_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/win32-vc70/vcl_cstdlib.h b/Utilities/ITK/Utilities/vxl/vcl/win32-vc70/vcl_cstdlib.h
index 8d75c3dc01a917b5f118066738e8b72c9028b524..1a07b5b1acedf44f9401cc2bdac273825afd4262 100644
--- a/Utilities/ITK/Utilities/vxl/vcl/win32-vc70/vcl_cstdlib.h
+++ b/Utilities/ITK/Utilities/vxl/vcl/win32-vc70/vcl_cstdlib.h
@@ -12,5 +12,5 @@
inline int vcl_abs(int x) { return x >= 0 ? x : -x; }
inline long vcl_abs(long x) { return x >= 0 ? x : -x; }
-
+inline long long vcl_abs(long long x) {return _abs64(x); }
#endif // vcl_win32_vc70_cstdlib_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_cmath.h b/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_cmath.h
new file mode 100644
index 0000000000000000000000000000000000000000..381669018d795c2c3467ffa8e1f6cd47984cb2f3
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_cmath.h
@@ -0,0 +1,19 @@
+#ifndef vcl_win32_vc_8_cmath_h_
+#define vcl_win32_vc_8_cmath_h_
+
+#include <cmath>
+
+// VC8 does not declare abs(__int 64) - so need to rewrite all vcl_abs
+
+#ifndef vcl_abs
+# define vcl_abs vcl_abs
+#endif
+
+#define vcl_generic_cmath_STD std
+#include "../generic/vcl_cmath.h"
+
+inline float vcl_abs(float x) { return x >= 0.0f ? x : -x; }
+inline double vcl_abs(double x) { return x >= 0.0 ? x : -x; }
+inline long double vcl_abs(long double x) { return x >= 0.0 ? x : -x; }
+
+#endif // vcl_win32_vc_8_cmath_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_complex.h b/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_complex.h
new file mode 100644
index 0000000000000000000000000000000000000000..0d323910c07184ee4b1f0618ea80cf348dc20a86
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_complex.h
@@ -0,0 +1,22 @@
+#ifndef vcl_win32_vc_8_complex_h_
+#define vcl_win32_vc_8_complex_h_
+
+#include <complex>
+
+// It used to necessary to bring the complex abs functions from the
+// std namespace into the global namespace to avoid conflicts with the
+// (incorrect) cstdlib headers. Then these headers were
+// updated to define the functions with a vcl_ prefix. We must do the
+// same here.
+
+#ifndef vcl_abs
+# define vcl_abs vcl_abs
+#endif
+
+
+#define vcl_generic_complex_STD std
+#include "../generic/vcl_complex.h"
+
+template <class T> inline T vcl_abs(const vcl_complex<T>& x) { return std::abs(x); }
+
+#endif // vcl_win32_vc_8_complex_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_cstdlib.h b/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_cstdlib.h
new file mode 100644
index 0000000000000000000000000000000000000000..e0648225b70184ea2741fcbffb46da9d414742d1
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_cstdlib.h
@@ -0,0 +1,18 @@
+#ifndef vcl_win32_vc_8_cstdlib_h_
+#define vcl_win32_vc_8_cstdlib_h_
+
+#include <cstdlib>
+
+#ifndef vcl_abs
+# define vcl_abs vcl_abs
+#endif
+
+#define vcl_generic_cstdlib_STD std
+#include "../generic/vcl_cstdlib.h"
+
+// Use compiler intrinsics
+// see http://msdn.microsoft.com/en-us/library/5704bbxw(VS.80).aspx
+inline int vcl_abs(int x) { return abs(x); }
+inline long vcl_abs(long x) { return labs(x); }
+inline long long vcl_abs(long long x) { return _abs64(x); }
+#endif // vcl_win32_vc_8_cstdlib_h_
diff --git a/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_valarray.h b/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_valarray.h
new file mode 100644
index 0000000000000000000000000000000000000000..589050fa658a895beb45ff89dbbf3a2a0b79eaf9
--- /dev/null
+++ b/Utilities/ITK/Utilities/vxl/vcl/win32-vc8/vcl_valarray.h
@@ -0,0 +1,19 @@
+#ifndef vcl_win32_vc_8_valarray_h_
+#define vcl_win32_vc_8_valarray_h_
+
+// VC7 does not define abs functions correctly in cstdlib.
+// The vcl versions of these headers declare the functions with vcl_
+// prefixes, so we must do the same here.
+
+#include <valarray>
+
+#ifndef vcl_abs
+# define vcl_abs vcl_abs
+#endif
+
+#define vcl_generic_valarray_STD std
+#include "../generic/vcl_valarray.h"
+
+template <class T> inline vcl_valarray<T> vcl_abs(const vcl_valarray<T>& x) { return std::abs(x); }
+
+#endif // vcl_win32_vc_8_valarray_h_